Experimental parser: split off dot processing

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 223 matching lines @@
     elif component.name() == 'NAMED_RANGE_KEY':
       return component.args()[0]
     elif component.name() == 'EPSILON_KEY':
       return 'epsilon'
     elif component.name() == 'OMEGA_KEY':
       return 'omega'
     elif component.name() == 'NUMERIC_RANGE_KEY':
       r = component.args()
       to_str = lambda x: KeyEncoding.to_str(encoding, x)
       if r[0] == r[1]:
-        return '%s' % to_str(r[0])
-      return '[%s-%s]' % (to_str(r[0]), to_str(r[1]))
+        return "'%s'" % to_str(r[0])
+      return "['%s'-'%s']" % (to_str(r[0]), to_str(r[1]))
     raise Exception('unprintable %s' % component)
 
   def __flatten(self):
     return self.__flatten_components([self.__term])
 
   @staticmethod
   def __flatten_components(components):
     for component in components:
       if component.name() != 'COMPOSITE_KEY':
         yield component
@@ skipping 209 matching lines @@
         yield key(last[1] + 1, r[0] - 1)
       last = r
     upper_bound = encoding.primary_range()[1]
     if last == None:
       r = encoding.primary_range()
       yield key(r[0], r[1])
     elif last[1] < upper_bound:
       yield key(last[1] + 1, upper_bound)
     for c in sorted(classes, TransitionKey.__component_compare):
       yield c