Your IP : 3.14.134.195
�
�� f�% c @ sE d Z d d l Z d d l m Z m Z Gd d � d e j � Z d S( u� 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( u grammaru tokenc B sJ | Ee Z d Z d Z d d � Z d d � Z d d � Z d d � Z d
S( u Converteru2 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( u< Load the grammar tables from the text files written by pgen.N( u parse_graminit_hu parse_graminit_cu
finish_off( u selfu
graminit_hu
graminit_c( ( u7 /opt/alt/python33/lib64/python3.3/lib2to3/pgen2/conv.pyu run/ s
u
Converter.runc C s y t | � } Wn= t k
rO } z t d | | f � d SWYd d } ~ Xn Xi | _ i | _ d } x� | D]� } | d 7} t j d | � } | r� | j � r� t d | | | j � f � qo | j � \ } } t
| � } | | j | <| | j | <qo Wd S( u� 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.
u Can't open %s: %sNi i u ^#define\s+(\w+)\s+(\d+)$u %s(%s): can't parse %sFT( u openu IOErroru printu Falseu
symbol2numberu
number2symbolu reu matchu stripu groupsu intu True( u selfu filenameu fu erru linenou lineu mou symbolu number( ( u7 /opt/alt/python33/lib64/python3.3/lib2to3/pgen2/conv.pyu parse_graminit_h5 s&
u Converter.parse_graminit_hc ! C s� y t | � } Wn= t k
rO } z t d | | f � d SWYd d } ~ Xn Xd } | d t | � } } | d t | � } } | d t | � } } i } g } x | j d � r�x| j d � r�t j d | � } t t t
| j � � � \ } }
} g } xq t | � D]c }
| d t | � } } t j d | � } t t t
| j � � � \ } } | j
| | f � qW| d t | � } } | | | |
f <| d t | � } } q� Wt j d | � } t t t
| j � � � \ } } g } x~ t | � D]p }
| d t | � } } t j d | � } t t t
| j � � � \ } } }
| | |
f } | j
| � qW| j
| � | d t | � } } | d t | � } } q� W| | _ i } t j d
| � } t
| j d � � } x@t | � D]2} | d t | � } } t j d | � } | j d � } t t t
| j d d
d d � � � \ } } } } | | } | d t | � } } 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 t | � } } | | _ g } | d t | � } } t j d | � } t
| j d � � } x� t | � D]� } | d t | � } } t j d | � } | j � \ } } t
| � } | d k rd } n t | � } | j
| | f � q�W| d t | � } } | | _ | d t | � } } | d t | � } } t j d | � } t
| j d � � } | d t | � } } | d t | � } } t j d | � } t
| j d � � } | d t | � } } t j d | � } t
| j d � � } | | _ | d t | � } } y | d t | � } } Wn t k
r|Yn Xd S( u� 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>},
...
};
u Can't open %s: %sNi i u static arc u) static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$u \s+{(\d+), (\d+)},$u' static state states_(\d+)\[(\d+)\] = {$u \s+{(\d+), arcs_(\d+)_(\d+)},$u static dfa dfas\[(\d+)\] = {$u0 \s+{(\d+), "(\w+)", (\d+), (\d+), states_(\d+),$i i i i u \s+("(?:\\\d\d\d)*")},$i u! static label labels\[(\d+)\] = {$u \s+{(\d+), (0|"\w+")},$u 0u
\s+(\d+),$u \s+{(\d+), labels},$u \s+(\d+)$F( u openu IOErroru printu Falseu nextu
startswithu reu matchu listu mapu intu groupsu rangeu appendu statesu groupu evalu enumerateu ordu dfasu Noneu labelsu startu
StopIteration(! u selfu filenameu fu erru linenou lineu allarcsu statesu mou nu mu ku arcsu _u iu ju su tu stateu dfasu ndfasu symbolu numberu xu yu zu firstu rawbitsetu cu byteu labelsu nlabelsu start( ( u7 /opt/alt/python33/lib64/python3.3/lib2to3/pgen2/conv.pyu parse_graminit_cT s� $!!$
3
u Converter.parse_graminit_cc 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( u1 Create additional useful structures. (Internal).N( u keywordsu tokensu enumerateu labelsu tokenu NAMEu None( u selfu ilabelu typeu value( ( u7 /opt/alt/python33/lib64/python3.3/lib2to3/pgen2/conv.pyu
finish_off� s " u Converter.finish_offN( u __name__u
__module__u __qualname__u __doc__u runu parse_graminit_hu parse_graminit_cu
finish_off( u
__locals__( ( u7 /opt/alt/python33/lib64/python3.3/lib2to3/pgen2/conv.pyu Converter$ s
�u Converter( u __doc__u reu pgen2u grammaru tokenu Grammaru Converter( ( ( u7 /opt/alt/python33/lib64/python3.3/lib2to3/pgen2/conv.pyu <module> s