1 package edu.berkeley.sbp;
2 import edu.berkeley.sbp.*;
3 import edu.berkeley.sbp.util.*;
4 import edu.berkeley.sbp.bind.*;
7 import java.lang.reflect.*;
9 /** a tree (or node in a tree); see jargon.txt for details */
11 extends PrintableTree<Tree<T>>
12 implements Iterable<Tree<T>>,
15 private final Input.Region location;
17 private final Tree<T>[] children;
18 private final boolean lift;
20 public T head() { return head; }
22 private Tree<T> lifted() { return children[children.length-1]; }
24 public int numChildren() {
26 ? (children.length-1)+lifted().numChildren()
29 public Iterable<Tree<T>> children() { return this; }
30 public Iterator<Tree<T>> iterator() {
32 ? new ConcatenateIterator(new ArrayIterator(children, 0, children.length-1),
33 children[children.length-1].iterator())
34 : new ArrayIterator(children);
37 public Tree<T> child(int i) {
38 return lift && i >= children.length-1
39 ? children[children.length-1].child(i-(children.length-1))
43 public Input.Region getRegion() { return location; }
45 public Tree(Input.Region loc, T head) { this(loc, head, null); }
46 public Tree(Input.Region loc, T head, Tree<T>[] children) { this(loc, head, children, false); }
47 public Tree(Input.Region loc, T head, Tree<T>[] children, boolean lift) {
50 this.lift = lift && children != null && children.length > 0;
52 Tree<T>[] children2 = children==null ? new Tree[0] : new Tree[children.length];
53 if (children != null) System.arraycopy(children, 0, children2, 0, children.length);
54 this.children = children2;
58 // PrintableTree /////////////////////////////////////////////////////////////////////////////
60 protected String headToString() { return head()==null?null:head().toString(); }
61 protected String headToJava() {
63 if (head()==null) return null;
64 if (head() instanceof ToJava) {
65 StringBuffer sb = new StringBuffer();
66 ((ToJava)head()).toJava(sb);
69 return (head()==null?"null":("\""+StringUtil.toJavaString(head().toString())+"\""));
71 protected String left() { return "{"; }
72 protected String right() { return "}"; }
73 protected boolean ignoreSingleton() { return false; }
76 // ToGraphViz /////////////////////////////////////////////////////////////////////////////
78 public GraphViz.Node toGraphViz(GraphViz gv) {
79 if (gv.hasNode(this)) return gv.createNode(this);
80 GraphViz.Node n = gv.createNode(this);
81 n.label = head()==null ? "" : head().toString();
83 for(Tree t : this) n.edge(t, null);
86 public boolean isTransparent() { return false; }
87 public boolean isHidden() { return false; }
89 public static interface TreeFunctor<T,R> extends Functor<Iterable<Tree<T>>, R> { }
92 public static class RawBindingFunctor<T> implements TreeFunctor<T,Object>, ToJava {
93 private Binding _binding;
94 private String _toString;
95 public RawBindingFunctor(String toString, Binding binding) {
96 this._binding = binding;
97 this._toString = toString;
99 public String toString() {
102 public void toJava(StringBuffer sb) {
103 sb.append("new Tree.RawBindingFunctor(");
105 sb.append(StringUtil.toJavaString(_toString));
110 public Object invoke(Iterable<Tree<T>> t) {
111 return _binding.invoke(new Object[] { t });
115 public static class BindingFunctor<T> implements TreeFunctor<T,Object>, ToJava {
116 private Binding _binding;
117 private String _toString;
118 public String toString() {
121 public BindingFunctor(String toString, Binding binding) {
122 this._binding = binding;
123 this._toString = toString;
125 public void toJava(StringBuffer sb) {
126 sb.append("new Tree.BindingFunctor(");
128 sb.append(StringUtil.toJavaString(_toString));
133 public Object invoke(Iterable<Tree<T>> t) {
134 ArrayList ret = new ArrayList();
136 if (tc.head() != null && tc.head() instanceof Functor)
137 ret.add(((Tree.TreeFunctor<Object,Object>)tc.head()).invoke(tc.children()));
138 else if (tc.numChildren() == 0)
141 System.err.println("FIXME: don't know what to do about " + tc);
145 Object[] o = (Object[])ret.toArray(new Object[0]);
146 return _binding.invoke(o);