Current File : //proc/227033/task/227033/root/lib64/python3.6/lib2to3/pgen2/__pycache__/grammar.cpython-36.pyc
3
\� � @ sx d Z ddlZddlZddlmZmZ G dd� de�Zdd� Zd Z i Z
x.e j � D ]"Z e rNe j
� \ZZeee�e
e< qNW 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� )�token�tokenizec @ s@ e Zd ZdZdd� 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 C s< i | _ i | _g | _i | _dg| _i | _i | _i | _d| _d S )Nr �EMPTY� )r r ) �
symbol2number�
number2symbol�states�dfas�labels�keywords�tokens� symbol2label�start)�self� r � /usr/lib64/python3.6/grammar.py�__init__M s zGrammar.__init__c C s2 t |d�� }t| j�}tj||d� W dQ R X dS )a� Dump the grammar tables to a pickle file.
dump() recursively changes all dict to OrderedDict, so the pickled file
is not exactly the same as what was passed in to dump(). load() uses the
pickled file to create the tables, but only changes OrderedDict to dict
at the top level; it does not recursively change OrderedDict to dict.
So, the loaded tables are different from the original tables that were
passed to load() in that some of the OrderedDict (from the pickled file)
are not changed back to dict. For parsing, this has no effect on
performance because OrderedDict uses dict's __getitem__ with nothing in
between.
�wb� N)�open�_make_deterministic�__dict__�pickle�dump)r �filename�f�dr r r r X s
z Grammar.dumpc C s0 t |d��}tj|�}W dQ R X | jj|� dS )z+Load the grammar tables from a pickle file.�rbN)r r �loadr �update)r r r r r r r r i s z Grammar.loadc C s | j jtj|�� dS )z3Load the grammar tables from a pickle bytes object.N)r r! r �loads)r Zpklr r r r" o s z
Grammar.loadsc C sX | j � }x"dD ]}t||t| |�j� � qW | jdd� |_| jdd� |_| j|_|S ) z#
Copy the grammar.
r r r r
r r N)r r r r
r r )� __class__�setattr�getattr�copyr r
r )r �newZ dict_attrr r r r& s s z Grammar.copyc C sv ddl m } td� || j� td� || j� td� || j� td� || j� td� || j� td| j� d S )
z:Dump the grammar tables to standard output, for debugging.r )�pprintZs2nZn2sr
r r r N)r( �printr r r
r r r )r r( r r r �report� s
zGrammar.reportN)
�__name__�
__module__� __qualname__�__doc__r r r r" r& r* r r r r r s 4
r c C s^ t | t�r&tjtdd� | j� D ���S t | t�r>dd� | D �S t | t�rZtdd� | D ��S | S )Nc s s | ]\}}|t |�fV qd S )N)r )�.0�k�vr r r � <genexpr>� s z&_make_deterministic.<locals>.<genexpr>c S s g | ] }t |��qS r )r )r/ �er r r �
<listcomp>� s z'_make_deterministic.<locals>.<listcomp>c s s | ]}t |�V qd S )N)r )r/ r3 r r r r2 � s )�
isinstance�dict� collections� OrderedDict�sorted�items�list�tuple)�topr r r r � s
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
)r. r7 r � r r �objectr r Z opmap_rawZopmap�
splitlines�line�split�op�namer% r r r r �<module>
s y=
Mini Shell