U ÙAT^8mc@sÀdZdZddlZddlmZdZiadd„ZGdd „d eƒZ Gd d „d e ƒZ Gd d „d e ƒZ dd„Z Gdd„deƒZ Gdd„de ƒZGdd„de ƒZGdd„de ƒZGdd„de ƒZdd„ZdS)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)ÚStringIOiÿÿÿcCsDts8ddlm}|j ¡D]\}}t|ƒtkr|t|<qt ||¡S)Né)Úpython_symbols)Ú _type_reprsZpygramrZ__dict__ZitemsÚtypeZintZ setdefault)Ztype_numrÚnameZval©rú&/usr/lib64/python3.8/lib2to3/pytree.pyÚ type_reprs   r c@sºeZdZdZdZdZdZdZdZdd„Z dd„Z dZ d d „Z d d „Z d d„Zdd„Zdd„Zdd„Zdd„Zdd„Zedd„ƒZedd„ƒZdd„Zdd „Zd!d"„Zejd#kr¶d$d%„ZdS)&ÚBasez Abstract base class for Node and Leaf. This provides some default functionality and boilerplate using the template pattern. A node may be a subnode of at most one parent. NrFcOó|tk stdƒ‚t |¡S)z7Constructor that prevents Base from being instantiated.zCannot instantiate Base)r ÚAssertionErrorÚobjectÚ__new__©ZclsÚargsZkwdsrrrr1óz Base.__new__cCs|j|jk rtS| |¡S)zW Compare two nodes for equality. This calls the method _eq(). )Ú __class__ZNotImplementedÚ_eq©ÚselfZotherrrrÚ__eq__6ó z Base.__eq__cCót‚dS)a_ Compare two nodes for equality. This is called by __eq__ and __ne__. It is only called if the two nodes have the same type. This must be implemented by the concrete subclass. Nodes should be considered equal if they have the same structure, ignoring the prefix string and other context information. N©ZNotImplementedErrorrrrrrBs zBase._eqcCr)zr Return a cloned (deep) copy of self. This must be implemented by the concrete subclass. Nr©rrrrÚcloneMóz Base.clonecCr)zx Return a post-order iterator for the tree. This must be implemented by the concrete subclass. NrrrrrÚ post_orderUrzBase.post_ordercCr)zw Return a pre-order iterator for the tree. This must be implemented by the concrete subclass. NrrrrrÚ pre_order]rzBase.pre_ordercCsÊ|jdk stt|ƒƒ‚|dk s"t‚t|tƒs2|g}g}d}|jjD]D}||kr||rdt|jj||fƒ‚|dk rv| |¡d}qB| |¡qB|sœt|j||fƒ‚|j ¡||j_|D] }|j|_q²d|_dS)z/Replace this node with a new one in the parent.NFT) Úparentr ÚstrÚ isinstanceÚlistÚchildrenZextendÚappendÚchanged)rZnewZ l_childrenZfoundÚchZxrrrÚreplacees&       z Base.replacecCs*|}t|tƒs$|jsdS|jd}q|jS)z9Return the line number which generated the invocant node.Nr)r!ÚLeafr#Úlineno©rÚnoderrrÚ get_lineno|s   zBase.get_linenocCs|jr|j ¡d|_dS)NT)rr%Ú was_changedrrrrr%…s z Base.changedcCsJ|jrFt|jjƒD]2\}}||kr|j ¡|jj|=d|_|SqdS)z‰ Remove the node from the tree. Returns the position of the node in its parent's children before it was removed. N)rÚ enumerater#r%)rÚir+rrrÚremoveŠs  z Base.removec Cs`|jdkrdSt|jjƒD]@\}}||krz|jj|dWStk rXYdSXqdS)zŸ The node immediately following the invocant in their parent's children list. If the invocant does not have a next sibling, it is None Nr)rr.r#Z IndexError©rr/ÚchildrrrÚ next_sibling—s zBase.next_siblingcCsR|jdkrdSt|jjƒD]2\}}||kr|dkr8dS|jj|dSqdS)z¤ The node immediately preceding the invocant in their parent's children list. If the invocant does not have a previous sibling, it is None. Nrr)rr.r#r1rrrÚ prev_sibling¨s zBase.prev_siblingccs|jD]}| ¡EdHqdS©N)r#Úleaves©rr2rrrr6¸s z Base.leavescCs|jdkrdSd|j ¡S)Nrr)rÚdepthrrrrr8¼s z Base.depthcCs|j}|dkrdS|jS)z Return the string immediately following the invocant node. This is effectively equivalent to node.next_sibling.prefix NÚ)r3Úprefix)rZnext_sibrrrÚ get_suffixÁszBase.get_suffix©ircCst|ƒ d¡S)NZascii)r ZencoderrrrÚ__str__Ìóz Base.__str__)Ú__name__Ú __module__Ú __qualname__Ú__doc__rrr#r-Z was_checkedrrZ__hash__rrrrr'r,r%r0Úpropertyr3r4r6r8r;ÚsysÚ version_infor=rrrrr s4        r c@sŠeZdZdZddd„Zdd„Zdd„Zejd kr4eZ d d „Z d d „Z dd„Z dd„Z edd„ƒZejdd„ƒZdd„Zdd„Zdd„ZdS)ÚNodez+Concrete implementation for interior nodes.NcCst|dkst|ƒ‚||_t|ƒ|_|jD] }|jdks@tt|ƒƒ‚||_q&|dk rV||_|rj|dd…|_nd|_dS)zð 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 rr"r#rÚreprr:Úfixers_applied)rrr#Úcontextr:rIr&rrrÚ__init__Ós   z Node.__init__cCsd|jjt|jƒ|jfS)ú)Return a canonical string representation.z %s(%s, %r))rr?r rr#rrrrÚ__repr__ìsþz Node.__repr__cCsd tt|jƒ¡S)úk Return a pretty string representation. This reproduces the input source exactly. r9)ÚjoinÚmapr r#rrrrÚ __unicode__òrzNode.__unicode__r<cCó|j|jf|j|jfkS©zCompare two nodes for equality.)rr#rrrrrýózNode._eqcCst|jdd„|jDƒ|jdS)ú$Return a cloned (deep) copy of self.cSsg|] }| ¡‘qSr)r)Z.0r&rrrZ szNode.clone..©rI)rFrr#rIrrrrrsÿz Node.cloneccs$|jD]}| ¡EdHq|VdS©z*Return a post-order iterator for the tree.N)r#rr7rrrrs zNode.post_orderccs$|V|jD]}| ¡EdHq dS©z)Return a pre-order iterator for the tree.N)r#rr7rrrr s zNode.pre_ordercCs|js dS|jdjS)zO The whitespace and comments preceding this node in the input. r9r©r#r:rrrrr:sz Node.prefixcCs|jr||jd_dS©NrrY©rr:rrrr:scCs(||_d|j|_||j|<| ¡dS)z… Equivalent to 'node.children[i] = child'. This method also sets the child's parent attribute appropriately. N)rr#r%r1rrrÚ set_child s  zNode.set_childcCs ||_|j ||¡| ¡dS)z‹ Equivalent to 'node.children.insert(i, child)'. This method also sets the child's parent attribute appropriately. N)rr#Zinsertr%r1rrrÚ insert_child*szNode.insert_childcCs||_|j |¡| ¡dS)zˆ Equivalent to 'node.children.append(child)'. This method also sets the child's parent attribute appropriately. N)rr#r$r%r7rrrÚ append_child3s zNode.append_child©NNN)r?r@rArBrKrMrQrDrEr=rrrrrCr:Úsetterr\r]r^rrrrrFÏs(ý      rFc@sŒeZdZdZdZdZdZddgfdd„Zdd„Zd d „Z e j d krFe Z d d „Z dd„Zdd„Zdd„Zdd„Zedd„ƒZejdd„ƒZdS)r(z'Concrete implementation for leaf nodes.r9rNcCsdd|krdksnt|ƒ‚|dk r8|\|_\|_|_||_||_|dk rR||_|dd…|_dS)z— Initializer. Takes a type constant (a token number < 256), a string value, and an optional context keyword argument. rrGN)r Ú_prefixr)ÚcolumnrÚvaluerI)rrrcrJr:rIrrrrKFs z Leaf.__init__cCsd|jj|j|jfS)rLz %s(%r, %r))rr?rrcrrrrrMYsþz Leaf.__repr__cCs|jt|jƒS)rN)r:r rcrrrrrQ_rzLeaf.__unicode__r<cCrRrS)rrcrrrrrjrTzLeaf._eqcCs$t|j|j|j|j|jff|jdS)rUrV)r(rrcr:r)rbrIrrrrrns þz Leaf.cloneccs |VdSr5rrrrrr6tr>z Leaf.leavesccó |VdSrWrrrrrrwrTzLeaf.post_orderccrdrXrrrrrr{rTzLeaf.pre_ordercCs|jS)zP The whitespace and comments preceding this token in the input. )rarrrrr:sz Leaf.prefixcCs| ¡||_dSr5)r%rar[rrrr:†s)r?r@rArBrar)rbrKrMrQrDrEr=rrr6rrrCr:r`rrrrr(=s*ý   r(cCsN|\}}}}|s||jkrConstructor that prevents BasePattern from being instantiated.zCannot instantiate BasePattern)rgr r rrrrrr³rzBasePattern.__new__cCsHt|jƒ|j|jg}|r,|ddkr,|d=qd|jjd tt|ƒ¡fS)Niÿÿÿÿz%s(%s)z, ) r rÚcontentrrr?rOrPrH)rrrrrrM¸szBasePattern.__repr__cCs|S)zŒ A subclass can define this as a hook for optimizations. Returns either self or another node with the same effect. rrrrrÚoptimize¾rzBasePattern.optimizecCsn|jdk r|j|jkrdS|jdk rRd}|dk r4i}| ||¡sDdS|rR| |¡|dk rj|jrj|||j<dS)a# Does this pattern exactly match a node? 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. Default implementation for non-wildcard patterns. NFT)rrhÚ _submatchÚupdater)rr+ÚresultsÚrrrrÚmatchÆs     zBasePattern.matchcCs t|ƒdkrdS| |d|¡S)z Does this pattern exactly match a sequence of nodes? Default implementation for non-wildcard patterns. rFr)rern)rÚnodesrlrrrÚ match_seqßrzBasePattern.match_seqccs&i}|r"| |d|¡r"d|fVdS)z} Generator yielding all matches for this pattern. Default implementation for non-wildcard patterns. rrN)rn)rrormrrrÚgenerate_matchesészBasePattern.generate_matchesr5r5) r?r@rArBrrhrrrMrirnrprqrrrrrgžs  rgc@s*eZdZddd„Zd dd„Zd dd„ZdS) Ú LeafPatternNcCsZ|dk r&d|krdks&nt|ƒ‚|dk rDt|tƒsDtt|ƒƒ‚||_||_||_dS)ap Initializer. Takes optional type, content, and name. The type, if given must be a token type (< 256). If not given, this matches any *leaf* node; the content may still be required. The content, if given, must be a string. If a name is given, the matching node is stored in the results dict under that key. NrrG)r r!r rHrrhr)rrrhrrrrrKös zLeafPattern.__init__cCst|tƒsdSt |||¡S)z*Override match() to insist on a leaf node.F)r!r(rgrn©rr+rlrrrrn s zLeafPattern.matchcCs |j|jkS)á„ 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. )rhrcrsrrrrjs zLeafPattern._submatchr_r5r5)r?r@rArKrnrjrrrrrrôs  rrc@s$eZdZdZddd„Zddd„ZdS) Ú NodePatternFNcCsŒ|dk r|dkst|ƒ‚|dk rvt|tƒr6tt|ƒƒ‚t|ƒ}t|ƒD].\}}t|tƒsdt||fƒ‚t|tƒrFd|_qF||_ ||_ ||_ dS)ad 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. NrGT) r r!r rHr"r.rgÚWildcardPatternÚ wildcardsrrhr)rrrhrr/ZitemrrrrK$s zNodePattern.__init__cCsŽ|jrHt|j|jƒD].\}}|t|jƒkr|dk r<| |¡dSqdSt|jƒt|jƒkr`dSt|j|jƒD]\}}| ||¡sndSqndS)rtNTF)rwrqrhr#rerkZziprn)rr+rlÚcrmÚ subpatternr2rrrrjAs   zNodePattern._submatchr_r5)r?r@rArwrKrjrrrrru s ruc@s^eZdZdZddedfdd„Zdd„Zddd „Zdd d „Zd d „Z dd„Z dd„Z dd„Z dS)rva 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. NrcCsd|kr|krtks,nt||fƒ‚|dk rtttt|ƒƒ}t|ƒsVtt|ƒƒ‚|D]}t|ƒsZtt|ƒƒ‚qZ||_||_||_||_ dS)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)* rN) ÚHUGEr ZtuplerPrerHrhÚminÚmaxr)rrhr{r|rÚaltrrrrKks,zWildcardPattern.__init__cCsÒd}|jdk rs$   1nNV,==#