Experimental parser: build regex parse trees for all rules

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 @@
     if key == 'RANGE':
       ranges.append((ord(graph[1]), ord(graph[2])))
     elif key == 'LITERAL':
       ranges.append((ord(graph[1]), ord(graph[1])))
     elif key == 'CHARACTER_CLASS':
       if graph[1] == 'ws':
         ranges.append(TransitionKey.__unicode_whitespace_bounds)
       elif graph[1] == 'lit':
         ranges.append(TransitionKey.__unicode_literal_bounds)
       else:
-        assert "unknown character class %s" % graph[1]
+        raise Exception("unknown character class [%s]" % graph[1])
     elif key == 'CAT':
       for x in [graph[1], graph[2]]:
         TransitionKey.__process_graph(x, ranges)
     else:
-      assert False, "bad key %s" % key
+      raise Exception("bad key [%s]" % key)
 
   @staticmethod
   def character_class(invert, graph):
     ranges = []
     TransitionKey.__process_graph(graph, ranges)
     return TransitionKey.__key_from_ranges(invert, ranges)
 
   def matches_char(self, char):
     char = ord(char)
     # TODO class checks
@@ skipping 140 matching lines @@
       elif last[1] + 1 < r[0]:
         inverted.append((last[1] + 1, r[0] - 1))
       last = r
     if last != None and last[1] < TransitionKey.__latin_1_upper_bound:
       inverted.append((last[1] + 1, TransitionKey.__latin_1_upper_bound))
     if not contains_whitespace:
       inverted.append(TransitionKey.__unicode_whitespace_bounds)
     if not contains_literal:
       inverted.append(TransitionKey.__unicode_literal_bounds)
     return inverted