Experimental parser: some unit tests

tools/lexer_generator/transition_keys.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 52 matching lines @@
     assert (TransitionKey.__lower_bound <= char and
             char <= TransitionKey.__latin_1_upper_bound)
     return TransitionKey.__create([(char, char)])
 
   @staticmethod
   def character_class(invert, graph):
     # TODO
     return TransitionKey.__create([(129, 129)])
 
   def matches_char(self, char):
+    char = ord(char)
     for r in self.__ranges:
       if r[0] <= char and char <= r[1]: return True
     return False
 
   def matches_key(self, key):
     assert isinstance(key, self.__class__)
     assert key != TransitionKey.epsilon()
     if self == key: return True
     if self == TransitionKey.epsilon(): return False
     # TODO
@@ skipping 21 matching lines @@
       return "epsilon"
     if self == self.any():
       return "any"
     return ", ".join(TransitionKey.__print_range(x) for x in self.__ranges)
 
   @staticmethod
   def merge_key_set(key_set):
     key_set -= set([TransitionKey.epsilon()])
     # TODO need intersections and symmetric differences
     return key_set