public class TreeTyper extends Visitor
| Modifier and Type | Field and Description |
|---|---|
protected Analyzer |
analyzer
The analyzer utility.
|
protected AST |
ast
The common type operations.
|
protected boolean |
flatten
The flag for flattening lists.
|
protected Runtime |
runtime
The runtime.
|
protected Sequence |
sequence
The current sequence.
|
protected boolean |
strict
The flag for strict unification.
|
| Constructor and Description |
|---|
TreeTyper(Runtime runtime,
Analyzer analyzer,
AST ast)
Create a new tree typer.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
process(java.lang.String name,
boolean isAction,
java.util.List<Binding> children)
Determine the type of the specified generic node constructor.
|
void |
visit(Element e)
Visit the specified element.
|
void |
visit(GenericActionValue v)
Visit the specified generic action value.
|
void |
visit(GenericNodeValue v)
Visit the specified generic node value.
|
void |
visit(Module m)
Visit the specified module.
|
void |
visit(OrderedChoice c)
Visit the specified ordered choice.
|
void |
visit(Production p)
Visit the specified production.
|
void |
visit(Sequence s)
Visit the specified sequence.
|
void |
visit(UnaryOperator op)
Visit the specified unary operator.
|
dispatch, equals, hashCode, iterate, map, mapInPlace, unableToVisit, visitprotected final Runtime runtime
protected final Analyzer analyzer
protected final AST ast
protected boolean strict
protected boolean flatten
protected Sequence sequence
public void visit(Module m)
public void visit(Production p)
public void visit(OrderedChoice c)
public void visit(Sequence s)
public void visit(UnaryOperator op)
public void visit(Element e)
public void visit(GenericNodeValue v)
public void visit(GenericActionValue v)
protected void process(java.lang.String name,
boolean isAction,
java.util.List<Binding> children)
name - The constructor's name.isAction - The flag for whether the constructor appears in an action.children - The list of bindings for the children.Copyright © 2014. All Rights Reserved.