o
��bc� � @ s� d Z dZddlZddlmZmZmZmZmZm Z ddl
m Z ddl
m Z G dd � d e
�Zd
d � ZG d d
� d
e�Zejejejdd�Zdd� Zdd� Zdd� ZdS )z�Pattern compiler.
The grammar is taken from PatternGrammar.txt.
The compiler compiles a pattern to a pytree.*Pattern instance.
z#Guido van Rossum <[email protected]>� N� )�driver�literals�token�tokenize�parse�grammar)�pytree)�pygramc @ s e Zd ZdS )�PatternSyntaxErrorN)�__name__�
__module__� __qualname__� r r �&/usr/lib/python3.10/lib2to3/patcomp.pyr s r c c sN � t jt jt jh}t�t�| �j�}|D ]}|\}}}}}||vr$|V qdS )z6Tokenizes a string suppressing significant whitespace.N) r �NEWLINE�INDENT�DEDENTr �generate_tokens�io�StringIO�readline) �input�skip�tokens� quintuple�type�value�start�end� line_textr r r �tokenize_wrapper s ���r! c @ s: e Zd Zd
dd�Zddd�Zdd� Zd
d d
�Zd d � ZdS )�PatternCompilerNc C sZ |du r
t j| _t j| _n
t�|�| _t �| j�| _t j| _ t j
| _ tj | jt
d�| _dS )z^Initializer.
Takes an optional alternative filename for the pattern grammar.
N)�convert)r
�pattern_grammarr �pattern_symbols�symsr � load_grammar�Symbols�python_grammar� pygrammar�python_symbols�pysyms�Driver�pattern_convert)�self� grammar_filer r r �__init__( s
zPatternCompiler.__init__Fc
C sb t |�}z
| jj||d�}W n tjy" } ztt|��d�d}~ww |r,| �|�|fS | �|�S )z=Compiles a pattern string to a nested pytree.*Pattern object.)�debugN)r! r � parse_tokensr �
ParseErrorr �str� compile_node)r/ r r2 � with_treer �root�er r r �compile_pattern7 s ��
z PatternCompiler.compile_patternc
s� |j � jjkr |jd }|j � jjkr=� fdd�|jddd� D �}t|�dkr,|d S tjdd� |D �ddd�}|�� S |j � jj kre� fd d�|jD �}t|�dkrX|d S tj|gddd�}|�� S |j � jj
kr� � |jdd� �}t� |�}|�� S |j � jj
ks�J �d}|j}t|�d
kr�|d j tjkr�|d j}|dd� }d}t|�dkr�|d j � jjkr�|d }|dd � }� � ||�}|du�rA|j � jjks�J �|j} | d }
|
j tjkr�d} tj} nA|
j tjkr�d} tj} n5|
j tjk�r'| d j tjk�sJ �t| �d v �sJ �� �| d � } } t| �d
k�r&� �| d
�} nJ �| dk�s3| dk�rA|�� }tj|gg| | d�}|du�rI||_|�� S )zXCompiles a node, recursively.
This is one big switch on the node type.
r c � g | ]}� � |��qS r �r6 ��.0�ch�r/ r r �
<listcomp>O � z0PatternCompiler.compile_node.<locals>.<listcomp>N� r c S s g | ]}|g�qS r r )r> �ar r r rA R s ��min�maxc r; r r< r= r@ r r rA V rB � ���)rH � rJ )r r& �Matcher�children� Alternatives�lenr �WildcardPattern�optimize� Alternative� NegatedUnit�
compile_basic�NegatedPattern�Unitr �EQUALr �Repeater�STAR�HUGE�PLUS�LBRACE�RBRACE�get_int�name)
r/ �node�alts�p�units�patternr^ �nodes�repeatrL �childrF rG r r@ r r6 C sj
�
z PatternCompiler.compile_nodec C sZ t |�dksJ �|d }|jtjkr"tt�|j��}t� t
|�|�S |jtj kr�|j}|� � rJ|t
vr9td| ��|dd � rCtd��t� t
| �S |dkrQd }n|�d�sgt| j|d �}|d u rgtd| ��|dd � ry| �|d jd �g}nd }t�||�S |jdkr�| �|d �S |jd kr�|d u s�J �| �|d �}tj|ggddd
�S J |��) Nr r zInvalid token: %rz Can't have details for token�any�_zInvalid symbol: %r�(�[rE )rN r r �STRINGr5 r �
evalStringr r � LeafPattern�_type_of_literal�NAME�isupper� TOKEN_MAPr �
startswith�getattrr, r6 rL � NodePatternrO )r/ rd re r_ r r �content�
subpatternr r r rS � s<
z PatternCompiler.compile_basicc C s |j tjksJ �t|j�S �N)r r �NUMBER�intr )r/ r_ r r r r] � s
zPatternCompiler.get_intrw )FF)r r
r r1 r: r6 rS r] r r r r r" & s
G #r" )ro rk rx �TOKENc C s* | d � � r tjS | tjv rtj| S d S )Nr )�isalphar ro r �opmap)r r r r rn � s
rn c C s: |\}}}}|s
|| j v rtj|||d�S tj|||d�S )z9Converts raw node information to a Node or Leaf instance.)�context)�
number2symbolr �Node�Leaf)r �
raw_node_infor r r} rL r r r r. � s r. c C s t � �| �S rw )r" r: )rc r r r r: � s r: )�__doc__�
__author__r �pgen2r r r r r r � r r
� Exceptionr r! �objectr" ro rk rx rq rn r. r: r r r r �<module> s$
