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 ]

3


 \�%�@s2dZd
dl
Z
d
dlmZmZ
Gdd�dej�ZdS)a�Convert graminit.[ch] spit out by pgen to Python code.

Pgen is the Python parser generator.  It is useful to quickly create a
parser from a grammar file in Python's grammar notation.  But I don't
want my parsers to be written in C (yet), so I'm translating the
parsing tables to Python data structures and writing a Python parse
engine.

Note that the token numbers are constants determined by the standard
Python tokenizer.  The standard token module defines these numbers and
their names (the names are not used much).  The token numbers are
hardcoded into the Python tokenizer and into pgen.  A Python
implementation of the Python tokenizer is also available, in the
standard tokenize module.

On the other hand, symbol numbers (representing the grammar's
non-terminals) are assigned by pgen based on the actual grammar
input.

Note: this module is pretty much obsolete; the pgen module generates
equivalent grammar tables directly from the Grammar.txt input file
without having to invoke the Python pgen C program.

�N)�grammar�tokenc@s0eZ
dZd
Zdd�Zdd�Zdd�Zdd	�Zd
S)�	Convertera2
Grammar subclass that reads classic pgen output files.

    The run() method reads the tables as produced by the pgen parser
    generator, typically contained in two C files, graminit.h and
    graminit.c.  The other methods are for internal use only.

    See the base class for more documentation.

    cCs |j|
�

|j
|�

|j�
d
S)z<Load the grammar tables from the text files written by pgen.N)�parse_graminit_h�parse_graminit_c�
finish_off)�selfZ
graminit_hZ
graminit_c�r	�*/usr/lib64/python3.6/lib2to3/pgen2/conv.py�run/s



z
Converter.runc	Cs�yt|
�
}Wn0t
k
r<
}
ztd
|
|f�

dSd}~XnXi|_i|_d}x�|D]�}|d7}tjd|�}|r�|j�r�td|
||j�f�

qT|j�\}}t	|�
}||jks�t
�
||jks�t
�
||j|<||j|<qTWdS)	z�Parse the .h file written by pgen.  (Internal)

        This file is a sequence of #define statements defining the
        nonterminals of the grammar as numbers.  We build two tables
        mapping the numbers to names and back.

        zCan't open %s: %sFNr
�
z^#define\s+(\w+)\s+(\d+)$z%s(%s): can't parse %sT)�open�OSError�print�
symbol2number�
number2symbol�re�match�strip�groups�int�AssertionError)	r�filename�
f�err�lineno�line�mo�symbol�numberr	r	r
r5s*




















zConverter.parse_graminit_hc!Cspyt|
�
}Wn0t
k
r<
}
ztd
|
|f�

dSd}~XnXd}|dt|�
}}|dksht||f�
�
|dt|�
}}|dks�t||f�
�
|dt|�
}}i}g}�x*|jd�
�r�x�|jd�
�
r�tjd	|�}|s�t||f�
�
tt	t
|j���
\}	}
}g}xft|�
D]Z}
|dt|�
}}tjd
|�}|�
s<t||f�
�
tt	t
|j���
\}}|j
||f�

�
qW|dt|�
}}|dk�
s�t||f�
�
|||	|
f<|dt|�
}}q�Wtjd|�}|�
s�t||f�
�
tt	t
|j���
\}}|t|�
k�
s�t||f�
�
g}x�t|�
D]~}
|dt|�
}}tjd
|�}|�s@t||f�
�
tt	t
|j���
\}}	}
||	|
f}|t|�
k�s~t||f�
�
|j
|�

�qW|j
|�

|dt|�
}}|dk�s�t||f�
�
|dt|�
}}q�W||_i}tjd|�}|�s�t||f�
�
t
|jd�
�
}�
x�t|�
D�
]r}|dt|�
}}tjd|�}|�sNt||f�
�
|jd�
}tt	t
|jdddd���
\}}}}|j||k�s�t||f�
�
|j||k�s�t||f�
�
|dk�s�t||f�
�
||}|t|�
k�s�t||f�
�
|dt|�
}}tjd|�}|�st||f�
�
i}t|jd�
�
}xPt|�
D]D\}}t|�
}x0td�
D]$}|d|>@�rPd||d|<�qPW�q6W||f||<�qW|dt|�
}}|dk�s�t||f�
�
||_g}|dt|�
}}tjd|�}|�s�t||f�
�
t
|jd�
�
}x|t|�
D]p}|dt|�
}}tjd|�}|�s>t||f�
�
|j�\}}t
|�
}|dk�rbd}nt|�
}|j
||f�

�q
W|dt|�
}}|dk�s�t||f�
�
||_|dt|�
}}|dk�s�t||f�
�
|dt|�
}}tjd|�}|�st||f�
�
t
|jd�
�
}|t|j�
k�s&t�
|dt|�
}}|dk�sNt||f�
�
|dt|�
}}tjd|�}|�s~t||f�
�
t
|jd�
�
}|t|j�
k�s�t||f�
�
|dt|�
}}tjd|�}|�s�t||f�
�
t
|jd�
�
} | |jk�s�t||f�
�
| |_|dt|�
}}|dk�s,t||f�
�
y|dt|�
}}Wntk
�rX


YnXd�slt||f�
�
dS)a�Parse the .c file written by pgen.  (Internal)

        The file looks as follows.  The first two lines are always this:

        #include "pgenheaders.h"
        #include "grammar.h"

        After that come four blocks:

        1) one or more state definitions
        2) a table defining dfas
        3) a table defining labels
        4) a struct defining the grammar

        A state definition has the following form:
        - one or more arc arrays, each of the form:
          static arc arcs_<n>_<m>[<k>] = {
                  {<i>, <j>},
                  ...
          };
        - followed by a state array, of the form:
          static state states_<s>[<t>] = {
                  {<k>, arcs_<n>_<m>},
                  ...
          };

        zCan't open %s: %sFNr
rz#include "pgenheaders.h"
z#include "grammar.h"
zstatic arc z)static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$z\s+{(\d+), (\d+)},$z};
z'static state states_(\d+)\[(\d+)\] = {$z\s+{(\d+), arcs_(\d+)_(\d+)},$zstatic dfa dfas\[(\d+)\] = {$z0\s+{(\d+), "(\w+)", (\d+), (\d+), states_(\d+),$����z\s+("(?:\\\d\d\d)*")},$�z!static label labels\[(\d+)\] = {$z\s+{(\d+), (0|"\w+")},$�
0zgrammar _PyParser_Grammar = {
z
\s+(\d+),$z	dfas,
z\s+{(\d+), labels},$z	\s+(\d+)$)r
rr�nextr�
startswithrr�list�maprr�range�append�len�states�grouprr�eval�	enumerate�ord�dfas�labels�start�
StopIteration)!rrrrrrZallarcsr-r�
n�
m�
kZarcs�
_�
i�
j�
s�
t�stater2Zndfasrr�
x�
y�
z�firstZ	rawbitset�
cZbyter3Znlabelsr4r	r	r
rTs�























































"




























































zConverter.parse_graminit_cc
Cs\i|_i|_
xJt|j�
D]<\}
\}}|tjkrB|d
k	rB|
|j|<q|d
kr|
|j
|<qWd
S)z1Create additional useful structures.  (Internal).N)�keywords�tokensr0r3r�NAME)rZilabel�type�valuer	r	r
r�s





zConverter.finish_offN)�__name__�
__module__�__qualname__�__doc__rrrrr	r	r	r
r$s	&r)rLrZpgen2rrZGrammarrr	r	r	r
�<module>s