Revision: 17906
Author: [email protected]
Date: Wed Nov 20 10:53:56 2013 UTC
Log: Experimental parser: remove some dead code
[email protected]
BUG=
Review URL: https://codereview.chromium.org/78153002
http://code.google.com/p/v8/source/detail?r=17906
Modified:
/branches/experimental/parser/tools/lexer_generator/nfa.py
/branches/experimental/parser/tools/lexer_generator/nfa_builder.py
/branches/experimental/parser/tools/lexer_generator/rule_parser.py
=======================================
--- /branches/experimental/parser/tools/lexer_generator/nfa.py Wed Nov 20
10:42:41 2013 UTC
+++ /branches/experimental/parser/tools/lexer_generator/nfa.py Wed Nov 20
10:53:56 2013 UTC
@@ -61,11 +61,6 @@
assert self.is_closed()
return self.__transitions
- def next_states(self, key_filter):
- assert self.is_closed()
- f = lambda acc, (k, v) : acc if not key_filter(k) else acc | set(v)
- return reduce(f, self.__transitions.items(), set())
-
def __add_transition(self, key, next_state):
if next_state == None:
assert not self.is_closed(), "already closed"
=======================================
--- /branches/experimental/parser/tools/lexer_generator/nfa_builder.py Wed
Nov 20 10:06:26 2013 UTC
+++ /branches/experimental/parser/tools/lexer_generator/nfa_builder.py Wed
Nov 20 10:53:56 2013 UTC
@@ -146,16 +146,12 @@
return self.__key_state(TransitionKey.unique('catch_all'))
def __join(self, graph):
- (graph, name, subgraph, modifier) = graph[1:]
+ (graph, name, subgraph) = graph[1:]
subgraphs = self.__peek_state()['subgraphs']
if not name in subgraphs:
subgraphs[name] = self.__nfa(subgraph)
(subgraph_start, subgraph_end, nodes_in_subgraph) = subgraphs[name]
(start, ends) = self.__process(graph)
- if modifier:
- assert modifier == 'ZERO_OR_MORE'
- for end in ends:
- end.add_epsilon_transition(subgraph_end)
self.__patch_ends(ends, subgraph_start)
end = self.__new_state()
subgraph_end.add_epsilon_transition(end)
@@ -214,7 +210,8 @@
is_epsilon = lambda k: k == TransitionKey.epsilon()
state_iter = lambda node : node.state_iter(key_filter = is_epsilon)
edge = set(state_iter(node))
- closure = Automaton.visit_states(edge, inner, state_iter=state_iter,
visit_state=set())
+ closure = Automaton.visit_states(
+ edge, inner, state_iter=state_iter, visit_state=set())
node.set_epsilon_closure(closure)
Automaton.visit_states(set([start_state]), outer)
@@ -260,10 +257,8 @@
return ('EPSILON',)
@staticmethod
- def join_subgraph(graph, name, subgraph, modifier):
- if modifier:
- modifier = NfaBuilder.__modifer_map[modifier]
- return ('JOIN', graph, name, subgraph, modifier)
+ def join_subgraph(graph, name, subgraph):
+ return ('JOIN', graph, name, subgraph)
@staticmethod
def or_graphs(graphs):
=======================================
--- /branches/experimental/parser/tools/lexer_generator/rule_parser.py Mon
Nov 18 16:22:04 2013 UTC
+++ /branches/experimental/parser/tools/lexer_generator/rule_parser.py Wed
Nov 20 10:53:56 2013 UTC
@@ -306,9 +306,8 @@
graph = NfaBuilder.add_continue(graph)
else:
assert subgraph == 'default'
- subgraph_modifier = None
graph = NfaBuilder.join_subgraph(
- graph, transition, rule_map[transition], subgraph_modifier)
+ graph, transition, rule_map[transition])
graphs.append(graph)
if continues == len(graphs):
graphs.append(NfaBuilder.epsilon())
--
--
v8-dev mailing list
[email protected]
http://groups.google.com/group/v8-dev
---
You received this message because you are subscribed to the Google Groups "v8-dev" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/groups/opt_out.
