Experimental parser: action refactor

tools/lexer_generator/nfa_builder.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 25 matching lines @@
     self.__operation_map = {}
     self.__members = getmembers(self)
     self.__character_classes = {}
     self.__states = []
 
   def set_character_classes(self, classes):
     self.__character_classes = classes
 
   def __new_state(self):
     self.__node_number += 1
-    return NfaState(self.__node_number - 1)
+    return NfaState()
 
   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])
       ends += x[1]
     start.close(None)
     return (start, ends)
 
@@ skipping 218 matching lines @@
 
   __modifer_map = {
     '+': 'ONE_OR_MORE',
     '?': 'ZERO_OR_ONE',
     '*': 'ZERO_OR_MORE',
   }
 
   @staticmethod
   def apply_modifier(modifier, graph):
     return (NfaBuilder.__modifer_map[modifier], graph)