Experimental parser: split and rename some files

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
 #       with the distribution.
 #     * Neither the name of Google Inc. nor the names of its
 #       contributors may be used to endorse or promote products derived
 #       from this software without specific prior written permission.
 #
 # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 # "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 # LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 # A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 # OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 # SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 # LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 # DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 # THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 import ply.lex as lex
 import ply.yacc as yacc
-from action import Term, Action
+from term import Term
 from regex_parser import RegexParser, ParserBuilder
+from automaton import Action
 from nfa_builder import NfaBuilder
 from dfa import Dfa
 from dfa_optimizer import DfaOptimizer
-from transition_keys import TransitionKey, KeyEncoding
+from dfa_minimizer import DfaMinimizer
+from transition_key import TransitionKey, KeyEncoding
 
 class RuleLexer:
 
   tokens = (
     'DEFAULT_ACTION',
     'EPSILON',
     'EOS',
     'CATCH_ALL',
 
     'IDENTIFIER',
@@ skipping 335 matching lines @@
       return self.__dfa
 
     def optimize_dfa(self, log = False):
       assert not self.__dfa
       assert not self.__minimial_dfa
       self.__dfa = DfaOptimizer.optimize(self.minimal_dfa(), log)
       self.__minimial_dfa = None
 
     def minimal_dfa(self):
       if not self.__minimial_dfa:
-        self.__minimial_dfa = self.dfa().minimize()
+        self.__minimial_dfa = DfaMinimizer(self.dfa()).minimize()
       return self.__minimial_dfa
 
   def __process_parser_state(self):
     parser_state = self.__parser_state
     assert 'default' in parser_state.rules, "default lexer state required"
     # Check that we don't transition to a nonexistent state.
     assert parser_state.transitions <= set(parser_state.rules.keys())
     rule_map = {}
     # process all subgraphs
     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(default_action, 0)