Expermental parser: fix state iteration in codegen

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 73 matching lines @@
 
   def start_state(self):
     return self.__start
 
   def start_set(self):
     return set([self.__start])
 
   def terminal_set(self):
     return set(self.__terminal_set)
 
-  def all_states_iter(self):
-    return self.__start.state_iter()
-
   @staticmethod
   def __match_char(state, char):
     match = list(state.state_iter(key_filter = lambda k: k.matches_char(char)))
     if not match: return None
     assert len(match) == 1
     return match[0]
 
   def collect_actions(self, string):
     state = self.__start
     for c in string:
@@ skipping 22 matching lines @@
         yield (state.action(), last_position, pos)
         last_position = pos
         # lex next token
         next = Dfa.__match_char(self.__start, c)
         assert next
       state = next
     assert state.action() # must invoke default action here
     yield (state.action(), last_position, len(string))
 
   def minimize(self):
-    pass
+    paritions = []
+    working_set = []
+    action_map = {}
+    id_map = {}
+    def f(state, visitor_state):
+      node_number = state.node_number()
+      assert not node_number in id_map
+      id_map[node_number] = state
+      action = state.action()
+      if not action in action_map:
+        action_map[action] = set()
+      action_map[action].add(node_number)
+    self.visit_all_states(f)
+    total = 0
+    for p in action_map.values():
+      paritions.append(p)
+      total += len(p)
+    assert total == self.__node_count
+