Experimental parser: remove match actions

tools/lexer_generator/rule_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 170 matching lines @@
     # process tree
     if p[1] == 'eos' or p[1] == 'catch_all':
       assert p[1] not in rules['uniques'], "cannot redefine %s in %s" % (
         p[1], self.__state.current_state)
       rules['uniques'][p[1]] = True
       tree = NfaBuilder.unique_key(p[1])
     elif p[1] == 'epsilon':
       tree = Term.empty_term()
     else:
       tree = p[1]  # regex case
-    # handle actions
-    if entry_action or match_action:
-      tree = NfaBuilder.add_action(
-        tree, Action(entry_action, match_action, precedence))
+    # install actions
+    tree = NfaBuilder.add_action(tree, entry_action, match_action, precedence)
     # handle transitions
     if not transition:
       pass
     elif transition.name() == 'continue':
       tree = NfaBuilder.add_continue(tree, transition.args()[0])
     else:
       tree = NfaBuilder.join_subtree(tree, transition.name())
     # store tree
     rules['trees'].append(tree)
 
@@ skipping 197 matching lines @@
     # process all subgraphs
     for tree_name, v in parser_state.rules.items():
       assert v['trees'], "lexer state %s is empty" % tree_name
       rule_map[tree_name] = NfaBuilder.or_terms(v['trees'])
     # build the automata
     for name, tree in rule_map.items():
       self.__automata[name] = RuleProcessor.Automata(
         parser_state.encoding, parser_state.character_classes, rule_map, name)
     # process default_action
     default_action = parser_state.rules['default']['default_action']
-    self.__default_action = Action(Term.empty_term(), default_action)
+    self.__default_action = Action(default_action, 0)