Name	Size	Mode	Actions
conv.cpython-39.opt-1.pyc	6134	0644	editdlrm
conv.cpython-39.opt-2.pyc	3652	0644	editdlrm
conv.cpython-39.pyc	6995	0644	editdlrm
driver.cpython-39.opt-1.pyc	5097	0644	editdlrm
driver.cpython-39.opt-2.pyc	4101	0644	editdlrm
driver.cpython-39.pyc	5129	0644	editdlrm
grammar.cpython-39.opt-1.pyc	5707	0644	editdlrm
grammar.cpython-39.opt-2.pyc	2556	0644	editdlrm
grammar.cpython-39.pyc	5707	0644	editdlrm
literals.cpython-39.opt-1.pyc	1364	0644	editdlrm
literals.cpython-39.opt-2.pyc	1287	0644	editdlrm
literals.cpython-39.pyc	1531	0644	editdlrm
parse.cpython-39.opt-1.pyc	6466	0644	editdlrm
parse.cpython-39.opt-2.pyc	3242	0644	editdlrm
parse.cpython-39.pyc	6480	0644	editdlrm
pgen.cpython-39.opt-1.pyc	9319	0644	editdlrm
pgen.cpython-39.opt-2.pyc	9319	0644	editdlrm
pgen.cpython-39.pyc	9722	0644	editdlrm
token.cpython-39.opt-1.pyc	1889	0644	editdlrm
token.cpython-39.opt-2.pyc	1839	0644	editdlrm
token.cpython-39.pyc	1889	0644	editdlrm
tokenize.cpython-39.opt-1.pyc	15124	0644	editdlrm
tokenize.cpython-39.opt-2.pyc	11230	0644	editdlrm
tokenize.cpython-39.pyc	15173	0644	editdlrm
__init__.cpython-39.opt-1.pyc	167	0644	editdlrm
__init__.cpython-39.opt-2.pyc	139	0644	editdlrm
__init__.cpython-39.pyc	167	0644	editdlrm

a �i��@s`dZd
dl
Z
ddlmZ
Gdd�de�ZdZiZe��D]"Z e r8e � �\ZZe ee�ee<q8dS)a�
This module defines the data structures used to represent a grammar. These are a bit arcane because they are derived from the data structures used by Python's 'pgen' parser generator. There's also a table here mapping operators to their names in the token module; the Python tokenize module reports all operators as the fallback token code OP, but the parser needs the actual token code. �N�
)
�tokenc@s@eZ
dZd
Zdd�Zdd�Zdd�Zdd �Zd d�Zdd �Z dS)�Grammara� Pgen parsing tables conversion class. Once initialized, this class supplies the grammar tables for the parsing engine implemented by parse.py. The parsing engine accesses the instance variables directly. The class here does not provide initialization of the tables; several subclasses exist to do this (see the conv and pgen modules). The load() method reads the tables from a pickle file, which is much faster than the other ways offered by subclasses. The pickle file is written by calling dump() (after loading the grammar tables using a subclass). The report() method prints a readable representation of the tables to stdout, for debugging. The instance variables are as follows: symbol2number -- a dict mapping symbol names to numbers. Symbol numbers are always 256 or higher, to distinguish them from token numbers, which are between 0 and 255 (inclusive). number2symbol -- a dict mapping numbers to symbol names; these two are each other's inverse. states -- a list of DFAs, where each DFA is a list of states, each state is a list of arcs, and each arc is a (i, j) pair where i is a label and j is a state number. The DFA number is the index into this list. (This name is slightly confusing.) Final states are represented by a special arc of the form (0, j) where j is its own state number. dfas -- a dict mapping symbol numbers to (DFA, first) pairs, where DFA is an item from the states list above, and first is a set of tokens that can begin this grammar rule (represented by a dict whose values are always 1). labels -- a list of (x, y) pairs where x is either a token number or a symbol number, and y is either None or a string; the strings are keywords. The label number is the index in this list; label numbers are used to mark state transitions (arcs) in the DFAs. start -- the number of the grammar's start symbol. keywords -- a dict mapping keyword strings to arc labels. tokens -- a dict mapping token numbers to arc labels. c

Cs<i|_i|_
g|_i|_d
g
|_i|_i|_i|_d|_dS)N)r
ZEMPTY�
) � symbol2number� number2symbol�states�dfas�labels�keywords�tokens�symbol2label�start)
�self�r�-/usr/lib64/python3.9/lib2to3/pgen2/grammar.py�__init__Ls








zGrammar.__init__cCs@t|
d
��"}t
�|j|t
j�
Wd�
n1s20


Y
dS)z)Dump the grammar tables to a pickle file.�wbN)�open�pickle�dump�__dict__�HIGHEST_PROTOCOL)r�filename�
frrrrWs
zGrammar.dumpcCsDt|
d
��}t
�|�
}Wd�
n1s*0


Y
|j�|�

dS)z+Load the grammar tables from a pickle file.�rbN)rr�loadr�update)rrr�
drrrr\s
(
zGrammar.loadcCs|j�
t�|
�
�

d
S)z3Load the grammar tables from a pickle bytes object.N)rrr�loads)rZpklrrrrbsz Grammar.loadsc
CsT|��}
d
D]}t
|
|t||����
q|jdd�|
_|jdd�|
_|j|
_|
S)z# Copy the grammar. )rrr rrr N)� __class__�setattr�getattr�copyr rr)r�newZ dict_attrrrrr#fs




zGrammar.copyc
Csvd
dlm}

t
d�

|
|j�

t
d�

|
|j�

t
d�

|
|j�

t
d�

|
|j�

t
d�

|
|j�

t
d|j�
d S) z:Dump the grammar tables to standard output, for debugging.r
)
�pprintZs2nZn2srr r rN)r%�printrrrr r r)rr%rrr�reportss










zGrammar.reportN) �__name__� __module__�__qualname__�__doc__rrrrr#r'rrrrrs
5 ra ( LPAR ) RPAR [ LSQB ] RSQB : COLON , COMMA ; SEMI + PLUS - MINUS * STAR / SLASH | VBAR & AMPER < LESS > GREATER = EQUAL . DOT % PERCENT ` BACKQUOTE { LBRACE } RBRACE @ AT @= ATEQUAL == EQEQUAL != NOTEQUAL <> NOTEQUAL <= LESSEQUAL >= GREATEREQUAL ~ TILDE ^ CIRCUMFLEX << LEFTSHIFT >> RIGHTSHIFT ** DOUBLESTAR += PLUSEQUAL -= MINEQUAL *= STAREQUAL /= SLASHEQUAL %= PERCENTEQUAL &= AMPEREQUAL |= VBAREQUAL ^= CIRCUMFLEXEQUAL <<= LEFTSHIFTEQUAL >>= RIGHTSHIFTEQUAL **= DOUBLESTAREQUAL // DOUBLESLASH //= DOUBLESLASHEQUAL -> RARROW := COLONEQUAL )r+r�r�objectrZ opmap_rawZopmap� splitlines�line�split�op�namer"rrrr�so3