Experimental parser: store literals as ints

tools/lexer_generator/transition_key_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 18 matching lines @@
 from transition_keys import TransitionKey, KeyEncoding
 from regex_parser import RegexParser
 
 class TransitionKeyTestCase(unittest.TestCase):
 
   __encoding = KeyEncoding.get('latin1')
 
   __equal_pairs = [
     (TransitionKey.epsilon(), TransitionKey.epsilon()),
     (TransitionKey.any(__encoding), TransitionKey.any(__encoding)),
-    (TransitionKey.single_char(__encoding, 'a'),
-     TransitionKey.single_char(__encoding, 'a')),
+    (TransitionKey.single_char(__encoding, ord('a')),
+     TransitionKey.single_char(__encoding, ord('a'))),
   ]
 
   def test_eq(self):
     for (left, right) in self.__equal_pairs:
       self.assertEqual(left, right)
 
   def test_hash(self):
     for (left, right) in self.__equal_pairs:
       self.assertEqual(hash(left), hash(right))
 
@@ skipping 96 matching lines @@
     self.assertTrue(key.matches_char('A'))
 
   def test_disjoint_keys(self):
     encoding = self.__encoding
     key = lambda x, y: TransitionKey.range(encoding, x , y)
     disjoint_set = TransitionKey.disjoint_keys(encoding,
                                                [key(1, 10), key(5, 15)])
     self.assertTrue(key(1, 4) in disjoint_set)
     self.assertTrue(key(5, 10) in disjoint_set)
     self.assertTrue(key(11, 15) in disjoint_set)