mirror of
https://github.com/davidhalter/parso.git
synced 2025-12-15 00:47:11 +08:00
Add docstring
This commit is contained in:
@@ -16,11 +16,6 @@ fallback token code OP, but the parser needs the actual token code.
|
|||||||
|
|
||||||
"""
|
"""
|
||||||
|
|
||||||
try:
|
|
||||||
import cPickle as pickle
|
|
||||||
except:
|
|
||||||
import pickle
|
|
||||||
|
|
||||||
|
|
||||||
class Grammar(object):
|
class Grammar(object):
|
||||||
"""Pgen parsing tables conversion class.
|
"""Pgen parsing tables conversion class.
|
||||||
|
|||||||
@@ -204,6 +204,9 @@ def _simplify_dfas(dfas):
|
|||||||
|
|
||||||
|
|
||||||
def _make_dfas(start, finish):
|
def _make_dfas(start, finish):
|
||||||
|
"""
|
||||||
|
This is basically doing what the powerset construction algorithm is doing.
|
||||||
|
"""
|
||||||
# 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.
|
# state reduction.
|
||||||
|
|||||||
Reference in New Issue
Block a user