Experimental parser: store literals as ints

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 73 matching lines @@
         automaton.to_dot()
 
   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, 'a')
-    key_b = TransitionKey.single_char(encoding, 'b')
-    key_c = TransitionKey.single_char(encoding, 'c')
+    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())