Experimental parser: print out minimization savings

tools/lexer_generator/generator.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 91 matching lines @@
   args = parser.parse_args()
 
   re_file = args.re
   print "parsing %s" % re_file
   with open(re_file, 'r') as f:
     rule_processor = RuleProcessor.parse(f.read())
 
   if args.minimize_default:
     if args.no_verify_default:
       DfaMinimizer.set_verify(False)
-    rule_processor.default_automata().minimal_dfa()
+    dfa = rule_processor.default_automata().dfa()
+    mdfa = rule_processor.default_automata().minimal_dfa()
+    print "nodes reduced from %s to %s" % (dfa.node_count(), mdfa.node_count())
     DfaMinimizer.set_verify(True)
 
   html_file = args.html
   if html_file:
     html = generate_html(rule_processor, args.minimize_default)
     with open(args.html, 'w') as f:
       f.write(html)
       print "wrote html to %s" % html_file
 
   code_file = args.code
   if code_file:
     code = generate_code(rule_processor, args.minimize_default)
     with open(code_file, 'w') as f:
       f.write(code)
       print "wrote code to %s" % code_file
 
   input_file = args.input
   if input_file:
     with open(input_file, 'r') as f:
       lex(rule_processor, f.read())