Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/parso/pgen2/__pycache__/generator.cpython-39.pyc
Ðазад
a e�h�8 � @ s� d Z ddlmZ ddlmZmZmZmZmZm Z ddl m Z m Z ed�Z G dd� dee �ZG dd � d �ZG d d � d ee �ZG d d � d �Zdd� Zdd� Zdd� Zdd� Zeed�dd�Zdd� Zdd � Zd d � Zd S ) a� This module defines the data structures used to represent a grammar. Specifying grammars in pgen is possible with this grammar:: grammar: (NEWLINE | rule)* ENDMARKER rule: NAME ':' rhs NEWLINE rhs: items ('|' items)* items: item+ item: '[' rhs ']' | atom ['+' | '*'] atom: '(' rhs ')' | NAME | STRING This grammar is self-referencing. This parser generator (pgen2) was created by Guido Rossum and used for lib2to3. Most of the code has been refactored to make it more Pythonic. Since this was a "copy" of the CPython Parser parser "pgen", there was some work needed to make it more readable. It should also be slightly faster than the original pgen2, because we made some optimizations. � )� literal_eval)�TypeVar�Generic�Mapping�Sequence�Set�Union)� GrammarParser�NFAState� _TokenTypeTc @ s6 e Zd ZdZeeeed f eedf d�dd�ZdS )�Grammara Once initialized, this class supplies the grammar tables for the parsing engine implemented by parse.py. The parsing engine accesses the instance variables directly. The only important part in this parsers are dfas and transitions between dfas. zDFAState[_TokenTypeT]�ReservedString)�start_nonterminal� rule_to_dfas�reserved_syntax_stringsc C s || _ || _|| _d S �N)�nonterminal_to_dfasr r )�selfr r r � r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/parso/pgen2/generator.py�__init__/ s zGrammar.__init__N)�__name__� __module__� __qualname__�__doc__�strr r r r r r r r % s �r c @ s0 e Zd ZdZg fded d�dd�Zdd� ZdS ) �DFAPlanzj Plans are used for the parser to create stack nodes and do the proper DFA state transitions. �DFAState��next_dfa� dfa_pushesc C s || _ || _d S r r )r r r r r r r = s zDFAPlan.__init__c C s d| j j| j| jf S )Nz %s(%s, %s))� __class__r r r �r r r r �__repr__A s zDFAPlan.__repr__N)r r r r r r r# r r r r r 8 s r c @ sF e Zd ZdZeee ed�dd�Zdd� Zdd� Z d d � Z d d � Z d S )r aa The DFAState object is the core class for pretty much anything. DFAState are the vertices of an ordered graph while arcs and transitions are the edges. Arcs are the initial edges, where most DFAStates are not connected and transitions are then calculated to connect the DFA state machines that have different nonterminals. )� from_rule�nfa_set�finalc C s^ t |t�sJ �t tt|��t�s$J �t |t�s2J �|| _|| _i | _i | _i | _ ||v | _ d S r ) � isinstance�set�next�iterr r$ r% �arcs�nonterminal_arcs� transitions�is_final)r r$ r% r& r r r r O s zDFAState.__init__c C s8 t |t�sJ �|| jvs J �t |t�s*J �|| j|< d S r )r' r r+ r )r �next_�labelr r r �add_arc` s zDFAState.add_arcc C s* | j �� D ]\}}||u r || j |< q d S r )r+ �items)r �old�newr0 r/ r r r � unifystatef s zDFAState.unifystatec C sd t |t�sJ �| j|jkr dS t| j�t|j�kr6dS | j�� D ] \}}||j�|�ur@ dS q@dS )NFT)r' r r. �lenr+ r2 �get)r �otherr0 r/ r r r �__eq__k s zDFAState.__eq__c C s d| j j| j| jf S )Nz<%s: %s is_final=%s>)r! r r$ r. r" r r r r# y s �zDFAState.__repr__N) r r r r r r r r r1 r5 r9 r# r r r r r E s r c @ s& e Zd ZdZed�dd�Zdd� ZdS )r z� Most grammars will have certain keywords and operators that are mentioned in the grammar as strings (e.g. "if") and not token types (e.g. NUMBER). This class basically is the former. ��valuec C s || _ d S r r: )r r; r r r r � s zReservedString.__init__c C s d| j j| jf S )Nz%s(%s))r! r r; r" r r r r# � s zReservedString.__repr__N)r r r r r r r# r r r r r s r c C sp d}|rld}t | �D ]T\}}t|d t| ��D ]8}| | }||kr.| |= | D ]}|�||� qLd} qq.qqdS )a This is not theoretically optimal, but works well enough. Algorithm: repeatedly look for two states that have the same set of arcs (same labels pointing to the same nodes) and unify them, until things stop changing. dfas is a list of DFAState instances TF� N)� enumerate�ranger6 r5 )�dfas�changes�iZstate_i�jZstate_j�stater r r �_simplify_dfas� s rD c s� t | t�sJ �t |t�s J �� fdd�� t� }� | |� t| j||�g}|D ]�}i }|jD ]6}|jD ]*}|jdurd|�|jt� �}� |j |� qdqZ|� � D ]D\} }|D ]} | j|kr� q�q�t| j||�} |� | � |� | | � q�qL|S )z� Uses the powerset construction algorithm to create DFA states from sets of NFA states. Also does state reduction if some states are not needed. c sJ t | t�sJ �| |v rd S |�| � | jD ]}|jd u r*� |j|� q*d S r )r' r �addr+ �nonterminal_or_stringr) )� nfa_state� base_nfa_set�nfa_arc�� addclosurer r rK � s z _make_dfas.<locals>.addclosureN) r' r r( r r$ r% r+ rF � setdefaultr) r2 �appendr1 ) �start�finishrH ZstatesrC r+ rG rI r% rF Z nested_stater rJ r � _make_dfas� s* rP c C s� t d| j� | g}t|�D ]�\}}t d|||u r4dp6d� |jD ]^}|j|j }}||v rf|�|�}nt|�}|�|� |d u r�t d| � q@t d||f � q@qd S )NzDump of NFA for� State�(final)� z -> %d� %s -> %d) �printr$ r= r+ rF r) �indexr6 rM ) rN rO �todorA rC �arcr0 r/ rB r r r � _dump_nfa� s rY c C sf t d| d j� t| �D ]H\}}t d||jr0dp2d� |j�� D ] \}}t d|| �|�f � q@qd S )NzDump of DFA forr rQ rR rS rT )rU r$ r= r. r+ r2 rV )r? rA rC � nonterminalr/ r r r � _dump_dfas� s r[ )� bnf_grammar�returnc C s� i }d}t | ��� D ]2\}}t||�}t|� |||j< |du r|j}qi }|�� D ]T\}}|D ]F} | j�� D ]6\} } | |v r�| | j| < qnt||| �} t | �| j | < qnq`qTt |� t |||�S )a ``bnf_text`` is a grammar in extended BNF (using * for repetition, + for at-least-once repetition, [] for optional parts, | for alternatives and () for grouping). It's not EBNF according to ISO/IEC 14977. It's a dialect Python uses in its own parser. N) r �parserP rD r$ r2 r+ r, �_make_transitionr r- �_calculate_tree_traversalr ) r\ �token_namespacer r Znfa_aZnfa_zr? Zreserved_stringsrZ � dfa_stateZterminal_or_nonterminalr � transitionr r r �generate_grammar� s, �rd c C s� |d � � rt| |�S |d dv s*J |��|�d�s>|�d�rBJ �t|�}z || W S tyz t|� }||< | Y S 0 dS )z� Creates a reserved string ("if", "for", "*", ...) or returns the token type (NUMBER, STRING, ...) for a given grammar terminal. r )�"�'z"""z'''N)�isalpha�getattr� startswithr �KeyErrorr )ra r r0 r; �rr r r r_ s r_ c C s� i }t | �� �}|�� |D ]}||vr t| ||� q | �� D ]�}|D ]�}|j}|j�� D ]�\}}|| �� D ]r\}} ||v r�|| } t| j r�| j d j n| j j | r�| d j n|j g�} t d|j |ft | � ��t|| �||< qnqZqFq>dS )z� By this point we know how dfas can move around within a stack node, but we don't know how we can add a new stack node (nonterminal transitions). r zZRule %s is ambiguous; given a %s token, we can't determine if we should evaluate %s or %s.N)�list�keys�sort�_calculate_first_plans�valuesr- r, r2 �sortedr r$ r � ValueError�tupler ) r � first_plansZ nonterminalsrZ r? rb r- r rc �pushesZ prev_plan�choicesr r r r` . s> �� � ���� r` c C s� | | }i }d||< |d }|j �� D ]\}}|jg||< q&|j�� D ]h\}}z || } W n tyx t| ||�} Y n0 | du r�td| ��| �� D ]\} } |g| || < q�qF|||< |S )z� Calculates the first plan in the first_plans dictionary for every given nonterminal. This is going to be used to know when to create stack nodes. Nr zleft recursion for rule %r)r- r2 r r, rj ro rr ) r rt rZ r? Znew_first_plansrC rc r/ Z nonterminal2Z first_plans2�tru r r r ro ` s" ro N)r �astr �typingr r r r r r Zparso.pgen2.grammar_parserr r r r r r r rD rP rY r[ r rd r_ r` ro r r r r �<module> s :2*2
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка