V}Oc @sPdZddkZddklZlZlZlZddklZl Z ddk l Z ddk l Z lZlZddklZlZlZlZlZdefd YZd efd YZd efd YZdefdYZdefdYZdefdYZdefdYZdefdYZeeZ defdYZ!defdYZ"de fdYZ#de#fdYZ$d efd!YZ%d"efd#YZ&d$efd%YZ'd&e'fd'YZ(d(e'fd)YZ)d*e'fd+YZ*d,e fd-YZ+dS(.s @package antlr3.tree @brief ANTLR3 runtime package, tree module This module contains all support classes for AST construction and tree parsers. iN(tUPtDOWNtEOFtINVALID_TOKEN_TYPE(tBaseRecognizertRuleReturnScope(t IntStream(t CommonTokentTokent INVALID_TOKEN(tMismatchedTreeNodeExceptiontMissingTokenExceptiontUnwantedTokenExceptiontMismatchedTokenExceptiontNoViableAltExceptiontRewriteCardinalityExceptioncBs eZdZdZdZRS(s @brief Base class for all exceptions thrown during AST rewrite construction. This signifies a case where the cardinality of two or more elements in a subrule are different: (ID INT)+ where |ID|!=|INT| cCsti||||_dS(N(t RuntimeErrort__init__telementDescription(tselfR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRCscCs|iS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt getMessageIs(t__name__t __module__t__doc__RR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR;s tRewriteEarlyExitExceptioncBseZdZddZRS(s4@brief No elements within a (...)+ in a rewrite rulecCsti||dS(N(RR(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRPsN(RRRtNoneR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRMstRewriteEmptyStreamExceptioncBseZdZRS(sX @brief Ref to ID or expr but no tokens in ID stream or subtrees in expr stream (RRR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRTstTreecBseZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZdZdZdZdZdZdZdZdZdZdZdZdZRS(s. @brief Abstract baseclass for tree nodes. What does a tree look like? ANTLR has a number of support classes such as CommonTreeNodeStream that work on these kinds of trees. You don't have to make your trees implement this interface, but if you do, you'll be able to use more support code. NOTE: When constructing trees, ANTLR can build any kind of tree; it can even use Token objects as trees if you add a child list to your tokens. This is a tree node without any payload; just navigation and factory stuff. cCs tdS(N(tNotImplementedError(Rti((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetChildrscCs tdS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt getChildCountvscCs tdS(s,Tree tracks parent and child index now > 3.0N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt getParentzscCs tdS(s,Tree tracks parent and child index now > 3.0N(R(Rtt((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt setParentscCs tdS(s7Walk upwards looking for ancestor with this token type.N(R(Rtttype((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt hasAncestorscCs tdS(s9Walk upwards and get first ancestor with this token type.N(R(RR#((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt getAncestorscCs tdS(sReturn a list of all ancestors of this node. The first node of list is the root and the last is the parent of this node. N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt getAncestorsscCs tdS(s%This node is what child index? 0..n-1N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt getChildIndexscCs tdS(s%This node is what child index? 0..n-1N(R(Rtindex((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt setChildIndexscCs tdS(s6Set the parent and child index values for all childrenN(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytfreshenParentAndChildIndexesscCs tdS(s Add t as a child to this node. If t is null, do nothing. If t is nil, add all children of t to this' children. N(R(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytaddChildscCs tdS(s@Set ith child (0..n-1) to t; t must be non-null and non-nil nodeN(R(RRR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytsetChildscCs tdS(N(R(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt deleteChildscCs tdS(s# Delete children from start to stop and replace with t even if t is a list (nil-root tree). num of children can increase or decrease. For huge child lists, inserting children can force walking rest of children to set their childindex; could be slow. N(R(RtstartChildIndextstopChildIndexR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytreplaceChildrenscCs tdS(sx Indicates the node is a nil node but may still have children, meaning the tree is a flat list. N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytisNilscCs tdS(so What is the smallest token index (indexing from 0) for this node and its children? N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetTokenStartIndexscCs tdS(N(R(RR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytsetTokenStartIndexscCs tdS(sk What is the largest token index (indexing from 0) for this node and its children? N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetTokenStopIndexscCs tdS(N(R(RR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytsetTokenStopIndexscCs tdS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytdupNodescCs tdS(s-Return a token type; needed for tree parsing.N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetTypescCs tdS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetTextscCs tdS(sU In case we don't have a token payload, what is the line for errors? N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetLinescCs tdS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetCharPositionInLinescCs tdS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt toStringTreescCs tdS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyttoString s(RRRRRR R"R$R%R&R'R)R*R+R,R-R0R1R2R3R4R5R6R7R8R9R:R;R<(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRbs6                    t TreeAdaptorcBseZdZdZdZdZdZdZdZdZ dZ d Z d Z dd Zd Zd ZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZ dZ!RS( s @brief Abstract baseclass for tree adaptors. How to create and navigate trees. Rather than have a separate factory and adaptor, I've merged them. Makes sense to encapsulate. This takes the place of the tree construction code generated in the generated code in 2.x and the ASTFactory. I do not need to know the type of a tree at all so they are all generic Objects. This may increase the amount of typecasting needed. :( cCs tdS(s Create a tree node from Token object; for CommonTree type trees, then the token just becomes the payload. This is the most common create call. Override if you want another kind of node to be built. N(R(Rtpayload((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytcreateWithPayloads cCs tdS(s]Duplicate a single tree node. Override if you want another kind of node to be built.N(R(RttreeNode((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR6*scCs tdS(s9Duplicate tree recursively, using dupNode() for each nodeN(R(Rttree((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytdupTree2scCs tdS(s Return a nil node (an empty but non-null node) that can hold a list of element as the children. If you want a flat tree (a list) use "t=adaptor.nil(); t.addChild(x); t.addChild(y);" N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytnil8scCs tdS(s Return a tree node representing an error. This node records the tokens consumed during error recovery. The start token indicates the input symbol at which the error was detected. The stop token indicates the last symbol consumed during recovery. You must specify the input stream so that the erroneous text can be packaged up in the error node. The exception could be useful to some applications; default implementation stores ptr to it in the CommonErrorNode. This only makes sense during token parsing, not tree parsing. Tree parsing should happen only when parsing and tree construction succeed. N(R(Rtinputtstarttstoptexc((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt errorNodeBscCs tdS(s@Is tree considered a nil node used to make lists of child nodes?N(R(RRA((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR1VscCs tdS(s Add a child to the tree t. If child is a flat tree (a list), make all in list children of t. Warning: if t has no children, but child does and child isNil then you can decide it is ok to move children to t via t.children = child.children; i.e., without copying the array. Just make sure that this is consistent with have the user will build ASTs. Do nothing if t or child is null. N(R(RR!tchild((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR+\s cCs tdS(s- If oldRoot is a nil root, just copy or move the children to newRoot. If not a nil root, make oldRoot a child of newRoot. old=^(nil a b c), new=r yields ^(r a b c) old=^(a b c), new=r yields ^(r ^(a b c)) If newRoot is a nil-rooted single child tree, use the single child as the new root node. old=^(nil a b c), new=^(nil r) yields ^(r a b c) old=^(a b c), new=^(nil r) yields ^(r ^(a b c)) If oldRoot was null, it's ok, just return newRoot (even if isNil). old=null, new=r yields r old=null, new=^(nil r) yields ^(nil r) Return newRoot. Throw an exception if newRoot is not a simple node or nil root with a single child node--it must be a root node. If newRoot is ^(nil x) return x as newRoot. Be advised that it's ok for newRoot to point at oldRoot's children; i.e., you don't have to copy the list. We are constructing these nodes so we should have this control for efficiency. N(R(RtnewRoottoldRoot((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt becomeRootiscCs tdS(sn Given the root of the subtree created for this rule, post process it to do any simplifications or whatever you want. A required behavior is to convert ^(nil singleSubtree) to singleSubtree as the setting of start/stop indexes relies on a single non-nil root for non-flat trees. Flat trees such as for lists like "idlist : ID+ ;" are left alone unless there is only one ID. For a list, the start/stop indexes are set in the nil node. This method is executed after all rule tree construction and right before setTokenBoundaries(). N(R(Rtroot((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytrulePostProcessingscCs tdS(sFor identifying trees. How to identify nodes so we can say "add node to a prior node"? Even becomeRoot is an issue. Use System.identityHashCode(node) usually. N(R(Rtnode((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt getUniqueIDscCs tdS(s0 Create a new node derived from a token, with a new token type and (optionally) new text. This is invoked from an imaginary node ref on right side of a rewrite rule as IMAG[$tokenLabel] or IMAG[$tokenLabel "IMAG"]. This should invoke createToken(Token). N(R(Rt tokenTypet fromTokenttext((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytcreateFromTokens cCs tdS(sCreate a new node derived from a token, with a new token type. This is invoked from an imaginary node ref on right side of a rewrite rule as IMAG["IMAG"]. This should invoke createToken(int,String). N(R(RRQRS((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytcreateFromTypes cCs tdS(s9For tree parsing, I need to know the token type of a nodeN(R(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR7scCs tdS(s,Node constructors can set the type of a nodeN(R(RR!ttype((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytsetTypescCs tdS(N(R(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR8scCs tdS(s,Node constructors can set the text of a nodeN(R(RR!RS((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytsetTextscCs tdS(sReturn the token object from which this node was created. Currently used only for printing an error message. The error display routine in BaseRecognizer needs to display where the input the error occurred. If your tree of limitation does not store information that can lead you to the token, you can create a token filled with the appropriate information and pass that back. See BaseRecognizer.getErrorMessage(). N(R(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetTokens cCs tdS(sg Where are the bounds in the input token stream for this node and all children? Each rule that creates AST nodes will call this method right before returning. Flat trees (i.e., lists) will still usually have a nil root node just to hold the children list. That node would contain the start/stop indexes then. N(R(RR!t startTokent stopToken((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytsetTokenBoundariess cCs tdS(sX Get the token start index for this subtree; return -1 if no such index N(R(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR2scCs tdS(sW Get the token stop index for this subtree; return -1 if no such index N(R(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR4scCs tdS(sGet a child 0..n-1 nodeN(R(RR!R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs tdS(s@Set ith child (0..n-1) to t; t must be non-null and non-nil nodeN(R(RR!RRI((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR, scCs tdS(s4Remove ith child and shift children down from right.N(R(RR!R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR-scCs tdS(s2How many children? If 0, then this is a leaf nodeN(R(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs tdS(s Who is the parent node of this node; if null, implies node is root. If your node type doesn't handle this, it's ok but the tree rewrites in tree parsers need this functionality. N(R(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR scCs tdS(s Who is the parent node of this node; if null, implies node is root. If your node type doesn't handle this, it's ok but the tree rewrites in tree parsers need this functionality. N(R(RR!tparent((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR")scCs tdS(s What index is this node in the child list? Range: 0..n-1 If your node type doesn't handle this, it's ok but the tree rewrites in tree parsers need this functionality. N(R(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR'3scCs tdS(s What index is this node in the child list? Range: 0..n-1 If your node type doesn't handle this, it's ok but the tree rewrites in tree parsers need this functionality. N(R(RR!R(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR)=scCs tdS(sD Replace from start to stop child index of parent with t, which might be a list. Number of children may be different after this call. If parent is null, don't do anything; must be at root of overall tree. Can't replace whatever points to the parent externally. Do nothing. N(R(RR]R.R/R!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR0Gs cGst|djo&t|dto|i|dSt|djoGt|dttfo-t|dto|i|d|dSt|djobt|dttfoHt|dto4t|dto |i|d|d|dSt|djoGt|dttfo-t|dto|i|d|dSt ddi d|DdS( s Deprecated, use createWithPayload, createFromToken or createFromType. This method only exists to mimic the Java interface of TreeAdaptor. iiiis.No create method with this signature found: %ss, css"x|]}t|iVqWdS(N(RVR(t.0tv((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pys s N( tlent isinstanceRR?tinttlongRTt basestringRUt TypeErrortjoin(Rtargs((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytcreateVs$' N("RRRR?R6RBRCRHR1R+RLRNRPRRTRUR7RWR8RXRYR\R2R4RR,R-RR R"R'R)R0Rh(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR=s>                   tBaseTreecBseZdZddZdZdZdZdZdZ dZ dZ d Z d Z d Zd d ZdddZdZdZdZdZdZdZdZdZdZdZdZRS(sV @brief A generic tree implementation with no payload. You must subclass to actually have any user data. ANTLR v3 uses a list of children approach instead of the child-sibling approach in v2. A flat tree (a list) is an empty node whose children represent the list. An empty, but non-null node is called "nil". cCs,ti|g|_d|_d|_dS(s Create a new node from an existing node does nothing for BaseTree as there are no fields other than the children list, which cannot be copied as the children are not considered part of this node. iN(RRtchildrenRR]t childIndex(RRO((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRs   cCs*y|i|SWntj odSXdS(N(Rjt IndexErrorR(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs|iS(s@brief Get the children internal List Note that if you directly mess with the list, do so at your own risk. (Rj(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt getChildrenscCs0x)|iD]}|i|jo|Sq WdS(N(RjR7R(RttreeTypeRI((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetFirstChildWithTypes   cCs t|iS(N(R`Rj(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs|djodS|iox|i|ijotdnx<t|iD]+\}}||_t|i||_qRW|i|i7_n0|ii|||_t|id|_dS(sAdd t as child of this node. Warning: if t has no children, but child does and child isNil then this routine moves children to t via t.children = child.children; i.e., without copying the array. Ns#attempt to add child list to itselfi( RR1Rjt ValueErrort enumerateR]R`Rktappend(Rt childTreetidxRI((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR+s     cCs|i|7_dS(s6Add all elements of kids list as children of this nodeN(Rj(RRj((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt addChildrenscCsR|djodS|iotdn||i|<||_||_dS(Ns Can't set single child to a list(RR1RpRjR]Rk(RRR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR,s    cCsL|i|}|i|=x.t|i|D]\}}|||_q+W|S(N(RjRqRk(RRtkilledRtRI((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR- s    c Cs |t|ijp|t|ijotdn||d}|io |i}n |g}t|}||}|djoHxst|D]3\}} | |i||<|| _||| _qWn/|i||d5||i||+|i|dS(s# Delete children from start to stop and replace with t even if t is a list (nil-root tree). num of children can increase or decrease. For huge child lists, inserting children can force walking rest of children to set their childindex; could be slow. sindexes invalidiiN(R`RjRlR1RqR]RkR*( RR.R/tnewTreetreplacingHowManyt newChildrentreplacingWithHowManytdeltaRtRI((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR0s$        cCstS(N(tFalse(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR1GsicCs>x7t|i|D]"\}}|||_||_qWdS(N(RqRjRkR](RtoffsetRtRI((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR*Ks  icCs||ijotd||ifn||ijotd||ifnx-t|iD]\}}|i||qjWdS(Ns)parents don't match; expected %r found %rs/child indexes don't match; expected %d found %d(R]RpRkRqRjt sanityCheckParentAndChildIndexes(RR]RRtRI((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR~Qs cCsdS(s%BaseTree doesn't track child indexes.i((R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR'bscCsdS(s%BaseTree doesn't track child indexes.N((RR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR)hscCsdS(s'BaseTree doesn't track parent pointers.N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR nscCsdS(s'BaseTree doesn't track parent pointers.N((RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR"sscCs|i|dj S(s7Walk upwards looking for ancestor with this token type.N(R%R(RR#((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR$yscCsI|i}x6|dj o(|i|jo|S|i}qWdS(s9Walk upwards and get first ancestor with this token type.N(R RR7(RR#R!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR%}s  cCs\tdjodSg}|i}x.|dj o |id||i}q*W|S(sReturn a list of all ancestors of this node. The first node of list is the root and the last is the parent of this node. iN(t selfgetParentRR tinsert(Rt ancestorsR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR&s  cCst|idjo |iSg}|ip1|id|i|i|idnxNt|iD]=\}}|djo|idn|i|iquW|ip|idndi|S(s&Print out a whole tree not just a nodeit(t t)t(R`RjR<R1RrRqR;Rf(RtbufRRI((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR;s      cCsdS(Ni((R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR9scCsdS(Ni((R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR:scCs tdS(s;Override to say how a node (not a tree) should look as textN(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR<sN(RRRRRRRmRoRR+RuR,R-R0R1R*R~R'R)R R"R$R%R&R;R9R:R<(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRis2     "  .           tBaseTreeAdaptorcBseZdZdZdZdZddZdZdZ dZ ddZ d Z d Z d Zd Zd ZdZdZdZdZdZddddZRS(sG @brief A TreeAdaptor that works with any Tree implementation. cCs |idS(N(R?R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRCscCst||||S(s create tree node that holds the start and stop tokens associated with an error. If you specify your own kind of tree nodes, you will likely have to override this method. CommonTree returns Token.INVALID_TOKEN_TYPE if no token payload but you might have to set token type for diff node type. You don't have to subclass CommonErrorNode; you will likely need to subclass your own tree node class to avoid class cast exception. (tCommonErrorNode(RRDRERFRG((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRHscCs |iS(N(R1(RRA((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR1scCs|djodS|i|}|i||i||i||xQt|i|D]:}|i||}|i||}|i ||q`W|S(s This is generic in the sense that it will work with any kind of tree (not just Tree interface). It invokes the adaptor routines not the tree node routines to do the construction. N( RR6R)R'R"trangeRRRBR+(RR!R]RwRRIt newSubTree((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRBs cCs/|dj o|dj o|i|ndS(s Add a child to the tree t. If child is a flat tree (a list), make all in list children of t. Warning: if t has no children, but child does and child isNil then you can decide it is ok to move children to t via t.children = child.children; i.e., without copying the array. Just make sure that this is consistent with have the user will build ASTs. N(RR+(RRARI((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR+s cCst|to|i|}n|djo|St|tp|i|}n|ioM|i}|djo|id}q|djot dqn|i ||S(s If oldRoot is a nil root, just copy or move the children to newRoot. If not a nil root, make oldRoot a child of newRoot. old=^(nil a b c), new=r yields ^(r a b c) old=^(a b c), new=r yields ^(r ^(a b c)) If newRoot is a nil-rooted single child tree, use the single child as the new root node. old=^(nil a b c), new=^(nil r) yields ^(r a b c) old=^(a b c), new=^(nil r) yields ^(r ^(a b c)) If oldRoot was null, it's ok, just return newRoot (even if isNil). old=null, new=r yields r old=null, new=^(nil r) yields ^(nil r) Return newRoot. Throw an exception if newRoot is not a simple node or nil root with a single child node--it must be a root node. If newRoot is ^(nil x) return x as newRoot. Be advised that it's ok for newRoot to point at oldRoot's children; i.e., you don't have to copy the list. We are constructing these nodes so we should have this control for efficiency. iismore than one node as rootN( RaRRhRt CommonTreeR?R1RRRR+(RRJRKtnc((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRL s      cCs|dj on|ioa|idjo d}q{|idjo-|id}|id|idq{n|S(s'Transform ^(nil x) to x and nil to nulliiiN(RR1RRR"R)(RRM((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRNDs  cCst|ttfptt|it|tptt|i|djp#t|tptt|i|i |}||_|dj o ||_ n|i |}|S(N( RaRbRctAssertionErrorRVRRRRdt createTokenRSR?(RRQRRRSR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRTTs)#0   cCst|ttfptt|it|tp |djptt|i|id|d|}|i |}|S(NRQRS( RaRbRcRRVRRdRRR?(RRQRSRRR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRUas )0cCs |iS(N(R7(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR7jscCstddS(Ns!don't know enough about Tree node(R(RR!RV((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRWnscCs |iS(N(R8(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR8rscCstddS(Ns!don't know enough about Tree node(R(RR!RS((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRXvscCs |i|S(N(R(RR!R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRzscCs|i||dS(N(R,(RR!RRI((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR,~scCs |i|S(N(R-(RR!R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR-scCs |iS(N(R(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs t|S(N(thash(RRO((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRPscCs tdS(s Tell me how to create a token for use with imaginary token nodes. For example, there is probably no input symbol associated with imaginary token DECL, but you need to create it as a payload or whatever for the DECL node as in ^(DECL type ID). If you care what the token payload objects' type is, you should override this method and any other createToken variant. N(R(RRRRQRS((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRs N(RRRRCRHR1RRBR+RLRNRTRUR7RWR8RXRR,R-RRPR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRs(      7          RcBs eZdZdZdZdZdZdZeeZ dZ ee Z dZ ee Z dZeeZd Zd ZeeeZd Zd ZeeeZd ZdZdZdZdZdZeZdZRS(sq@brief A tree node that is wrapper for a Token object. After 3.0 release while building tree rewrite stuff, it became clear that computing parent and child index is very difficult and cumbersome. Better to spend the space in every tree node. If you don't want these extra fields, it's easy to cut them out in your own BaseTree subclass. cCsti|d|_d|_d|_d|_|djo d|_nxt|t o(|i|_|i|_|i|_n@|djpt|t o ||_nt t |i dS(Ni(RiRt startIndext stopIndexRR]RkttokenRaRRReRVR(RR>((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRs          cCs|iS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRYscCs t|S(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR6scCs |idjS(N(RR(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR1scCs"|idjotS|iiS(N(RRRR7(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR7scCs|idjodS|iiS(N(RRRS(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR8scCs\|idjp|iidjo)|io|idiSdSn|iiS(Ni(RRR9RR(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR9s & cCs`|idjp|iidjo)|io|idiSdSn|iiSdS(Nii(RRR:RR(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR:s & cCs5|idjo|idj o|iiS|iS(Ni(RRRt getTokenIndex(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR2 s cCs ||_dS(N(R(RR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR3scCs5|idjo|idj o|iiS|iS(Ni(RRRR(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR4s cCs ||_dS(N(R(RR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR5scCs|idjoB|idjp|idjo|ii|_|_ndSx|iD]}|iq\W|idjo|idjodS|io<|id}|id}|i|_|i|_ndS(sFor every node in this subtree, make sure it's start/stop token's are set. Walk depth first, visit bottom up. Only updates nodes with at least one token index < 0. iNi( RjRRRRRtsetUnknownTokenBoundariesR2R4(RRIt firstChildt lastChild((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR%s      cCs|iS(N(Rk(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR'?scCs ||_dS(N(Rk(RRt((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR)DscCs|iS(N(R](R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR IscCs ||_dS(N(R](RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR"NscCs4|iodS|itjodS|iiS(NRCs (R1R7RRRS(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR<Ss  cCs|ip |iSd}|ip|d|i7}n|dig}|iD]}||iqW~7}|ip|d7}n|S(NRs(%s RR(RjR<R1RfR;(Rtrett_[1]RI((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR;`s   7 (RRRRRYR6R1R7tpropertyRVR8RSR9tlineR:tcharPositionInLineR2R3ttokenStartIndexR4R5ttokenStopIndexRR'R)R R"R<t__str__R;(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRs6                     RcBs;eZdZdZdZdZdZdZRS(s9A node representing erroneous token range in token streamcCs{ti|d|djp,|i|ijo|itjo |}n||_||_||_||_ dS(N( RRRRR7RRDRERFttrappedException(RRDRERFRG((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRvs     cCstS(N(R|(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR1scCstS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR7scCst|ito`|ii}|ii}|iitjo|ii}n|ii ||}n9t|it o|ii |i|i}nd}|S(Ns ( RaRERRRFR7RRDtsizeR<R(RRtjtbadText((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR8scCst|itodt|iidSt|ito*dt|iid|idSt|ito'dt|ii d|idSt|it o'dt|ii d|idSd|idS(Nss ((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR?scCs.|dj otd|Std|d|S(s Tell me how to create a token for use with imaginary token nodes. For example, there is probably no input symbol associated with imaginary token DECL, but you need to create it as a payload or whatever for the DECL node as in ^(DECL type ID). If you care what the token payload objects' type is, you should override this method and any other createToken variant. toldTokenRVRSN(RR(RRRRQRS((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRs cCsp|djodSd}d}|dj o |i}n|dj o |i}n|i||i|dS(s Track start/stop token for subtree root created for a rule. Only works with Tree nodes. For rules that match nothing, seems like this will yield start=i and stop=i-1 in a nil node. Might be useful info so I'll not force to be i..i. Ni(RR(R3R5(RR!RZR[RERF((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR\s      cCs|djodS|iS(Ni(RR2(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR2 s cCs|djodS|iS(Ni(RR4(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR4s cCs|djodS|iS(N(RR8(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR8s cCs|djotS|iS(N(RRR7(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR7s cCst|to |iSdS(s What is the Token associated with this node? If you are not using CommonTree, then you must override this in your own adaptor. N(RaRRYR(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRY"s cCs|djodS|i|S(N(RR(RR!R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR/s cCs|djodS|iS(Ni(RR(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR5s cCs |iS(N(R (RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR ;scCs|i|dS(N(R"(RR!R]((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR"?scCs|djodS|iS(Ni(RR'(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR'Cs cCs|i|dS(N(R)(RR!R(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR)IscCs(|dj o|i|||ndS(N(RR0(RR]R.R/R!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR0Ms N(RRRR6R?RRR\R2R4R8R7RYRRR R"R'R)R0(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRs"              tTreeNodeStreamcBsVeZdZdZdZdZdZdZdZdZ dZ RS( sT@brief A stream of tree nodes It accessing nodes from a tree of some kind. cCs tdS(sGet a tree node at an absolute index i; 0..n-1. If you don't want to buffer up nodes, then this method makes no sense for you. N(R(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetlscCs tdS(sL Get tree node at current input pointer + i ahead where i=1 is next node. i<0 indicates nodes in the past. So LT(-1) is previous node, but implementations are not required to provide results for k < -1. LT(0) is undefined. For i>=n, return null. Return null for LT(0) and any index that results in an absolute address that is negative. This is analogus to the LT() method of the TokenStream, but this returns a tree node instead of a token. Makes code gen identical for both parser and tree grammars. :) N(R(Rtk((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytLTuscCs tdS(s Where is this stream pulling nodes from? This is not the name, but the object that provides node objects. N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt getTreeSourcescCs tdS(s! If the tree associated with this stream was created from a TokenStream, you can specify it here. Used to do rule $text attribute in tree parser. Optional unless you use tree parser rule text attribute or output=template and rewrite=true options. N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetTokenStreamscCs tdS(sx What adaptor can tell me how to interpret/navigate nodes and trees. E.g., get text of a node. N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetTreeAdaptorscCs tdS(sG As we flatten the tree, we use UP, DOWN nodes to represent the tree structure. When debugging we need unique nodes so we have to instantiate new ones. When doing normal tree parsing, it's slow and a waste of memory to create unique navigation nodes. Default should be false; N(R(RtuniqueNavigationNodes((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytsetUniqueNavigationNodess cCs tdS(sK Return the text of all nodes from start to stop, inclusive. If the stream does not buffer all the nodes then it can still walk recursively from start until stop. You can always return null or "" too, but users should not access $ruleLabel.text in an action of course in that case. N(R(RRERF((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR<s cCs tdS(s* Replace from start to stop child index of parent with t, which might be a list. Number of children may be different after this call. The stream is notified because it is walking the tree and might need to know you are monkeying with the underlying tree. Also, it might be able to modify the node stream to avoid restreaming for future phases. If parent is null, don't do anything; must be at root of overall tree. Can't replace whatever points to the parent externally. Do nothing. N(R(RR]R.R/R!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR0s ( RRRRRRRRRR<R0(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRbs  tCommonTreeNodeStreamcBs+eZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZdZdZdZdZdZd dZdZd dZdZdZdZdZdZdZdZ dZ!dZ"RS(!s@brief A buffered stream of tree nodes. Nodes can be from a tree of ANY kind. This node stream sucks all nodes out of the tree specified in the constructor during construction and makes pointers into the tree using an array of Object pointers. The stream necessarily includes pointers to DOWN and UP and EOF nodes. This stream knows how to mark/release for backtracking. This stream is most suitable for tree interpreters that need to jump around a lot or for tree parsers requiring speed (at cost of memory). There is some duplicated functionality here with UnBufferedTreeNodeStream but just in bookkeeping, not tree walking etc... @see UnBufferedTreeNodeStream c Gsti|t|djo/t}|d}d}d}d}d}nt|djo0|d}|d}d}d}d}d}nt|djo_|d}|d} |d} |i}|i}|i| | !}|i}|i }|i }n t d|dj o ||_n|i t d|_|dj o ||_ n|i td|_ |dj o ||_ n|i td|_ |dj o ||_n g|_||_d|_||_t|_d |_d|_g|_dS( NiiiisInvalid argumentsRRRi(RRR`RRtadaptorRMtnodestdowntupteofReRURRRttokensR|Rtpt lastMarkertcalls( RRgRRARRRRR]RERF((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRsZ                               cCs|i|id|_dS(s}Walk tree with depth-first-search and fill nodes buffer. Don't do DOWN, UP nodes if its a list (t is isNil). iN(t _fillBufferRMR(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt fillBuffer:scCs|ii|}|p|ii|n|ii|}| o|djo|itnx0t|D]"}|i|ii ||qrW| o|djo|it ndS(Ni( RR1RRrRtaddNavigationNodeRRRRR(RR!RCtntc((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRCs  cCsT|idjo|inx/t|iD]\}}||jo|Sq.WdS(sWWhat is the stream index for node? 0..n-1 Return -1 if node not found. i(RRRqR(RRORR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt getNodeIndexWs   cCsd}|tjo3|io|iitd}qu|i}n0|io|iitd}n |i}|ii |dS(s As we flatten the tree, we use UP, DOWN nodes to represent the tree structure. When debugging we need unique nodes so instantiate new ones when uniqueNavigationNodes is true. RRN( RRthasUniqueNavigationNodesRRURRRRRr(RR#tnavNode((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRfs     cCs)|idjo|in|i|S(Ni(RRR(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs|idjo|in|djodS|djo|i| S|i|dt|ijo|iS|i|i|dS(Niii(RRRtLBR`RR(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRs  !cCs |idS(Ni(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetCurrentSymbolscCs=|djodS|i|djodS|i|i|S(sLook backwards k nodesiN(RRR(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRs  cCs|iS(N(RM(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs|iiS(N(Rt getSourceName(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs|iS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs ||_dS(N(R(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytsetTokenStreamscCs|iS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs|iS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs ||_dS(N(R(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs1|idjo|in|id7_dS(Nii(RR(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytconsumescCs|ii|i|S(N(RR7R(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytLAscCs4|idjo|in|i|_|iS(Ni(RRR(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytmarkscCsdS(N((Rtmarker((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytreleasescCs|iS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR(scCs+|djo |i}n|i|dS(N(RRtseek(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytrewinds  cCs+|idjo|in||_dS(Ni(RR(RR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs$|ii|i|i|dS(sj Make stream jump to a new location, saving old location. Switch back with pop(). N(RRrRR(RR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytpushscCs#|iid}|i||S(sx Seek back to previous index saved during last push() call. Return top of stack (return index). i(RtpopR(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRs cCsd|_d|_g|_dS(Ni(RRR(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytresets  cCs+|idjo|int|iS(Ni(RRR`R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR scCs.|dj o|ii||||ndS(N(RRR0(RR]R.R/R!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR0s  cCs[|idjo|indig}|iD]}|t|ii|q2~S(s3Used for testing, just return the token type streamiR(RRRfRRRR7(RRRO((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRs c Cs|djp |djodS|idjo|in|idj o|ii|}|ii|}|ii|tjo|ii|}n.|ii|t jo|i d}n|ii ||Sd\}}x/t |i D]\}}||joPqqWg}|i |}xo||joa|ii|}|djod|ii|}n|i||d7}|i |}q5W|ii|}|djod|ii|}n|i|di|S(NiiiRiR(iN(RRRRRR2R4R7RRRR<RqRR8RrRf( RRERFtbeginTokenIndext endTokenIndexRR!RRS((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR<%s@            ccs;|idjo|inx|iD] }|Vq(WdS(Ni(RRR(RRO((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt__iter__bs  N(#RRRRRRRRRRRRRRRRRRRRRRRRR(RRRRRRR0RR<R(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRs@ Z                      =t TreeParsercBseZdZddZdZdZdZdZdZ dZ dZ d Z e ie Ze ie Zdddd Zed Zed Zd ZdZdZdZdZdZRS(s@brief Baseclass for generated tree parsers. A parser for a stream of tree nodes. "tree grammars" result in a subclass of this. All the error reporting and recovery is shared with Parser via the BaseRecognizer superclass. cCs*ti||d|_|i|dS(N(RRRRDtsetTreeNodeStream(RRDtstate((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRxs cCs5ti||idj o|iidndS(Ni(RRRDRR(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRs cCs ||_dS(sSet the input streamN(RD(RRD((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs|iS(N(RD(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetTreeNodeStreamscCs |iiS(N(RDR(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRscCs |idS(Ni(R(RRD((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetCurrentInputSymbolscCs.d|i|d}ttd|d|S(Ns rewrite rule. We need to subclass to fill in the next() method, which returns either an AST node wrapped around a token payload or an existing subtree. Once you start next()ing, do not try to add more elements. It will break the cursor tracking I believe. @see org.antlr.runtime.tree.RewriteRuleSubtreeStream @see org.antlr.runtime.tree.RewriteRuleTokenStream TODO: add mechanism to detect/puke on modification after reading from stream cCssd|_d|_d|_t|_||_||_t|t t fod|_||_n|i |dS(Ni( tcursorRt singleElementtelementsR|tdirtyRRRatlistttupletadd(RRRR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR s        cCsd|_t|_dS(s Reset the condition of this stream so that it appears we have not consumed any of its elements. Elements themselves are untouched. Once we reset the stream, any future use will need duplicates. Set the dirty bit. iN(R RR(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR s cCs|djodS|idj o|ii|dS|idjo||_dSg|_|ii|id|_|ii|dS(N(RRRrR(Rtel((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR s    cCs]|ip)|it|jo-t|djo|i}|i|S|i}|S(s= Return the next element in the stream. If out of elements, throw an exception unless size()==1. If size is 1, then return elements[0]. Return a duplicate node/subtree if stream is out of elements and size==1. If we've already used the element, dup (dirty bit set). i(RR R`t_nexttdup(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytnextTree s )  cCst|djot|in|it|jo7t|djo|i|iSt|in|idj o |id7_|i|iS|i|i|i}|id7_|S(s_ do the work of getting the next element, making sure that it's a tree node or subtree. Deal with the optimization of single- element list versus list of size > 1. Throw an exception if the stream is empty or we're out of elements and size>1. protected so you can override in a subclass if necessary. iiN( R`RRR ttoTreeRRRR(Rto((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR s cCs tdS(s' When constructing trees, sometimes we need to dup a token or AST subtree. Dup'ing a token means just creating another AST node around it. For trees, you must call the adaptor.dupTree() unless the element is for a tree root; then it must be a node dup. N(R(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR scCs|S(s Ensure stream emits trees; tokens must be converted to AST nodes. AST nodes can be passed through unmolested. ((RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR scCsF|idj o|idjp&|idj o|it|ijS(Ni(RRR RR`(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pythasNext s cCs7|idj odS|idj ot|iSdS(Nii(RRRR`(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR s cCs|iS(s8Deprecated. Directly access elementDescription attribute(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetDescription& sN(RRRRRRRRRRRRRt__len__R(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR x s "     tRewriteRuleTokenStreamcBs2eZdZdZdZdZdZRS(s@brief Internal helper class.cCs|S(N((RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR/ scCs|i}|ii|S(N(RRR?(RR!((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytnextNode5 s cCs |iS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyt nextToken: scCstddS(Ns'dup can't be called for a token stream.(Re(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR> s(RRRRRRR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR, s    tRewriteRuleSubtreeStreamcBs eZdZdZdZRS(s@brief Internal helper class.cCs`|ip)|it|jo0t|djo|i}|ii|S|i}|S(s Treat next element as a single node even if it's a subtree. This is used instead of next() when the result has to be a tree root node. Also prevents us from duplicating recently-added children; e.g., ^(type ID)+ adds ID to type and then 2nd iteration must dup the type node, but ID has been added. Referencing a rule result twice is ok; dup entire tree as we can't be adding trees as root; e.g., expr expr. Hideous code duplication here with super.next(). Can't think of a proper way to refactor. This needs to always call dup node and super.next() doesn't know which to call: dup node or dup tree. i(RR R`RRR6(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRE s  )  cCs|ii|S(N(RRB(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRb s(RRRRR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR B s tRewriteRuleNodeStreamcBs)eZdZdZdZdZRS(s Queues up nodes matched on left side of -> in a tree parser. This is the analog of RewriteRuleTokenStream for normal parsers. cCs |iS(N(R(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRm scCs|ii|S(N(RR6(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRq scCstddS(Ns&dup can't be called for a node stream.(Re(RR((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyRu s(RRRRRR(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR!g s  tTreeRuleReturnScopecBs)eZdZdZdZdZRS(s This is identical to the ParserRuleReturnScope except that the start property is a tree nodes not Token object when you are parsing trees. To be generic the tree node types have to be Object. cCsd|_d|_dS(N(RRERA(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR s cCs|iS(N(RE(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetStart scCs|iS(N(RA(R((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pytgetTree s(RRRRR#R$(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyR"{ s  (,RRtantlr3.constantsRRRRtantlr3.recognizersRRtantlr3.streamsRt antlr3.tokensRRR tantlr3.exceptionsR R R R RRRRRtobjectRR=RiRRt INVALID_NODERRRRRRR RR R!R"(((s5/mit/xavid/lib/python2.6/site-packages/antlr3/tree.pyts:# "( ! Kj/%