VimPlug/parso
1
0
Fork 0
mirror of https://github.com/davidhalter/parso.git synced 2026-03-01 04:52:48 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Simplify some code

Browse Source
This commit is contained in:
Dave Halter
2018-06-15 00:06:56 +02:00
parent 1f02327cff
commit 567e0d7aed
1 changed files with 4 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
parso/pgen2/pgen.py
View File

@@ -30,11 +30,14 @@ class ParserGenerator(object):
def make_grammar(self, grammar): def make_grammar(self, grammar):
self._first = {} # map from symbol name to set of tokens self._first = {} # map from symbol name to set of tokens
self._addfirstsets()
names = list(self._rule_to_dfas.keys()) names = list(self._rule_to_dfas.keys())
names.sort() names.sort()
for name in names: for name in names:
if name not in self._first:
self._calcfirst(name)
#print name, self._first[name].keys()
i = 256 + len(grammar.symbol2number) i = 256 + len(grammar.symbol2number)
grammar.symbol2number[name] = i grammar.symbol2number[name] = i
grammar.number2symbol[i] = name grammar.number2symbol[i] = name
@@ -109,14 +112,6 @@ class ParserGenerator(object):
grammar.tokens[itoken] = ilabel grammar.tokens[itoken] = ilabel
return ilabel return ilabel
def _addfirstsets(self):
names = list(self._rule_to_dfas.keys())
names.sort()
for name in names:
if name not in self._first:
self._calcfirst(name)
#print name, self._first[name].keys()
def _calcfirst(self, name): def _calcfirst(self, name):
dfa = self._rule_to_dfas[name] dfa = self._rule_to_dfas[name]
self._first[name] = None # dummy to detect left recursion self._first[name] = None # dummy to detect left recursion