Experimental lexer generator: Code gen fix.

tools/lexer_generator/dfa.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 @@
   def actions(self):
     return self.__actions
 
   def add_transition(self, key, state):
     assert not self.__transitions.has_key(key)
     self.__transitions[key] = state
 
   def transitions(self):
     return self.__transitions
 
-  def to_code(self):
+  def to_code(self, start_node_number):
     # FIXME: add different check types (if, switch, lookup table)
     # FIXME: add action + break / continue
     # FIXME: add default action
     code = '''
 code_%s:
 fprintf(stderr, "state %s, char at hand is %%c (%%d)\\n", c, c);
 ''' % (self.node_number(), self.node_number())
 
     for key, state in self.__transitions.items():
       code += key.to_code()
       code += ''' {
   c = *(++cursor);
   goto code_%s;
 }
 ''' % state.node_number()
 
     action = self.action()
     if action:
       if action[1] == 'terminate':
         code += 'return 0;'
       elif action[1] == 'terminate_illegal':
         code += 'return 1;'
       else:
         code += self.action()[1];
+        code += 'goto code_%s;' % start_node_number
 
     return code
 
 class Dfa(Automaton):
 
   def __init__(self, start_name, mapping):
     super(Dfa, self).__init__()
     self.__terminal_set = set()
     self.__name_map = {}
     for i, (name, node_data) in enumerate(mapping.items()):
@@ skipping 67 matching lines @@
 
   def minimize(self):
     pass
 
   def to_code(self):
     code = '''
 char c = *cursor;
 goto code_%s;
 ''' % (self.__start.node_number())
     for n in self.__name_map.values():
-      code += n.to_code()
+      code += n.to_code(self.__start.node_number())
     return code