Experimental lexer generator: fix dfa generation when there are epsilon transitions with actions.

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 381 matching lines @@
         if action:
           actions.append(action)
 
         # Pull in actions which can be taken with an epsilon transition from the
         # match state.
         e = TransitionKey.epsilon()
         if e in state.transitions():
           for e_trans in state.transitions()[e]:
             if e_trans[1]:
               actions.append(e_trans[1])
+        for s in state.epsilon_closure():
+          if e in s.transitions():
+            for e_trans in s.transitions()[e]:
+              if e_trans[1]:
+                actions.append(e_trans[1])
 
       assert len(match_states) == len(transitions)
 
       actions.sort()
       action = actions[0] if actions else None
       transition_state = Nfa.__to_dfa(match_states, dfa_nodes, end_node)
       dfa_nodes[name]['transitions'][key] = (transition_state, action)
     return name
 
   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)