Experimental parser: better generation

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 196 matching lines @@
   def __action(self, graph):
     incoming = graph[3]
     (start, ends) = self.__process(graph[1])
     action = graph[2]
     if incoming:
       new_start = self.__new_state()
       new_start.set_transition_action(action)
       new_start.close(start)
       start = new_start
     else:
+      new_end = self.__new_state()
       for end in ends:
         end.set_transition_action(action)
+      self.__patch_ends(ends, new_end)
+      ends = [new_end]
     return (start, ends)
 
   def __continue(self, graph):
     (start, ends) = self.__process(graph[1])
     state = self.__peek_state()
     if not state['start_node']:
       state['start_node'] = self.__new_state()
     end = self.__new_state()
     self.__patch_ends(ends, end)
     ends = [end]
@@ skipping 186 matching lines @@
 
   def compute_dfa(self):
     self.__compute_epsilon_closures()
     dfa_nodes = {}
     start_name = self.__to_dfa(set([self.__start]), dfa_nodes, self.__end)
     return (start_name, dfa_nodes)
 
   def to_dot(self):
     iterator = lambda visitor, state: self.__visit_all_edges(visitor, state)
     return self.generate_dot(self.__start, set([self.__end]), iterator)