RoseAst¶
Interface for iterating over an AST.
Synopsis¶
Declared in <src/midend/abstractLayer/RoseAst.h>
class RoseAst; Description¶
The iterator follows the STL iterator pattern and is implemented as a depth-first, pre-order traversal that maintains its own stack. The iterator performs the exact same traversal as the traversal classes in ROSE (it is using the same underlying information).
#include <RoseAst.h>
SgNode *node = .... // any subtree
RoseAst ast(node);
for (RoseAst::iterator i = ast.begin(); i != ast.end(); ++i)
std::cout <<"We are here: " <<(*i)->class_name() <<"\n";
Types¶
| Name | Description |
|---|---|
iterator | AST iterator. |
Type Aliases¶
| Name |
|---|
elementType |
pointer |
reference |
size_type |
Member Functions¶
| Name | Description |
|---|---|
RoseAstRoseAst(SgNode* astNode); [constructor] | Defines the starting node for traversal. |
beginiterator begin(); | Iterator positioned at root of subtree. |
enditerator end(); | Iterator positioned at the end of the traversal. |
Private Data Members¶
| Name |
|---|
_startNode |
Created with MrDocs