/usr/lib64/python2.6/lib2to3
Edit: /usr/lib64/python2.6/lib2to3/pytree.pyo (28902B)
Ñò
« gc @ s d Z d Z d d k Z d d k Z d d k l Z d Z h a d „ Z d e f d „ ƒ YZ d e f d
„ ƒ YZ
d e f d „ ƒ YZ d
„ Z d e f d „ ƒ YZ
d e
f d „ ƒ YZ d e
f d „ ƒ YZ d e
f d „ ƒ YZ d e
f d „ ƒ YZ d „ Z d S( sÌ
Python parse tree definitions.
This is a very concrete parse tree; we need to keep every token and
even the comments and whitespace between tokens.
There's also a pattern matching implementation here.
s# Guido van Rossum
iÿÿÿÿN( t StringIOiÿÿÿc C sl t pU d d k l } xB | i i ƒ D]- \ } } t | ƒ t j o | t | \ } } | | j o% | d j o d S| i i | d Sq( Wd S( s¤
The node immediately preceding the invocant in their parent's children
list. If the invocant does not have a previous sibling, it is None.
i i N( R( R* R: R) ( R R; R> ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyt prev_siblingÈ s
c C s" | i } | d j o d S| i S( s
Return the string immediately following the invocant node. This is
effectively equivalent to node.next_sibling.prefix
u N( R? R* R" ( R t next_sib( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyt
get_suffixØ s
i i c C s t | ƒ i d ƒ S( Nt ascii( t unicodet encode( R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyt __str__ã s N( ( i i ( t __name__t
__module__t __doc__R* R R( R) R' R9 R R t __hash__R R R R R R# R$ R4 R8 R. R< t propertyR? R@ RB t syst version_infoRF ( ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyR
" s0
t Nodec B s© e Z d Z d d d „ Z d „ Z d „ Z e i d j o
e Z n d „ Z
d „ Z d „ Z d „ Z
d
„ Z d „ Z e e e ƒ Z d „ Z d
„ Z d „ Z RS( s+ Concrete implementation for interior nodes.c C sS | | _ t | ƒ | _ x | i D] } | | _ q" W| d j o
| | _ n d S( sð
Initializer.
Takes a type constant (a symbol number >= 256), a sequence of
child nodes, and an optional context keyword argument.
As a side effect, the parent pointers of the children are updated.
N( R R& R) R( R* R" ( R R R) t contextR" R2 ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyt __init__ë s
c C s# d | i i t | i ƒ | i f S( s) Return a canonical string representation.s
%s(%s, %r)( R RG R R R) ( R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyt __repr__ý s c C s d i t t | i ƒ ƒ S( sk
Return a pretty string representation.
This reproduces the input source exactly.
u ( t joint mapRD R) ( R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyt __unicode__ s i i c C s" | i | i f | i | i f j S( s Compare two nodes for equality.( R R) ( R R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyR s c C s4 t | i g } | i D] } | | i ƒ q ~ ƒ S( s$ Return a cloned (deep) copy of self.( RN R R) R ( R t _[1]R2 ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyR s c c s9 x- | i D]" } x | i ƒ D] } | Vq Wq
W| Vd S( s* Return a post-order iterator for the tree.N( R) R ( R R> R7 ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyR s
c c s9 | Vx- | i D]" } x | i ƒ D] } | Vq" Wq Wd S( s) Return a pre-order iterator for the tree.N( R) R ( R R> R7 ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyR s
c C s | i p d S| i d i S( sO
The whitespace and comments preceding this node in the input.
t i ( R) R" ( R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyt _prefix_getter$ s
c C s" | i o | | i d _ n d S( Ni ( R) R" ( R R" ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyt _prefix_setter, s
c C s4 | | _ d | i | _ | | i | <| i ƒ d S( s…
Equivalent to 'node.children[i] = child'. This method also sets the
child's parent attribute appropriately.
N( R( R* R) R. ( R R; R> ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyt set_child2 s
c C s* | | _ | i i | | ƒ | i ƒ d S( s‹
Equivalent to 'node.children.insert(i, child)'. This method also sets
the child's parent attribute appropriately.
N( R( R) t insertR. ( R R; R> ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyt insert_child< s c C s' | | _ | i i | ƒ | i ƒ d S( sˆ
Equivalent to 'node.children.append(child)'. This method also sets the
child's parent attribute appropriately.
N( R( R) R- R. ( R R> ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyt append_childE s N( i i ( RG RH RI R* RP RQ RT RL RM RF R R R R RW RX RK R" RY R[ R\ ( ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyRN ç s
R5 c B s e Z d Z d Z d Z d Z d
d
d „ Z d „ Z d „ Z e
i d j o
e Z n d „ Z
d „ Z d „ Z d
„ Z d „ Z d „ Z e e e ƒ Z RS( s' Concrete implementation for leaf nodes.RV i c C s\ | d j o | \ | _ \ | _ | _ n | | _ | | _ | d j o
| | _ n d S( s—
Initializer.
Takes a type constant (a token number < 256), a string value, and an
optional context keyword argument.
N( R* t _prefixR6 t columnR t value( R R R_ RO R" ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyRP X s
c C s d | i i | i | i f S( s) Return a canonical string representation.s
%s(%r, %r)( R RG R R_ ( R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyRQ g s c C s | i t | i ƒ S( sk
Return a pretty string representation.
This reproduces the input source exactly.
( R" RD R_ ( R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyRT m s i c C s" | i | i f | i | i f j S( s Compare two nodes for equality.( R R_ ( R R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyR x s c C s+ t | i | i | i | i | i f f ƒ S( s$ Return a cloned (deep) copy of self.( R5 R R_ R" R6 R^ ( R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyR | s c c s | Vd S( s* Return a post-order iterator for the tree.N( ( R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyR s c c s | Vd S( s) Return a pre-order iterator for the tree.N( ( R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyR … s c C s | i S( sP
The whitespace and comments preceding this token in the input.
( R] ( R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyRW ‰ s c C s | i ƒ | | _ d S( N( R. R] ( R R" ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyRX s
N( i i ( RG RH RI R] R6 R^ R* RP RQ RT RL RM RF R R R R RW RX RK R" ( ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyR5 O s
c C sp | \ } } } } | p | | i j o0 t | ƒ d j o | d St | | d | ƒSt | | d | ƒSd S( sõ
Convert raw node information to a Node or Leaf instance.
This is passed to the parser driver which calls it whenever a reduction of a
grammar rule produces a new complete node, so that the tree is build
strictly bottom-up.
i i RO N( t
number2symbolt lenRN R5 ( t grt raw_nodeR R_ RO R) ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyt convert• s t BasePatternc B s\ e Z d Z d Z d Z d Z d „ Z d „ Z d „ Z d d „ Z
d d „ Z d „ Z RS( s”
A pattern is a tree matching pattern.
It looks for a specific node type (token or symbol), and
optionally for a specific content.
This is an abstract base class. There are three concrete
subclasses:
- LeafPattern matches a single leaf node;
- NodePattern matches a single node (usually non-leaf);
- WildcardPattern matches a sequence of nodes of variable length.
c O s
t i | ƒ S( s> Constructor that prevents BasePattern from being instantiated.( R R ( R R R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyR ½ s c C sk t | i ƒ | i | i g } x$ | o | d d j o | d =q! Wd | i i d i t t | ƒ ƒ f S( Niÿÿÿÿs %s(%s)s , (
R R t contentR
R* R RG RR RS t repr( R R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyRQ Â s
c C s | S( sŒ
A subclass can define this as a hook for optimizations.
Returns either self or another node with the same effect.
( ( R ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyt optimizeÈ s c C sµ | i d j o | i | i j o t S| i d j oQ d } | d j o
h } n | i | | ƒ p t S| o | i | ƒ q‰ n | d j o | i o | | | i = 256). If the
type is None this matches *any* single node (leaf or not),
except if content is not None, in which it only matches
non-leaf nodes that also match the content pattern.
The content, if not None, must be a sequence of Patterns that
must match the node's children exactly. If the content is
given, the type must not be None.
If a name is given, the matching node is stored in the results
dict under that key.
N(
R* R& R: R% t WildcardPatternR, t wildcardsR Rf R
( R R Rf R
R; t item( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyRP . s
c C sÔ | i od x\ t | i | i ƒ D]E \ } } | t | i ƒ j o# | d j o | i | ƒ n t Sq Wt St | i ƒ t | i ƒ j o t Sx; t | i | i ƒ D]$ \ } } | i
| | ƒ p t Sq¨ Wt S( s„
Match the pattern's content to the node's children.
This assumes the node type matches and self.content is not None.
Returns True if it matches, False if not.
If results is not None, it must be a dict which will be
updated with the nodes matching named subpatterns.
When returning False, the results dict may still be updated.
N( Rt Rp Rf R) Ra R* Rj R, R' t zipRm ( R R7 Rk t cRl t
subpatternR> ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyRi K s
N( RG RH R' Rt R* RP Ri ( ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyRr * s Rs c B sh e Z d Z d
d e d
d „ Z d „ Z d
d „ Z d
d „ Z d „ Z d „ Z
d „ Z d „ Z RS( s
A wildcard pattern can match zero or more nodes.
This has all the flexibility needed to implement patterns like:
.* .+ .? .{m,n}
(a b c | d e | f)
(...)* (...)+ (...)? (...){m,n}
except it always uses non-greedy matching.
i c C s_ | d j o* t t t | ƒ ƒ } x | D] } q) Wn | | _ | | _ | | _ | | _ d S( sÏ
Initializer.
Args:
content: optional sequence of subsequences of patterns;
if absent, matches one node;
if present, each subsequence is an alternative [*]
min: optinal minumum number of times to match, default 0
max: optional maximum number of times tro match, default HUGE
name: optional name assigned to this match
[*] Thus, if content is [[a, b, c], [d, e], [f, g, h]] this is
equivalent to (a b c | d e | f g h); if content is None,
this is equivalent to '.' in regular expression terms.
The min and max parameters work as follows:
min=0, max=maxint: .*
min=1, max=maxint: .+
min=0, max=1: .?
min=1, max=1: .
If content is not None, replace the dot with the parenthesized
list of alternatives, e.g. (a b c | d e | f g h)*
N( R* t tupleRS Rf t mint maxR
( R Rf Rz R{ R
t alt( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyRP u s
c C s@ d } | i d j oE t | i ƒ d j o/ t | i d ƒ d j o | i d d } n | i d j o` | i d j oP | i d j o t d | i ƒ S| d j o | i | i j o | i ƒ Sn | i d j oa t | t ƒ oQ | i d j oA | i | i j o. t | i | i | i | i | i | i ƒ S| S( s+ Optimize certain stacked wildcard patterns.i i R
N(
R* Rf Ra Rz R{ Rr R
Rh R% Rs ( R Rx ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyRh ˜ s 0 #
c C s | i | g | ƒ S( s' Does this pattern exactly match a node?( Ro ( R R7 Rk ( ( s& /usr/lib64/python2.6/lib2to3/pytree.pyRm « s c C s{ xt | i | ƒ D]c \ } } | t | ƒ j oD | d j o2 | i | ƒ | i o t | ƒ | | i s" ÅhF V,=¹#