public InnerAmbiguous(Forest<?> f) { this.f = f; }
}
- static <T> Forest<T> singleton(Input.Region loc, Position p) {
- return create(loc, null, new Forest[] { }, false, true, p); }
- static <T> Forest<T> singleton(Input.Region loc, Forest<T> body, Position p) { return body; }
- static <T> Forest<T> leaf(Input.Region loc, T tag, Position p) { return create(loc, tag, null, false, false, p); }
- public static <T> Forest<T> create(Input.Region loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton, Position p) {
- return new MyBody<T>(loc, tag, tokens, unwrap, singleton, p);
+ static <T> Forest<T> leaf(Input.Region loc, T tag) { return create(loc, tag, null, false); }
+ public static <T> Forest<T> create(Input.Region loc, T tag, Forest<T>[] tokens, boolean unwrap) {
+ return new MyBody<T>(loc, tag, tokens, unwrap);
}
// Body //////////////////////////////////////////////////////////////////////////////
GraphViz.Node n = gv.createNode(this);
n.label = headToString()==null?"":headToString();
n.directed = true;
- n.comment = reduction==null?null:reduction+"";
+ //n.comment = reduction==null?null:reduction+"";
edges(n);
return n;
}
ivbc.invoke(this, b, c);
}
- private final Input.Region location;
+ private final Input.Region location;
private final T tag;
private final Forest<T>[] tokens;
private final boolean unwrap;
- private final boolean singleton;
- private final Sequence.Position reduction;
- private MyBody(Input.Region loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton, Position reduction) {
+ private MyBody(Input.Region loc, T tag, Forest<T>[] tokens, boolean unwrap) {
this.location = loc;
this.tag = tag;
this.tokens = tokens==null ? emptyForestArray : new Forest[tokens.length];
if (tokens != null) System.arraycopy(tokens, 0, this.tokens, 0, tokens.length);
if (tokens != null) for(int i=0; i<tokens.length; i++) if (tokens[i]==null) throw new Error(i+"");
this.unwrap = unwrap;
- this.singleton = singleton;
- this.reduction = reduction;
}
public void gather(TaskList tl, HashSet<Tree<T>>[] ht, HashSet<Tree<T>> target) {
gather(tl, ht, target, new Tree[ht.length], 0);
}
}
public void expand(TaskList tl, HashSet<Tree<T>> ht) {
- if (singleton) {
- tokens[0].expand(tl, ht);
- return;
- }
HashSet<Tree<T>>[] children = new HashSet[tokens.length];
tl.gather(this, children, ht);
for(int i=0; i<children.length; i++) {
}
public void expand(final int i, final TreeBuilder<T> h) {
- if (singleton) {
- tokens[0].visit(h, null, i);
- return;
- }
if (i==0) h.start(tag, location);
if (i==tokens.length) {