/** expand this forest into a set of trees */
public HashSet<Tree<T>> expand(boolean toss) {
- final HashSet<Tree<T>> hs = new HashSet<Tree<T>>();
- TreeMaker<T> ret = new TreeMaker<T>(toss) {
- public void start(T head, Input.Location loc) { }
- public void finish(T head, Input.Location loc) { hs.add(new Tree<T>(loc, head, toks.toArray(tree_hint))); }
- public void child(Tree<T> t) { toks.add(t); }
- };
- visit(ret, null, null);
- if (toss && hs.size() > 1) throw new Ambiguous(this);
- return hs;
+ final HashSetTreeConsumer<T> ret = new HashSetTreeConsumer<T>();
+ visit(new TreeMaker2<T>(toss, ret), null, null);
+ if (toss && ret.size() > 1) throw new Ambiguous(this);
+ return ret;
+ }
+
+ public static interface TreeConsumer<T> {
+ public void addTree(Tree<T> t);
+ }
+ public static class HashSetTreeConsumer<T> extends HashSet<Tree<T>> implements TreeConsumer<T> {
+ public void addTree(Tree<T> t) { super.add(t); }
}
static <T> Forest<T> singleton(Input.Location loc) { return create(loc, null, new Forest[] { }, false, true); }
} else {
tokens[i].visit(new TreeMaker<T>(h.toss) {
public void start(T head, Input.Location loc) { }
- public void child(Tree<T> t) { toks.add(t); }
+ public void addTree(Tree<T> t) { toks.add(t); }
public void finish(T head, Input.Location loc) {
int old = h.toks.size();
- h.child(new Tree<T>(loc, head, toks.toArray(tree_hint)));
+ h.addTree(new Tree<T>(loc, head, toks.toArray(tree_hint)));
expand(i+1, h);
while(h.toks.size() > old) h.toks.remove(h.toks.size()-1);
}
}
public abstract <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c);
- private static abstract class TreeMaker<T> implements Invokable<Forest.Body<T>,Boolean,Integer> {
+ private static class TreeMaker2<T> extends TreeMaker<T> {
+ private TreeConsumer<T> tc;
+ public TreeMaker2(boolean toss, TreeConsumer<T> tc) { super(toss); this.tc = tc; }
+ public void finish(T head, Input.Location loc) { tc.addTree(new Tree<T>(loc, head, toks.toArray(tree_hint)));; }
+ public void start(T head, Input.Location loc) { }
+ public void addTree(Tree<T> t) { toks.add(t); }
+ }
+ private static abstract class TreeMaker<T> implements Invokable<Forest.Body<T>,Boolean,Integer>, TreeConsumer<T> {
public ArrayList<Tree<T>> toks = new ArrayList<Tree<T>>();
private boolean toss;
protected T head;
public TreeMaker(boolean toss) { this.toss = toss; }
public abstract void start(T head, Input.Location loc);
public abstract void finish(T head, Input.Location loc);
- public abstract void child(Tree<T> t);
+ public abstract void addTree(Tree<T> t);
public void invoke(Forest.Body<T> bod, Boolean o, Integer i) {
if (i==null) {
ArrayList<Tree<T>> toks = this.toks;