ž
¬ÿ fân c @ s d Z d Z d d l Z d d l Z d d l m Z d Z i a d d „ Z Gd d „ d e ƒ Z
Gd
d „ d e
ƒ Z Gd d
„ d
e
ƒ Z d d „ Z
Gd d „ d e ƒ Z Gd d „ d e ƒ Z Gd d „ d e ƒ Z Gd d „ d e ƒ Z Gd d „ d e ƒ Z d d „ Z d S( uÌ
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.
u# Guido van Rossum i N( u StringIOiÿÿÿc C sh t sX d d l m } x? | j j ƒ D]+ \ } } t | ƒ t k r& | t | = 256), a sequence of
child nodes, and an optional context keyword argument.
As a side effect, the parent pointers of the children are updated.
i N( u AssertionErroru typeu listu childrenu parentu Noneu repru prefixu fixers_applied( u selfu typeu childrenu contextu prefixu fixers_appliedu ch( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __init__ß s !
u
Node.__init__c C s# d | j j t | j ƒ | j f S( u) Return a canonical string representation.u
%s(%s, %r)( u __class__u __name__u type_repru typeu children( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __repr__ø s u
Node.__repr__c C s d j t t | j ƒ ƒ S( uk
Return a pretty string representation.
This reproduces the input source exactly.
u ( u joinu mapu stru children( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __unicode__þ s u Node.__unicode__i i c C s" | j | j f | j | j f k S( u Compare two nodes for equality.( u typeu children( u selfu other( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _eq s u Node._eqc C s) t | j d d „ | j Dƒ d | j ƒS( u$ Return a cloned (deep) copy of self.c S s g | ] } | j ƒ ‘ q S( ( u clone( u .0u ch( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu
s u Node.clone..u fixers_applied( u Nodeu typeu childrenu fixers_applied( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu clone
s u
Node.clonec c s9 x- | j D]" } x | j ƒ D] } | Vq Wq
W| Vd S( u* Return a post-order iterator for the tree.N( u childrenu
post_order( u selfu childu node( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu
post_order s
u Node.post_orderc c s9 | Vx- | j D]" } x | j ƒ D] } | Vq" Wq Wd S( u) Return a pre-order iterator for the tree.N( u childrenu pre_order( u selfu childu node( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu pre_order s u Node.pre_orderc C s | j s
d S| j d j S( uO
The whitespace and comments preceding this node in the input.
u i ( u childrenu prefix( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _prefix_getter s u Node._prefix_getterc C s | j r | | j d _ n d S( Ni ( u childrenu prefix( u selfu prefix( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _prefix_setter( s u Node._prefix_setterc C s4 | | _ d | j | _ | | j | <| j ƒ d S( u…
Equivalent to 'node.children[i] = child'. This method also sets the
child's parent attribute appropriately.
N( u parentu Noneu childrenu changed( u selfu iu child( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu set_child. s
u Node.set_childc C s* | | _ | j j | | ƒ | j ƒ d S( u‹
Equivalent to 'node.children.insert(i, child)'. This method also sets
the child's parent attribute appropriately.
N( u parentu childrenu insertu changed( u selfu iu child( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu insert_child8 s u Node.insert_childc C s' | | _ | j j | ƒ | j ƒ d S( uˆ
Equivalent to 'node.children.append(child)'. This method also sets the
child's parent attribute appropriately.
N( u parentu childrenu appendu changed( u selfu child( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu append_childA s u Node.append_childN( i i ( u __name__u
__module__u __qualname__u __doc__u Noneu __init__u __repr__u __unicode__u sysu version_infou __str__u _equ cloneu
post_orderu pre_orderu _prefix_getteru _prefix_setteru propertyu prefixu set_childu insert_childu append_child( u
__locals__( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu NodeÛ s$
u Nodec B sÔ | Ee Z d Z d Z d Z d Z d Z d d g d d „ Z d d „ Z d d „ Z
e j d k rm e
Z
n d d „ Z d
d „ Z d d „ Z d d „ Z d d „ Z d d „ Z d d „ Z e e e ƒ Z d S( u Leafu' Concrete implementation for leaf nodes.u i c C s“ d | k o d k n s( t | ƒ ‚ | d k rR | \ | _ \ | _ | _ n | | _ | | _ | d k r| | | _ n | d d … | _ d S( u—
Initializer.
Takes a type constant (a token number < 256), a string value, and an
optional context keyword argument.
i i N( u AssertionErroru Noneu _prefixu linenou columnu typeu valueu fixers_applied( u selfu typeu valueu contextu prefixu fixers_applied( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __init__T s
( u
Leaf.__init__c C s d | j j | j | j f S( u) Return a canonical string representation.u
%s(%r, %r)( u __class__u __name__u typeu value( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __repr__g s u
Leaf.__repr__c C s | j t | j ƒ S( uk
Return a pretty string representation.
This reproduces the input source exactly.
( u prefixu stru value( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __unicode__m s u Leaf.__unicode__i c C s" | j | j f | j | j f k S( u Compare two nodes for equality.( u typeu value( u selfu other( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _eqx s u Leaf._eqc C s4 t | j | j | j | j | j f f d | j ƒS( u$ Return a cloned (deep) copy of self.u fixers_applied( u Leafu typeu valueu prefixu linenou columnu fixers_applied( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu clone| s u
Leaf.clonec c s | Vd S( N( ( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu leaves‚ s u Leaf.leavesc c s | Vd S( u* Return a post-order iterator for the tree.N( ( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu
post_order… s u Leaf.post_orderc c s | Vd S( u) Return a pre-order iterator for the tree.N( ( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu pre_order‰ s u Leaf.pre_orderc C s | j S( uP
The whitespace and comments preceding this token in the input.
( u _prefix( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _prefix_getter s u Leaf._prefix_getterc C s | j ƒ | | _ d S( N( u changedu _prefix( u selfu prefix( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _prefix_setter“ s
u Leaf._prefix_setterN( i i ( u __name__u
__module__u __qualname__u __doc__u _prefixu linenou columnu Noneu __init__u __repr__u __unicode__u sysu version_infou __str__u _equ cloneu leavesu
post_orderu pre_orderu _prefix_getteru _prefix_setteru propertyu prefix( u
__locals__( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu LeafK s& u Leafc C sk | \ } } } } | s' | | j k rT t | ƒ d k rA | d St | | d | ƒSt | | d | ƒSd S( uõ
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 u contextN( u
number2symbolu lenu Nodeu Leaf( u gru raw_nodeu typeu valueu contextu children( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu convert™ s u convertc B sz | Ee Z d Z d Z d Z d Z d Z d d „ Z d d „ Z d d „ Z
d d d „ Z d d
d „ Z d d
„ Z
d S( u BasePatternu”
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 k s t d ƒ ‚ t j | ƒ S( u> Constructor that prevents BasePattern from being instantiated.u Cannot instantiate BasePattern( u BasePatternu AssertionErroru objectu __new__( u clsu argsu kwds( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __new__Á s u BasePattern.__new__c C sh t | j ƒ | j | j g } x! | rA | d d k rA | d =q! Wd | j j d j t t | ƒ ƒ f S( Ni u %s(%s)u , iÿÿÿÿiÿÿÿÿ(
u type_repru typeu contentu nameu Noneu __class__u __name__u joinu mapu repr( u selfu args( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __repr__Æ s u BasePattern.__repr__c C s | S( uŒ
A subclass can define this as a hook for optimizations.
Returns either self or another node with the same effect.
( ( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu optimizeÌ s u BasePattern.optimizec C s§ | j d k r% | j | j k r% d S| j d k r~ d } | d k rO i } n | j | | ƒ se d S| r~ | j | ƒ q~ n | d k r£ | j r£ | | | j | Ee Z d Z d Z d d d d d „ Z d d d „ Z d S( u NodePatternc C sÜ | d k r' | d k s' t | ƒ ‚ n | d k r½ t | t ƒ sU t t | ƒ ƒ ‚ t | ƒ } xY t | ƒ D]H \ } } t | t ƒ s› t | | f ƒ ‚ t | t ƒ rn d | _
qn qn Wn | | _ | | _ | | _
d S( ud
Initializer. Takes optional type, content, and name.
The type, if given, must be a symbol type (>= 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.
i NT( u Noneu AssertionErroru
isinstanceu stru repru listu enumerateu BasePatternu WildcardPatternu Trueu wildcardsu typeu contentu name( u selfu typeu contentu nameu iu item( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __init__2 s " ! u NodePattern.__init__c C sÊ | j rh xX t | j | j ƒ D]A \ } } | t | j ƒ k r | d k r\ | j | ƒ n d Sq Wd St | j ƒ t | j ƒ k rŠ d Sx9 t | j | j ƒ D]" \ } } | j
| | ƒ s d Sq Wd S( u„
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.
NTF( u wildcardsu generate_matchesu contentu childrenu lenu Noneu updateu Trueu Falseu zipu match( u selfu nodeu resultsu cu ru
subpatternu child( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _submatchO s
" "u NodePattern._submatchNF( u __name__u
__module__u __qualname__u Falseu wildcardsu Noneu __init__u _submatch( u
__locals__( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu NodePattern. s u NodePatternc B sŒ | Ee Z d Z d Z d d e d d d „ Z d d „ Z d d d „ Z d d d
„ Z d d „ Z
d
d „ Z d d „ Z d d „ Z
d S( u WildcardPatternu
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 | k o" | k o" t k n s9 t | | f ƒ ‚ | d k rª t t t | ƒ ƒ } t | ƒ sx t t | ƒ ƒ ‚ x/ | D]$ } t | ƒ s t t | ƒ ƒ ‚ q Wn | | _ | | _ | | _ | | _
d S( uÏ
Initializer.
Args:
content: optional sequence of subsequences of patterns;
if absent, matches one node;
if present, each subsequence is an alternative [*]
min: optional minimum number of times to match, default 0
max: optional maximum number of times to 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)*
i N( u HUGEu AssertionErroru Noneu tupleu mapu lenu repru contentu minu maxu name( u selfu contentu minu maxu nameu alt( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __init__y s 9
% u WildcardPattern.__init__c C s/ d } | j d k rW t | j ƒ d k rW t | j d ƒ d k rW | j d d } n | j d k r¿ | j d k r¿ | j d k r” t d | j ƒ S| d k r¿ | j | j k r¿ | j ƒ Sn | j d k r+t | t ƒ r+| j d k r+| j | j k r+t | j | j | j | j | j | j ƒ S| S( u+ Optimize certain stacked wildcard patterns.i i u nameN(
u Noneu contentu lenu minu maxu NodePatternu nameu optimizeu
isinstanceu WildcardPattern( u selfu
subpattern( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu optimizeœ s .
!
u WildcardPattern.optimizec C s | j | g | ƒ S( u' Does this pattern exactly match a node?( u match_seq( u selfu nodeu results( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu match¯ s u WildcardPattern.matchc C su xn | j | ƒ D]] \ } } | t | ƒ k r | d k ri | j | ƒ | j ri t | ƒ | | j s u NegatedPattern.generate_matchesN( u __name__u
__module__u __qualname__u Noneu __init__u matchu match_sequ generate_matches( u
__locals__( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu NegatedPattern' s
u NegatedPatternc c sÀ | s d i f Vn¨ | d | d d … } } xŠ | j | ƒ D]y \ } } | s_ | | f Vq? xV t | | | d … ƒ D]; \ } } i } | j | ƒ | j | ƒ | | | f Vqy Wq? Wd S( uR
Generator yielding matches for a sequence of patterns and nodes.
Args:
patterns: a sequence of patterns
nodes: a sequence of nodes
Yields:
(count, results) tuples where:
count: the entire sequence of patterns matches nodes[:count];
results: dict containing named submatches.
i i N( u generate_matchesu update( u patternsu nodesu pu restu c0u r0u c1u r1u r( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu generate_matchesJ s
&
u generate_matches( u __doc__u
__author__u sysu warningsu iou StringIOu HUGEu _type_reprsu type_repru objectu Baseu Nodeu Leafu convertu BasePatternu LeafPatternu NodePatternu WildcardPatternu NegatedPatternu generate_matches( ( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu s"
»pN V,=¼#