Ñò V}òOc@sýdZddklZddklZddklZlZd„ZdZ dZ dZ dZ d Z d Zd Zd Zd efd„ƒYZdefd„ƒYZdefd„ƒYZdefd„ƒYZdefd„ƒYZdefd„ƒYZdS(s& @package antlr3.tree @brief ANTLR3 runtime package, treewizard module A utility module to create ASTs at runtime. See for an overview. Note that the API of the Python implementation is slightly different. iÿÿÿÿ(tINVALID_TOKEN_TYPE(t CommonToken(t CommonTreetCommonTreeAdaptorcCs,|djohStd„t|ƒDƒƒS(sk Compute a dict that is an inverted index of tokenNames (which maps int token types to names). css%x|]\}}||fVqWdS(N((t.0ttypetname((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pys 5s N(tNonetdictt enumerate(t tokenNames((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pytcomputeTokenTypes,s iiiiiiitTreePatternLexercBs?eZd„ZedƒZeedƒBZd„Zd„ZRS(cCsJ||_d|_d|_t|ƒ|_d|_t|_|i ƒdS(Niÿÿÿÿ( tpatterntpRtctlentntsvaltFalseterrortconsume(tselfR ((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyt__init__Cs     t5abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_t 0123456789cCsd|_x|itjoï|idjo|iƒq n|i|ijoX|i|i7_|iƒx4|i|ijo |i|i7_|iƒqoWtS|idjo|iƒtS|idjo|iƒtS|idjo|iƒt S|id jo|iƒt S|id jo|iƒt S|id jo |iƒx„|id jos|id joC|iƒ|id jo|id 7_n|i|i7_n|i|i7_|iƒq`W|iƒt S|iƒt |_tSWtS(Ntt s s s t(t)t%t:t.t[t]s\(Rs s s (RRtEOFRt_TreePatternLexer__idStartChart_TreePatternLexer__idChartIDtBEGINtENDtPERCENTtCOLONtDOTtARGtTrueR(R((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyt nextToken]s\             cCsF|id7_|i|ijo t|_n|i|i|_dS(Ni(RRR#RR (R((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRšs (t__name__t __module__Rt frozensetR$R%R.R(((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyR Bs    =tTreePatternParsercBs,eZd„Zd„Zd„Zd„ZRS(cCs.||_||_||_|iƒ|_dS(N(t tokenizertwizardtadaptorR.tttype(RR3R4R5((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyR¤s   cCsU|itjo |iƒS|itjo&|iƒ}|itjo|SdSdS(N(R6R't parseTreeR&t parseNodeR#R(Rtnode((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyR «s  cCsø|itjodS|iiƒ|_|iƒ}|djodSx…|ittttfjoh|itjo#|i ƒ}|i i ||ƒqH|iƒ}|djodS|i i ||ƒqHW|it jodS|iiƒ|_|S(N( R6R'RR3R.R8R&R)R+R7R5taddChildR((Rtroottsubtreetchild((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyR7¹s&     cCsd}|itjop|iiƒ|_|itjodS|ii}|iiƒ|_|itjodS|iiƒ|_n|itjoL|iiƒ|_t ddƒ}t |ƒ}|dj o ||_ n|S|itjodS|ii}|iiƒ|_|djo|i i ƒS|}d}|itjo(|ii}|}|iiƒ|_n|ii|ƒ}|tjodS|i i||ƒ}|dj ot|tƒo ||_ n|dj ot|tƒo t|_n|S(NiR tnil(RR6R)R3R.R&RR*R+RtWildcardTreePatterntlabelR5R>R,R4t getTokenTypeRtcreateFromTypet isinstancet TreePatternR-t hasTextArg(RR@twildcardPayloadR9t tokenNamettexttargt treeNodeType((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyR8ÕsL          (R/R0RR R7R8(((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyR2£s   RDcBs eZdZd„Zd„ZRS(sY When using %label:TOKENNAME in a tree for parse(), we must track the label. cCs&ti||ƒd|_d|_dS(N(RRRR@RE(Rtpayload((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRs cCs>|idj od|idti|ƒSti|ƒSdS(NRR(R@RRttoString(R((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRLs(R/R0t__doc__RRL(((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRDs R?cBseZRS((R/R0(((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyR?$stTreePatternTreeAdaptorcBseZdZd„ZRS(s>This adaptor creates TreePattern objects for use during scan()cCs t|ƒS(N(RD(RRK((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pytcreateWithPayload+s(R/R0RMRO(((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRN(st TreeWizardcBs¤eZdZdddd„Zd„Zd„Zd„Zd„Zd„Z d„Z d„Z d „Z d „Z d „Zdd „Zd „Zdd„Zd„ZRS(s6 Build and navigate trees with this object. Must know about the names of tokens so you have to pass in a map or array of token names (from which this class can build the map). I.e., Token DECL means nothing unless the class can translate it to a token type. In order to create nodes and navigate, this class needs a TreeAdaptor. This class can build a token type -> node index for repeated use or for iterating over the various nodes with a particular type. This class works in conjunction with the TreeAdaptor rather than moving all this functionality into the adaptor. An adaptor helps build and navigate trees using methods. This class helps you do it with string patterns like "(A B C)". You can create a tree from that pattern or match subtrees against it. cCsS||_|djot|ƒ|_n'|dj otdƒ‚n||_dS(Ns&Can't have both tokenNames and typeMap(R5RR ttokenNameToTypeMapt ValueError(RR5R ttypeMap((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRBs    cCs*y|i|SWntj otSXdS(s=Using the map of token names to token types, return the type.N(RQtKeyErrorR(RRG((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRANscCs+t|ƒ}t|||iƒ}|iƒS(sü Create a tree or node from the indicated tree pattern that closely follows ANTLR tree grammar tree element syntax: (root child1 ... child2). You can also just pass in a node: ID Any node can have a text argument: ID[foo] (notice there are no quotes around foo--it's clear it's a string). nil is a special name meaning "give me a nil node". Useful for making lists: (nil A B C) is a list of A B C. (R R2R5R (RR R3tparser((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pytcreateWs cCsh}|i||ƒ|S(sWalk the entire tree and make a node name to nodes mapping. For now, use recursion but later nonrecursive version may be more efficient. Returns a dict int -> list where the list is of your AST node type. The int is the token type of the node. (t_index(Rttreetm((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pytindexlscCs«|djodS|ii|ƒ}|i|ƒ}|djog||<}n|i|ƒxEt|ii|ƒƒD]+}|ii||ƒ}|i||ƒqxWdS(sDo the work for indexN( RR5tgetTypetgettappendtranget getChildCounttgetChildRW(RttRYR6telementstiR=((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRWys   cCsXt|ttfƒo|i||ƒSt|tƒo|i||ƒStdƒ‚dS(s´Return a list of matching token. what may either be an integer specifzing the token type to find or a string with a pattern that must be matched. s 'what' must be string or integerN(RCtinttlongt_findTokenTypet basestringt _findPatternt TypeError(RRXtwhat((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pytfindŠs cs,g‰‡fd†}|i|||ƒˆS(s1Return a List of tree nodes with token type ttypecsˆi|ƒdS(N(R](RXtparentt childIndextlabels(tnodes(sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pytvisitor¡s(tvisit(RRaR6Rp((Rosx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRfœscsšg‰t|ƒ}t|ˆtƒƒ}|iƒ‰ˆdjpˆiƒptˆtƒodSˆiƒ}‡‡‡fd†}ˆi |||ƒˆS(s+Return a List of subtrees matching pattern.cs+ˆi|ˆdƒoˆi|ƒndS(N(t_parseRR](RXRlRmR@(ttpatterntsubtreesR(sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRpºsN( R R2RNR RtisNilRCR?R[Rq(RRaR R3RUt rootTokenTypeRp((RsRtRsx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRh©s   cCsjt|ttfƒo|i|dd||ƒn4t|tƒo|i|||ƒn tdƒ‚dS(sÇVisit every node in tree matching what, invoking the visitor. If what is a string, it is parsed as a pattern and only matching subtrees will be visited. The implementation uses the root node of the pattern in combination with visit(t, ttype, visitor) so nil-rooted patterns are not allowed. Patterns with wildcard roots are also not allowed. If what is an integer, it is used as a token type and visit will match all nodes of that type (this is faster than the pattern match). The labels arg of the visitor action method is never set (it's None) since using a token type rather than a pattern doesn't let us set a label. is 'what' must be string or integerN(RCRdRet _visitTypeRRgt _visitPatternRi(RRXRjRp((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRqÃs cCs—|djodS|ii|ƒ|jo||||dƒnxNt|ii|ƒƒD]4}|ii||ƒ}|i|||||ƒq[WdS(sDo the recursive work for visitN(RR5R[R^R_R`Rw(RRaRlRmR6RpRcR=((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRwÝs cs”t|ƒ}t|ˆtƒƒ}|iƒ‰ˆdjpˆiƒptˆtƒodSˆiƒ}‡‡‡fd†}ˆi |||ƒdS(sT For all subtrees that match the pattern, execute the visit action. Ncs7h}ˆi|ˆ|ƒoˆ||||ƒndS(N(Rr(RXRlRmRn(RsRpR(sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyt rootvisitorüs( R R2RNR RRuRCR?R[Rq(RRXR RpR3RURvRy((RsRRpsx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pyRxës   cCs@t|ƒ}t||tƒƒ}|iƒ}|i|||ƒS(sÍ Given a pattern like (ASSIGN %lhs:ID %rhs:.) with optional labels on the various nodes and '.' (dot) as the node/subtree wildcard, return true if the pattern matches and fill the labels Map with the labels pointing at the appropriate nodes. Return false if the pattern is malformed or the tree does not match. If a node specifies a text arg in pattern, then that must match for that node in t. (R R2RNR Rr(RRaR RnR3RURs((sx/afs/athena.mit.edu/user/x/a/xavid/lib/python2.7/site-packages/antlr_python_runtime-3.1.3-py2.6.egg/antlr3/treewizard.pytparses  c Cs=|djp |djotSt|tƒpV|ii|ƒ|iƒjotS|io$|ii|ƒ|iƒjotSn|idj o|dj o|||is$  al