python (3.12.0)
̑e @ d Z ddlmZ G d de Z G d de Zy)zParser engine for the grammar tables generated by pgen.
The grammar table must be loaded first.
See Parser/parser.c in the Python distribution for additional info on
how this parsing engine works.
)tokenc e Zd ZdZd Zd Zy)
ParseErrorz(Exception to signal the parser is stuck.c
~ t j | |d|d|d| || _ || _ || _ || _ y )Nz: type=z, value=z
, context=) Exception__init__msgtypevaluecontext)selfr r
r r s G/BuggyBox/python/3.12.0/bootstrap/lib/python3.12/lib2to3/pgen2/parse.pyr zParseError.__init__ s< 4 ug"7 8
c t t | | j | j | j | j ffS N)r
r r r )r
s r
__reduce__zParseError.__reduce__ s* DzDHHdiiT\\JJJr N)__name__
__module__ __qualname____doc__r r r r r r s 2 Kr r c > e Zd ZdZd
dZd
dZd Zd Zd Zd Z d Z
y) Parsera5 Parser engine.
The proper usage sequence is:
p = Parser(grammar, [converter]) # create instance
p.setup([start]) # prepare for parsing
<for each input token>:
if p.addtoken(...): # parse a token; may raise ParseError
break
root = p.rootnode # root of abstract syntax tree
A Parser instance may be reused by calling setup() repeatedly.
A Parser instance contains state pertaining to the current token
sequence, and should not be used concurrently by different threads
to parse separate token sequences.
See driver.py for how to get input tokens by tokenizing a file or
string.
Parsing is complete when addtoken() returns True; the root of the
abstract syntax tree can then be retrieved from the rootnode
instance variable. When a syntax error occurs, addtoken() raises
the ParseError exception. There is no error recovery; the parser
cannot be used after a syntax error was reported (but it can be
reinitialized by calling setup()).
Nc * || _ |xs d | _ y)a Constructor.
The grammar argument is a grammar.Grammar instance; see the
grammar module for more information.
The parser is not ready yet for parsing; you must call the
setup() method to get it started.
The optional convert argument is a function mapping concrete
syntax tree nodes to abstract syntax tree nodes. If not
given, no conversion is done and the syntax tree produced is
the concrete syntax tree. If given, it must be a function of
two arguments, the first being the grammar (a grammar.Grammar
instance), and the second being the concrete syntax tree node
to be converted. The syntax tree is converted from the bottom
up.
A concrete syntax tree node is a (type, value, context, nodes)
tuple, where type is the node type (a token or symbol number),
value is None for symbols and a string for tokens, context is
None or an opaque value used for error reporting (typically a
(lineno, offset) pair), and nodes is a list of children for
symbols, and None for tokens.
An abstract syntax tree node may be anything; this is entirely
up to the converter function.
c |S r r )grammarnodes r <lambda>z!Parser.__init__.<locals>.<lambda>Z s r N)r convert)r
r r s r r zParser.__init__< s : >#= r c || j j }|ddg f}| j j | d|f}|g| _ d| _ t | _ y)a Prepare for parsing.
This *must* be called before starting to parse.
The optional argument is an alternative start symbol; it
defaults to the grammar's start symbol.
You can use a Parser instance to parse any number of programs;
each time you call setup() the parser is reset to an initial
state determined by the (implicit or explicit) start symbol.
N )r startdfasstackrootnodeset
used_names)r
r" newnode
stackentrys r setupz Parser.setup\ s\ =LL&&E $b)ll''.7;
\
%r c | j ||| } | j d \ }}}|\ }} || }
|
D ] \ } } | j j | \ }
}|| k( re| j ||| | | }|| d|fgk( rB| j | j s y| j d \ }}}|\ }} || d|fgk( rB y|
dk\ s| j j |
}|\ }}||v s| j |
| j j |
| | n? d|f|
v r*| j | j s t d||| t d||| B)z<Add a token; return True iff this is the end of the program.Tr! F ztoo much inputz bad input) classifyr$ r labelsshiftpopr# pushr )r
r
r r ilabeldfastater statesfirstarcsinewstatetvitsdfa itsstatesitsfirsts r addtokenzParser.addtokent s tUG4 #zz"~ C MFE%=D # $
H 8||**1-1Q; JJtUHg> $E -QJ<7
#zz#'+/::b>(UD(+
!-QJ<7 !#X !\\ . .q 1F*0'Ix ) !T\\%6%6q%98WM 3$
H6 u:%HHJ :: ()9)-ug ? ? %[$wGGS r c |t j k( rD| j j | | j j
j
| }||S | j j j
| }|t d||| |S )z&Turn a token into a label. (Internal)z bad token) r NAMEr' addr keywordsgettokensr )r
r
r r r3 s r r. zParser.classify sz 5:: OO &\\**..u5F!
$$((. > [$w? ?
r c | j d \ }}}|||df}| j | j | }||d j | |||f| j d< y)zShift a token. (Internal)r, N)r$ r r append) r
r
r r: r r4 r5 r r( s r r0 z Parser.shift sb ::b>UD.,,t||W5 HOOG $ x.
2r c | j d \ }}}|d|g f}|||f| j d< | j j |d|f y)z Push a nonterminal. (Internal)r, Nr! )r$ rH ) r
r
newdfar: r r4 r5 r r( s r r2 z Parser.push sQ ::b>UDw+ x.
2
61g./r c * | j j \ }}}| j | j | }|W| j r(| j d \ }}}|d j | y|| _ | j | j
_ yy)z Pop a nonterminal. (Internal)Nr, )r$ r1 r r rH r% r' )r
popdfapopstatepopnoder( r4 r5 r s r r1 z
Parser.pop sz $(JJNN$4!',,t||W5 zz#'::b> UDR( '
+/??
(
r r ) r r r r r r* r@ r. r0 r2 r1 r r r r r s- : ?@ 0.H` /0
;r r N)r r r r objectr r r r <module>rQ s+ K K n;V n;r 
Browse
Usage
Versions