3 QF>]@srddlZejd kZejd kZer4ejZddlmZn ddlmZGdddeZGdddeZ Gd d d Z dS) N)UserListc@sPeZdZgfddZddZer(ddZddZd d Zdd d Z dddZ dS)ASTcCst||_tj||dS)N)internkindr__init__)selfrZkidsr M/home/psgendb/BIRCHDEV/python/lib/python3.6/site-packages/spark_parser/ast.pyrs z AST.__init__cCs|j||S)N)data)r lowhighr r r __getslice__szAST.__getslice__cCs |j|S)N)r )r ir r r __getitem__szAST.__getitem__cCs0t|tr"|j|jko tj||S|j|kSdS)N) isinstancerrr__eq__)r or r r rs   z AST.__eq__cCs t|jS)N)hashr)r r r r __hash__ sz AST.__hash__cCs |j|dS)N) __repr1__)r indentr r r __repr__#sz AST.__repr__NcCst|j}|dk rd||f}d}t|dkrB|dt|7}d}||}|d7}d}xp|D]h}t|dr|r||j||}q|j|d}n&|r|d|t|f}n |t|}|d |7}|d7}q\W|S) Nz%d. %sFz (%d)Tz rr )strrlenhasattrr)r rZsibNumrvZenumerate_childrenrnodechildr r r r&s*        z AST.__repr1__)r)N) __name__ __module__ __qualname__rrPYTHON37rrrrrr r r r r s  rc@s eZdZdS)#GenericASTTraversalPruningExceptionN)r#r$r%r r r r r'Asr'c@sDeZdZdZddZddZddZdd d Zdd d Zd dZ dS)GenericASTTraversala GenericASTTraversal is a Visitor pattern according to Design Patterns. For each node it attempts to invoke the method n_, falling back onto the default() method if the n_* can't be found. The preorder traversal also looks for an exit hook named n__exit (no default routine is called if it's not found). To prematurely halt traversal of a subtree, call the prune() method -- this only makes sense for a preorder traversal. Node type is determined via the typestring() method. cCs ||_dS)N)ast)r r)r r r rNszGenericASTTraversal.__init__cCs|jS)N)r)r r!r r r typestringQszGenericASTTraversal.typestringcCstdS)N)r')r r r r pruneTszGenericASTTraversal.pruneNc Cs|dkr|j}y:d|j|}t||rWy:d|j|}t||r~t||}||n |j|Wntk rdSX|d}t||rt||}||dS)aWalk the tree in roughly 'postorder' (a bit of a lie explained below). For each node with typestring name *name* if the node has a method called n_*name*, call that before walking children. If there is no method define, call a self.default(node) instead. Subclasses of GenericASTTtraversal ill probably want to override this method. If the node has a method called *name*_exit, that is called after all children have been called. So in this sense this function is a lie. In typical use a node with children can call "postorder" in any order it wants which may skip children or order then in ways other than first to last. In fact, this this happens. Nr,r-) r)iter TypeError postorderr*rr.r/r')r r!firstr3r1r2r r r r6|s*        zGenericASTTraversal.postordercCsdS)zDefault action to take on an ASTNode. Our defualt is to do nothing. Subclasses will probably want to define this for other behavior.Nr )r r!r r r r/szGenericASTTraversal.default)N)N) r#r$r%__doc__rr*r+r0r6r/r r r r r(Ds  % -r()rr)rr) sys version_infoZPYTHON3r&r collectionsrr BaseExceptionr'r(r r r r s   4