|
Server : LiteSpeed System : Linux premium217.web-hosting.com 4.18.0-553.54.1.lve.el8.x86_64 #1 SMP Wed Jun 4 13:01:13 UTC 2025 x86_64 User : alloknri ( 880) PHP Version : 8.1.34 Disable Function : NONE Directory : /opt/alt/python27/lib64/python2.7/lib2to3/pgen2/ |
�
�V~gc @ sE d Z d d l Z d d l m Z m Z d e j f d � � YZ d S( s� 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.
i����N( t grammart tokent Converterc B s2 e Z d Z d � Z d � Z d � Z d � Z RS( s2 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.
c C s( | j | � | j | � | j � d S( s< Load the grammar tables from the text files written by pgen.N( t parse_graminit_ht parse_graminit_ct
finish_off( t selft
graminit_ht
graminit_c( ( s7 /opt/alt/python27/lib64/python2.7/lib2to3/pgen2/conv.pyt run/ s
c C s� y t | � } Wn# t k
r5 } d | | f GHt SXi | _ i | _ d } x� | D]� } | d 7} t j d | � } | r� | j � r� d | | | j � f GHqU | j � \ } } t | � } | | j | <| | j | <qU Wt
S( s� 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.
s Can't open %s: %si i s ^#define\s+(\w+)\s+(\d+)$s %s(%s): can't parse %s( t opent IOErrort Falset
symbol2numbert
number2symbolt ret matcht stript groupst intt True( R t filenamet ft errt linenot linet mot symbolt number( ( s7 /opt/alt/python27/lib64/python2.7/lib2to3/pgen2/conv.pyR 5 s&
c ! C sH y t | � } Wn# t k
r5 } d | | f GHt SXd } | d | j � } } | d | j � } } | d | j � } } i } g } x�| j d � r�x� | j d � r�t j d | � } t t | j � � \ } }
} g } xk t
| � D]] }
| d | j � } } t j d | � } t t | j � � \ } } | j | | f � q� W| d | j � } } | | | |
f <| d | j � } } q� Wt j d | � } t t | j � � \ } } g } xx t
| � D]j }
| d | j � } } t j d | � } t t | j � � \ } } }
| | |
f } | j | � q�W| j | � | d | j � } } | d | j � } } q� W| | _ i } t j d | � } t | j
d � � } x:t
| � D],} | d | j � } } t j d
| � } | j
d � } t t | j
d d d
d � � \ } } } } | | } | d | j � } } t j d | � } i } t | j
d � � } x` t | � D]R \ } } t | � } x7 t
d � D]) } | d | >@r�d | | d | <q�q�Wq�W| | f | | <q�W| d | j � } } | | _ g } | d | j � } } t j d | � } t | j
d � � } x� t
| � D]� } | d | j � } } t j d | � } | j � \ } } t | � } | d k r�d } n t | � } | j | | f � qhW| d | j � } } | | _ | d | j � } } | d | j � } } t j d | � } t | j
d � � } | d | j � } } | d | j � } } t j d | � } t | j
d � � } | d | j � } } t j d | � } t | j
d � � } | | _ | d | j � } } y | d | j � } } Wn t k
rCn Xd S( s� 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>},
...
};
s Can't open %s: %si i s static arc s) static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$s \s+{(\d+), (\d+)},$s' static state states_(\d+)\[(\d+)\] = {$s \s+{(\d+), arcs_(\d+)_(\d+)},$s static dfa dfas\[(\d+)\] = {$s0 \s+{(\d+), "(\w+)", (\d+), (\d+), states_(\d+),$i i i i s \s+("(?:\\\d\d\d)*")},$i s! static label labels\[(\d+)\] = {$s \s+{(\d+), (0|"\w+")},$t 0s
\s+(\d+),$s \s+{(\d+), labels},$s \s+(\d+)$N( R
R R t nextt
startswithR R t mapR R t ranget appendt statest groupt evalt enumeratet ordt dfast Nonet labelst startt
StopIteration(! R R R R R R t allarcsR# R t nt mt kt arcst _t it jt st tt stateR( t ndfasR R t xt yt zt firstt rawbitsett ct byteR* t nlabelsR+ ( ( s7 /opt/alt/python27/lib64/python2.7/lib2to3/pgen2/conv.pyR T s�
-
c C s� i | _ i | _ xj t | j � D]Y \ } \ } } | t j k r_ | d k r_ | | j | <q" | d k r" | | j | <q" q" Wd S( s1 Create additional useful structures. (Internal).N( t keywordst tokensR& R* R t NAMER) ( R t ilabelt typet value( ( s7 /opt/alt/python27/lib64/python2.7/lib2to3/pgen2/conv.pyR � s " ( t __name__t
__module__t __doc__R R R R ( ( ( s7 /opt/alt/python27/lib64/python2.7/lib2to3/pgen2/conv.pyR $ s
�( RI R t pgen2R R t GrammarR ( ( ( s7 /opt/alt/python27/lib64/python2.7/lib2to3/pgen2/conv.pyt <module> s | __init__.py | |||
| __init__.pyc | |||
| __init__.pyo | |||
| conv.py | |||
| conv.pyc | |||
| conv.pyo | |||
| driver.py | |||
| driver.pyc | |||
| driver.pyo | |||
| grammar.py | |||
| grammar.pyc | |||
| grammar.pyo | |||
| literals.py | |||
| literals.pyc | |||
| literals.pyo | |||
| parse.py | |||
| parse.pyc | |||
| parse.pyo | |||
| pgen.py | |||
| pgen.pyc | |||
| pgen.pyo | |||
| token.py | |||
| token.pyc | |||
| token.pyo | |||
| tokenize.py | |||
| tokenize.pyc | |||
| tokenize.pyo |