Experimental parser: user defined key classes

tools/lexer_generator/transition_key_test.py

 # Copyright 2013 the V8 project authors. All rights reserved.
 # Redistribution and use in source and binary forms, with or without
 # modification, are permitted provided that the following conditions are
 # met:
 #
 #     * Redistributions of source code must retain the above copyright
 #       notice, this list of conditions and the following disclaimer.
 #     * Redistributions in binary form must reproduce the above
 #       copyright notice, this list of conditions and the following
 #       disclaimer in the documentation and/or other materials provided
@@ skipping 35 matching lines @@
       self.assertEqual(hash(left), hash(right))
 
   def test_classes(self):
     # class regex, should match, should not match
     data = [
       ("1-2", "12", "ab"),
       ("a-zA-Z", "abyzABYZ" , "123"),
       ("a-zA-Z0g" , "abyzABYZ0" , "123"),
       ("a-z:ws::lit:" , "abc" , "123"),
     ]
+    classes = {}
     for (string, match, no_match) in data:
       for invert in [False, True]:
         if invert:
           regex = "[^%s]" % string
           token = "NOT_CLASS"
         else:
           regex = "[%s]" % string
           token = "CLASS"
         graph = RegexParser.parse(regex)
         assert graph[0] == token
-        key = TransitionKey.character_class(invert, graph[1])
+        key = TransitionKey.character_class(graph, classes)
         for c in match:
           self.assertEqual(invert, not key.matches_char(c))
         for c in no_match:
           self.assertEqual(invert, key.matches_char(c))
 
+  def test_self_defined_classes(self):
+    graph = RegexParser.parse("[a-z]")
+    classes = {
+      'self_defined' : TransitionKey.character_class(graph, {})}
+    graph = RegexParser.parse("[^:self_defined:]")
+    key = TransitionKey.character_class(graph, classes)
+    self.assertTrue(key.matches_char('A'))
+
 if __name__ == '__main__':
     unittest.main()