/** expand this forest into a set of trees */
public HashSet<Tree<T>> expand(boolean toss) {
- TreeMaker<T> ret = new TreeMaker<T>(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 && ret.size() > 1) throw new Ambiguous(this);
- return ret;
+ if (toss && hs.size() > 1) throw new Ambiguous(this);
+ return hs;
}
static <T> Forest<T> singleton(Input.Location loc) { return create(loc, null, new Forest[] { }, false, true); }
// Body //////////////////////////////////////////////////////////////////////////////
protected static interface Body<T> {
- TreeMaker<T> expand(int i, TreeMaker<T> h);
+ void expand(int i, TreeMaker<T> h);
}
- protected static class MyBody<T> extends Forest<T> implements Body<T> /* extends PrintableTree<Forest<T>> implements */, Invokable<Tree<T>, TreeMaker<T>, Integer> {
+ protected static class MyBody<T> extends Forest<T> implements Body<T> /* extends PrintableTree<Forest<T>> implements */ {
public <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c) {
ivbc.invoke(this, b, c);
this.singleton = singleton;
}
- public TreeMaker<T> expand(int i, TreeMaker<T> h) {
+ public void expand(final int i, final TreeMaker<T> h) {
if (singleton) {
tokens[0].visit(h, null, i);
+ return;
+ }
+ if (i==0) h.start(tag, location);
- } else if (i==tokens.length) {
- h.add(new Tree<T>(null, tag, h.toks.toArray(tree_hint)));
+ if (i==tokens.length) {
+ h.finish(tag, location);
} else if (unwrap && i==tokens.length-1) {
if (tokens[i] != null)
tokens[i].visit(h, null, 0);
} else {
- //boolean hit = false;
- //tokens[i].visit(this, h, i);
-
- for(Tree<T> r : tokens[i].expand(h.toss)) {
- //hit = true;
- int old = h.toks.size();
- h.toks.add(r);
- expand(i+1, h);
- while(h.toks.size() > old) h.toks.remove(h.toks.size()-1);
- }
-
- //if (!hit) throw new Error();
+ 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 finish(T head, Input.Location loc) {
+ int old = h.toks.size();
+ h.child(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);
+ }
+ }, null, null);
}
- return h;
- }
- public void invoke(Tree<T> r, TreeMaker<T> h, Integer i) {
- //hit = true;
- int old = h.toks.size();
- h.toks.add(r);
- expand(i+1, h);
- while(h.toks.size() > old) h.toks.remove(h.toks.size()-1);
- //ivbc.invoke(this, b, c);
}
protected String headToString() { return null; }
}
public abstract <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c);
- private static class TreeMaker<T> extends HashSet<Tree<T>> implements Invokable<Forest.Body<T>,Boolean,Integer> {
+ private static abstract class TreeMaker<T> implements Invokable<Forest.Body<T>,Boolean,Integer> {
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 void invoke(Forest.Body<T> bod, Boolean o, Integer i) {
if (i==null) {
ArrayList<Tree<T>> toks = this.toks;