Operation   : Linux premium131.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64
Software     : Apache
Server IP    : 162.0.232.56 | Your IP: 216.73.216.111
Domains      : 1034 Domain(s)
Permission   : [ 0755 ]

o

�=?h��@s4dZd
dl
mZ
Gdd�de�ZGdd�de�ZdS)z�Parser 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@s eZ
dZd
Zdd�Zdd�ZdS)�
ParseErrorz(Exception to signal the parser is stuck.cCs4t�
|d
|
|||f�
|
|_||_||_||_dS)Nz!%s: type=%r, value=%r, context=%r)�	Exception�__init__�msg�type�value�context)�selfrrrr	�r�:/opt/alt/python310/lib64/python3.10/lib2to3/pgen2/parse.pyrs


�



zParseError.__init__c

Cst|�
|j
|j|j|jffS�
N)rrrr	)
r
rrr�
__reduce__s
zParseError.__reduce__N)�__name__�
__module__�__qualname__�__doc__rrrrrrrs
rc@sLeZ
dZd
Zddd�
Zddd�
Zdd�Zd	d
�Zdd�Zd
d�Z	dd�Z
dS)�Parsera5Parser 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()).

    NcCs|
|_|pd
d�|_
dS)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
Ss|
Sr
r)�grammar�noderrr�<lambda>Zsz!Parser.__init__.<locals>.<lambda>N)r�convert)r
rrrrrr<s
zParser.__init__cCsH|
d
ur|jj
}
|
d
d
gf}|jj|
d|f}|g
|_d
|_t�|_d
S)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�start�dfas�stack�rootnode�set�
used_names)r
r�newnodeZ
stackentryrrr�setup\s





zParser.setupcCs:
|�|
||�}	|j
d\}}}|\}}	||}
|
D]e\}}|jj|\}
}||kr_|�|
|||�
|}||d|fg
kr\|��
|j
sG
d
S|j
d\}}}|\}}	||d|fg
ks=
dS|
dkr|jj|
}|\}}||vr|�|
|jj|
||�

nqd|f|
vr�|��
|j
s�td|
||��
ntd|
||��
q)z<Add a token; return True iff this is the end of the program.T���rF�
ztoo much inputz	bad input)	�classifyrr�labels�shift�popr�pushr)r
rrr	�ilabel�dfa�staterZstates�firstZarcs�
i�newstate�
t�
vZitsdfaZ	itsstatesZitsfirstrrr�addtokentsD









�



�

���zParser.addtokencCsX|
tj
kr|j�|�

|jj�|�
}|d
u
r|S|jj�|
�
}|d
ur*td|
||��
|S)z&Turn a token into a label.  (Internal)Nz	bad token)	r�NAMEr�addr�keywords�get�tokensr)r
rrr	r(rrrr#�s






zParser.classifyc	CsT|jd
\}}}|
||df}|�
|j|�}|du
r |d
�|�

|||f|jd
<dS)zShift a token.  (Internal)r!N)rrr�append)	r
rrr-r	r)r*rrrrrr%�s




zParser.shiftc	CsB|jd
\}}}|
d|gf}|||f|jd
<|j�
|d|f�

dS)zPush a nonterminal.  (Internal)r!Nr)rr6)	r
rZnewdfar-r	r)r*rrrrrr'�s


zParser.pushc
Csf|j�
�\}
}}|�|j|�}|d
u
r1|jr'|jd\}}}|d�|�

d
S||_|j|j_d
Sd
S)zPop a nonterminal.  (Internal)Nr!)rr&rrr6rr)r
ZpopdfaZpopstateZpopnoderr)r*rrrrr&�s





�z
Parser.popr
)rrrrrr r0r#r%r'r&rrrrrs


 0	rN)r�rrr�objectrrrrr�<module>
s