????
Your IP : 216.73.217.84
�
���L�� � � d Z ddlZddlmZ G d� de� ZdZi Zej � D ]$ Z e s�e j � \ Z Z e
ee � ee < �& [ [ [ y)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 �4 � e Zd ZdZd� Zd� Zd� Zd� Zd� Zd� Z y) �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 � � i | _ i | _ g | _ i | _ dg| _ i | _ i | _ i | _ d| _ y )N)r �EMPTY� ) �
symbol2number�
number2symbol�states�dfas�labels�keywords�tokens� symbol2label�start)�selfs �</opt/alt/python312/lib64/python3.12/lib2to3/pgen2/grammar.py�__init__zGrammar.__init__L sF � � ��� ����� ��� �#�n�� ���
��� � �����
� c � � t |d� 5 }t j | j |t j � ddd� y# 1 sw Y yxY w)z)Dump the grammar tables to a pickle file.�wbN)�open�pickle�dump�__dict__�HIGHEST_PROTOCOL)r �filename�fs r r z Grammar.dumpW s4 � �
�(�D�
!�Q� �K�K��
�
�q�&�*A�*A� B� "�
!�
!�s �0A�Ac � � t |d� 5 }t j |� }ddd� | j j � y# 1 sw Y �%xY w)z+Load the grammar tables from a pickle file.�rbN)r r �loadr �update)r r r �ds r r" z Grammar.load\ s; � �
�(�D�
!�Q�� � �A��A� "� �
�
� � �Q� � "�
!�s �A�Ac �` � | j j t j |� � y)z3Load the grammar tables from a pickle bytes object.N)r r# r �loads)r �pkls r r& z
Grammar.loadsb s � � �
�
� � �V�\�\�#� .�/r c �� � | j � }dD ]' }t ||t | |� j � � �) | j dd |_ | j
dd |_ | j |_ |S )z#
Copy the grammar.
)r
r r
r r r N)� __class__�setattr�getattr�copyr r r )r �new� dict_attrs r r, z Grammar.copyf sh � � �n�n� ��4�I� �C��G�D�)�$<�$A�$A�$C� D�4� �[�[��^��
��[�[��^��
��J�J�� ��
r c �^ � ddl m } t d� || j � t d� || j � t d� || j � t d� || j
� t d� || j � t d| j � y )
z:Dump the grammar tables to standard output, for debugging.r )�pprint�s2n�n2sr r
r r N)r0 �printr
r r r
r r )r r0 s r �reportzGrammar.reports sv � �!�
�e� ��t�!�!�"�
�e� ��t�!�!�"�
�h���t�{�{��
�f�
��t�y�y��
�h���t�{�{��
�g�t�z�z�"r N)
�__name__�
__module__� __qualname__�__doc__r r r" r& r, r4 � r r r r s' � �3�j �C�
� 0� �
#r r a
( 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
)r8 r � r �objectr � opmap_raw�opmap�
splitlines�line�split�op�namer+ r9 r r �<module>rC sp �� � � �j#�f� j#�^1
� �f �� � � � "�D� ��:�:�<���D��E�4�(��b� �
#� �"�dr