Experimental parser: split and rename some files

tools/lexer_generator/nfa_builder.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.
 
 from types import TupleType
 from inspect import getmembers
-from action import *
+from term import Term
+from automaton import Action
 from nfa import *
 
 # Nfa is built in two stages:
 # 1. Build a tree of operations on rules.
 #    Each node in the tree is a tuple (operation, subtree1, ... subtreeN).
 #    Rule parser builds this tree by invoking static methods of NfaBuilder.
 # 2. For each node, perform the operation of the node to produce an Nfa.
 #    If an operation is called X, then it is performed by the method
 #    of NfaBuilder called __x(). See __process() for mapping from
 #    operation to processing methods.
@@ skipping 293 matching lines @@
     inverse_key = TransitionKey.inverse_key(encoding, keys)
     if not inverse_key:
       inverse_key = TransitionKey.unique('no_match')
     state.swap_key(catch_all, inverse_key)
 
   @staticmethod
   def __install_omega_transitions(start_state, default_action):
     '''install a match transition, a backtrack transition,
     or a default transition into all nodes'''
     pass