Experimental parser: remove match actions

tools/lexer_generator/dfa.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 26 matching lines @@
     self.__transitions = transitions
     self.__action = action
     assert isinstance(action, Action)
 
   def name(self):
     return self.__name
 
   def action(self):
     return self.__action
 
+  def transition_count(self):
+    return len(self.__transitions)
+
+  def omega_transition(self):
+    if TransitionKey.omega() in self.__transitions:
+      return self.__transitions[TransitionKey.omega()]
+    return None
+
   def epsilon_closure_iter(self):
     return iter([])
 
   def transition_state_for_key(self, value):
     matches = list(self.transition_state_iter_for_key(value))
     assert len(matches) <= 1
     return matches[0] if matches else None
 
   def key_state_iter(
     self,
@@ skipping 121 matching lines @@
     def f(state, visitor_state):
       state_id = len(id_to_state)
       id_to_state[state_id] = state
       action = state.action()
       all_keys.append(state.key_iter())
       if state in terminal_set:
         key = ("terminal set", action)
       else:
         # Match actions are valid only if we have matched the whole token, not
         # just some sub-part of it.
-        assert not action.match_action()
+        # TODO(dcarney): restore
+        # assert not action.is_match_action()
         key = ("nonterminal set", action)
       if not key in initial_partitions:
         initial_partitions[key] = set()
       initial_partitions[key].add(state_id)
     self.__dfa.visit_all_states(f)
     partitions = set()
     working_set = set()
 
     # Create StatePartition objects:
     for k, p in initial_partitions.items():
@@ skipping 176 matching lines @@
           elif len(intersection) <= len(difference):
             working_set.add(intersection)
           else:
             working_set.add(difference)
         if old_partitions:
           partitions -= old_partitions
         if new_partitions:
           partitions |= new_partitions
     (start_name, mapping) = self.__create_states_from_partitions(partitions)
     return Dfa(self.__dfa.encoding(), start_name, mapping)