VimPlug/parso
1
0
Fork 0
mirror of https://github.com/davidhalter/parso.git synced 2026-05-19 23:10:16 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

More renames

Browse Source
This commit is contained in:
Dave Halter
2018-06-13 20:54:18 +02:00
parent 9a0b6f4928
commit 275dbca1b9
1 changed files with 13 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files
parso/pgen2/pgen.py
+13 -13
View File
@@ -322,7 +322,7 @@ class DFAState(object):
__hash__ = None # For Py3 compatibility. __hash__ = None # For Py3 compatibility.
def _simplify_dfa(dfas): def _simplify_dfas(dfas):
# This is not theoretically optimal, but works well enough. # This is not theoretically optimal, but works well enough.
# Algorithm: repeatedly look for two states that have the same # Algorithm: repeatedly look for two states that have the same
# set of arcs (same labels pointing to the same nodes) and # set of arcs (same labels pointing to the same nodes) and
@@ -344,7 +344,7 @@ def _simplify_dfa(dfas):
break break
def _make_dfa(start, finish): def _make_dfas(start, finish):
# To turn an NFA into a DFA, we define the states of the DFA # To turn an NFA into a DFA, we define the states of the DFA
# to correspond to *sets* of states of the NFA. Then do some # to correspond to *sets* of states of the NFA. Then do some
# state reduction. Let's represent sets as dicts with 1 for # state reduction. Let's represent sets as dicts with 1 for
@@ -401,12 +401,12 @@ def _dump_nfa(start, finish):
print(" %s -> %d" % (label, j)) print(" %s -> %d" % (label, j))
def _dump_dfa(name, dfa): def _dump_dfas(name, dfas):
print("Dump of DFA for", name) print("Dump of DFA for", name)
for i, state in enumerate(dfa): for i, state in enumerate(dfas):
print(" State", i, state.isfinal and "(final)" or "") print(" State", i, state.isfinal and "(final)" or "")
for label, next in state.arcs.items(): for label, next in state.arcs.items():
print(" %s -> %d" % (label, dfa.index(next))) print(" %s -> %d" % (label, dfas.index(next)))
def generate_grammar(bnf_grammar, token_namespace): def generate_grammar(bnf_grammar, token_namespace):
@@ -418,20 +418,20 @@ def generate_grammar(bnf_grammar, token_namespace):
It's not EBNF according to ISO/IEC 14977. It's a dialect Python uses in its It's not EBNF according to ISO/IEC 14977. It's a dialect Python uses in its
own parser. own parser.
""" """
dfas = {} rule_to_dfa = {}
start_symbol = None start_symbol = None
for nfa_a, nfa_z in _GrammarParser(bnf_grammar).parse(): for nfa_a, nfa_z in _GrammarParser(bnf_grammar).parse():
#_dump_nfa(a, z) #_dump_nfa(a, z)
dfa = _make_dfa(nfa_a, nfa_z) dfas = _make_dfas(nfa_a, nfa_z)
#_dump_dfa(self._current_rule_name, dfa) #_dump_dfas(self._current_rule_name, dfas)
# oldlen = len(dfa) # oldlen = len(dfas)
_simplify_dfa(dfa) _simplify_dfas(dfas)
# newlen = len(dfa) # newlen = len(dfas)
dfas[nfa_a.from_rule] = dfa rule_to_dfa[nfa_a.from_rule] = dfas
#print(self._current_rule_name, oldlen, newlen) #print(self._current_rule_name, oldlen, newlen)
if start_symbol is None: if start_symbol is None:
start_symbol = nfa_a.from_rule start_symbol = nfa_a.from_rule
p = ParserGenerator(dfas, token_namespace) p = ParserGenerator(rule_to_dfa, token_namespace)
return p.make_grammar(Grammar(bnf_grammar, start_symbol)) return p.make_grammar(Grammar(bnf_grammar, start_symbol))