/opt/alt/python36/lib64/python3.6/lib2to3/pgen2/__pycache__
Edit: /opt/alt/python36/lib64/python3.6/lib2to3/pgen2/__pycache__/conv.cpython-36.opt-1.pyc (6161B)
3
k f% @ s2 d Z ddlZddlmZmZ G dd dejZdS )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)grammartokenc @ s0 e Zd ZdZdd 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.
c C s | j | | j| | j dS )z
@ rd||d | < qW qW ||f||< q4W |d t| }}|| _g } |d t| }}tjd|}t |jd} xjt | D ]^}|d t| }}tjd|}|j
\}}t |}|dkrd}nt|}| j ||f qpW |d t| }}| | _|d t| }}|d t| }}tjd|}t |jd}|d t| }}|d t| }}tjd|}t |jd} |d t| }}tjd|}t |jd} | | _|d t| }}y|d t| }}W n tk
r Y nX 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__[] = {
{, },
...
};
- followed by a state array, of the form:
static state states_[] = {
{, arcs__},
...
};
zCan't open %s: %sFNr r z static arc z)static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$z\s+{(\d+), (\d+)},$z'static state states_(\d+)\[(\d+)\] = {$z \s+{(\d+), arcs_(\d+)_(\d+)},$z static 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+")},$0z
\s+(\d+),$z\s+{(\d+), labels},$z \s+(\d+)$)r
r r next
startswithr r listmapr r rangeappendstatesgroupeval enumerateorddfaslabelsstart
StopIteration)!r r r r r r Zallarcsr) r nmkZarcs_ijststater. Zndfasr r xyzfirstZ rawbitsetcZbyter/ Znlabelsr0 r r r
r T s
"
zConverter.parse_graminit_cc C s\ i | _ i | _xJt| jD ]<\}\}}|tjkrB|dk rB|| j |< q|dkr|| j|< qW dS )z1Create additional useful structures. (Internal).N)keywordstokensr, r/ r NAME)r Zilabeltypevaluer r r
r s zConverter.finish_offN)__name__
__module__ __qualname____doc__r r r r r r r r
r $ s &r )rH r Zpgen2r r ZGrammarr r r r r
s