Experimental parser: key inversion

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
@@ skipping 13 matching lines @@
 # 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 regex_parser import RegexParser
 from nfa import NfaBuilder
 from dfa import Dfa
 
 def build_automata(string):
-  parser = RegexParser()
-  parser.build()
-  graph = parser.parse(string)
+  graph = RegexParser.parse(string)
   nfa = NfaBuilder().nfa(graph)
   (start_name, dfa_nodes, end_nodes) = nfa.compute_dfa()
   dfa = Dfa(start_name, dfa_nodes, end_nodes)
   return (nfa, dfa)
 
 class AutomataTestCase(unittest.TestCase):
 
     # (pattern, should match, shouldn't match)
     __test_data = [
       ("a", ["a"], ["b", ""]),
@@ skipping 21 matching lines @@
           self.assertFalse(dfa.matches(string))
 
     def test_can_construct_dot(self):
       for (regex, matches, not_matches) in self.__test_data:
         (nfa, dfa) = build_automata(regex)
         nfa.to_dot()
         dfa.to_dot()
 
 if __name__ == '__main__':
     unittest.main()