œ_#ÁÕ§TE NAŒ“KeÉ:”(åŽÖJÞùY’‚ñùž7; «]Û ý`8g“¯B© jd ÖÖ¸ðzœ¸¦4Ç3Kó^(ÍÖ¼ Õ€pvìwšõB4d f$Èü^0˜…åÌC$#2FŽÑ§±¦ÛZ/÷š&m£ñzÒÖ ’.Î]!Î;ƒ(Õ–¢d/—#Kª+tZyuÏB>NÛÖ†(¸ŒSà'³„Y˜´-_•¦¼´˜OlNK§¶ÒàŠˆTHµƒeTPå·fïM’…þuÏÍüp6دªE£åü‡ZØ'CKF#â«;‹eyO Qp„†l"ö1èíÙP ÏŒúl! BÝ2ñª•_VÁÉ÷3eu`–F¸ìI--ö<¿žë¯4õ캿¢)34Å{wMÉ2ÆÖFŸ¥` e9Ú¶¸P‡.”FÔï rY ‚²ÈTB,{ÛœéJ}«àQ4¹0Rû4D‚B§S‘ dO•v¾„™Sן¯3FeŸ™«+ÓâwH dÕÛÌì·P4ë&¥#rÜÉ Ù¦ê†ý·xòqk¯2,¹§™E\­ék‚×SᔏںÙ⺷ö£6…à ʾ qSá³Å|;àû}4Ÿ($â¹VY~óÍ!èÜÒŒËX½Ù1j‚VíÍŸš³+œ]«½g{_{/vµ½\¢¶vÉWKÿ:ñám½ ¥ S²x‘t ŽšÝÙÿÀÇ^ný PK   IW™k‚½÷ á  _rels/.relsUT dìd dìd dìd­’ÏNÃ0 ‡ï{ŠÈ÷ÕÝ@¡¥» ¤Ý*`%îÑ&QâÁöö‚J£ì°cœŸ¿|¶²ÙÆA½rL½wVE Šñ¶w­†çúay * 9Kƒw¬áÈ ¶ÕbóÄIîI]’Ê—4t"á1™ŽGJ…ìòMããH’±Å@æ…ZÆuYÞ`üÍ€jÂT;«!îì T} |Û7MoøÞ›ýÈNN<|v–í2ÄÜ¥ÏèšbË¢Ázó˜Ë )„"£O­Ï7ú{ZYÈ’yÞç#1'tuÉM?6o>Z´_å9›ëKÚ˜}?þ³žÏÌ·N>fµx PK    IWª½e  ¢ U  € word/document.xmlUT dìdPK    IWþË3” z  €J¢ word/settings.xmlUT dìdPK    IWC‡{š' ƒ  €¤ docProps/custom.xmlUT dìdPK    IW츱=Œ   €‡¥ [Content_Types].xmlUT dìdPK    IWV%ë±"   €U§ docProps/app.xmlUT dìdPK    IW€RŒ 3  €¶¨ docProps/core.xmlUT dìdPK    IWkòDn ô  €ª word/_rels/document.xml.relsUT dìdPK    IW ;$î   €Î« word/fontTable.xmlUT dìdPK    IW+åäz] ÷.  €ý¬ word/numbering.xmlUT dìdPK    IW¤2×r- ¿  €›° word/styles.xmlUT dìdPK    IWMFÒ ø  €´ word/header1.xmlUT dìdPK    IWF— T e  €· word/media/image1.jpegUT dìdPK    IW!Yéáå   €°Ë word/media/image2.pngUT dìdPK    IW°Àºë ú  €ÙÌ word/media/image3.pngUT dìdPK    IW$“†ª L  €Î word/footer1.xmlUT dìdPK    IWzaGôM   €ñÑ word/footer2.xmlUT dìdPK    IW–µ­âº P  €}Õ word/theme/theme1.xmlUT dìdPK    IW™k‚½÷ á €{Û _rels/.relsUT PK   ! bîh^   [Content_Types].xml ¢(   ¬”ËNÃ0E÷HüCä-Jܲ@5í‚Ç*Q>Àēƪc[žiiÿž‰ûB¡j7±ÏÜ{2ñÍh²nm¶‚ˆÆ»R ‹ÈÀU^7/ÅÇì%¿’rZYï @1__f› ˜q·ÃR4DáAJ¬h>€ãÚÇV߯¹ ªZ¨9ÈÛÁàNVÞ8Ê©ÓãÑÔji){^óã-I‹"{Üv^¥P!XS)bR¹rú—K¾s(¸3Õ`cÞ0†½ÝÎß»¾7M4²©ŠôªZƐk+¿|\|z¿(Ž‹ôPúº6h_-[ž@!‚ÒØ Pk‹´­2nÏ}Ä?£LËð Ýû%áÄßdºždN"m,à¥ÇžDO97*‚~§Èɸ8ÀOíc|n¦Ñ äEøÿöéºóÀBÉÀ!$}‡íàÈé;{ìÐå[ƒîñ–é2þ ÿÿ PK   ! µU0#ô L _rels/.rels ¢(   ¬’MOÃ0 †ïHü‡È÷ÕݐBKwAH»!T~€Iܵ£$Ý¿'TƒG½~üÊÛÝ<êÈ!öâ4¬‹;#¶w­†—úqu *&r–Fq¬áÄvÕõÕö™GJy(v½*«¸¨¡KÉß#FÓñD±Ï.W ¥†=™ZÆMYÞbø®ÕBSí­†°·7 ê“Ï›×–¦é ?ˆ9LìÒ™ÈsbgÙ®|Èl!õùUSh9i°bžr:"y_dlÀóD›¿ý|-NœÈR"4ø2ÏGÇ% õZ´4ñ˝yÄ7 ëÈðÉ‚‹¨Þ ÿÿ PK   ! Q48wÛ —  xl/workbook.xml¤UÙnâ0}iþ!cñ‡ *–¢AšVU×$dC¬&vÆv UÕŸë@XÊK§/¹p|Žï¹N÷b“¥Ö •Š ÞC¸î"‹òHÄŒ¯zèá~b·‘¥4á1I§=ôJºèÿüÑ] ù¼âÙ ®z(Ñ:GE ͈ª‹œrˆ,…̈†©\9*—”Ä*¡Tg©ã¹nàd„q´Eåg0ÄrÉ":Q‘Q®· ’¦D}•°\UhYô¸ŒÈç"·#‘å ±`)Ó¯%(²²(œ®¸d‘‚ì nZ w v¡ñª• t¶TÆ")”Xê:@;[Ògú±ë`|²›ó=ø’ïHúÂL÷¬dðEVÁ+8€a÷Ûh¬Uz%„Íû"ZsÏÍCýî’¥ôqk]‹äù5ÉL¦Rd¥Dé˘i÷P ¦bM/|dÉ",…¨çãFNoçiûéë>aêiçsó#ðÄ ÕTr¢éHp ÜIú®ÝJìQ"ÀÜÖ-ý[0I¡¦ÀZ Z…d¡nˆN¬B¦=4 g %PDF-1.4 %âãÏÓ 3 0 obj << /Linearized 1 /L 422775 ÿØÿà JFIF    ÿÛ C      ÿÛ C   ÿÀ  X" ÿÄ    ÿÄ H   !1A"Qaq2‘¡#±ÁBRÑ3Cbrá$S‚¢²ð4ñ%6DTc’ÂsÿÄ   ÿÄ =  !1AQ"aq‘Á2R¡±BÑð#3br’²4á$‚¢ÂñÿÚ   ? áHBßÝ`„! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! !@B„ „! ! stream

