import java.lang.reflect.*;
/** an efficient representation of a collection of trees (Tomita's shared packed parse forest) */
-public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/
- implements Visitable<Forest.Body<T>>,
- IntegerMappable,
+public abstract class Forest<T> /*extends PrintableTree<Forest.Body<T>>*/
+ implements IntegerMappable,
GraphViz.ToGraphViz {
private static int master_idx = 0;
private final int idx = master_idx++;
public int toInt() { return idx; }
- public abstract void expand(TaskList tl, HashSet<Tree<T>> ht);
- public abstract void gather(TaskList tl, HashSet<Tree<T>>[] ht, HashSet<Tree<T>> target);
-
- public static class TaskList extends ArrayList<TaskList.Task> {
- public interface Task {
- public void perform();
- }
- public class ExpandTask implements Task {
- private Forest f;
- private HashSet hs;
- public ExpandTask(Forest f, HashSet hs) { this.f = f; this.hs = hs; }
- public void perform() { f.expand(TaskList.this, hs); }
- }
- public class GatherTask implements Task {
- private Forest f;
- private HashSet[] ht;
- private HashSet hs;
- public GatherTask(Forest f, HashSet<Tree<?>>[] ht, HashSet<Tree<?>> hs) { this.f = f; this.hs = hs; this.ht = ht;}
- public void perform() { f.gather(TaskList.this, ht, hs); }
- }
- public void expand(Forest f, HashSet hs) {
- add(new ExpandTask(f, hs));
- }
- public void gather(Forest f, HashSet[] ht, HashSet hs) {
- add(new GatherTask(f, ht, hs));
- }
- public void run() {
- while(true) {
- if (isEmpty()) return;
- Task task = get(size()-1);
- remove(size()-1);
- task.perform();
- }
- }
- }
-
/** assume that this forest contains exactly one tree and return it; otherwise throw an exception */
public final Tree<T> expand1() throws Ambiguous, ParseFailed {
try {
}
/** expand this forest into a set of trees */
+ public abstract void expand(HashSet<Tree<T>> ht);
public HashSet<Tree<T>> expand(boolean toss) {
- /*
- final HashSetTreeConsumer<T> ret = new HashSetTreeConsumer<T>();
- visit(new TreeMaker2<T>(toss, ret), null, null);
- */
- TaskList tl = new TaskList();
HashSet<Tree<T>> ret = new HashSet<Tree<T>>();
- tl.expand(this, ret);
- tl.run();
-
- if (toss && ret.size() > 1) throw new InnerAmbiguous(this);
+ expand(ret);
return ret;
}
public InnerAmbiguous(Forest<?> f) { this.f = f; }
}
- static interface TreeConsumer<T> {
- public void addTree(Tree<T> t);
- }
- 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, Position p) {
- return create(loc, null, new Forest[] { }, new Object[0], false, true, p); }
- static <T> Forest<T> singleton(Input.Location loc, Forest<T> body, Position p) {
- //return create(loc, null, new Forest[] { body }, false, true, p);
- return body;
- }
- static <T> Forest<T> leaf(Input.Location loc, T tag, Position p) { return create(loc, tag, null, null, false, false, p); }
- public static <T> Forest<T> create(Input.Location loc, T tag, Forest<T>[] tokens, Object[] labels, boolean unwrap, boolean singleton, Position p) {
- return new MyBody<T>(loc, tag, tokens, labels, 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 Body<T>(loc, tag, tokens, unwrap);
}
// Body //////////////////////////////////////////////////////////////////////////////
- protected static interface Body<T> extends GraphViz.ToGraphViz {
- void expand(int i, TreeMaker<T> h);
- }
public abstract void edges(GraphViz.Node n);
public boolean ambiguous() { return false; }
- protected static class MyBody<T> extends Forest<T> implements Body<T> /* extends PrintableTree<Forest<T>> implements */ {
+ public /*protected*/ static class Body<T> extends Forest<T> /* extends PrintableTree<Forest<T>> implements */ {
+
+ private final Input.Region location;
+ private final T tag;
+ private final Forest<T>[] tokens;
+ private final boolean unwrap;
public boolean isTransparent() { return false; }
public boolean isHidden() { return false; }
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;
}
if (i==tokens.length-1 && unwrap && !tokens[i].ambiguous()) {
tokens[i].edges(n);
} else {
- n.edge(tokens[i], labels==null?null:labels[i]);
+ n.edge(tokens[i], null);
}
}
}
- public <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c) {
- ivbc.invoke(this, b, c);
- }
-
- private final Input.Location location;
- private final T tag;
- private final Forest<T>[] tokens;
- private final Object[] labels;
- private final boolean unwrap;
- private final boolean singleton;
- private final Sequence.Position reduction;
-
- private MyBody(Input.Location loc, T tag, Forest<T>[] tokens, Object[] labels, boolean unwrap, boolean singleton, Position reduction) {
+ private Body(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;
- this.labels = labels;
- }
- public void gather(TaskList tl, HashSet<Tree<T>>[] ht, HashSet<Tree<T>> target) {
- gather(tl, ht, target, new Tree[ht.length], 0);
- }
- private void gather(TaskList tl, HashSet<Tree<T>>[] ht, HashSet<Tree<T>> target, Tree[] trees, int i) {
- if (i==ht.length) {
- target.add(new Tree<T>(null, tag, trees));
- return;
- }
- for(Tree<T> tree : ht[i]) {
- if (unwrap && i==trees.length-1) {
- // I think this is wrong
- Tree[] trees2 = new Tree[trees.length - 1 + tree.numChildren()];
- System.arraycopy(trees, 0, trees2, 0, trees.length-1);
- for(int j=0; j<tree.numChildren(); j++)
- trees2[trees.length-1+j] = tree.child(j);
- target.add(new Tree<T>(null, tag, trees2));
- } else {
- trees[i] = tree;
- gather(tl, ht, target, trees, i+1);
- trees[i] = null;
- }
- }
- }
- 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++) {
- children[i] = new HashSet<Tree<T>>();
- tl.expand(tokens[i], children[i]);
- }
}
- public void expand(final int i, final TreeMaker<T> h) {
- if (singleton) {
- tokens[0].visit(h, null, i);
+ public void expand(HashSet<Tree<T>> ht) {
+ expand(0, new Tree[tokens.length], ht);
+ }
+ public void expand(final int i, Tree<T>[] ta, HashSet<Tree<T>> ht) {
+ if (i==tokens.length) {
+ ht.add(new Tree<T>(location, tag, ta, unwrap));
return;
}
- if (i==0) h.start(tag, location);
-
- 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 {
- tokens[i].visit(new TreeMaker<T>(h.toss) {
- public void start(T head, Input.Location loc) { }
- public void addTree(Tree<T> t, Object label) { toks.add(t); labs.add(label); }
- public void finish(T head, Input.Location loc) {
- int old = h.toks.size();
- h.addTree(new Tree<T>(loc, head, toks.toArray(tree_hint), labs.toArray(string_hint)), labels==null?null:labels[i]);
- expand(i+1, h);
- while(h.toks.size() > old) h.toks.remove(h.toks.size()-1);
- while(h.labs.size() > old) h.labs.remove(h.labs.size()-1);
- }
- }, null, null);
+ HashSet<Tree<T>> ht2 = new HashSet<Tree<T>>();
+ tokens[i].expand(ht2);
+ for(Tree<T> tc : ht2) {
+ ta[i] = tc;
+ expand(i+1, ta, ht);
+ ta[i] = null;
}
}
* viewed, it becomes immutable
*/
static class Ref<T> extends Forest<T> {
- public void expand(TaskList tl, HashSet<Tree<T>> ht) {
- for (Forest<T> f : hp) f.expand(tl, ht);
- }
- public void gather(TaskList tl, HashSet<Tree<T>>[] ht, HashSet<Tree<T>> target) {
- throw new Error();
+ public void expand(HashSet<Tree<T>> ht) {
+ for (Forest<T> f : hp)
+ f.expand(ht);
}
public HashSet<GSS.Phase.Node> parents = new HashSet<GSS.Phase.Node>();
public boolean contains(Forest f) {
return n;
}
- public <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c) {
- if (hp==null) return;
- for(Forest<T> f : hp)
- f.visit(ivbc, b, c);
- }
public Forest resolve() { return this; }
}
- public abstract <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c);
- 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), labs.toArray(string_hint)));; }
- public void start(T head, Input.Location loc) { }
- public void addTree(Tree<T> t, Object label) { toks.add(t); labs.add(label); }
- }
- private static abstract class TreeMaker<T> implements Invokable<Forest.Body<T>,Boolean,Integer>/*, TreeConsumer<T>*/ {
- public ArrayList<Tree<T>> toks = new ArrayList<Tree<T>>();
- public ArrayList<Object> labs = new ArrayList<Object>();
- 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 addTree(Tree<T> t, Object label);
- public void invoke(Forest.Body<T> bod, Boolean o, Integer i) {
- if (i==null) {
- ArrayList<Tree<T>> toks = this.toks;
- this.toks = new ArrayList<Tree<T>>();
- ArrayList<Object> labs = this.labs;
- this.labs = new ArrayList<Object>();
- bod.expand(0, this);
- this.toks = toks;
- this.labs = labs;
- } else {
- bod.expand(i, this);
- }
- }
- }
-
// Statics //////////////////////////////////////////////////////////////////////////////
private static Tree[] tree_hint = new Tree[0];
projects / sbp.git / blobdiff