Experimental parser: enable transition reduction

tools/lexer_generator/dfa_optimizer.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 131 matching lines @@
           continue
         # do goto replacement
         counters['gotos'] += 1
         match_action = ('goto', name(transition_state))
         new_state['action'] = replacement_action(state.action(), match_action)
         # will need to patch up transition_state
         store_states.add(name(transition_state))
       assert not state_replacements
     self.__dfa.visit_all_states(replace_state)
     # now patch up all states with stores
-    for state in store_states:
-      old_action = states[state]['action']
-      match_action = ('do_stored_token', None)
-      states[state]['action'] = replacement_action(old_action, match_action)
+    for state_id in store_states:
+      old_action = states[state_id]['action']
+      match_action = ('do_stored_token', state_id)
+      states[state_id]['action'] = replacement_action(old_action, match_action)
     start_name = name(self.__dfa.start_state())
     if self.__log:
       print 'gotos inserted %s' % counters['gotos']
       print 'transitions removed %s' % counters['removals']
       print 'do_stored_token actions added %s' % len(store_states)
     self.__dfa = Dfa(self.__dfa.encoding(), start_name, states)
 
   @staticmethod
   def optimize(dfa, log):
     optimizer = DfaOptimizer(dfa, log)
     optimizer.replace_tokens_with_gotos()
     return optimizer.__dfa