Experimental parser: add catch all rule

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 138 matching lines @@
   def __visit_all_edges(self, visitor, state):
     edge = set([self.__start])
     next_edge = lambda node: set(node.transitions().values())
     return self.visit_edges(edge, next_edge, visitor, state)
 
   def to_dot(self):
     iterator = lambda visitor, state: self.__visit_all_edges(visitor, state)
     state_iterator = lambda x : [x]
     return self.generate_dot(self.__start, self.__terminal_set, iterator, state_iterator)
 
+  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()
     return code