final T head;
Tree<T>[] children;
- final Token.Location location;
+ final Input.Location location;
public T head() { return head; }
public int numChildren() { return children.length; }
public Iterator<Tree<T>> iterator() { return new ArrayIterator(children); }
public Tree<T> child(int i) { return children[i]; }
- public Token.Location getLocation() { return location; }
+ public Input.Location getLocation() { 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.Location loc, T head) { this(loc, head, null); }
+ public Tree(Input.Location loc, T head, Tree<T>[] children) {
this.location = loc;
this.head = head;
Tree<T>[] children2 = children==null ? new Tree[0] : new Tree[children.length];
this.children = children2;
}
+ /** 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();
+ }
+ private String toString = null;
+
protected String headToString() { return head==null?null:head.toString(); }
protected String headToJava() { return head==null?null:StringUtil.toJavaString(head+""); }
+ protected String left() { return "{"; }
+ protected String right() { return "}"; }
+ protected boolean ignoreSingleton() { return false; }
}