X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FTree.java;h=1b9ddfa668f8bcee675892b4c216cc7408456fac;hp=6b295a5b18b7b66f4b1b9367cc21b1951f60c979;hb=c8d1c3a25e2bfa9645c4b91d3dde9c4857f636f2;hpb=136bae5cb17061a7d1142450a67ee11a40ba7ef9

diff --git a/src/edu/berkeley/sbp/Tree.java b/src/edu/berkeley/sbp/Tree.java
index 6b295a5..1b9ddfa 100644
--- a/src/edu/berkeley/sbp/Tree.java
+++ b/src/edu/berkeley/sbp/Tree.java
@@ -1,42 +1,91 @@
 package edu.berkeley.sbp;
 import edu.berkeley.sbp.*;
-import edu.berkeley.sbp.*;
 import edu.berkeley.sbp.util.*;
+import edu.berkeley.sbp.bind.*;
 import java.io.*;
 import java.util.*;
 import java.lang.reflect.*;
 
 /** a tree (or node in a tree); see jargon.txt for details */
-public class Tree<T> extends PrintableTree<Tree<T>> implements Iterable<Tree<T>> {
+public class Tree<T>
+    extends PrintableTree<Tree<T>>
+    implements Iterable<Tree<T>>,
+               GraphViz.ToGraphViz {
 
-    final T           head;
-          Tree<T>[]   children;
-    final Token.Location    location;
+    private final Input.Region location;
+    private final T            head;
+    private final Tree<T>[]    children;
+    private final boolean      lift;
 
     public T                 head()        { return head; }
-    public int               numChildren() { return children.length; }
-    public Iterable<Tree<T>> children()    { return new ArrayIterator(children); }
-    public Iterator<Tree<T>> iterator()    { return new ArrayIterator(children); }
-    public Tree<T>           child(int i)  { return children[i]; }
 
-    public       Token.Location    getLocation() { return location; }
+    private Tree<T> lifted() { return children[children.length-1]; }
+
+    public int               numChildren() {
+        return lift
+            ? (children.length-1)+lifted().numChildren()
+            : children.length;
+    }
+    public Iterable<Tree<T>> children()    { return this; }
+    public Iterator<Tree<T>> iterator()    {
+        return lift
+            ? new ConcatenateIterator(new ArrayIterator(children, 0, children.length-1),
+                                      children[children.length-1].iterator())
+            : new ArrayIterator(children);
+    }
+
+    public Tree<T> child(int i)  {
+        return lift && i >= children.length-1
+            ? children[children.length-1].child(i-(children.length-1))
+            : children[i];
+    }
+
+    public Input.Region    getRegion() { return location; }
 
-    public Tree(Token.Location loc, T head)                   { this(loc, head, null); }
-    public Tree(Token.Location loc, T head, Tree<T>[] children) {
+    public Tree(Input.Region loc, T head)                     { this(loc, head, null); }
+    public Tree(Input.Region loc, T head, Tree<T>[] children) { this(loc, head, children, false); }
+    public Tree(Input.Region loc, T head, Tree<T>[] children, boolean lift) {
         this.location = loc;
         this.head = head;
-        Tree<T>[] children2 = children==null ? new Tree[0] : new Tree[children.length];
-        if (children != null) System.arraycopy(children, 0, children2, 0, children.length);
-        this.children = children2;
+        this.lift = lift && children != null && children.length > 0;
+        this.children = ArrayUtil.clone(children, Tree.class);
     }
 
-    /** since Tree instances are immutable, we can cache this to make pretty-printing MUCH faster */
-    public String toString() {
-        if (toString!=null) return toString;
-        return toString = super.toString();
+
+    // PrintableTree /////////////////////////////////////////////////////////////////////////////
+
+    protected String headToString() { return head()==null?null:head().toString(); }
+    protected String headToJava()   {
+      // FIXME
+        if (head()==null) return null;
+        if (head() instanceof ToJava) {
+            StringBuffer sb = new StringBuffer();
+            ((ToJava)head()).toJava(sb);
+            return sb.toString();
+        }
+        return (head()==null?"null":("\""+StringUtil.toJavaString(head().toString())+"\""));
     }
-    private String toString = null;
+    protected String left()   { return "{"; }
+    protected String right()  { return "}"; }
+    protected boolean ignoreSingleton() { return false; }
+
+
+    // ToGraphViz /////////////////////////////////////////////////////////////////////////////
+
+    public GraphViz.Node toGraphViz(GraphViz gv) {
+        if (gv.hasNode(this)) return gv.createNode(this);
+        GraphViz.Node n = gv.createNode(this);
+        n.label = head()==null ? "" : head().toString();
+        //n.color = "red";
+        for(Tree t : this) n.edge(t, null);
+        return n;
+    }
+    public boolean isTransparent() { return false; }
+    public boolean isHidden() { return false; }
+
+
+    // TreeFunctor /////////////////////////////////////////////////////////////////////////////
 
-    protected String headToString() { return head==null?null:head.toString(); }
-    protected String headToJava()   { return head==null?null:StringUtil.toJavaString(head+""); }
+    public static interface TreeFunctor<T,R> extends Functor<Iterable<Tree<T>>, R> { }
+    
 }