X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FTree.java;h=1b9ddfa668f8bcee675892b4c216cc7408456fac;hp=989224cc8bdb137509a9f7217540c370867b337c;hb=c8d1c3a25e2bfa9645c4b91d3dde9c4857f636f2;hpb=0a0227b9180534d2a431f3d6e08a398bde2244c4 diff --git a/src/edu/berkeley/sbp/Tree.java b/src/edu/berkeley/sbp/Tree.java index 989224c..1b9ddfa 100644 --- a/src/edu/berkeley/sbp/Tree.java +++ b/src/edu/berkeley/sbp/Tree.java @@ -1,57 +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 { +public class Tree + extends PrintableTree> + implements Iterable>, + GraphViz.ToGraphViz { + + private final Input.Region location; + private final T head; + private final Tree[] children; + private final boolean lift; - final T head; - Tree[] children; - final Token.Location location; + public T head() { return head; } - public T head() { return head; } - public int numChildren() { return children.length; } - public Iterable> children() { return new ArrayIterator(children); } + private Tree lifted() { return children[children.length-1]; } + + public int numChildren() { + return lift + ? (children.length-1)+lifted().numChildren() + : children.length; + } + public Iterable> children() { return this; } + public Iterator> iterator() { + return lift + ? new ConcatenateIterator(new ArrayIterator(children, 0, children.length-1), + children[children.length-1].iterator()) + : new ArrayIterator(children); + } + + public Tree child(int i) { + return lift && i >= children.length-1 + ? children[children.length-1].child(i-(children.length-1)) + : children[i]; + } - public Token.Location getLocation() { return location; } + 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[] children) { + public Tree(Input.Region loc, T head) { this(loc, head, null); } + public Tree(Input.Region loc, T head, Tree[] children) { this(loc, head, children, false); } + public Tree(Input.Region loc, T head, Tree[] children, boolean lift) { this.location = loc; this.head = head; - Tree[] 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); } - /** append Java code to sb which evaluates to this instance */ - public void toJava(StringBuffer sb) { - sb.append("new Tree(null, "); - sb.append(head==null ? "null" : "\"" + StringUtil.toJavaString(head+"") + "\""); - sb.append(", new Tree[] { "); - for(int i=0; i 0) { ret.append(q); ret.append(" "); } - } - String tail = ret.toString().trim(); - String h = (head!=null && !head.toString().equals("")) ? (tail.length() > 0 ? head+":" : head+"") : ""; - if (tail.length() > 0) tail = "{" + tail + "}"; - return h + tail; + + // 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 ///////////////////////////////////////////////////////////////////////////// + public static interface TreeFunctor extends Functor>, R> { } + }