___________________________ < root@rinduuu:~# /home/rinduuuuuuu?! > ___________________________

Command :

ikan Uploader :
Directory :  /lib64/python3.12/lib2to3/pgen2/__pycache__/
Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 
Current File : //lib64/python3.12/lib2to3/pgen2/__pycache__/conv.cpython-312.opt-1.pyc
�

�?h�%��J�dZddlZddlmZmZGd�dej
�Zy)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�(�eZdZdZd�Zd�Zd�Zd�Zy)�	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.

    c�h�|j|�|j|�|j�y)z<Load the grammar tables from the text files written by pgen.N)�parse_graminit_h�parse_graminit_c�
finish_off)�self�
graminit_h�
graminit_cs   �+/usr/lib64/python3.12/lib2to3/pgen2/conv.py�runz
Converter.run/s(�����j�)����j�)�����c	��	t|�}i|_i|_d}|D]�}|dz
}tjd|�}|s2|j�r"t|�d|�d	|j�����R|j�\}}t|�}||j|<||j|<��y
#t$r}td|�d|���Yd}~yd}~wwxYw)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.

        �Can't open �: NFr�z^#define\s+(\w+)\s+(\d+)$�(z): can't parse T)
�open�OSError�print�
symbol2number�
number2symbol�re�match�strip�groups�int)	r�filename�f�err�lineno�line�mo�symbol�numbers	         rrzConverter.parse_graminit_h5s���	��X��A� ���������D��a�K�F����6��=�B��$�*�*�,��(�F�26�*�*�,�@�A�"$��������V���.4��"�"�6�*�-3��"�"�6�*����'�	���3�7�8���	�s�B0�0	C�9C�Cc�z�	t|�}d}|dzt|�}}|dzt|�}}|dzt|�}}i}g}|j	d��r�|j	d�r�tjd|�}ttt|j���\}	}
}g}t|�D]e}
|dzt|�}}tjd	|�}ttt|j���\}}|j||f��g|dzt|�}}|||	|
f<|dzt|�}}|j	d�r��tjd
|�}ttt|j���\}}g}t|�D]k}
|dzt|�}}tjd|�}ttt|j���\}}	}
||	|
f}|j|��m|j|�|dzt|�}}|dzt|�}}|j	d�r���||_
i}tjd|�}t|jd��}t|�D]�}|dzt|�}}tjd
|�}|jd�}ttt|jdddd���\}}}}||}|dzt|�}}tjd|�}i}t|jd��}t!|�D]4\}}t#|�}td�D]}|d|zzs�d||dz|z<��6||f||<��|dzt|�}}||_g}|dzt|�}}tjd|�}t|jd��}t|�D]l}|dzt|�}}tjd|�}|j�\}}t|�}|dk(rd}nt|�}|j||f��n|dzt|�}}||_|dzt|�}}|dzt|�}}tjd|�}t|jd��}|dzt|�}}|dzt|�}}tjd|�}t|jd��}|dzt|�}}tjd|�}t|jd��} | |_|dzt|�}}	|dzt|�}}y#t$r}td|�d|���Yd}~yd}~wwxYw#t*$rYywxYw)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>},
                  ...
          };

        rrNFrrzstatic arc z)static arc arcs_(\d+)_(\d+)\[(\d+)\] = {$z\s+{(\d+), (\d+)},$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+")},$�0z
\s+(\d+),$z\s+{(\d+), labels},$z	\s+(\d+)$)rrr�next�
startswithrr�list�maprr�range�append�states�group�eval�	enumerate�ord�dfas�labels�start�
StopIteration)!rr r!r"r#r$�allarcsr5r%�n�m�k�arcs�_�i�j�s�t�stater:�ndfasr&r'�x�y�z�first�	rawbitset�c�byter;�nlabelsr<s!                                 rr	zConverter.parse_graminit_cTsP��8	��X��A�
���a�x��a�����a�x��a�����a�x��a���������o�o�m�,��/�/�-�0��X�X�J�"�$���s�3��	�	��4�5���1�a����q��A�#)�!�8�T�!�W�D�F����"8�$�?�B���C����� 5�6�D�A�q��K�K��A��'�"� &�a�x��a����"&���A���%�a�x��a�����/�/�-�0� ���D�d�K�B���C�����-�.�D�A�q��E��1�X��%�a�x��a�����X�X�?��F���s�3��	�	��4�5���1�a��q�!�t�}�����T�"��
�M�M�%� �!�!�8�T�!�W�D�F�!�!�8�T�!�W�D�F�C�o�o�m�,�D�����
�X�X�6��
=���B�H�H�Q�K� ���u��A�!�!�8�T�!�W�D�F����M�� �B��X�X�a�[�F�"�3�s�B�H�H�Q��1�a�,@�#A�B�O�F�A�q�!��1�I�E�!�!�8�T�!�W�D�F����4�d�;�B��E��R�X�X�a�[�)�I�!�)�,���1��1�v���q��A��q�!�t�}�)*��a��c�A�g��"�-�
"�5�>�D��L�-�.�a�x��a������	����a�x��a����
�X�X�:�D�
A���b�h�h�q�k�"���w��A�!�!�8�T�!�W�D�F����4�d�;�B��9�9�;�D�A�q��A��A��C�x�����G���M�M�1�a�&�!� ��a�x��a��������a�x��a�����a�x��a����
�X�X�m�T�
*���B�H�H�Q�K� ���a�x��a�����a�x��a����
�X�X�-�t�
4���b�h�h�q�k�"���a�x��a����
�X�X�l�D�
)���B�H�H�Q�K� ����
��a�x��a����	%�!�!�8�T�!�W�D�F��C�	���3�7�8���	��D�	��	�s)�V�6V.�	V+�V&�&V+�.	V:�9V:c���i|_i|_t|j�D]?\}\}}|tj
k(r|�||j|<�.|��1||j|<�Ay)z1Create additional useful structures.  (Internal).N)�keywords�tokensr8r;r�NAME)r�ilabel�type�values    rr
zConverter.finish_off�s^����
����%.�t�{�{�%;�!�F�M�T�5��u�z�z�!�e�&7�'-��
�
�e�$���$*����D�!�	&<rN)�__name__�
__module__�__qualname__�__doc__rrr	r
�rrrr$s�����>c%�J+rr)r\r�pgen2rr�Grammarrr]rr�<module>r`s&���4
�!�]+����]+r

........