Experimental parser: dfa optimization to remove transitions from keyword lexing

tools/lexer_generator/generator.py

Index: tools/lexer_generator/generator.py
diff --git a/tools/lexer_generator/generator.py b/tools/lexer_generator/generator.py
index 7849d1a558796865111eba90d5ad8508c4e68f08..1a1e5f36fb4b60fb5553007e8914c5666acc0712 100644
--- a/tools/lexer_generator/generator.py
+++ b/tools/lexer_generator/generator.py
@@ -98,6 +98,7 @@ if __name__ == '__main__':
   parser.add_argument('--input')
   parser.add_argument('--code')
   parser.add_argument('--encoding', default='latin1')
+  parser.add_argument('--optimize-default', action='store_true')
   parser.add_argument('--no-minimize-default', action='store_true')
   parser.add_argument('--no-verify-default', action='store_true')
   parser.add_argument('--no-inline', action='store_true')
@@ -114,6 +115,9 @@ if __name__ == '__main__':
   with open(re_file, 'r') as f:
     rule_processor = RuleProcessor.parse(f.read(), args.encoding)
 
+  if args.optimize_default:
+    rule_processor.default_automata().optimize_dfa(log = args.verbose)
+
   if minimize_default:
     if args.no_verify_default:
       DfaMinimizer.set_verify(False)