i fm @ 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) z
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.
z#Guido van Rossum N)StringIOic 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.
N)r r! r# r" r; fixers_applied)r r r# contextr; rK r) r
r
r __init__ s
z
Node.__init__c C s# d | j j t | j | j f S)z)Return a canonical string representation.z
%s(%s, %r))r rB r r r# )r r
r
r __repr__ s z
Node.__repr__c C s d j t t | j S)zk
Return a pretty string representation.
This reproduces the input source exactly.
r: )joinmapr? r# )r r
r
r __unicode__ s zNode.__unicode__r= r c C s" | j | j f | j | j f k S)z Compare two nodes for equality.)r r# )r r r
r
r r s zNode._eqc C s) t | j d d | j D d | j S)z$Return a cloned (deep) copy of self.c S s g | ] } | j q Sr
)r ).0r) r
r
r
s z Node.clone..rK )rJ r r# rK )r r
r
r r s z
Node.clonec c s, x | j D] } | j Dd Hq
W| Vd S)z*Return a post-order iterator for the tree.N)r# r )r r5 r
r
r r s zNode.post_orderc c s, | Vx | j D] } | j Dd Hq Wd S)z)Return a pre-order iterator for the tree.N)r# r )r r5 r
r
r r
s zNode.pre_orderc C s | j s
d S| j d j S)zO
The whitespace and comments preceding this node in the input.
r: r )r# r; )r r
r
r _prefix_getter s zNode._prefix_getterc C s | j r | | j d _ n d S)Nr )r# r; )r r; r
r
r _prefix_setter s zNode._prefix_setterc C s4 | | _ d | j | _ | | j | <| j d S)z
Equivalent to 'node.children[i] = child'. This method also sets the
child's parent attribute appropriately.
N)r" r# r& )r r2 r5 r
r
r set_child! s
zNode.set_childc C s* | | _ | j j | | | j d S)z
Equivalent to 'node.children.insert(i, child)'. This method also sets
the child's parent attribute appropriately.
N)r" r# insertr& )r r2 r5 r
r
r insert_child+ s zNode.insert_childc C s' | | _ | j j | | j d S)z
Equivalent to 'node.children.append(child)'. This method also sets the
child's parent attribute appropriately.
N)r" r# r% r& )r r5 r
r
r append_child4 s zNode.append_child)r= r )rB rC rD rE rM rN rQ rH rI rA r r r r rT rU rG r; rV rX rY r
r
r
r rJ s$
rJ c @ s e 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 ri 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)r, z'Concrete implementation for leaf nodes.r: r Nc C sk | d k r* | \ | _ \ | _ | _ n | | _ | | _ | d k rT | | _ n | d d | _ d S)z
Initializer.
Takes a type constant (a token number < 256), a string value, and an
optional context keyword argument.
N)_prefixr- columnr valuerK )r r r\ rL r; rK r
r
r rM G s z
Leaf.__init__c C s d | j j | j | j f S)z)Return a canonical string representation.z
%s(%r, %r))r rB r r\ )r r
r
r rN Z s z
Leaf.__repr__c C s | j t | j S)zk
Return a pretty string representation.
This reproduces the input source exactly.
)r; r? r\ )r r
r
r rQ ` s zLeaf.__unicode__r= c C s" | j | j f | j | j f k S)z Compare two nodes for equality.)r r\ )r r r
r
r r k s zLeaf._eqc C s4 t | j | j | j | j | j f f d | j S)z$Return a cloned (deep) copy of self.rK )r, r r\ r; r- r[ rK )r r
r
r r o s z
Leaf.clonec c s | Vd S)Nr
)r r
r
r r8 u s z Leaf.leavesc c s | Vd S)z*Return a post-order iterator for the tree.Nr
)r r
r
r r x s zLeaf.post_orderc c s | Vd S)z)Return a pre-order iterator for the tree.Nr
)r r
r
r r | s zLeaf.pre_orderc C s | j S)zP
The whitespace and comments preceding this token in the input.
)rZ )r r
r
r rT s zLeaf._prefix_getterc C s | j | | _ d S)N)r& rZ )r r; r
r
r rU s
zLeaf._prefix_setter)r= r )rB rC rD rE rZ r- r[ rM rN rQ rH rI rA r r r8 r r rT rU rG r; r
r
r
r r, > s& r, c C sk | \ } } } } | s' | | j k rT t | d k rA | d St | | d | St | | d | Sd S)z
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.
r r rL N)Z
number2symbollenrJ r, )ZgrZraw_noder r\ rL r# r
r
r convert s r^ c @ sv e 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) BasePatterna
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.
Nc O s
t j | S)z>Constructor that prevents BasePattern from being instantiated.)r r )r r r r
r
r r s zBasePattern.__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)Nr z%s(%s)z, r` ) r r contentr r rB rO rP repr)r r r
r
r rN s zBasePattern.__repr__c C s | S)z
A subclass can define this as a hook for optimizations.
Returns either self or another node with the same effect.
r
)r r
r
r optimize s zBasePattern.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 = 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.
NT)r! r1 r WildcardPattern wildcardsr ra r )r r ra r r2 itemr
r
r rM % s zNodePattern.__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)a
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)ro rk ra r# r] re ziprh )r r. rf crg
subpatternr5 r
r
r rd B s
" "zNodePattern._submatch)rB rC rD ro rM rd r
r
r
r rm ! s rm c @ s e 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)rn a
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.
Nr c C s] | d k r5 t t t | } x | D] } q( Wn | | _ | | _ | | _ | | _ d S)a
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)*
N)tuplerP ra minmaxr )r ra ru rv r altr
r
r rM l s
zWildcardPattern.__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)z+Optimize certain stacked wildcard patterns.Nr r r ) ra r] ru rv rm r rc r rn )r rs r
r
r rc s .
!
zWildcardPattern.optimizec C s | j | g | S)z'Does this pattern exactly match a node?)rj )r r. rf r
r
r rh s zWildcardPattern.matchc C su xn | j | D]] \ } } | t | k r | d k ri | j | | j ri t | | | j s"
nN V,=#