Experimental parser: split and rename some files

tools/lexer_generator/test/automata_test.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 11 matching lines @@
 # 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 unittest
 from lexer_generator.dot_utilities import *
 from lexer_generator.automaton import Action
 from lexer_generator.regex_parser import RegexParser
-from lexer_generator.transition_keys import TransitionKey, KeyEncoding
+from lexer_generator.transition_key import TransitionKey, KeyEncoding
 from lexer_generator.nfa_builder import NfaBuilder
 from lexer_generator.dfa import Dfa
+from lexer_generator.dfa_minimizer import DfaMinimizer
 
 class AutomataTestCase(unittest.TestCase):
 
   __encoding = KeyEncoding.get('latin1')
 
   @staticmethod
   def __build_automata(string):
     encoding = AutomataTestCase.__encoding
     trees = {'main' : RegexParser.parse(string)}
     nfa = NfaBuilder.nfa(encoding, {}, trees, 'main')
     (start_name, dfa_nodes) = nfa.compute_dfa()
     dfa = Dfa(encoding, start_name, dfa_nodes)
-    return (nfa, dfa, dfa.minimize())
+    return (nfa, dfa, DfaMinimizer(dfa).minimize())
 
   # (pattern, should match, should not match)
   __test_data = [
     ("a", ["a"], ["b", ""]),
     ("ab", ["ab"], ["bb", ""]),
     ("a+b", ["ab", "aab", "aaab"], ["a", "b", ""]),
     ("a?b", ["ab", "b"], ["a", "c", ""]),
     ("a*b", ["ab", "aaab", "b"], ["a", "c", ""]),
     ("a|b", ["a", "b"], ["ab", "c", ""]),
     (".", ["a", "b"], ["", "aa"]),
@@ skipping 37 matching lines @@
     key_a = TransitionKey.single_char(encoding, ord('a'))
     key_b = TransitionKey.single_char(encoding, ord('b'))
     key_c = TransitionKey.single_char(encoding, ord('c'))
 
     mapping['S_0']['transitions'][key_a] = 'S_1'
     mapping['S_0']['transitions'][key_b] = 'S_2'
     mapping['S_1']['transitions'][key_c] = 'S_3'
     mapping['S_2']['transitions'][key_c] = 'S_3'
     mapping['S_3']['terminal'] = True
 
-    mdfa = Dfa(encoding, 'S_0', mapping).minimize()
+    mdfa = DfaMinimizer(Dfa(encoding, 'S_0', mapping)).minimize()
     self.assertEqual(3, mdfa.node_count())