import java.util.*;
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, GraphViz.ToGraphViz {
-
- private static int master_idx = 0;
- private final int idx = master_idx++;
- public int toInt() { return idx; }
+/**
+ * An efficient representation of a collection of trees (Tomita's
+ * shared packed parse forest).
+ */
+public abstract class Forest<T> implements GraphViz.ToGraphViz {
/** assume that this forest contains exactly one tree and return it; otherwise throw an exception */
- public final Tree<T> expand1() throws Ambiguous, ParseFailed {
- try {
- Iterator<Tree<T>> it = expand(true).iterator();
- if (!it.hasNext()) throw new ParseFailed();
- return it.next();
- } catch (InnerAmbiguous ia) { throw new Ambiguous(ia.f); }
- }
+ public abstract Tree<T> expand1() throws Ambiguous;
/** expand this forest into a set of trees */
- public HashSet<Tree<T>> expand(boolean toss) {
- final HashSetTreeConsumer<T> ret = new HashSetTreeConsumer<T>();
- visit(new TreeMaker2<T>(toss, ret), null, null);
- if (toss && ret.size() > 1) throw new InnerAmbiguous(this);
- return ret;
- }
+ public void expand(HashSet<Tree<T>> ht) { expand(ht, new HashSet<Forest<T>>(), null); }
- private static class InnerAmbiguous extends RuntimeException {
- public final Forest<?> f;
- public InnerAmbiguous(Forest<?> f) { this.f = f; }
+ /** create a new forest */
+ public static <T> Forest<T> create(Input.Region loc, T head, Forest<T>[] children, boolean lift) {
+ return new One<T>(loc, head, children, lift);
}
- 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); }
- }
+ // Package-Private //////////////////////////////////////////////////////////////////////////////
- static <T> Forest<T> singleton(Input.Location loc, Position p) {
- return create(loc, null, new Forest[] { }, 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, false, false, p); }
- public static <T> Forest<T> create(Input.Location loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton, Position p) {
- return new MyBody<T>(loc, tag, tokens, unwrap, singleton, p);
- }
- // Body //////////////////////////////////////////////////////////////////////////////
+ abstract void expand(HashSet<Tree<T>> ht, HashSet<Forest<T>> ignore, Tree<T> bogus);
+ abstract void gather(HashSet<Forest<T>> ignore);
+ abstract void edges(GraphViz.Node n);
+ boolean ambiguous() { return false; }
- protected static interface Body<T> extends GraphViz.ToGraphViz {
- void expand(int i, TreeMaker<T> h);
- }
- public abstract void edges(GraphViz.Node n);
- protected static class MyBody<T> extends Forest<T> implements Body<T> /* extends PrintableTree<Forest<T>> implements */ {
+
+ // One //////////////////////////////////////////////////////////////////////////////
+
+ /** A "single" forest with a head and child subforests */
+ private static class One<T> extends Forest<T> {
+
+ private final Input.Region location;
+ private final T head;
+ private final Forest<T>[] children;
+
+ /** if true, the last child's children are considered children of this node */
+ private final boolean lift;
+
+ private One(Input.Region loc, T head, Forest<T>[] children, boolean lift) {
+ this.location = loc;
+ this.head = head;
+ this.children = children==null ? emptyForestArray : new Forest[children.length];
+ if (children != null) System.arraycopy(children, 0, this.children, 0, children.length);
+ if (children != null) for(int i=0; i<children.length; i++) if (children[i]==null) throw new Error(i+"");
+ this.lift = lift;
+ }
+
+ public Tree<T> expand1() throws Ambiguous {
+ Tree<T>[] ret = new Tree[children.length];
+ for(int i=0; i<children.length; i++) ret[i] = children[i].expand1();
+ return new Tree<T>(location, head, ret, lift);
+ }
+
+ void gather(HashSet<Forest<T>> hf) {
+ hf.add(this);
+ for(Forest<T> f : children) f.gather(hf);
+ }
+ void expand(HashSet<Tree<T>> ht, HashSet<Forest<T>> ignore, Tree<T> bogus) {
+ if (ignore.contains(this)) { ht.add(bogus); return; }
+ expand(0, new Tree[children.length], ht, ignore, bogus);
+ }
+ private void expand(final int i, Tree<T>[] ta, HashSet<Tree<T>> ht, HashSet<Forest<T>> ignore, Tree<T> bogus) {
+ if (i==children.length) {
+ ht.add(new Tree<T>(location, head, ta, lift));
+ } else {
+ HashSet<Tree<T>> ht2 = new HashSet<Tree<T>>();
+ children[i].expand(ht2, ignore, bogus);
+ for(Tree<T> tc : ht2) {
+ ta[i] = tc;
+ expand(i+1, ta, ht, ignore, bogus);
+ ta[i] = null;
+ }
+ }
+ }
+
+ // GraphViz, ToInt //////////////////////////////////////////////////////////////////////////////
public boolean isTransparent() { return false; }
public boolean isHidden() { return false; }
edges(n);
return n;
}
+ boolean edges = false; // FIXME ??
public void edges(GraphViz.Node n) {
- for(int i=0; i<tokens.length; i++) {
- if (i==tokens.length-1 && unwrap) {
- tokens[i].edges(n);
+ if (edges) return;
+ edges = true;
+ for(int i=0; i<children.length; i++) {
+ if (i==children.length-1 && lift && !children[i].ambiguous()) {
+ children[i].edges(n);
} else {
- n.edge(tokens[i]);
+ n.edge(children[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 boolean unwrap;
- private final boolean singleton;
- private final Sequence.Position reduction;
+ protected String headToString() { return head==null?null:head.toString(); }
+ protected String headToJava() { return "null"; }
+ protected String left() { return "{"; }
+ protected String right() { return "}"; }
+ protected boolean ignoreSingleton() { return false; }
+ }
- private MyBody(Input.Location loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton, Position reduction) {
- 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 expand(final int i, final TreeMaker<T> h) {
- if (singleton) {
- tokens[0].visit(h, null, i);
- return;
- }
- if (i==0) h.start(tag, location);
- if (i==tokens.length) {
- h.finish(tag, location);
+ // Many //////////////////////////////////////////////////////////////////////////////
- } else if (unwrap && i==tokens.length-1) {
- if (tokens[i] != null)
- tokens[i].visit(h, null, 0);
+ /** An "ambiguity node"; this is immutable once it has been "looked at" */
+ static class Many<T> extends Forest<T> {
- } else {
- tokens[i].visit(new TreeMaker<T>(h.toss) {
- public void start(T head, Input.Location loc) { }
- public void addTree(Tree<T> t) { toks.add(t); }
- public void finish(T head, Input.Location loc) {
- int old = h.toks.size();
- 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);
- }
- }, null, null);
+ HashSet<GSS.Phase.Node> parents = new HashSet<GSS.Phase.Node>();
+ private FastSet<Forest<T>> hp = new FastSet<Forest<T>>();
+ private boolean touched = false;
+
+ public Many() { }
+
+ public Tree<T> expand1() throws Ambiguous {
+ touched();
+ if (hp.size() > 1) {
+ HashSet<Forest<T>> hf0 = new HashSet<Forest<T>>();
+ Iterator<Forest<T>> ih = hp.iterator();
+ ih.next().gather(hf0);
+ for(Forest<T> f : hp) {
+ HashSet<Forest<T>> hf1 = new HashSet<Forest<T>>();
+ f.gather(hf1);
+ hf0.retainAll(hf1);
+ }
+ HashSet<Tree<T>> ht = new HashSet<Tree<T>>();
+ expand(ht, hf0, new Tree(null, "*"));
+ throw new Ambiguous((Forest<?>)this,
+ (HashSet<Tree<?>>)(Object)ht);
}
+ return hp.iterator().next().expand1();
+ }
+
+ void gather(HashSet<Forest<T>> ht) {
+ touched();
+ ht.add(this);
+ for(Forest<T> f : hp) f.gather(ht);
}
- protected String headToString() { return tag==null?null:tag.toString(); }
- protected String headToJava() { return null; }
- protected String left() { return "{"; }
- protected String right() { return "}"; }
- protected boolean ignoreSingleton() { return false; }
- }
+ private void touched() {
+ if (touched) return;
+ touched = true;
+ /*
+ FastSet<Forest<T>> f2 = new FastSet<Forest<T>>();
+ for(Forest f : hp)
+ if (f instanceof Forest.One) f2.add(f);
+ else for(Forest ff : ((Forest.Many<T>)f))
+ f2.add(ff);
+ hp = f2;
+ */
+ }
+ public boolean contains(Forest f) {
+ touched();
+ return hp.contains(f);
+ }
+ public void merge(Forest p) {
+ if (touched) throw new RuntimeException("attempt to merge() on a Forest.Many that has already been examined");
+ if (p==this) throw new RuntimeException("attempt to merge() a Forest.Many to itself!");
+ hp.add(p, true);
+ }
+ boolean ambiguous() {
+ touched();
+ if (hp.size()==0) return false;
+ if (hp.size()==1) return hp.iterator().next().ambiguous();
+ return true;
+ }
+ void expand(HashSet<Tree<T>> ht, HashSet<Forest<T>> ignore, Tree<T> bogus) {
+ touched();
+ if (ignore.contains(this)) { ht.add(bogus); return; }
+ for (Forest<T> f : hp) f.expand(ht, ignore, bogus);
+ }
- // Ref //////////////////////////////////////////////////////////////////////////////
- /**
- * This class represents a partially complete collection of
- * forests to be viewed as a forest at some later date; once
- * viewed, it becomes immutable
- */
- static class Ref<T> extends Forest<T> {
- private FastSet<Forest<T>> hp = new FastSet<Forest<T>>();
- public Ref() { }
- public int toInt() {
- if (hp.size()==1) return hp.iterator().next().toInt();
- return super.toInt();
- }
- public void merge(Forest p) { if (p!=this) hp.add(p, true); }
+ // GraphViz, ToInt //////////////////////////////////////////////////////////////////////////////
public boolean isTransparent() { return hp.size()==1; }
public boolean isHidden() { return hp.size()==0; }
- public void edges(GraphViz.Node n) { for(Forest f : hp) f.edges(n); }
+ public void edges(GraphViz.Node n) {
+ if (hp.size()==1) { hp.iterator().next().edges(n); return; }
+ for(Forest f : hp) f.edges(n);
+ }
public GraphViz.Node toGraphViz(GraphViz gv) {
- if (hp.size()==0) return null;
if (hp.size()==1) return hp.iterator().next().toGraphViz(gv);
if (gv.hasNode(this)) return gv.createNode(this);
GraphViz.Node n = gv.createNode(this);
n.label = "?";
n.color = "red";
- for(Forest f : hp) n.edge(f);
+ for(Forest f : hp) n.edge(f, null);
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)));; }
- 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 addTree(Tree<T> t);
- 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>>();
- bod.expand(0, this);
- this.toks = toks;
- } else {
- bod.expand(i, this);
- }
- }
}
// Statics //////////////////////////////////////////////////////////////////////////////
private static Tree[] tree_hint = new Tree[0];
+ private static String[] string_hint = new String[0];
private static final Forest[] emptyForestArray = new Forest[0];
protected String headToString() { return null; }
- protected String headToJava() { return null; }
+ protected String headToJava() { return "null"; }
protected String left() { return "<?"; }
protected String right() { return "?>"; }
protected boolean ignoreSingleton() { return true; }
projects / sbp.git / blobdiff