package edu.berkeley.sbp;
import edu.berkeley.sbp.*;
-import edu.berkeley.sbp.*;
+import edu.berkeley.sbp.Sequence.Position;
import edu.berkeley.sbp.util.*;
import java.io.*;
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> {
+/**
+ * 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 Parser.Ambiguous, Parser.Failed {
- Iterator<Tree<T>> it = expand(true).iterator();
- if (!it.hasNext()) throw new Parser.Failed();
- return it.next();
- }
+ public abstract Tree<T> expand1() throws Ambiguous;
/** expand this forest into a set of trees */
- public abstract HashSet<Tree<T>> expand(boolean toss);
-
- abstract boolean valid();
+ public void expand(HashSet<Tree<T>> ht) { expand(ht, new HashSet<Forest<T>>(), null); }
- static <T> Forest<T> singleton(Token.Location loc, Sequence creator) { return create(loc, null, new Forest[] { }, creator, false, true); }
- static <T> Forest<T> singleton(Token.Location loc, Forest<T> body, Sequence creator) { return create(loc, null, new Forest[] { body }, creator, false, true); }
- static <T> Forest<T> leaf(Token.Location loc, T tag, Sequence creator) { return create(loc, tag, null, creator, false, false); }
- public static <T> Forest<T> create(Token.Location loc, T tag, Forest<T>[] tokens, Sequence creator, boolean unwrap, boolean singleton) {
- return new MultiForest<T>(loc, tag, tokens, creator, unwrap, singleton);
+ /** 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);
}
- // Body //////////////////////////////////////////////////////////////////////////////
+ // Package-Private //////////////////////////////////////////////////////////////////////////////
- protected static class Body<T> {
+ 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; }
- private final Token.Location location;
- private final T tag;
- private final Forest<T>[] tokens;
- private final Sequence creator;
- private final boolean unwrap;
- private final boolean singleton;
- private Body(Token.Location loc, T tag, Forest<T>[] tokens, Sequence creator, boolean unwrap, boolean singleton) {
- 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.creator = creator;
- this.unwrap = unwrap;
- this.singleton = singleton;
- }
+ // One //////////////////////////////////////////////////////////////////////////////
- private HashSet<Tree<T>> expand(boolean toss, ArrayList<Tree<T>> toks, int i, HashSet<Tree<T>> h) {
- if (singleton) {
- for(Body<T> b : (IterableForest<T>)tokens[0]) b.expand(toss, toks, i, h);
+ /** A "single" forest with a head and child subforests */
+ private static class One<T> extends Forest<T> {
- } else if (i==tokens.length) {
- h.add(new Tree<T>(null, tag, toks.toArray(tree_hint)));
+ 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;
+ }
- } else if (unwrap && i==tokens.length-1) {
- if (tokens[i] != null)
- for(Body b : (IterableForest<T>)tokens[i])
- b.expand(toss, toks, 0, h);
+ 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 {
- if (tokens[i]!=null) {
- HashSet<Tree<T>> exp = tokens[i].expand(toss);
- if (exp != null)
- for(Tree<T> r : exp) {
- int old = toks.size();
- toks.add(r);
- expand(toss, toks, i+1, h);
- while(toks.size() > old) toks.remove(toks.size()-1);
- }
+ 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;
}
}
- return h;
- }
- void addTo(HashSet<Body> h) {
- if (!singleton) h.add(this);
- else for(Body b : (IterableForest<T>)tokens[0]) b.addTo(h);
- }
- void addTo(FastSet<Body> h) {
- if (!singleton) h.add(this, true);
- else for(Body b : (IterableForest<T>)tokens[0]) b.addTo(h);
- }
-
- private boolean kcache = false;
- private boolean keep = false;
- public boolean keep() {
- if (kcache) return keep;
- kcache = true;
- for(Forest<T> token : tokens) if (!token.valid()) return keep = false;
- return keep = creator==null || (creator.needs.size()==0 && creator.hates.size()==0);
- }
- public boolean keep(Iterable<Body<T>> h) {
- if (keep()) return true;
- for(Forest<T> token : tokens) if (!token.valid()) return false;
- int needs = 0;
- for(Body<T> b : h) {
- if (creator.hates.contains(b.creator) && b.keep(h)) return false;
- if (creator.needs.contains(b.creator) && b.keep(h)) needs--;
- }
- return needs <= -1 * creator.needs.size();
- }
-
- private boolean rep = false;
- public String toString() {
- if (rep) return "***";
- try {
- rep = true;
- StringBuffer ret = new StringBuffer();
- for(int i=0; i<tokens.length; i++) {
- String q = tokens[i]==null ? "null" : tokens[i].toString();
- if (q.length() > 0) {
- ret.append(q);
- ret.append(" ");
- }
+ }
+
+ // GraphViz, ToInt //////////////////////////////////////////////////////////////////////////////
+
+ public boolean isTransparent() { return false; }
+ public boolean isHidden() { return false; }
+ public GraphViz.Node toGraphViz(GraphViz gv) {
+ if (gv.hasNode(this)) return gv.createNode(this);
+ GraphViz.Node n = gv.createNode(this);
+ n.label = headToString()==null?"":headToString();
+ n.directed = true;
+ edges(n);
+ return n;
+ }
+ boolean edges = false; // FIXME ??
+ public void edges(GraphViz.Node 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(children[i], null);
}
- String tail = ret.toString().trim();
- String head = (tag!=null && !tag.toString().equals("")) ? (tail.length() > 0 ? tag+":" : tag+"") : "";
- if (tail.length() > 0) tail = "{" + tail + "}";
- return head + tail;
- } finally {
- rep = false;
}
}
+
+ 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; }
}
- // Ref //////////////////////////////////////////////////////////////////////////////
+ // Many //////////////////////////////////////////////////////////////////////////////
- static abstract class IterableForest<T> extends Forest<T> implements Iterable<Forest.Body<T>> {
- public abstract Iterator<Forest.Body<T>> iterator();
- }
+ /** An "ambiguity node"; this is immutable once it has been "looked at" */
+ static class Many<T> extends Forest<T> {
- /**
- * 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 IterableForest<T> {
- private FastSet<Forest> hp = new FastSet<Forest>();
- private Forest res = null;
- public boolean valid = false;
- public Ref() { }
- public void merge(Forest p) {
- //if (p==null) throw new Error("bad evil bad!");
- if (res != null) throw new Error("already resolved!");
- if (p==null) throw new Error();
- if (p!=this) hp.add(p, true);
- }
- public Iterator<Body<T>> iterator() { return ((IterableForest<T>)resolve()).iterator(); }
- public HashSet<Tree<T>> expand(boolean toss) { return resolve().expand(toss); }
- public boolean valid() { if (valid) return true; resolve(); return valid; }
- public String toString() { return resolve().toString(); }
- public Forest resolve() {
- if (hp==null) return res;
- HashSet<Body> results = null;
- FastSet<Body> nh = new FastSet<Body>();
- for(Forest<?> p : hp)
- for(Body<?> b : (IterableForest<?>)p) {
- if (b.keep() && (b.creator==null || !b.creator.lame)) {
- valid = true;
- b.addTo(nh);
- } else {
- results = new HashSet<Body>();
- }
- }
- if (results != null) {
- for(Forest<?> p : hp)
- for(Body<?> b : (IterableForest<?>)p)
- results.add(b);
- for(Body b : results) {
- if (b.keep() && (b.creator==null || !b.creator.lame)) continue;
- if (b.creator!=null && b.creator.lame) continue;
- if (!b.keep(results)) continue;
- valid = true;
- b.addTo(nh);
+ 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);
}
- hp = null;
- res = new MultiForest(nh, valid);
- return res;
+ return hp.iterator().next().expand1();
+ }
+
+ void gather(HashSet<Forest<T>> ht) {
+ touched();
+ ht.add(this);
+ for(Forest<T> f : hp) f.gather(ht);
}
- }
- // Implementations //////////////////////////////////////////////////////////////////////////////
+ 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;
+ }
- private static class MultiForest<T> extends IterableForest<T> {
- private final FastSet<Body<T>> results;
- private boolean valid;
- public boolean valid() { return valid; }
- private MultiForest(FastSet<Body<T>> results, boolean valid) { this.results = results; this.valid = valid; }
- public MultiForest(Token.Location loc, T tag, Forest<T>[] tokens, Sequence creator, boolean unwrap, boolean singleton) {
- this.results = new FastSet<Body<T>>(new Body(loc, tag, tokens, creator, unwrap, singleton));
- this.valid = 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);
}
- public Iterator<Body<T>> iterator() { return results.iterator(); }
- public HashSet<Tree<T>> expand(boolean toss) {
- HashSet<Tree<T>> ret = new HashSet<Tree<T>>();
- for(Body<T> b : results)
- ret.addAll(b.expand(toss, new ArrayList<Tree<T>>(), 0, new HashSet<Tree<T>>()));
- if (toss && ret.size() > 1) throw new Parser.Ambiguous(this);
- return ret;
+
+ // GraphViz, ToInt //////////////////////////////////////////////////////////////////////////////
+
+ public boolean isTransparent() { return hp.size()==1; }
+ public boolean isHidden() { return hp.size()==0; }
+ public void edges(GraphViz.Node n) {
+ if (hp.size()==1) { hp.iterator().next().edges(n); return; }
+ for(Forest f : hp) f.edges(n);
}
-
- // Display //////////////////////////////////////////////////////////////////////////////
-
- private String toString = null;
- public String toString() {
- if (toString != null) return toString;
- StringBuffer ret = new StringBuffer();
- if (results.size()==1) {
- for(Forest.Body<T> r : results)
- ret.append(r);
- return toString = ret.toString();
- }
- ret.append("<?");
- boolean first = true;
- for(Forest.Body<T> r : results) {
- if (!first) ret.append(' ');
- first = false;
- ret.append(r);
- }
- ret.append("?>");
- return toString = ret.toString();
+ public GraphViz.Node toGraphViz(GraphViz gv) {
+ 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, null);
+ return n;
}
}
// Statics //////////////////////////////////////////////////////////////////////////////
private static Tree[] tree_hint = new Tree[0];
- private static Body[] body_hint = new Body[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 left() { return "<?"; }
+ protected String right() { return "?>"; }
+ protected boolean ignoreSingleton() { return true; }
}
projects / sbp.git / blobdiff