public class FinalLocalExtractor extends NodeVisitor
Modifier and Type | Class and Description |
---|---|
protected static class |
FinalLocalExtractor.LocalDeclFixer |
Modifier and Type | Field and Description |
---|---|
protected java.util.Set<LocalInstance> |
isFinal
Set of LocalInstances declared final; these should not be made non-final.
|
Constructor and Description |
---|
FinalLocalExtractor(Job job,
TypeSystem ts,
NodeFactory nf) |
Modifier and Type | Method and Description |
---|---|
NodeVisitor |
begin()
The begin method is called before the entire tree is visited.
|
NodeVisitor |
enter(Node parent,
Node n)
Begin normal traversal of a subtree rooted at
n . |
void |
finish()
The finish method is called after the entire tree has been visited.
|
Node |
leave(Node old,
Node n,
NodeVisitor v)
This method is called after all of the children of
n
have been visited. |
protected java.util.Set<LocalInstance> isFinal
public FinalLocalExtractor(Job job, TypeSystem ts, NodeFactory nf)
job
- ts
- nf
- public NodeVisitor begin()
NodeVisitor
null
is returned, the ast is not traversed.begin
in class NodeVisitor
NodeVisitor
to traverse the ast with. If
null
is returned, the ast is not traversed.public void finish()
NodeVisitor
finish
in class NodeVisitor
public NodeVisitor enter(Node parent, Node n)
NodeVisitor
n
. This gives
the visitor the option of changing internal state or returning a new
visitor which will be used to visit the children of n
.
The default implementation of this method is to call
enter(n)
, as most subclasses do not need to know
the parent of the node n
.
enter
in class NodeVisitor
parent
- The parent of n
, null
if n
has no parent.n
- The root of the subtree to be traversed.NodeVisitor
which should be used to visit the
children of n
.public Node leave(Node old, Node n, NodeVisitor v)
NodeVisitor
n
have been visited. In this case, these children were visited by the
visitor v
. This is the last chance for the visitor to
modify the tree rooted at n
. This method will be called
exactly the same number of times as entry
is called.
That is, for each node that is not overridden, enter
and
leave
are each called exactly once.
Note that if old == n
then the visitor should make a copy
of n
before modifying it. It should then return the
modified copy.
This method is typically called by the method
leave(parent, old, n v)
.
If a subclass overrides the method
leave(parent, old, n v)
then this method may not be called.
leave
in class NodeVisitor
old
- The original state of root of the current subtree.n
- The current state of the root of the current subtree.v
- The NodeVisitor
object used to visit the children.n
.