|
Server : Apache/2.2.17 (Unix) mod_ssl/2.2.17 OpenSSL/0.9.8e-fips-rhel5 DAV/2 PHP/5.2.17 System : Linux localhost 2.6.18-419.el5 #1 SMP Fri Feb 24 22:47:42 UTC 2017 x86_64 User : nobody ( 99) PHP Version : 5.2.17 Disable Function : NONE Directory : /usr/lib64/python2.4/compiler/ |
Upload File : |
m
=5Dc ( @ sB d Z d k Td k Z d k Z d k Z d k Z d e f d YZ d k l Z l
Z
d k l Z l Z l
Z
d Z d d Z d
Z d Z d Z d
f d YZ e i e i e i e i e i e i e i e i e i e i e i e i e i e i! e i" g Z# h e i$ d <e i% d <e i& d <e i' d <e i( d <e i) d <e i* d <Z+ e i, e i- e i. e i/ e i0 e i1 e i2 e i e i3 e i4 e i5 e i6 e i7 e i8 e i9 e i: e i; e i< e i= e i> e i? e i@ e iA e iB e i e i e i e i e i e i e iC e i e i e i e i e i e i e i! e i" e iD g( ZE eF e d o eE iG e iH n e i e i e i e i e i e i e i e i e i e i e i! g ZI d kJ ZJ h ZK x' e iL iM D] \ ZN ZO eO eK eN <qWx' e iP iM D] \ ZN ZO eO eK eN <qWd ZQ d S( s Parse tree transformation module.
Transforms Python source code into an abstract syntax tree (AST)
defined in the ast module.
The simplest ways to invoke this module are via parse and parseFile.
parse(buf) -> AST
parseFile(path) -> AST
( t *Nt WalkerErrorc B s t Z RS( N( t __name__t
__module__( ( ( t, /usr/lib64/python2.4/compiler/transformer.pyR " s ( s
CO_VARARGSs CO_VARKEYWORDS( s OP_ASSIGNs OP_DELETEs OP_APPLYc C s3 t | d } | i d } | i t | S( Nt Us
( t opent patht ft readt srct closet parse( R R
R ( ( R t parseFile( s
t execc C s_ | d j p
| d j o t i | Sn. | d j o t i | Sn
t d d S( NR t singlet evals4 compile() arg 3 must be 'exec' or 'eval' or 'single'( t modet Transformert
parsesuitet buft parseexprt
ValueError( R R ( ( R R 2 s
c C s g } x | D] } t | d o | i | i q
t | t d j o | i t t | q
t | t g j o | i t | q
| i | q
W| S( Nt asList( NN( t lt nodest itemt hasattrt appendR t typet Nonet tuple( R R R ( ( R R ; s c C sn t | d t p | d Sn xG | d D]; } t | t o% t | } | d j o | Sqf q+ q+ Wd S( Ni i ( t
isinstancet astR t childt
extractLineNot linenoR ( R! R$ R" ( ( R R# I s
c G s{ | d } t i | oJ y t | | d SWqw t j
o! t | Gt | G| GH qw Xn t d t | d S( Ni i s$ Can't find appropriate Node type: %s( t argst kindR t has_keyt TypeErrort lenR t str( R% R& ( ( R t NodeS s
R c B sA t Z d Z d Z d Z d Z d Z d Z d Z d Z d Z
d Z d
Z d Z
d Z d
Z d Z d Z d Z e Z e Z e Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z! d Z" d Z# d Z$ d Z% d! Z& d" Z' d# Z( d$ Z) d% Z* d& Z+ d' Z, d( Z- d) Z. d* Z/ d+ Z0 d, Z1 d- Z2 d. Z3 d/ Z4 e4 Z5 e4 Z6 e4 Z7 d0 Z8 d1 Z9 d2 Z: d3 Z; d4 Z< d5 Z= d6 Z> d7 Z? d8 Z@ d9 ZA d: ZB d; ZC d< ZD d= ZE d> ZF d? ZG d@ ZH dA ZI dB ZJ dC ZK dD ZL dE ZM dF ZN h ZO dG ZP dH ZQ dI ZR dJ ZS dK ZT dL ZU dM ZV dN ZW dO ZX dP ZY dQ ZZ dR Z[ dS Z\ dT Z] dU Z^ dV Z_ dW Z` dX Za dY Zb dZ Zc d[ Zd d\ Ze d] Zf d^ Zg eh ei d_ o d` Zj da Zk db Zl n
dc Zj eh ei dd o de Zm df Zn n dg Zo dh Zp di Zq dj Zr dk Zs dl Zt dm Zu dn Zv do Zw ex dp Zy RS(q s Utility object for transforming Python parse trees.
Exposes the following methods:
tree = transform(ast_tree)
tree = parsesuite(text)
tree = parseexpr(text)
tree = parsefile(fileob | filename)
c C s h | _ xG t i i D]6 \ } } t | | o t | | | i | <q q W| i | i t
i <h t
i | i
<t
i | i <t
i | i <t
i | i <t
i | i <t
i | i <t
i | i <| _ d | _ d S( N( t selft _dispatcht symbolt sym_namet itemst valuet nameR t getattrt com_NEWLINEt tokent NEWLINEt LPARt atom_lpart LSQBt atom_lsqbt LBRACEt atom_lbracet BACKQUOTEt atom_backquotet NUMBERt atom_numbert STRINGt atom_stringt NAMEt atom_namet _atom_dispatchR t encoding( R, R2 R1 ( ( R t __init__i s rc C sF t | t p
t | t p t i | d d } n | i | S( s, Transform an AST into a modified parse tree.t line_infoi N( R t treeR t listt parsert ast2tupleR, t compile_node( R, RI ( ( R t transformy s c C s | i t i | S( s6 Return a modified parse tree for the given suite text.N( R, RN RK t suitet text( R, RP ( ( R R s c C s | i t i | S( s; Return a modified parse tree for the given expression text.N( R, RN RK t exprRP ( R, RP ( ( R R s c C s< t | t d j o t | } n | i | i S( s@ Return a modified parse tree for the contents of the given file.t N( R t fileR R, R R ( R, RS ( ( R t parsefile s c C s0 | d } | t i j o% | d | _ | d } | d } n | t i j o | i | d Sn | t i j o | i | d Sn | t i j o | i | d Sn | t i j o | i | d Sn | t i
j o | i
| d Sn | t i j o | i | d Sn t d | f d S( Ni i i s unexpected node type(
t nodet nR. t
encoding_declR, RF t single_inputt
file_inputt
eval_inputt lambdeft funcdeft classdefR ( R, RU RV ( ( R RM s$
c C s: | d d } | t i j o | i | d Sn t S( Ni ( RU RV R5 R6 R, t com_stmtt Pass( R, RU RV ( ( R RX s c C s | i | t i } | d j o
d } n d } g } xN | | D]B } | d t
i j o( | d t
i j o | i
| | qC qC Wt | t | S( Ni i ( R, t
get_docstringt nodelistR. RY t docR t it stmtsRU R5 t ENDMARKERR6 t com_append_stmtt Modulet Stmt( R, Ra RU Rc Rb Rd ( ( R RY s
(c C s t | i | d S( Ni ( t
ExpressionR, t com_nodeRa ( R, Ra ( ( R RZ s c C s t | } | d j o | d d j p t | i | } d } xy | | j ok | | d t i j p t | | d d t i
j p t t | | | d d } | d 7} qI W| S( Ni i i ( R) Ra t listlent AssertionErrorR, RD R Rc R5 t DOTRC t Getattr( R, Ra Rk Rc R ( ( R t decorator_name s %
#c C s t | d j p t | d d t i j p t | d d t i j p t | d d t i j p t | i | d d } t | d j o9 | d d t i j p t | i | | d } n | } | S( Ni i i i ii i ( i i i ( R) Ra Rl R5 t ATR6 R. t dotted_nameR, Ro t funcnameR7 t com_call_functionRQ ( R, Ra RQ Rr ( ( R t decorator s c C sV g } xC | D]; } | d t i j p t | i | i | d q
Wt | S( Ni i ( R0 Ra t dec_nodelistR. Rt Rl R R, t
Decorators( R, Ra R0 Ru ( ( R t
decorators s c
C ss t | d j o: | d d t i j p t | i | d d } n! t | d j p t d } | d d } | d d } | d d } | d t i
j o | i | d \ }
} } n f }
} d } | i | d } | i | d } | d j oC t | t p t t | i d t p t | i d =n t | | |
| | | | d | S(
Ni i i i ii iiR$ ( R) Ra R. Rw Rl R, R R$ R2 R% t varargslistt com_arglistt namest defaultst flagsR` Rb Rj t codeR Rh R t Discardt Function( R, Ra R} R2 Rb R% R| R$ R{ Rw Rz ( ( R R\ s(
c C s | d d t i j o$ | i | d d \ } } } n f } } d } | i | d } t
| | | | d | d d S( Ni i i iR$ ( Ra R. Rx R, Ry Rz R{ R| Rj R} t Lambda( R, Ra R} R| Rz R{ ( ( R R[
s $
c C s | d d } | i | d } | d d t i j o
g } n | i | d } | i | d } | d j oC t | t
p t t | i d t p t | i d =n t | | | | d | d d S( Ni ii i i R$ ( Ra R2 R, R` Rb R5 t COLONt basest com_basesRj R} R R Rh Rl R R~ t Class( R, Ra R} R2 Rb R ( ( R R] s
c C s | i | d S( Ni ( R, R^ Ra ( R, Ra ( ( R t stmt. s c C sG g } x4 t d t | d D] } | i | | | q Wt | S( Ni i ( Rd t rangeR) Ra Rc R, Rf Rh ( R, Ra Rd Rc ( ( R t simple_stmt5 s
c C s
t d S( N( R ( R, Ra ( ( R t
parameters< s c C s
t d S( N( R ( R, Ra ( ( R Rx ? s c C s
t d S( N( R ( R, Ra ( ( R t fpdefB s c C s
t d S( N( R ( R, Ra ( ( R t fplistE s c C s
t d S( N( R ( R, Ra ( ( R Rq H s c C s
t d S( N( R ( R, Ra ( ( R t comp_opK s c C s
t d S( N( R ( R, Ra ( ( R t trailerN s c C s
t d S( N( R ( R, Ra ( ( R t sliceopQ s c C s
t d S( N( R ( R, Ra ( ( R t argumentT s c C s | d } | i | | d } t | d j o t | d | i Sn | d d t i j oi g } xA t d t | d d D]# } | i
| i | | t q Wt | | d | d d SnE | i | d } | i | d } t | | d | d | d St d d S( Nii R$ i i s can't get here( Ra t enR, t lookup_nodet exprNodeR) R~ R$ R5 t EQUALt nodeslR Rc R t
com_assignt OP_ASSIGNt Assignt
com_augassignt lvalt com_augassign_opt opt AugAssignR ( R, Ra R R Rc R R R ( ( R t expr_stmt\ s
! c C s+ g } t | d j o d } d } nt | d d t i j oO t | d j p | d d t i j p t | i | d } d } n
d } d } x: t | t | d D] } | i | i | | q W| d d t i j o t | | d | d d Sn t | | d | d d S( Ni i i i i iR$ ( R0 R) Ra t startR t destR5 t
RIGHTSHIFTt COMMARl R, Rj R Rc R t Printt Printnl( R, Ra Rc R R0 R ( ( R t
print_stmtm s
2
c C s | i | d t S( Ni ( R, R Ra t OP_DELETE( R, Ra ( ( R t del_stmt s c C s t d | d d S( NR$ i i ( R_ Ra ( R, Ra ( ( R t pass_stmt s c C s t d | d d S( NR$ i i ( t BreakRa ( R, Ra ( ( R t
break_stmt s c C s t d | d d S( NR$ i i ( t ContinueRa ( R, Ra ( ( R t
continue_stmt s c C sZ t | d j o" t t d d | d d Sn t | i | d d | d d S( Ni R$ i i ( R) Ra t Returnt ConstR R, Rj ( R, Ra ( ( R t return_stmt s "c C s% t | i | d d | d d S( Ni R$ i i ( t YieldR, Rj Ra ( R, Ra ( ( R t
yield_stmt s c C s t | d j o | i | d } n d } t | d j o | i | d } n d } t | d j o | i | d } n d } t | | | d | d d S( Ni i i R$ i i ( R) Ra R, Rj t expr3R t expr2t expr1t Raise( R, Ra R R R ( ( R t
raise_stmt s c C s+ t | d j p t | i | d S( Ni i ( R) Ra Rl R, Rj ( R, Ra ( ( R t import_stmt s c C s% t | i | d d | d d S( Ni R$ i i ( t ImportR, t com_dotted_as_namesRa ( R, Ra ( ( R t import_name s c C s | d d d j p t | d d t i j p t | d d d j p t | i | d } | d d t i j o" t | d g d | d d SnD | d | d d t i j } t | | i
| d | d d Sd S(
Ni i t fromi t importi R R$ ( R N( Ra Rl R. Rq R, t com_dotted_namet fromnameR5 t STARt FromR R7 RU t com_import_as_names( R, Ra RU R ( ( R t import_from s c C sV g } x5 t d t | d D] } | i | | d q Wt | d | d d S( Ni i R$ i ( Rz R R) Ra Rc R t Global( R, Ra Rc Rz ( ( R t global_stmt s
c C s | i | d } t | d j oG | i | d } t | d j o | i | d } qw d } n d } } t | | | d | d d S( Ni i i i i R$ i i ( R, Rj Ra R R) R R R t Exec( R, Ra R R R ( ( R t exec_stmt s
c C s^ | i | d } t | d j o | i | d } n d } t | | d | d d S( Ni i i R$ i i ( R, Rj Ra R R) R R t Assert( R, Ra R R ( ( R t assert_stmt s
c C s g } xe t d t | d d D]G } | i | | d } | i | | d } | i | | f q# Wt | d d j o | i | d } n d } t | | d | d d S( Ni i i i iR$ i (
t testsR R) Ra Rc R, Rj t testNodet suiteNodeR t elseNodeR t If( R, Ra R Rc R R R ( ( R t if_stmt s c C st | i | d } | i | d } t | d j o | i | d } n d } t | | | d | d d S( Ni i i i R$ i i ( R, Rj Ra R t bodyNodeR) R R t While( R, Ra R R R ( ( R t
while_stmt s c C s | i | d t } | i | d } | i | d } t | d j o | i | d } n d } t | | | | d | d d S( Ni i i i R$ i i ( R, R Ra R t
assignNodeRj t listNodeR R) R R t For( R, Ra R R R R ( ( R t for_stmt s c C s6 | d d t i j o | i | Sn | i | S( Ni i ( Ra R. t
except_clauseR, t com_try_finallyt com_try_except( R, Ra ( ( R t try_stmt s c C sq t | d j o | i | d Sn g } x6 | D]. } | d t i j o | i | | q5 q5 Wt | S( Ni i (
R) Ra R, R^ Rd RU R. R Rf Rh ( R, Ra RU Rd ( ( R RO s c C s | i t | S( N( R, t
com_binaryt TupleRa ( R, Ra ( ( R t testlist s c C sc t | d j oC | d d t i j o+ | i | d } | i | | d Sn | i | S( Ni i i ( R) Ra R. t gen_forR, Rj t testt com_generator_expressionR ( R, Ra R ( ( R t
testlist_gexp* s +c C sP t | d j o- | d d t i j o | i | d Sn | i t | S( Ni i ( R) Ra R. R[ R, R t Or( R, Ra ( ( R R 0 s +c C s | i t | S( N( R, R t AndRa ( R, Ra ( ( R t and_test6 s c C sF | i | d } t | d j o t | d | d d Sn | S( Nii R$ i ( R, Rj Ra t resultR) t Not( R, Ra R ( ( R t not_test: s c C s | i | d } t | d j o | Sn g } x t d t | d D] } | | d } | d } | d t
i j oB | d } t | d j o! | d j o
d } q d } q n t
| d } | d d } | i | | i | | f qM Wt | | d | S( Ni i i i t nots not ins is notR$ ( R, Rj Ra RU R) t resultsR Rc t nlRV R5 RC R t
_cmp_typesR$ R t Compare( R, Ra RU Rc R RV R R R$ ( ( R t
comparisonA s$
$c C s | i t | S( N( R, R t BitorRa ( R, Ra ( ( R RQ b s c C s | i t | S( N( R, R t BitxorRa ( R, Ra ( ( R t xor_exprf s c C s | i t | S( N( R, R t BitandRa ( R, Ra ( ( R t and_exprj s c C s | i | d } x t d t | d D] } | i | | } | | d d t i j o$ t
| | g d | d d } q, | | d d t i j o$ t | | g d | d d } q, t
d | | d d q, W| S( Ni i i R$ s unexpected token: %s( R, Rj Ra RU R R) Rc t rightR5 t LEFTSHIFTt LeftShiftR t
RightShiftR ( R, Ra RU R Rc ( ( R t
shift_exprn s $ $ c C s | i | d } x t d t | d D] } | i | | } | | d d t i j o$ t
| | g d | d d } q, | | d d t i j o$ t | | g d | d d } q, t
d | | d d q, W| S( Ni i i R$ s unexpected token: %s( R, Rj Ra RU R R) Rc R R5 t PLUSt Addt MINUSt SubR ( R, Ra RU R Rc ( ( R t
arith_expr{ s $ $ c C s | i | d } x t d t | d D] } | i | | } | | d d } | t i
j o t | | g } n | t i j o t
| | g } nZ | t i j o t | | g } n4 | t i j o t | | g } n t d | | d d | _ q, W| S( Ni i i s unexpected token: %s( R, Rj Ra RU R R) Rc R t tR5 R t Mult SLASHt Divt PERCENTt Modt DOUBLESLASHt FloorDivR R$ ( R, Ra RU R Rc R ( ( R t term s
c C s | d } | d } | i | d | d d } | t i j o t | d | d SnS | t i j o t
| d | d Sn+ | t i j o t | d | d } n | S( Ni ii R$ i (
Ra t eltR R, R RU R5 R t UnaryAddR t UnarySubt TILDEt Invert( R, Ra RU R R ( ( R t factor s
!c C s | i | d } x| t d t | D]e } | | } | d t i j o/ t
| | i | | d g d | d Sn | i | | } q) W| S( Ni i R$ i ( R, Rj Ra RU R R) Rc R R5 t
DOUBLESTARt Powert com_apply_trailer( R, Ra RU Rc R ( ( R t power s
c C s. | i | d d | S| d d t _ t S( Ni i ( R, RE Ra RV R$ ( R, Ra ( ( R t atom s c C s7 | d d t i j o t f Sn | i | d S( Ni i ( Ra R5 t RPARR R, Rj ( R, Ra ( ( R R8 s c C s7 | d d t i j o t f Sn | i | d S( Ni i ( Ra R5 t RSQBt ListR, t com_list_constructor( R, Ra ( ( R R: s c C s7 | d d t i j o t f Sn | i | d S( Ni i ( Ra R5 t RBRACEt DictR, t
com_dictmaker( R, Ra ( ( R R< s c C s t | i | d S( Ni ( t BackquoteR, Rj Ra ( R, Ra ( ( R R> s c C s, t | d d } t | d | d d S( Ni i R$ i ( R Ra t kR ( R, Ra R ( ( R R@ s c C sh | i oP | i d d g j o t | d i | i } n t d | i | f Sn t | Sd S( Ns utf-8s
iso-8859-1s # coding: %s
%s( R, RF t unicodet litt encodeR ( R, R ( ( R t decode_literal s
c C sF d } x% | D] } | | i | d 7} q
Wt | d | d d S( NRR i R$ i i ( R Ra RU R, R R ( R, Ra RU R ( ( R RB s
c C s t | d d d | d d S( Ni i R$ i ( t NameRa ( R, Ra ( ( R RD s c C s | i | d S( Ni ( R, R- RU ( R, RU ( ( R R s c C s | i | d | d S( Ni i ( R, R- RU ( R, RU ( ( R Rj s c G s t t d S( N( R~ R R ( R, R% ( ( R R4 s c C s g } g } d } d } x| t | j o| | } | d t i j p | d t i j o | d t i j oO | | d } | d t i
j o) | i | d | t B} | d } q n | t | j o\ | | d } | t i j o | | d } n t d | | i | d | t B} n Pn | i | i | | d } | t | j o Pn | | d t i j o, | i | i | | d | d } n% t | o | i t d n | d } q W| | | f S( Ni i i s unexpected token: %si ( Rz R{ R| Rc R) Ra RU R5 R R RC R t
CO_VARARGSR R t CO_VARKEYWORDSR, t com_fpdefR Rj R R ( R, Ra RU Rc R| Rz R{ R ( ( R Ry sB
(
c C s9 | d d t i j o | i | d Sn | d d S( Ni i i ( RU R5 R7 R, t
com_fplist( R, RU ( ( R R 6 s c C su t | d j o | i | d Sn g } x: t d t | d D] } | i | i | | qG Wt | S( Ni i ( R) RU R, R RJ R Rc R R ( R, RU Rc RJ ( ( R R < s c C s_ d } xN | D]F } t | t f j o' | d d j o | | d d } q
q
W| d S( NRR i i t .i( R2 RU RV R ( R, RU R2 RV ( ( R R E s *c C s | d t i j p t | d } | i | d d } t | d j o | d f Sn | d d d j p t | d d t i
j p t | | d d f S( Ni i t asi ( RU R. t dotted_as_nameRl R, R t dotR) R R5 RC ( R, RU R# ( ( R t com_dotted_as_nameM s
c C s| | d t i j p t | d } | i | d g } x: t d t | d D] } | i
| i | | qT W| S( Ni i i ( RU R. t dotted_as_namesRl R, R$ Rz R R) Rc R ( R, RU Rc Rz ( ( R R W s
c C s | d t i j p t | d } | d d t i j p t t | d j o | d d d f Sn | d d d j p
t | | d d t i j p t | d d | d d f S( Ni i R! i ( RU R. t import_as_nameRl R5 RC R) R ( R, RU ( ( R t com_import_as_name_ s
c C s| | d t i j p t | d } | i | d g } x: t d t | d D] } | i
| i | | qT W| S( Ni i i ( RU R. t import_as_namesRl R, R' Rz R R) Rc R ( R, RU Rc Rz ( ( R R i s
c C sG g } x: t d t | d D] } | i | i | | q W| S( Ni i ( R R R) RU Rc R R, Rj ( R, RU Rc R ( ( R R q s
c C s5 t | i | d | i | d d | d d S( Ni i R$ i ( t
TryFinallyR, Rj Ra ( R, Ra ( ( R R w s c C sL | i | d } g } d } x t d t | d D] } | | } | d t i j o t | d j oJ | i | d } t | d j o | i | d t } q d } n d } } | i | | | i | | d f n | d t i j o | i | | d } q8 q8 Wt | i | d | | d | d d S( Ni i i i R$ ( R, Rj Ra R t clausesR R R R) Rc RU R. R R R R R R R5 RC t TryExcept( R, Ra RU Rc R R R R R* ( ( R R } s$
+ c C s# | d t i j p t | d S( Ni i ( RU R. t augassignRl ( R, RU ( ( R R s c C sJ | i | } | i t t t t f j o | Sn t d | i i
d S( s Return node suitable for lvalue of augmented assignment
Names, slices, and attributes are the only allowable nodes.
s can't assign to %sN( R, Rj RU R t __class__R t Slicet SubscriptRn t SyntaxErrorR ( R, RU R ( ( R R s
c C s x~| d } | t i j p | t i j p | t i j o5 t | d j o | i | | Sn | d } q | t
j o. t | d j o
t d n | d } q | t i j o | d d t i
j o
t d n t | d j o | i | d } x^ t d t | d D]C } | | } | d t i j o
t d n | i | | } q"W| i | | d | Sn | d } q | t i
j o | d d } | t i j o/ | d } | d t i j o
t d qoq|| t i j o? | d } | d t i j o
t d n | i | | Sq|| t i j o | i | d | Sq|t d q t d q Wd S(
Ni i i s can't assign to operatoris can't assign to ()s can't assign to []s can't assign to literals bad assignment( RU R R. t exprlistR R R) R, t com_assign_tuplet assigningt
_assign_typesR0 R R
Rj t primaryR Rc t chR5 R R t com_assign_trailerR7 R R9 R t com_assign_listRC t com_assign_name( R, RU R3 R6 Rc R5 R ( ( R R sP
0
c C s\ g } x= t d t | d D]# } | i | i | | | q Wt | d t
| S( Ni i R$ ( t assignsR R) RU Rc R R, R R3 t AssTupleR# ( R, RU R3 R: Rc ( ( R R2 s
!c C s g } x t d t | d D] } | d t | j o[ | | d d t i j o
t d n | | d d t i j p t
| | d n | i | i
| | | q Wt | d t | S( Ni i i s" can't assign to list comprehensionR$ ( R: R R) RU Rc R. t list_forR0 R5 R Rl R R, R R3 t AssListR# ( R, RU R3 R: Rc ( ( R R8 s
2!c C s t | d | d | d S( Ni R$ i ( t AssNameRU R3 ( R, RU R3 ( ( R R9 s c C s | d d } | t i j o | i | | d | Sn | t i j o | i | | d | Sn | t i
j o
t d n t d | d S( Ni i i s can't assign to function calls unknown trailer type: %s( RU R R5 Rm R, t com_assign_attrR5 R3 R9 t com_subscriptlistR7 R0 ( R, R5 RU R3 R ( ( R R7 s
c C s t | | d | d | d S( Ni R$ i( t AssAttrR5 RU R3 ( R, R5 RU R3 ( ( R R? s c C s t | } | d j o% | d } | i | | d Sn g } xD t d | d D]0 } | | } | i | i | | d qW W| | d t | S( s= Compile 'NODE (OP NODE)*' into (type, [ node1, ..., nodeN ]).i i i R$ N( R) Ra R RV R, R R0 R Rc R t constructorR# ( R, RB Ra Rc R0 R RV ( ( R R s
$c C sR | i | | d } | d j p t t | t o | Sn t | g S( Ni ( R, R RU R R Rl R Rh ( R, RU R ( ( R R^ s
c C sb | i | | d } | d j p t t | t o | i | i
n | i | d S( Ni ( R, R RU R R Rl R Rh Rd t extendR R ( R, Rd RU R ( ( R Rf s
R< c C s g } x t d t | D] } | | d t i j o: t | | d j p t | i | d | | Sn | | d t
i j o q n | i | i
| | q Wt | d | d i S( Ni i R$ ( t valuesR R) Ra Rc R. R< Rl R, t com_list_comprehensionR5 R R Rj R R$ ( R, Ra Rc RD ( ( R R s
c C so | d d } g } xE| o=| d d }
|
d j o | i | d t } | i | d } t
| | g } | d d | _ | i | t
| d j o
d } qW| i | d } q |
d j oq | i | d } t | d | d d } | i i | t
| d j o
d } qW| i | d } q t d | | f q Wt | | d | S(
Ni i t fori i t ifR$ i s, unexpected list comprehension element: %s %d( RU R$ t forsR R, R R R Rj R t ListCompFort newforR R) R t
com_list_iterR t
ListCompIft newift ifsR0 t ListCompRQ ( R, RQ RU R RJ R R$ RM RH R R ( ( R RE s.
c C s# | d t i j p t | d S( Ni i ( RU R. t list_iterRl ( R, RU ( ( R RK < s c C sM g } x: t d t | d D] } | i | i | | q Wt | S( Ni i ( RD R R) Ra Rc R R, Rj R ( R, Ra Rc RD ( ( R R @ s
R c C s | d d } g } xB| o:| d d }
|
d j o | i | d t } | i | d } t
| | g d | d d } | i | t
| d j o
d } qT| i | d } q |
d j oq | i | d } t | d | d d } | i i | t
| d j o
d } qT| i | d } q t d | | f q Wt | d
_ t t | | d | S( Ni i RF i R$ i RG i s. unexpected generator expression element: %s %di ( RU R$ RH R R, R R R Rj t genNodet
GenExprForRJ R R) R t com_gen_iterR t GenExprIfRM RN R0 t Truet
is_outmostt GenExprt GenExprInnerRQ ( R, RQ RU RQ RJ R R$ RM RH R R ( ( R R G s0
c C s# | d t i j p t | d S( Ni i ( RU R. t gen_iterRl ( R, RU ( ( R RS i s c C sd g } xQ t d t | d D]7 } | i | i | | | i | | d f q Wt | S( Ni i i ( R0 R R) Ra Rc R R, Rj R ( R, Ra Rc R0 ( ( R R m s
5c C s | d d } | t i j o | i | | d Sn | t i j o | i | | d Sn | t i j o | i
| | d t Sn t d | d S( Ni i i s unknown node type: %s(
Ra R R5 R7 R, Rs t primaryNodeRm t com_select_memberR9 R@ t OP_APPLYR0 ( R, RZ Ra R ( ( R R u s c C s< | d t i j o
t d n t | | d d | d S( Ni s member must be a namei R$ i ( Ra R5 RC R0 Rn RZ ( R, RZ Ra ( ( R R[ s
c
C sC | d t i j o t | g d t | Sn g } d } t | } x t
d | d D] }
| |
} | d t i
j p | d t i j o Pn | i | | \ } } | d j oH t | t o8 t | d j o% | d d t i j o
t d n | i | q\ W|
d }
|
| j o& | |
d t i j o |
d }
n d } } x |
| j o | |
} | |
d } |
d }
| d t i
j o- | d j o
t d n | i | } qa| d t i j o- | d j o
t d n | i | } qat d | qaWt | | | | d t | S(
Ni R$ i i i s& generator expression needs parenthesiss$ already have the varargs indentifiers# already have the kwargs indentifiers unknown node type: %s( Ra R5 R t CallFuncRZ R# R% t kwR) t len_nodelistR Rc RU R R R, t com_argumentR R RW R. R R0 R R R t star_nodet
dstar_nodet tokR6 Rj (
R, RZ Ra R6 R Rc RU R% R_ Rb Rc R^ Ra ( ( R Rs sD
(H
%
c C sD t | d j oI | d d t i j o1 | i | d } d | i | | d f Sn t | d j o/ | o
t d n d | i | d f Sn | i | d } | d } x6 t | d j o" | d t i
j o | d } q W| d t i
j o t d | d n t | d | d | d } d | f S( Ni i i i s! non-keyword arg after keyword args# keyword can't be an expression (%s)R$ ( R) Ra R. R R, Rj R R R^ R0 R RV R5 RC t KeywordRU ( R, Ra R^ RU RV R R ( ( R R` s +
' c C s t | d j o | d } | d d t i j p+ t | d j o- | d d t i j o/ | d d t i j o | i | | | Sq n g } x: t d t | d D] } | i | i | | q Wt | | | d t | S( Ni i i iR$ ( R) Ra t subR5 R R. R R, t com_sliceR5 R3 t
subscriptsR Rc R t
com_subscriptR/ R# ( R, R5 Ra R3 Rg Re Rc ( ( R R@ s
[ c C s | d } | d } | t i j o# | d d t i j o t Sn | t i j p t | d j o | i | Sn | i
| S( Ni i i ( RU R6 R R5 Rm t EllipsisR R) R, t com_sliceobjRj ( R, RU R6 R ( ( R Rh s
( #c C sE g } | d d t i j o | i t d d } n! | i | i | d d } | t
| j o@ | | d t i j o( | i | i | | | d } n | i t d xk t
| t
| D]T } | | } t
| d j o | i t d q | i | i | d q Wt | d t | S( Ni i i i R$ ( R0 RU R5 R R R R Rc R, Rj R) R. R R t jR6 t SliceobjR# ( R, RU R6 Rc R0 Rk ( ( R Rj s"
+
c C s d } } t | d j oF | d d t i j o | i | d } q | i | d } n> t | d j o* | i | d } | i | d } n t | | | | d t | S( Ni i i i i R$ (
R t lowert upperR) RU R5 R R, Rj R. R5 R3 R# ( R, R5 RU R3 Rn Rm ( ( R Rf s
c C s | d j o | d } | d } n | t i j of t | d j o | i | d Sn x3 | D]+ } | d t i j o | i | Sqd qd Wd Sn | t i
j o> x3 | D]+ } | d t i j o | i | Sq q Wd Sn | t i j oS | d d t i
j o3 d } x" | D] } | t | d } q W| Sn d Sn | t i j p | t i j p | t i j o | i | d Sn | t j o( t | d j o | i | d Sn d S( Ni i RR ( RV R RU R. RO R) R, R` Re R RY R
R5 RA t sR R R t
small_stmtt
_doc_nodes( R, RU RV Re Ro R ( ( R R` s<
0 (z R R t __doc__RG RN R R RT RM RX RY RZ Ro Rt Rw R\ R[ R] R Rp t flow_stmtt
compound_stmtR R Rx R R Rq R R R R R R R R R R R R R R R R R R R R R R R RO R t
testlist_safet testlist1R1 R R R R R RQ R R R R R R R R
R8 R: R< R> R@ R RB RD R t _callersRj R4 Ry R R R R$ R R' R R R R R R R R2 R8 R9 R7 R? R R^ Rf R R. R RE RK R RS R R R[ Rs R` R@ Rh Rj Rf R R` ( ( ( R R _ s
!
!
4
,
#
"
+
$ t <t >s ==s <=s >=s !=R c C s g } x{ | D]s } t | t i j o | i t i | | q
t | t i j o | i | q
| i t
| q
W| S( N( R RI R R t typest IntTypeR t _namest gett
StringTypet
debug_tree( RI R R ( ( R R s (R Rr t compiler.astRK R. R5 t syst
StandardErrorR t constsR R R R R\ R
R R R# R+ R R R Ru R R R R RQ R R R R R R R Rq t LESSt GREATERt EQEQUALR t LESSEQUALt GREATEREQUALt NOTEQUALR R\ R] R Rp Rs R Rt R R R R R R R R R R R R R R R RO R1 R
t _legal_node_typesR R R R4 Rz R| R/ R0 R t vt tok_nameR ( R R4 RK R R Rz R\ R+ R R R R R. R| R R R R
R R R R# R5 R Rq ( ( R t ? sB
`Z
+H