Yf @ s d Z d Z d d l Z d d l Z d d l m Z m Z m Z m Z m Z m
Z
d d l m Z d d l m
Z
e j j e j j e d Z Gd d
d
e Z d d Z Gd
d d e Z d e j d e j d e j d d i Z d d Z d d Z d d Z d S)zPattern compiler.
The grammar is taken from PatternGrammar.txt.
The compiler compiles a pattern to a pytree.*Pattern instance.
z#Guido van Rossum N )driverliteralstokentokenizeparsegrammar)pytree)pygramzPatternGrammar.txtc @ s e Z d Z d S)PatternSyntaxErrorN)__name__
__module__ __qualname__ r r 4/opt/alt/python35/lib64/python3.5/lib2to3/patcomp.pyr s r c c sn t j t j t j h } t j t j | j } x4 | D], } | \ } } } } } | | k r: | Vq: Wd S)z6Tokenizes a string suppressing significant whitespace.N) r NEWLINEINDENTDEDENTr generate_tokensioStringIOreadline) inputskiptokensZ quintupletypevaluestartendZ line_textr r r tokenize_wrapper! s
r c @ sX e Z d Z e d d Z d d d d Z d d Z d d d
Z d d Z d S)
PatternCompilerc C s^ t j | | _ t j | j | _ t j | _ t j | _ t j
| j d t | _ d S)z^Initializer.
Takes an optional alternative filename for the pattern grammar.
ZconvertN) r Z load_grammarr r
ZSymbolssymsZpython_grammarZ pygrammarZpython_symbolspysymsZDriverpattern_convert)selfZ grammar_filer r r __init__- s
zPatternCompiler.__init__Fc C s t | } y | j j | d | } Wn: t j k
rd } z t t | WYd d } ~ Xn X| r~ | j | | f S| j | Sd S)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 rooter r r compile_pattern8 s %z PatternCompiler.compile_patternc
s | j j j k r" | j d } | j j j k r f d d | j d d d D } t | d k rz | d St j d d | D d d d d } | j S| j j j k r f d
d | j D } t | d k r | d St j | g d d d d } | j S| j j j
k ri j | j d d } t j | } | j S| j j j
k st d } | j } t | d k r| d j t j k r| d j } | d d } d } t | d k r#| d j j j k r#| d } | d d } j | | } | d k r| j j j k s\t | j } | d }
|
j t j k rd } t j } n |
j t j k rd } t j } n |
j t j k r<| d j t j k st t | d k st j | d } } t | d k rH j | d } n d
sHt | d k s`| d k r| j } t j | g g d | d | } | d k r| | _ | j S)zXCompiles a node, recursively.
This is one big switch on the node type.
r c s g | ] } j | q Sr )r( ).0ch)r$ r r
P s z0PatternCompiler.compile_node..N r c S s g | ] } | g q Sr r )r, ar r r r. S s minmaxc s g | ] } j | q Sr )r( )r, r- )r$ r r r. W s Fr5 r5 r5 )r3 r4 )r r! ZMatcherchildrenZ Alternativeslenr WildcardPatternoptimizeZ AlternativeZ NegatedUnit
compile_basicZNegatedPatternZUnitAssertionErrorr EQUALr ZRepeaterSTARZHUGEPLUSLBRACERBRACEget_intname)
r$ nodeZaltspZunitspatternrB nodesrepeatr6 Zchildr1 r2 r )r$ r r( D sh
)(
(
+
! z PatternCompiler.compile_nodeNc C s t | d k s t | d } | j t j k rb t t j | j } t j
t | | S| j t j k rp| j } | j
r | t k r t d | | d d r t d t j
t | S| d k r d } n@ | j d s't | j | d } | d k r't d | | d d rW| j | d j d g } n d } t j | | Sns | j d k r| j | d S| j d k r| d k st | j | d } t j | g g d
d d d Sd st | d S)
Nr r zInvalid token: %rz Can't have details for tokenany_zInvalid symbol: %r([r1 r2 F)r7 r; r r STRINGr' r Z
evalStringr r Z LeafPattern_type_of_literalNAMEisupper TOKEN_MAPr
startswithgetattrr" r( r6 Z NodePatternr8 )r$ rF rG rC r r Zcontent
subpatternr r r r: s<
z PatternCompiler.compile_basicc C s% | j t j k s t t | j S)N)r r NUMBERr; intr )r$ rC r r r rA s zPatternCompiler.get_int) r r
r _PATTERN_GRAMMAR_FILEr% r+ r( r: rA r r r r r + s
G#r rN rL rT ZTOKENc C s9 | d j r t j S| t j k r1 t j | Sd Sd S)Nr )isalphar rN r Zopmap)r r r r rM s
rM c C sW | \ } } } } | s' | | j k r= t j | | d | St j | | d | Sd S)z9Converts raw node information to a Node or Leaf instance.contextN)Z
number2symbolr ZNodeZLeaf)r Z
raw_node_infor r rX 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 osZpgen2r r r r r r r r
pathjoindirname__file__rV Exceptionr r objectr rN rL rT rP rM r# r+ r r r r s$ .