Inheritance diagram for rve_interface_gen.antlr3.tree.RewriteRuleElementStream:
Public Member Functions | |
| def | __init__ |
| def | add |
| def | dup |
| def | getDescription |
| def | hasNext |
| def | nextTree |
| def | reset |
| def | size |
| def | toTree |
Public Attributes | |
| adaptor | |
| cursor | |
| dirty | |
| elementDescription | |
| elements | |
| singleElement | |
Private Member Functions | |
| def | _next |
Static Private Attributes | |
| __len__ = size | |
Detailed Description
@brief Internal helper class. A generic list of elements tracked in an alternative to be used in a -> 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
Constructor & Destructor Documentation
| def rve_interface_gen.antlr3.tree.RewriteRuleElementStream.__init__ | ( | self, | |
| adaptor, | |||
| elementDescription, | |||
elements = None |
|||
| ) |
Member Function Documentation
| def rve_interface_gen.antlr3.tree.RewriteRuleElementStream._next | ( | self | ) | [private] |
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.
| def rve_interface_gen.antlr3.tree.RewriteRuleElementStream.add | ( | self, | |
| el | |||
| ) |
| def rve_interface_gen.antlr3.tree.RewriteRuleElementStream.dup | ( | self, | |
| el | |||
| ) |
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.
Reimplemented in rve_interface_gen.antlr3.tree.RewriteRuleNodeStream, rve_interface_gen.antlr3.tree.RewriteRuleSubtreeStream, and rve_interface_gen.antlr3.tree.RewriteRuleTokenStream.
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).
| def rve_interface_gen.antlr3.tree.RewriteRuleElementStream.toTree | ( | self, | |
| el | |||
| ) |
Ensure stream emits trees; tokens must be converted to AST nodes. AST nodes can be passed through unmolested.
Reimplemented in rve_interface_gen.antlr3.tree.RewriteRuleNodeStream, and rve_interface_gen.antlr3.tree.RewriteRuleTokenStream.
Member Data Documentation
rve_interface_gen::antlr3::tree.RewriteRuleElementStream::__len__ = size [static, private] |
The documentation for this class was generated from the following file: