X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;ds=sidebyside;f=src%2Fedu%2Fberkeley%2Fsbp%2FForest.java;h=00f826a9e792fc2b8b42af5b14ee2786a82ea377;hb=4ca0bc9a5bf2519c0e2cff2e988a6a7ffc6c7d9e;hp=bc31117325f3142d700ed341cddeede0dfb4b7d2;hpb=dd9286cb6cab28051289fbab244d4b6a19619886;p=sbp.git

diff --git a/src/edu/berkeley/sbp/Forest.java b/src/edu/berkeley/sbp/Forest.java
index bc31117..00f826a 100644
--- a/src/edu/berkeley/sbp/Forest.java
+++ b/src/edu/berkeley/sbp/Forest.java
@@ -7,9 +7,8 @@ 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,
+public abstract class Forest<T> /*extends PrintableTree<Forest.Body<T>>*/
+    implements IntegerMappable,
                GraphViz.ToGraphViz {
 
     private static int master_idx = 0;
@@ -26,10 +25,10 @@ public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/
     }
 
     /** 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);
-        if (toss && ret.size() > 1) throw new InnerAmbiguous(this);
+        HashSet<Tree<T>> ret = new HashSet<Tree<T>>();
+        expand(ret);
         return ret;
     }
 
@@ -38,33 +37,20 @@ public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/
         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; }
@@ -73,7 +59,7 @@ public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/
             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;
         }
@@ -85,66 +71,39 @@ public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/
                 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 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;
             }
         }
 
         protected String  headToString()         { return tag==null?null:tag.toString(); }
-        protected String  headToJava()           { return null; }
+        protected String  headToJava()           { return "null"; }
         protected String  left()                 { return "{"; }
         protected String  right()                { return "}"; }
         protected boolean ignoreSingleton()      { return false; }
@@ -159,6 +118,10 @@ public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/
      *  viewed, it becomes immutable
      */
     static class Ref<T> extends Forest<T> {
+        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 hp.contains(f);
@@ -193,46 +156,9 @@ public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/
             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];
@@ -240,7 +166,7 @@ public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/
     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; }