checkpoint

[sbp.git] / src / edu / berkeley / sbp / Forest.java

diff --git a/src/edu/berkeley/sbp/Forest.java b/src/edu/berkeley/sbp/Forest.java
index 8399053..420d655 100644 (file)
--- a/src/edu/berkeley/sbp/Forest.java
+++ b/src/edu/berkeley/sbp/Forest.java
@@ -20,9 +20,9 @@ public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/ impl
     public HashSet<Tree<T>> expand(boolean toss) {
         final HashSet<Tree<T>> hs = new HashSet<Tree<T>>();
         TreeMaker<T> ret = new TreeMaker<T>(toss) {
-            public void add(Input.Location loc, T head) {
-                hs.add(new Tree<T>(loc, head, toks.toArray(tree_hint)));
-            }
+            public void start(T head, Input.Location loc) { }
+            public void finish(T head, Input.Location loc) { hs.add(new Tree<T>(loc, head, toks.toArray(tree_hint))); }
+            public void child(Tree<T> t) { toks.add(t); }
         };
         visit(ret, null, null);
         if (toss && hs.size() > 1) throw new Ambiguous(this);
@@ -39,7 +39,7 @@ public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/ impl
     // Body //////////////////////////////////////////////////////////////////////////////
 
     protected static interface Body<T> {
-        TreeMaker<T> expand(int i, TreeMaker<T> h);
+        void expand(int i, TreeMaker<T> h);
     }
 
     protected static class MyBody<T> extends Forest<T> implements Body<T> /* extends PrintableTree<Forest<T>> implements */ {
@@ -64,12 +64,15 @@ public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/ impl
             this.singleton = singleton;
         }
 
-        public TreeMaker<T> expand(final int i, final TreeMaker<T> h) {
+        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);
 
-            } else if (i==tokens.length) {
-                h.add(/*FIXME*/null, tag);
+            if (i==tokens.length) {
+                h.finish(tag, location);
 
             } else if (unwrap && i==tokens.length-1) {
                 if (tokens[i] != null)
@@ -77,15 +80,16 @@ public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/ impl
 
             } else {
                 tokens[i].visit(new TreeMaker<T>(h.toss) {
-                    public void add(Input.Location loc, T head) {
+                    public void start(T head, Input.Location loc) { }
+                    public void child(Tree<T> t) { toks.add(t); }
+                    public void finish(T head, Input.Location loc) {
                         int old = h.toks.size();
-                        h.toks.add(new Tree<T>(loc, head, toks.toArray(tree_hint)));
+                        h.child(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;
         }
 
         protected String  headToString()         { return null; }
@@ -119,8 +123,11 @@ public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/ impl
     private static abstract class TreeMaker<T> implements Invokable<Forest.Body<T>,Boolean,Integer> {
         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 add(Input.Location loc, T head);
+        public abstract void start(T head, Input.Location loc);
+        public abstract void finish(T head, Input.Location loc);
+        public abstract void child(Tree<T> t);
         public void invoke(Forest.Body<T> bod, Boolean o, Integer i) {
             if (i==null) {
                 ArrayList<Tree<T>> toks = this.toks;