Experimental parser: output alias dot to html

tools/lexer_generator/rule_parser.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 317 matching lines @@
 
 class RuleProcessor(object):
 
   def __init__(self, string, encoding_name):
     self.__automata = {}
     self.__default_action = None
     self.__parser_state = RuleParserState(KeyEncoding.get(encoding_name))
     RuleParser.parse(string, self.__parser_state)
     self.__process_parser_state()
 
+  def alias_iter(self):
+    return iter(self.__parser_state.aliases.items())
+
   def automata_iter(self):
     return iter(self.__automata.items())
 
   def default_automata(self):
     return self.__automata['default']
 
   def default_action(self):
     return self.__default_action
 
   class Automata(object):
@@ skipping 48 matching lines @@
     for tree_name, v in parser_state.rules.items():
       assert v['trees'], "lexer state %s is empty" % tree_name
       rule_map[tree_name] = NfaBuilder.or_terms(v['trees'])
     # build the automata
     for name, tree in rule_map.items():
       self.__automata[name] = RuleProcessor.Automata(
         parser_state.encoding, parser_state.character_classes, rule_map, name)
     # process default_action
     default_action = parser_state.rules['default']['default_action']
     self.__default_action = Action(Term.empty_term(), default_action)