X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FForest.java;h=e7c0be4394c23d4951fc03f03be26cb2b44a80b3;hp=0a20228acd563ee908532da57f962af4002d33ee;hb=5ea3b9182192a0fbb7a0bd86b919384ddaeff29a;hpb=fc1e5069ec5401c425dd29b77b04285916b62d10

diff --git a/src/edu/berkeley/sbp/Forest.java b/src/edu/berkeley/sbp/Forest.java
index 0a20228..e7c0be4 100644
--- a/src/edu/berkeley/sbp/Forest.java
+++ b/src/edu/berkeley/sbp/Forest.java
@@ -1,88 +1,197 @@
 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> extends PrintableTree<Forest.Body<T>> implements Iterable<Forest.Body<T>> {
+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; }
+
+    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 {
-        Iterator<Tree<T>> it = expand(true).iterator();
-        if (!it.hasNext()) throw new ParseFailed();
-        return it.next();
+        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); }
     }
 
     /** expand this forest into a set of trees */
-    public abstract HashSet<Tree<T>>  expand(boolean toss);
+    public HashSet<Tree<T>> expand(boolean toss) {
+        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);
+        return ret;
+    }
 
-    static        <T> Forest<T> singleton(Input.Location loc)                       { return create(loc, null, new Forest[] { }, false, true); }
-    static        <T> Forest<T> singleton(Input.Location loc, Forest<T> body)       { return create(loc, null, new Forest[] { body },  false, true); }
-    static        <T> Forest<T> leaf(Input.Location loc, T tag) { return create(loc, tag, null, false, false); }
-    public static <T> Forest<T> create(Input.Location loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton) {
-        return new MultiForest<T>(loc, tag, tokens, unwrap, singleton);
+    private static class InnerAmbiguous extends RuntimeException {
+        public final Forest<?> f;
+        public InnerAmbiguous(Forest<?> f) { this.f = f; }
     }
 
+    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 MyBody<T>(loc, tag, tokens, unwrap);
+    }
     // Body //////////////////////////////////////////////////////////////////////////////
 
-    protected static class Body<T> extends PrintableTree<Forest<T>> implements Iterable<Forest<T>> {
+    public /*protected*/ static interface Body<T> extends GraphViz.ToGraphViz {
+        void expand(int i, TreeBuilder<T> h);
+    }
+    public abstract void edges(GraphViz.Node n);
+    public boolean ambiguous() { return false; }
+    public /*protected*/ static class MyBody<T> extends Forest<T> implements Body<T> /* extends PrintableTree<Forest<T>> implements */ {
+
+        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;
+            //n.comment = reduction==null?null:reduction+"";
+            edges(n);
+            return n;
+        }
+        boolean edges = false;
+        public void edges(GraphViz.Node n) {
+            if (edges) return;
+            edges = true;
+            for(int i=0; i<tokens.length; i++) {
+                if (i==tokens.length-1 && unwrap && !tokens[i].ambiguous()) {
+                    tokens[i].edges(n);
+                } else {
+                    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 Input.Region      location;
         private final T                 tag;
         private final Forest<T>[]       tokens;
         private final boolean           unwrap;
-        private final boolean           singleton;
 
-        private Body(Input.Location loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton) {
+        private MyBody(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;
+        }
+        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>(location, 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>(location, 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) {
+            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]);
+            }
         }
 
-        private HashSet<Tree<T>> expand(boolean toss, ArrayList<Tree<T>> toks, int i, HashSet<Tree<T>> h) {
-            if (singleton) {
-                for(Body<T> b : tokens[0]) b.expand(toss, toks, i, h);
+        public void expand(final int i, final TreeBuilder<T> h) {
+            if (i==0) h.start(tag, location);
 
-            } else if (i==tokens.length) {
-                h.add(new Tree<T>(null, tag, toks.toArray(tree_hint)));
+            if (i==tokens.length) {
+                h.finish(tag, location);
 
             } else if (unwrap && i==tokens.length-1) {
                 if (tokens[i] != null)
-                    for(Body b : tokens[i])
-                        b.expand(toss, toks, 0, h);
+                    tokens[i].visit(h, null, 0);
 
             } else {
-                boolean hit = false;
-                for(Tree<T> r : tokens[i].expand(toss)) {
-                    hit = true;
-                    int old = toks.size();
-                    toks.add(r);
-                    expand(toss, toks, i+1, h);
-                    while(toks.size() > old) toks.remove(toks.size()-1);
-                }
-                //if (!hit) throw new Error();
+                tokens[i].visit(new TreeBuilder<T>(h.toss) {
+                    public void start(T head, Input.Region loc) { }
+                    public void addTree(Tree<T> t) { toks.add(t); }
+                    public void finish(T head, Input.Region 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);
             }
-            return h;
         }
 
-        void addTo(FastSet<Body> h) {
-            if (!singleton) h.add(this, true);
-            else for(Body b : tokens[0]) b.addTo(h);
-        }
-
-        protected String  headToString()         { return null; }
-        protected String  headToJava()           { return null; }
+        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; }
-        public    Iterator<Forest<T>> iterator() { return new ArrayIterator<Forest<T>>(tokens); }
     }
 
 
@@ -94,53 +203,64 @@ public abstract class Forest<T> extends PrintableTree<Forest.Body<T>> implements
      *  viewed, it becomes immutable
      */
     static class Ref<T> extends Forest<T> {
-        private FastSet<Forest> hp = new FastSet<Forest>();
-        private Forest res = null;
+        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 HashSet<GSS.Phase.Node> parents = new HashSet<GSS.Phase.Node>();
+        public boolean contains(Forest f) {
+            return hp.contains(f);
+        }
+        public boolean ambiguous() {
+            if (hp.size()==0) return false;
+            if (hp.size()==1) return hp.iterator().next().ambiguous();
+            return true;
+        }
+        private FastSet<Forest<T>> hp = new FastSet<Forest<T>>();
         public Ref() { }
-        public void merge(Forest p) {
-            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 ((Forest<T>)resolve()).iterator(); }
-        public HashSet<Tree<T>> expand(boolean toss) { return resolve().expand(toss); }
-        public Forest resolve() {
-            if (hp==null) return res;
-            FastSet<Body> nh      = new FastSet<Body>();
-            for(Forest<?> p : hp)
-                for(Body<?> b : (Forest<?>)p)
-                    b.addTo(nh);
-            res = new MultiForest(nh);
-            hp = null;
-            return res;
+        public int toInt() {
+            if (hp.size()==1) return hp.iterator().next().toInt();
+            return super.toInt();
         }
-    }
-
-    // Implementations //////////////////////////////////////////////////////////////////////////////
+        public void merge(Forest p) { if (p!=this) hp.add(p, true); }
 
-    private static class MultiForest<T> extends Forest<T> {
-        private final FastSet<Body<T>> results;
-        private MultiForest(FastSet<Body<T>> results) { this.results = results; }
-        public MultiForest(Input.Location loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton) {
-            this.results = new FastSet<Body<T>>(new Body(loc, tag, tokens, unwrap, singleton));
+        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);
         }
-        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 Ambiguous(this);
-            return ret;
+        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, 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);
+
     // 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; }