Experimental parser: always apply default transitions

tools/lexer_generator/automaton.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 61 matching lines @@
     return self.__precedence
 
   def __nonzero__(self):
     'true <==> self == empty_action'
     return bool(self.__term)
 
   def __eq__(self, other):
     return isinstance(other, self.__class__) and self.__term == other.__term
 
   def __str__(self):
-    return "action <%s>" % ('' if not self.__term else str(self.__term))
+    return str(self.__term)
 
 class AutomatonState(object):
   '''A base class for dfa and nfa states.  Immutable'''
 
   __node_number_counter = 0
 
   def __init__(self):
     self.__node_number = AutomatonState.__node_number_counter
     AutomatonState.__node_number_counter += 1
 
@@ skipping 108 matching lines @@
       last_position = pos
       # lex next token
       valid_states = Automaton.__transition_states_for_char(self.start_set(), c)
       assert valid_states
     valid_states = self.__omega_closure(self.epsilon_closure(valid_states))
     action = self.dominant_action(valid_states)
     if not action:
       assert default_action
       action = default_action
     yield (action, last_position, len(string))