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

Make first private

Browse Source
This commit is contained in:
Dave Halter
2018-06-12 21:56:26 +02:00
parent 8865aa452c
commit c17156bd36
1 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files
parso/pgen2/pgen.py
+9 -9
View File
@@ -15,7 +15,7 @@ class ParserGenerator(object):
def __init__(self, bnf_grammar, token_namespace): def __init__(self, bnf_grammar, token_namespace):
self._bnf_grammar = bnf_grammar self._bnf_grammar = bnf_grammar
self.dfas, self.startsymbol = _GrammarParser(bnf_grammar)._parse() self.dfas, self.startsymbol = _GrammarParser(bnf_grammar)._parse()
self.first = {} # map from symbol name to set of tokens self._first = {} # map from symbol name to set of tokens
self._addfirstsets() self._addfirstsets()
self._token_namespace = token_namespace self._token_namespace = token_namespace
@@ -46,7 +46,7 @@ class ParserGenerator(object):
return grammar return grammar
def _make_first(self, grammar, name): def _make_first(self, grammar, name):
rawfirst = self.first[name] rawfirst = self._first[name]
first = {} first = {}
for label in rawfirst: for label in rawfirst:
ilabel = self._make_label(grammar, label) ilabel = self._make_label(grammar, label)
@@ -105,25 +105,25 @@ class ParserGenerator(object):
names = list(self.dfas.keys()) names = list(self.dfas.keys())
names.sort() names.sort()
for name in names: for name in names:
if name not in self.first: if name not in self._first:
self._calcfirst(name) self._calcfirst(name)
#print name, self.first[name].keys() #print name, self._first[name].keys()
def _calcfirst(self, name): def _calcfirst(self, name):
dfa = self.dfas[name] dfa = self.dfas[name]
self.first[name] = None # dummy to detect left recursion self._first[name] = None # dummy to detect left recursion
state = dfa[0] state = dfa[0]
totalset = {} totalset = {}
overlapcheck = {} overlapcheck = {}
for label, next in state.arcs.items(): for label, next in state.arcs.items():
if label in self.dfas: if label in self.dfas:
if label in self.first: if label in self._first:
fset = self.first[label] fset = self._first[label]
if fset is None: if fset is None:
raise ValueError("recursion for rule %r" % name) raise ValueError("recursion for rule %r" % name)
else: else:
self._calcfirst(label) self._calcfirst(label)
fset = self.first[label] fset = self._first[label]
totalset.update(fset) totalset.update(fset)
overlapcheck[label] = fset overlapcheck[label] = fset
else: else:
@@ -137,7 +137,7 @@ class ParserGenerator(object):
" first sets of %s as well as %s" % " first sets of %s as well as %s" %
(name, symbol, label, inverse[symbol])) (name, symbol, label, inverse[symbol]))
inverse[symbol] = label inverse[symbol] = label
self.first[name] = totalset self._first[name] = totalset
class _GrammarParser(): class _GrammarParser():