1 package edu.berkeley.sbp;
2 import edu.berkeley.sbp.*;
3 import edu.berkeley.sbp.*;
4 import edu.berkeley.sbp.util.*;
7 import java.lang.reflect.*;
9 /** an efficient representation of a collection of trees (Tomita's shared packed parse forest) */
10 public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/ implements Visitable<Forest.Body<T>> {
12 /** assume that this forest contains exactly one tree and return it; otherwise throw an exception */
13 public final Tree<T> expand1() throws Ambiguous, ParseFailed {
14 Iterator<Tree<T>> it = expand(true).iterator();
15 if (!it.hasNext()) throw new ParseFailed();
19 /** expand this forest into a set of trees */
20 public HashSet<Tree<T>> expand(boolean toss) {
21 final HashSet<Tree<T>> hs = new HashSet<Tree<T>>();
22 TreeMaker<T> ret = new TreeMaker<T>(toss) {
23 public void add(Input.Location loc, T head) {
24 hs.add(new Tree<T>(loc, head, toks.toArray(tree_hint)));
27 visit(ret, null, null);
28 if (toss && hs.size() > 1) throw new Ambiguous(this);
32 static <T> Forest<T> singleton(Input.Location loc) { return create(loc, null, new Forest[] { }, false, true); }
33 static <T> Forest<T> singleton(Input.Location loc, Forest<T> body) { return create(loc, null, new Forest[] { body }, false, true); }
34 static <T> Forest<T> leaf(Input.Location loc, T tag) { return create(loc, tag, null, false, false); }
35 public static <T> Forest<T> create(Input.Location loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton) {
36 return new MyBody<T>(loc, tag, tokens, unwrap, singleton);
39 // Body //////////////////////////////////////////////////////////////////////////////
41 protected static interface Body<T> {
42 TreeMaker<T> expand(int i, TreeMaker<T> h);
45 protected static class MyBody<T> extends Forest<T> implements Body<T> /* extends PrintableTree<Forest<T>> implements */ {
47 public <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c) {
48 ivbc.invoke(this, b, c);
51 private final Input.Location location;
53 private final Forest<T>[] tokens;
54 private final boolean unwrap;
55 private final boolean singleton;
57 private MyBody(Input.Location loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton) {
60 this.tokens = tokens==null ? emptyForestArray : new Forest[tokens.length];
61 if (tokens != null) System.arraycopy(tokens, 0, this.tokens, 0, tokens.length);
62 if (tokens != null) for(int i=0; i<tokens.length; i++) if (tokens[i]==null) throw new Error(i+"");
64 this.singleton = singleton;
67 public TreeMaker<T> expand(final int i, final TreeMaker<T> h) {
69 tokens[0].visit(h, null, i);
71 } else if (i==tokens.length) {
72 h.add(/*FIXME*/null, tag);
74 } else if (unwrap && i==tokens.length-1) {
75 if (tokens[i] != null)
76 tokens[i].visit(h, null, 0);
79 tokens[i].visit(new TreeMaker<T>(h.toss) {
80 public void add(Input.Location loc, T head) {
81 int old = h.toks.size();
82 h.toks.add(new Tree<T>(loc, head, toks.toArray(tree_hint)));
84 while(h.toks.size() > old) h.toks.remove(h.toks.size()-1);
91 protected String headToString() { return null; }
92 protected String headToJava() { return null; }
93 protected String left() { return "{"; }
94 protected String right() { return "}"; }
95 protected boolean ignoreSingleton() { return false; }
99 // Ref //////////////////////////////////////////////////////////////////////////////
102 * This class represents a partially complete collection of
103 * forests to be viewed as a forest at some later date; once
104 * viewed, it becomes immutable
106 static class Ref<T> extends Forest<T> {
107 private FastSet<Forest<T>> hp = new FastSet<Forest<T>>();
109 public void merge(Forest p) { if (p!=this) hp.add(p, true); }
110 public <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c) {
111 if (hp==null) return;
112 for(Forest<T> f : hp)
115 public Forest resolve() { return this; }
118 public abstract <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c);
119 private static abstract class TreeMaker<T> implements Invokable<Forest.Body<T>,Boolean,Integer> {
120 public ArrayList<Tree<T>> toks = new ArrayList<Tree<T>>();
121 private boolean toss;
122 public TreeMaker(boolean toss) { this.toss = toss; }
123 public abstract void add(Input.Location loc, T head);
124 public void invoke(Forest.Body<T> bod, Boolean o, Integer i) {
126 ArrayList<Tree<T>> toks = this.toks;
127 this.toks = new ArrayList<Tree<T>>();
136 // Statics //////////////////////////////////////////////////////////////////////////////
138 private static Tree[] tree_hint = new Tree[0];
139 private static final Forest[] emptyForestArray = new Forest[0];
141 protected String headToString() { return null; }
142 protected String headToJava() { return null; }
143 protected String left() { return "<?"; }
144 protected String right() { return "?>"; }
145 protected boolean ignoreSingleton() { return true; }