public class ConstraintStatementExpression extends StatementExpression
ConstraintExpression
so that it can be used in
an ExpressionStatement
.Modifier and Type | Field and Description |
---|---|
ConstraintExpression |
constraint
(¬ø) The expression representing the constraint.
|
parenthesized, typeCache, typeCacheFilled
byteOffset, line, nodeID, symbolTable
Constructor and Description |
---|
ConstraintStatementExpression(ConstraintExpression c)
Full constructor.
|
Modifier and Type | Method and Description |
---|---|
Object |
clone()
Creates a new object with the same primitive data, and recursively creates new member data
objects as well.
|
boolean |
containsQuantifiedVariable()
Determines if there are any quantified variables in this expression.
|
HashSet<Argument> |
getVariableTypes()
Returns a set of
Argument s storing the name and type of each variable that is a
subexpression of this expression. |
ASTNodeIterator |
iterator()
Returns an iterator used to successively access the children of this node.
|
void |
runPass(Pass pass)
Ensures that the correct
run() method is called for this type of node. |
void |
write(StringBuffer buffer)
Writes a string representation of this
ASTNode to the specified buffer. |
senseValueChild
public ConstraintExpression constraint
public ConstraintStatementExpression(ConstraintExpression c)
c
- The expression representing a constraint.public HashSet<Argument> getVariableTypes()
Argument
s storing the name and type of each variable that is a
subexpression of this expression. This method cannot be run before
SemanticAnalysis
runs.getVariableTypes
in class Expression
public boolean containsQuantifiedVariable()
SemanticAnalysis
runs.containsQuantifiedVariable
in class Expression
public ASTNodeIterator iterator()
public Object clone()
public void runPass(Pass pass)
run()
method is called for this type of node.public void write(StringBuffer buffer)
ASTNode
to the specified buffer. The
representation written is parsable by the LBJava compiler, but not very readable.Copyright © 2016. All rights reserved.