Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(5)

Unified Diff: tools/lexer_generator/rule_parser.py

Issue 63183007: Experimental parser: dfa minimization (Closed) Base URL: https://v8.googlecode.com/svn/branches/experimental/parser
Patch Set: Created 7 years, 1 month ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
« no previous file with comments | « tools/lexer_generator/generator.py ('k') | tools/lexer_generator/transition_keys.py » ('j') | no next file with comments »
Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
Index: tools/lexer_generator/rule_parser.py
diff --git a/tools/lexer_generator/rule_parser.py b/tools/lexer_generator/rule_parser.py
index c4aedd0f8b806b86921a0cf31e10066affe6c591..aebd49936c0edcbadb24ecb5b1039329d237b0b9 100644
--- a/tools/lexer_generator/rule_parser.py
+++ b/tools/lexer_generator/rule_parser.py
@@ -217,15 +217,15 @@ class RuleParser:
class RuleProcessor(object):
- def __init__(self, parser_state):
+ def __init__(self, parser_state, minimize_dfa):
self.__automata = {}
- self.__process_parser_state(parser_state)
+ self.__process_parser_state(parser_state, minimize_dfa)
@staticmethod
- def parse(string):
+ def parse(string, minimize_dfa = True):
parser_state = RuleParserState()
RuleParser.parse(string, parser_state)
- return RuleProcessor(parser_state)
+ return RuleProcessor(parser_state, minimize_dfa)
def automata_iter(self):
return iter(self.__automata.items())
@@ -239,11 +239,11 @@ class RuleProcessor(object):
class Automata(object):
- def __init__(self, nfa):
+ def __init__(self, nfa, minimize_dfa):
(start, dfa_nodes) = nfa.compute_dfa()
self.__nfa = nfa
self.__dfa = Dfa(start, dfa_nodes)
- self.__minimial_dfa = self.__dfa.minimize()
+ self.__minimial_dfa = self.__dfa.minimize() if minimize_dfa else None
def nfa(self):
return self.__nfa
@@ -254,7 +254,7 @@ class RuleProcessor(object):
def minimal_dfa(self):
return self.__minimial_dfa
- def __process_parser_state(self, parser_state):
+ def __process_parser_state(self, parser_state, minimize_dfa):
rule_map = {}
builder = NfaBuilder()
builder.set_character_classes(parser_state.character_classes)
@@ -298,5 +298,5 @@ class RuleProcessor(object):
# build the automata
for rule_name, graph in rule_map.items():
nfa = builder.nfa(graph)
- self.__automata[rule_name] = RuleProcessor.Automata(nfa)
+ self.__automata[rule_name] = RuleProcessor.Automata(nfa, minimize_dfa)
self.default_action = parser_state.rules['default']['default_action']
« no previous file with comments | « tools/lexer_generator/generator.py ('k') | tools/lexer_generator/transition_keys.py » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698