Package | Description |
---|---|
edu.illinois.cs.cogcomp.lbjava | |
edu.illinois.cs.cogcomp.lbjava.IR |
Modifier and Type | Method and Description |
---|---|
void |
SemanticAnalysis.run(Argument a)
Runs this pass on all nodes of the indicated type.
|
void |
TranslateToJava.run(Argument a)
Runs this pass on all nodes of the indicated type.
|
void |
PrintAST.run(Argument node)
Runs this pass on all nodes of the indicated type.
|
void |
Pass.run(Argument node)
One of the recursive "helper" methods for
run() . |
Modifier and Type | Field and Description |
---|---|
Argument |
QuantifiedConstraintExpression.argument
(¬ø) The variable specified by this argument is set to each of the objects from
the collection in turn and used throughout the quantified constraint.
|
Argument |
InferenceDeclaration.HeadFinder.argument
(¬ø) Input specification of the head finder method.
|
Argument |
ConstraintDeclaration.argument
(¬ø) The input specification of the constraint.
|
Argument |
ClassifierExpression.argument
Specification of the classifier's input.
|
Argument |
ClassifierAssignment.argument
(¬ø) The input specification of the classifier.
|
Argument |
CatchClause.argument
(¬ø) The catch's input specification
|
Argument |
InferenceDeclaration.head
(¬ø) A specification of the object from which all variables can be found.
|
Modifier and Type | Method and Description |
---|---|
HashSet<Argument> |
Expression.getVariableTypes()
Returns a set of
Argument s storing the name and type of each variable that is a
subexpression of this expression. |
HashSet<Argument> |
ConstraintStatementExpression.getVariableTypes()
Returns a set of
Argument s storing the name and type of each variable that is a
subexpression of this expression. |
HashSet<Argument> |
ConstraintExpression.getVariableTypes()
Returns a set of
Argument s storing the name and type of each variable that is a
subexpression of this expression. |
Modifier and Type | Method and Description |
---|---|
Type |
SymbolTable.put(Argument a)
Adds a new entry to the table.
|
Copyright © 2016. All rights reserved.