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

next -> next_

Browse Source
This commit is contained in:
Dave Halter
2018-06-17 17:49:43 +02:00
parent fbed1ecfe0
commit 95e4ecf592
1 changed files with 13 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
parso/pgen2/pgen.py
View File

@@ -47,8 +47,8 @@ class ParserGenerator(object):
states = [] states = []
for state in dfas: for state in dfas:
arcs = [] arcs = []
for label, next in state.arcs.items(): for label, next_ in state.arcs.items():
arcs.append((self._make_label(grammar, label), dfas.index(next))) arcs.append((self._make_label(grammar, label), dfas.index(next_)))
if state.isfinal: if state.isfinal:
arcs.append((0, dfas.index(state))) arcs.append((0, dfas.index(state)))
states.append(arcs) states.append(arcs)
@@ -117,7 +117,7 @@ class ParserGenerator(object):
state = dfas[0] state = dfas[0]
totalset = set() totalset = set()
overlapcheck = {} overlapcheck = {}
for nonterminal_or_string, next in state.arcs.items(): for nonterminal_or_string, next_ in state.arcs.items():
if nonterminal_or_string in self._nonterminal_to_dfas: if nonterminal_or_string in self._nonterminal_to_dfas:
# It's a nonterminal and we have either a left recursion issue # It's a nonterminal and we have either a left recursion issue
# in the grammare or we have to recurse. # in the grammare or we have to recurse.
@@ -163,8 +163,8 @@ class DFAState(object):
self.arcs[label] = next_ self.arcs[label] = next_
def unifystate(self, old, new): def unifystate(self, old, new):
for label, next in self.arcs.items(): for label, next_ in self.arcs.items():
if next is old: if next_ is old:
self.arcs[label] = new self.arcs[label] = new
def __eq__(self, other): def __eq__(self, other):
@@ -176,8 +176,8 @@ class DFAState(object):
# would invoke this method recursively, with cycles... # would invoke this method recursively, with cycles...
if len(self.arcs) != len(other.arcs): if len(self.arcs) != len(other.arcs):
return False return False
for label, next in self.arcs.items(): for label, next_ in self.arcs.items():
if next is not other.arcs.get(label): if next_ is not other.arcs.get(label):
return False return False
return True return True
@@ -258,12 +258,12 @@ def _dump_nfa(start, finish):
todo = [start] todo = [start]
for i, state in enumerate(todo): for i, state in enumerate(todo):
print(" State", i, state is finish and "(final)" or "") print(" State", i, state is finish and "(final)" or "")
for label, next in state.arcs: for label, next_ in state.arcs:
if next in todo: if next_ in todo:
j = todo.index(next) j = todo.index(next_)
else: else:
j = len(todo) j = len(todo)
todo.append(next) todo.append(next_)
if label is None: if label is None:
print(" -> %d" % j) print(" -> %d" % j)
else: else:
@@ -274,8 +274,8 @@ def _dump_dfas(dfas):
print("Dump of DFA for", dfas[0].from_rule) print("Dump of DFA for", dfas[0].from_rule)
for i, state in enumerate(dfas): for i, state in enumerate(dfas):
print(" State", i, state.isfinal and "(final)" or "") print(" State", i, state.isfinal and "(final)" or "")
for nonterminal, next in state.arcs.items(): for nonterminal, next_ in state.arcs.items():
print(" %s -> %d" % (nonterminal, dfas.index(next))) print(" %s -> %d" % (nonterminal, dfas.index(next_)))
def generate_grammar(bnf_grammar, token_namespace): def generate_grammar(bnf_grammar, token_namespace):