Experimental parser: refactor TransitionKey to use Term

tools/lexer_generator/regex_parser.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 211 matching lines @@
 
   def p_maybe_modifier(self, p):
     '''maybe_modifier : ONE_OR_MORE
                       | ZERO_OR_ONE
                       | ZERO_OR_MORE
                       | REPEAT_BEGIN NUMBER REPEAT_END
                       | REPEAT_BEGIN NUMBER COMMA NUMBER REPEAT_END
                       | empty'''
     if len(p) == 4:
       p[0] = ("REPEAT", p[2], p[2])
-    elif len(p) == 5:
+    elif len(p) == 6:
       p[0] = ("REPEAT", p[2], p[4])
     elif p[1]:
       p[0] = (self.token_map[p[1]],)
     else:
       p[0] = None
 
   def p_literal(self, p):
     '''literal : LITERAL'''
     p[0] = Term('LITERAL', p[1])
 
@@ skipping 41 matching lines @@
   @staticmethod
   def __cat(left, right):
     assert left
     return NfaBuilder.cat_terms([left] if not right else [left, right])
 
   @staticmethod
   def parse(string):
     new_lexer = lambda: RegexLexer()
     new_parser = lambda: RegexParser()
     return ParserBuilder.parse(string, "RegexParser", new_lexer, new_parser)