Linux cesa-www-main 6.1.0-49-cloud-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.174-1 (2026-05-26) x86_64
Apache/2.4.68 (Debian)
Server IP : 10.218.0.2 & Your IP : 216.73.216.28
Domains :
Cant Read [ /etc/named.conf ]
User : www-data
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
lib /
python3.11 /
lib2to3 /
pgen2 /
__pycache__ /
Delete
Unzip
Name
Size
Permission
Date
Action
__init__.cpython-311.pyc
188
B
-rw-r--r--
2025-10-28 07:06
conv.cpython-311.pyc
12.95
KB
-rw-r--r--
2025-10-28 07:06
driver.cpython-311.pyc
8.23
KB
-rw-r--r--
2025-10-28 07:06
grammar.cpython-311.pyc
7.38
KB
-rw-r--r--
2025-10-28 07:06
literals.cpython-311.pyc
3
KB
-rw-r--r--
2025-10-28 07:06
parse.cpython-311.pyc
8.82
KB
-rw-r--r--
2025-10-28 07:06
pgen.cpython-311.pyc
19.78
KB
-rw-r--r--
2025-10-28 07:06
token.cpython-311.pyc
2.31
KB
-rw-r--r--
2025-10-28 07:06
tokenize.cpython-311.pyc
23.58
KB
-rw-r--r--
2025-10-28 07:06
Save
Rename
� ZQd� � �� � d Z ddlZddlmZ G d� de� � ZdZi Ze� � � D ]*Z e r&e � � � \ Z Z e ee � � ee < �+[ [ [ dS )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 �6 � e Zd ZdZd� Zd� Zd� Zd� Zd� Zd� 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 � � i | _ i | _ g | _ i | _ dg| _ i | _ i | _ i | _ d| _ d S )N)r �EMPTY� ) � symbol2number� number2symbol�states�dfas�labels�keywords�tokens� symbol2label�start)�selfs �,/usr/lib/python3.11/lib2to3/pgen2/grammar.py�__init__zGrammar.__init__L sJ � � ��� ����� ��� �#�n�� ��� ��� � ����� � � � c � � t |d� � 5 }t j | j |t j � � ddd� � dS # 1 swxY w Y dS )z)Dump the grammar tables to a pickle file.�wbN)�open�pickle�dump�__dict__�HIGHEST_PROTOCOL)r �filename�fs r r z Grammar.dumpW s� � � �(�D� !� !� C�Q� �K�� �q�&�*A� B� B� B� C� C� C� C� C� C� C� C� C� C� C� C���� C� C� C� C� C� Cs �&A�A� Ac � � t |d� � 5 }t j |� � }ddd� � n # 1 swxY w Y | j � |� � dS )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 �2�6�6c �^ � | j � t j |� � � � dS )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 � � | � � � }dD ]3}t ||t | |� � � � � � � �4| 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 s� � � �n�n� � ��4� E� E�I� �C��G�D�)�$<�$<�$A�$A�$C�$C� D� D� D� D��[����^�� ��[����^�� ��J�� �� r c �r � ddl m } 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 )�pprint�s2n�n2sr r r r N)r0 �printr r r r r r )r r0 s r �reportzGrammar.reports s� � �!�!�!�!�!�!� �e� � � ���t�!�"�"�"� �e� � � ���t�!�"�"�"� �h������t�{���� �f� � � ���t�y���� �h������t�{���� �g�t�z�"�"�"�"�"r N) �__name__� __module__� __qualname__�__doc__r r r" r& r, r4 � r r r r s| � � � � � �3� 3�j � � �C� C� C� � � � 0� 0� 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 s� �� � � � � � � � � � � � �j#� j#� j#� j#� j#�f� j#� j#� j#�^1 � �f �� � � � "� "� )� )�D� � )��:�:�<�<���D��G�E�4�(�(��b� ���"�d�d�dr