public class ASTPtLogicalNode extends ASTPtRootNode
ASTPtRootNode
,
PtParser
,
Token
Modifier and Type | Field and Description |
---|---|
protected Token |
_lexicalToken |
_children, _id, _isConstant, _parent, _ptToken, _ptType
Constructor and Description |
---|
ASTPtLogicalNode(int id) |
ASTPtLogicalNode(PtParser p,
int id) |
Modifier and Type | Method and Description |
---|---|
Token |
getOperator()
Return the operator for child nodes of this node.
|
boolean |
isCongruent(ASTPtRootNode node,
java.util.Map renaming)
Return true if this node is (hierarchically) congruent to the
given node, under the given renaming of bound identifiers.
|
boolean |
isLogicalAnd()
Return true if the node represents the logical AND of its
children.
|
boolean |
isLogicalOr()
Return true if the node represents the logical OR of its
children.
|
void |
visit(ParseTreeVisitor visitor)
Traverse this node with the given visitor.
|
clone, displayParseTree, evaluateParseTree, getToken, getType, isConstant, isEvaluated, jjtAddChild, jjtClose, jjtGetChild, jjtGetNumChildren, jjtGetParent, jjtOpen, jjtSetParent, setConstant, setToken, setType, toString, toString
protected Token _lexicalToken
public ASTPtLogicalNode(int id)
public ASTPtLogicalNode(PtParser p, int id)
public Token getOperator()
public boolean isCongruent(ASTPtRootNode node, java.util.Map renaming)
isCongruent
in class ASTPtRootNode
node
- The node to compare to.renaming
- A map from String to String that gives a
renaming from identifiers in this node to identifiers in the
given node.public boolean isLogicalAnd()
public boolean isLogicalOr()
public void visit(ParseTreeVisitor visitor) throws IllegalActionException
visit
in class ASTPtRootNode
visitor
- The visitor.IllegalActionException
- Always thrown in this base
class the visit() method is not implemented here.