Experimental parser: user defined key classes

tools/lexer_generator/nfa.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 104 matching lines @@
   def gather_transition_keys(state_set):
     f = lambda acc, state: acc | set(state.__transitions.keys())
     return TransitionKey.disjoint_keys(reduce(f, state_set, set()))
 
 class NfaBuilder:
 
   def __init__(self):
     self.__node_number = 0
     self.__operation_map = {}
     self.__members = getmembers(self)
+    self.__character_classes = {}
+
+  def set_character_classes(self, classes):
+    self.__character_classes = classes
 
   def __new_state(self):
     self.__node_number += 1
     return NfaState(self.__node_number - 1)
 
   def __or(self, graph):
     start = self.__new_state()
     ends = []
     for x in [self.__process(graph[1]), self.__process(graph[2])]:
       start.add_epsilon_transition(x[0])
@@ skipping 50 matching lines @@
 
   def __key_state(self, key):
     state =  self.__new_state()
     state.add_unclosed_transition(key)
     return (state, [state])
 
   def __literal(self, graph):
     return self.__key_state(TransitionKey.single_char(graph[1]))
 
   def __class(self, graph):
-    return self.__key_state(TransitionKey.character_class(False, graph[1]))
+    return self.__key_state(
+      TransitionKey.character_class(graph, self.__character_classes))
 
   def __not_class(self, graph):
-    return self.__key_state(TransitionKey.character_class(True, graph[1]))
+    return self.__key_state(
+      TransitionKey.character_class(graph, self.__character_classes))
 
   def __any(self, graph):
     return self.__key_state(TransitionKey.any())
 
   def __action(self, graph):
     result = self.__process(graph[1])
     for end in result[1]:
       end.set_transition_action(graph[2])
     return result
 
@@ skipping 154 matching lines @@
 digraph finite_state_machine {
   rankdir=LR;
   node [shape = circle, style=filled, bgcolor=lightgrey]; S_%s
   node [shape = doublecircle, style=unfilled]; S_%s
   node [shape = circle];
 %s
 }
     ''' % (self.__start.node_number(),
            self.__end.node_number(),
            "\n".join(node_content))