#include <ast.h>
Inheritance diagram for exprstmtNode::
Public Methods | |
exprstmtNode (exprNode *expr) | |
Create an expression statement. More... | |
virtual | ~exprstmtNode () |
Destroy a exprstmtNode. More... | |
typeNode * | base_type (bool TdefIndir) const |
Return the base data type of a node. More... | |
virtual void | dataflow (FlowVal *v, FlowProblem &fp) |
Run the dataflow analyzer. More... | |
virtual Node * | clone () const |
Clone the input node. More... | |
virtual void | output_stmt (output_context &ct, Node *par) |
Output a statement. More... | |
Accessors | |
Methods to get and set fields in the class. | |
exprNode * | expr () const |
exprNode * | get_expr () |
void | expr (exprNode *expr) |
AST Traversal | |
virtual void | visit (Visitor *the_visitor) |
Dispatch a Visitor. More... | |
virtual void | walk (Walker &the_walker) |
Dispatch a Walker. More... | |
virtual Node * | change (Changer &the_changer, bool redispatch=false) |
Dispatch a Changer. More... | |
Private Attributes | |
TREE exprNode * | _expr |
the expression. More... |
This class represent simple statements that just consist of an expression. This is just a wrapper that makes explicit that fact that any expression is also a statement.
The NodeType is Expr
|
Create an expression statement. The new statement has the given expression
|
|
Destroy a exprstmtNode.
|
|
Return the base data type of a node. This method differs from the Node::type() method in two respects. First, it follows some of the simple type inferences. For example, calling it on an idNode will return the type of its declaration. Second, the boolean argument indicates whether or not to follow typedef links.
Reimplemented from Node. |
|
Dispatch a Changer. This abstract method works much the walker, but allows the tree to be changed.
Reimplemented from Node. |
|
Clone the input node. This is not a "deep" clone, so be careful. For a deep clone, use the clone_changer class.
Reimplemented from Node. |
|
Run the dataflow analyzer. Each subclass overrides this method to define it's semantics for dataflow analysis. It alters the input flow value to reflect the effect of the node within the given flow problem, calling dataflow() on it's subtrees as necessary. See the dataflow analysis documentation for more information.
Reimplemented from Node. |
|
|
|
|
|
|
|
Output a statement.
Reimplemented from stmtNode. |
|
Dispatch a Visitor. This abstract method is the entry point for the visitor design pattern. Each node subclass defines a visit() method that calls the appropriate at_ method in the visitor. For more information see the Visitor documentation.
Reimplemented from Node. |
|
Dispatch a Walker. This abstract method works much like the visitor, but instead walks the entire underlying subtree calling the appropriate at_ method at each node. For more information see the Walker documentation.
Reimplemented from Node. |
|
the expression.
|