Experimental lexer generator: Code generator skeleton.

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 157 matching lines @@
   def __hash__(self):
     if self.__cached_hash == None:
       initial_hash = hash((-1, TransitionKey.__upper_bound + 1))
       f = lambda acc, r: acc ^ hash(r)
       self.__cached_hash = reduce(f, self.__ranges, initial_hash)
     return self.__cached_hash
 
   def __eq__(self, other):
     return isinstance(other, self.__class__) and self.__ranges == other.__ranges
 
+  def to_code(self):
+    code = 'if ('
+    first = True
+    for r in self.__ranges:
+      if not first:
+        code += ' || '
+      if r[0] == r[1]:
+        code += 'c == %s' % r[0]
+      else:
+        code += '(c >= %s && c <= %s)' % (r[0], r[1])
+      first = False
+    code += ')'
+    return code
+
   __printable_cache = {
     ord('\t') : '\\t',
     ord('\n') : '\\n',
     ord('\r') : '\\r',
   }
 
   @staticmethod
   def __range_str(r):
     if TransitionKey.__is_class_range(r):
       for name, v in TransitionKey.__class_bounds.items():
@@ skipping 104 matching lines @@
         if r[0] != TransitionKey.__lower_bound:
           inverted.append((TransitionKey.__lower_bound, r[0] - 1))
       elif last[1] + 1 < r[0]:
         inverted.append((last[1] + 1, r[0] - 1))
       last = r
     upper_bound = TransitionKey.__class_bounds["latin_1"][1]
     if last != None and last[1] < upper_bound:
       inverted.append((last[1] + 1, upper_bound))
     inverted += list(classes)
     return inverted