Experimental lexer generator: random refactoring + comments.

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 85 matching lines @@
     return TransitionKey.__cached_keys[name]
 
   @staticmethod
   def epsilon():
     '''Returns a TransitionKey for the epsilon (empty) transition.'''
     return TransitionKey.__cached_key('epsilon', lambda name : [])
 
   @staticmethod
   def any():
     '''Returns a TransitionKey which matches any character.'''
-    def bounds_getter(name):
-      bounds = TransitionKey.__class_bounds.values()
-      bounds.sort()
-      return bounds
-    return TransitionKey.__cached_key('any', bounds_getter)
+    return TransitionKey.__cached_key(
+        'any',
+        lambda name : sorted(TransitionKey.__class_bounds.values()))
 
   @staticmethod
   def single_char(char):
     '''Returns a TransitionKey for a single-character transition.'''
     char = ord(char)
     assert TransitionKey.__in_latin_1(char)
     return TransitionKey([(char, char)])
 
   @staticmethod
   def unique(name):
@@ skipping 270 matching lines @@
       elif last[1] + 1 < r[0]:
         inverted.append((last[1] + 1, r[0] - 1))
       last = r
     upper_bound = latin_1[1]
     if last == None:
       inverted.append(latin_1)
     elif last[1] < upper_bound:
       inverted.append((last[1] + 1, upper_bound))
     inverted += list(classes)
     return inverted