Experimental parser: split off dot processing

tools/lexer_generator/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
 #       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 unittest
+from dot_utilities import *
 from automaton import Action
 from regex_parser import RegexParser
 from transition_keys import TransitionKey, KeyEncoding
 from nfa_builder import NfaBuilder
 from dfa import Dfa
 
 class AutomataTestCase(unittest.TestCase):
 
   __encoding = KeyEncoding.get('latin1')
 
@@ skipping 35 matching lines @@
       for string in matches:
         for automaton in automata:
           self.assertTrue(automaton.matches(string))
       for string in not_matches:
         for automaton in automata:
           self.assertFalse(automaton.matches(string))
 
   def test_can_construct_dot(self):
     for (regex, matches, not_matches) in self.__test_data:
       for automaton in self.__build_automata(regex):
-        automaton.to_dot()
+        automaton_to_dot(automaton)
 
   def test_minimization(self):
     encoding = self.__encoding
     def empty_node():
       return {
         'transitions' : {},
         'terminal' : False,
         'action' : Action.empty_action() }
     mapping = { k : empty_node() for k in ['S_0', 'S_1', 'S_2', 'S_3'] }
     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()
     self.assertEqual(3, mdfa.node_count())