/opt/alt/python39/lib64/python3.9/lib2to3/pgen2/__pycache__
NameSizeModeActions
conv.cpython-39.opt-1.pyc61470644editdlrm
conv.cpython-39.opt-2.pyc36650644editdlrm
conv.cpython-39.pyc70080644editdlrm
driver.cpython-39.opt-1.pyc51100644editdlrm
driver.cpython-39.opt-2.pyc41140644editdlrm
driver.cpython-39.pyc51420644editdlrm
grammar.cpython-39.opt-1.pyc57200644editdlrm
grammar.cpython-39.opt-2.pyc25690644editdlrm
grammar.cpython-39.pyc57200644editdlrm
literals.cpython-39.opt-1.pyc13770644editdlrm
literals.cpython-39.opt-2.pyc13000644editdlrm
literals.cpython-39.pyc15440644editdlrm
parse.cpython-39.opt-1.pyc64790644editdlrm
parse.cpython-39.opt-2.pyc32550644editdlrm
parse.cpython-39.pyc64930644editdlrm
pgen.cpython-39.opt-1.pyc93320644editdlrm
pgen.cpython-39.opt-2.pyc93320644editdlrm
pgen.cpython-39.pyc97350644editdlrm
token.cpython-39.opt-1.pyc19020644editdlrm
token.cpython-39.opt-2.pyc18520644editdlrm
token.cpython-39.pyc19020644editdlrm
tokenize.cpython-39.opt-1.pyc151370644editdlrm
tokenize.cpython-39.opt-2.pyc112430644editdlrm
tokenize.cpython-39.pyc151860644editdlrm
__init__.cpython-39.opt-1.pyc1800644editdlrm
__init__.cpython-39.opt-2.pyc1520644editdlrm
__init__.cpython-39.pyc1800644editdlrm
Edit: /opt/alt/python39/lib64/python3.9/lib2to3/pgen2/__pycache__/conv.cpython-39.pyc (7008B)
a XC?h%@s2dZddlZddlmZmZGdddejZdS)aConvert 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@s0eZdZdZddZddZddZdd Zd S) Convertera2Grammar 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 |||||dS)zJ||f|d}ttt |dddd\}}}}|j||ksJ||f|j||ksJ||f|dksJ||f||}|t |ksJ||f|dt|}}td|}|s J||fi}t|d}t|D]@\}}t|}t dD]$}|d|>@r_[] = { {, }, ... }; - followed by a state array, of the form: static state states_[] = { {, arcs__}, ... }; r NFrr z#include "pgenheaders.h" z#include "grammar.h" z static 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+)$)rrrnext startswithrrlistmaprrrangeappendlenstatesgrouprreval enumerateorddfaslabelsstart StopIteration)!rrrrrrZallarcsr-rnmkZarcs_ijststater2ZndfasrrxyzfirstZ rawbitsetcZbyter3Znlabelsr4r r r rTs             "          zConverter.parse_graminit_ccCsXi|_i|_t|jD]<\}\}}|tjkr@|dur@||j|<q|dur||j|<qdS)z1Create additional useful structures. (Internal).N)keywordstokensr0r3rNAME)rZilabeltypevaluer r r rs zConverter.finish_offN)__name__ __module__ __qualname____doc__r rrrr r r r r$s  &r)rLrZpgen2rrZGrammarrr r r r s