Experimental parser: add catch all rule

tools/lexer_generator/automata_test.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 86 matching lines @@
       def verify_miss(string, expected):
         verify(string, expected + [('MISS',)])
       def verify_hit(string, expected):
         verify(string, expected + [('TERMINATE',)])
       (l, r) = left_action, right_action
       verify_hit("left", [l])
       verify_miss("lefta", [l])
       verify_hit("leftrightleftright", [l, r, l, r])
       verify_miss("leftrightleftrightx", [l, r, l, r])
 
-    def test_continue(self):
-      graph = NfaBuilder.cat_graphs([
-        NfaBuilder.cat_graphs([
-          RegexParser.parse("ab"),
-          NfaBuilder.add_continue(RegexParser.parse("cd"))]),
-        RegexParser.parse("ef")])
-      nfa = NfaBuilder().nfa(graph)
-      self.assertFalse(nfa.matches(""))
-      self.assertTrue(nfa.matches("abcdef"))
-      self.assertTrue(nfa.matches("abcdabcdef"))
+    def test_minimization(self):
+      for (regex, matches, not_matches) in self.__test_data:
+        (nfa, dfa) = build_automata(regex)
+        dfa.minimize()
+
+