Experimental parser: dfa minimization

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 24 matching lines @@
     "literal" : (257, 257),
   }
   __lower_bound = 0
   __upper_bound = reduce(lambda acc, (k, v): max(acc, v[1]), __class_bounds.items(), 0)
 
   __cached_keys = {}
 
   __unique_key_counter = -1
 
   @staticmethod
-  def alphabet_iter():
-    for k, (lower, upper) in TransitionKey.__class_bounds.items():
-      for i in range(lower, upper + 1):
-        yield i
-
-  @staticmethod
   def __in_latin_1(char):
     bound = TransitionKey.__class_bounds["latin_1"]
     return (bound[0] <= char and char <= bound[1])
 
   @staticmethod
   def __is_class_range(r):
     return r[0] == r[1] and not TransitionKey.__in_latin_1(r[0])
 
   @staticmethod
   def __is_unique_range(r):
@@ skipping 275 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