3
\� � @ 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 <guido@python.org>� N� )�driver�literals�token�tokenize�parse�grammar)�pytree)�pygramc @ s e Zd ZdS )�PatternSyntaxErrorN)�__name__�
__module__� __qualname__� r r �'/usr/lib64/python3.6/lib2to3/patcomp.pyr s r c c sP t jt jt jh}tjtj| �j�}x(|D ] }|\}}}}}||kr(|V q(W dS )z6Tokenizes a string suppressing significant whitespace.N) r �NEWLINE�INDENT�DEDENTr �generate_tokens�io�StringIO�readline) �input�skip�tokensZ quintuple�type�value�start�endZ line_textr r r �tokenize_wrapper s
r c @ s: e Zd Zd
dd�Zddd�Zdd� Zdd d
�Zd d � ZdS )�PatternCompilerNc C sZ |dkrt j| _t j| _ntj|�| _t j| j�| _t j| _ t j
| _ tj | jt
d�| _dS )z^Initializer.
Takes an optional alternative filename for the pattern grammar.
N)Zconvert)r
Zpattern_grammarr Zpattern_symbols�symsr Z load_grammarZSymbolsZpython_grammarZ pygrammarZpython_symbols�pysymsZDriver�pattern_convert)�selfZ grammar_filer r r �__init__( s
zPatternCompiler.__init__Fc C sn t |�}y| jj||d�}W n0 tjk
rL } ztt|���W Y dd}~X nX |r`| j|�|fS | j|�S dS )z=Compiles a pattern string to a nested pytree.*Pattern object.)�debugN)r r Z parse_tokensr Z
ParseErrorr �str� compile_node)r$ r r& Z with_treer �root�er r r �compile_pattern7 s z PatternCompiler.compile_patternc
s� |j � jjkr|jd }|j � jjkrz� fdd�|jddd� D �}t|�dkrX|d S tjdd� |D �ddd�}|j� S |j � jj krʇ fd d�|jD �}t|�dkr�|d S tj|gddd�}|j� S |j � jj
kr�� j |jdd� �}tj |�}|j� S |j � jj
k�st�d}|j}t|�d
k�rR|d j tjk�rR|d j}|dd� }d}t|�dk�r�|d
j � jjk�r�|d }|dd� }� j ||�}|dk �r�|j � jjk�s�t�|j} | d }
|
j tjk�r�d} tj} n�|
j tjk�r�d} tj} np|
j tjk�r^| d j tjk�s t�t| �dk�s.t�� j| d � } } t| �d k�rh� j| d
�} n
d �sht�| dk�s|| dk�r�|j� }tj|gg| | d�}|dk �r�||_|j� S )zXCompiles a node, recursively.
This is one big switch on the node type.
r c s g | ]}� j |��qS r )r( )�.0�ch)r$ r r �
<listcomp>O s z0PatternCompiler.compile_node.<locals>.<listcomp>N� r c S s g | ]
}|g�qS r r )r, �ar r r r. R s )�min�maxc s g | ]}� j |��qS r )r( )r, r- )r$ r r r. V s � � F���r5 r5 r5 )r3 r4 )r r! ZMatcher�childrenZ Alternatives�lenr �WildcardPattern�optimizeZ AlternativeZ NegatedUnit�
compile_basicZNegatedPatternZUnit�AssertionErrorr �EQUALr ZRepeater�STARZHUGE�PLUS�LBRACE�RBRACE�get_int�name)
r$ �nodeZalts�pZunits�patternrB �nodes�repeatr6 Zchildr1 r2 r )r$ r r( C sh
"
z PatternCompiler.compile_nodec C sn t |�dkst�|d }|jtjkrDttj|j��}t j
t |�|�S |jtj k�r|j}|j
� r�|tkrttd| ��|dd � r�td��t j
t| �S |dkr�d }n,|jd�s�t| j|d �}|d kr�td| ��|dd � r�| j|d jd �g}nd }t j||�S nV|jdk�r | j|d �S |jd k�r\|d k�s:t�| j|d �}t j|ggddd
�S d �sjt|��d S ) Nr r zInvalid token: %rz Can't have details for token�any�_zInvalid symbol: %r�(�[)r1 r2 F)r7 r; r r �STRINGr' r Z
evalStringr r Z LeafPattern�_type_of_literal�NAME�isupper� TOKEN_MAPr �
startswith�getattrr" r( r6 Z NodePatternr8 )r$ rF rG rC r r Zcontent�
subpatternr r r r: � s<
z PatternCompiler.compile_basicc C s |j tjkst�t|j�S )N)r r �NUMBERr; �intr )r$ rC r r r rA � s zPatternCompiler.get_int)N)FF)N)r r
r r% r+ r( r: rA r r r r r & s
G
#r )rN rL rT ZTOKENc C s. | d j � rtjS | tjkr&tj| S d S d S )Nr )�isalphar rN r Zopmap)r r r r rM � s
rM c C s> |\}}}}|s|| j kr*tj|||d�S tj|||d�S dS )z9Converts raw node information to a Node or Leaf instance.)�contextN)Z
number2symbolr ZNodeZLeaf)r Z
raw_node_infor r rW r6 r r r r# � s r# c C s t � j| �S )N)r r+ )rE r r r r+ � s r+ )�__doc__�
__author__r Zpgen2r r r r r r � r r
� Exceptionr r �objectr rN rL rT rP rM r# r+ r r r r �<module> s