X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FForest.java;h=0a20228acd563ee908532da57f962af4002d33ee;hp=e4572ec0d598721017d5ff5a3679e232ee2eb330;hb=fc1e5069ec5401c425dd29b77b04285916b62d10;hpb=c7af09d552a9cf2d53a72baa975c9a73384813ea diff --git a/src/edu/berkeley/sbp/Forest.java b/src/edu/berkeley/sbp/Forest.java index e4572ec..0a20228 100644 --- a/src/edu/berkeley/sbp/Forest.java +++ b/src/edu/berkeley/sbp/Forest.java @@ -7,7 +7,7 @@ import java.util.*; import java.lang.reflect.*; /** an efficient representation of a collection of trees (Tomita's shared packed parse forest) */ -public abstract class Forest { +public abstract class Forest extends PrintableTree> implements Iterable> { /** assume that this forest contains exactly one tree and return it; otherwise throw an exception */ public final Tree expand1() throws Ambiguous, ParseFailed { @@ -28,7 +28,7 @@ public abstract class Forest { // Body ////////////////////////////////////////////////////////////////////////////// - protected static class Body { + protected static class Body extends PrintableTree> implements Iterable> { private final Input.Location location; private final T tag; @@ -48,14 +48,14 @@ public abstract class Forest { private HashSet> expand(boolean toss, ArrayList> toks, int i, HashSet> h) { if (singleton) { - for(Body b : (IterableForest)tokens[0]) b.expand(toss, toks, i, h); + for(Body b : tokens[0]) b.expand(toss, toks, i, h); } else if (i==tokens.length) { h.add(new Tree(null, tag, toks.toArray(tree_hint))); } else if (unwrap && i==tokens.length-1) { if (tokens[i] != null) - for(Body b : (IterableForest)tokens[i]) + for(Body b : tokens[i]) b.expand(toss, toks, 0, h); } else { @@ -74,38 +74,26 @@ public abstract class Forest { void addTo(FastSet h) { if (!singleton) h.add(this, true); - else for(Body b : (IterableForest)tokens[0]) b.addTo(h); + else for(Body b : tokens[0]) b.addTo(h); } - public String toString() { - StringBuffer ret = new StringBuffer(); - for(int i=0; i 0) { - ret.append(q); - ret.append(" "); - } - } - String tail = ret.toString().trim(); - String head = (tag!=null && !tag.toString().equals("")) ? (tail.length() > 0 ? tag+":" : tag+"") : ""; - if (tail.length() > 0) tail = "{" + tail + "}"; - return head + tail; - } + protected String headToString() { return null; } + protected String headToJava() { return null; } + protected String left() { return "{"; } + protected String right() { return "}"; } + protected boolean ignoreSingleton() { return false; } + public Iterator> iterator() { return new ArrayIterator>(tokens); } } // Ref ////////////////////////////////////////////////////////////////////////////// - private static abstract class IterableForest extends Forest implements Iterable> { - public abstract Iterator> iterator(); - } - /** * This class represents a partially complete collection of * forests to be viewed as a forest at some later date; once * viewed, it becomes immutable */ - static class Ref extends IterableForest { + static class Ref extends Forest { private FastSet hp = new FastSet(); private Forest res = null; public Ref() { } @@ -114,14 +102,13 @@ public abstract class Forest { if (p==null) throw new Error(); if (p!=this) hp.add(p, true); } - public Iterator> iterator() { return ((IterableForest)resolve()).iterator(); } + public Iterator> iterator() { return ((Forest)resolve()).iterator(); } public HashSet> expand(boolean toss) { return resolve().expand(toss); } - public String toString() { return resolve().toString(); } public Forest resolve() { if (hp==null) return res; FastSet nh = new FastSet(); for(Forest p : hp) - for(Body b : (IterableForest)p) + for(Body b : (Forest)p) b.addTo(nh); res = new MultiForest(nh); hp = null; @@ -131,14 +118,13 @@ public abstract class Forest { // Implementations ////////////////////////////////////////////////////////////////////////////// - private static class MultiForest extends IterableForest { + private static class MultiForest extends Forest { private final FastSet> results; private MultiForest(FastSet> results) { this.results = results; } public MultiForest(Input.Location loc, T tag, Forest[] tokens, boolean unwrap, boolean singleton) { this.results = new FastSet>(new Body(loc, tag, tokens, unwrap, singleton)); } public Iterator> iterator() { return results.iterator(); } - public HashSet> expand(boolean toss) { HashSet> ret = new HashSet>(); for(Body b : results) @@ -146,32 +132,16 @@ public abstract class Forest { if (toss && ret.size() > 1) throw new Ambiguous(this); return ret; } - - // Display ////////////////////////////////////////////////////////////////////////////// - - private String toString = null; - public String toString() { - if (toString != null) return toString; - StringBuffer ret = new StringBuffer(); - if (results.size()==1) { - for(Forest.Body r : results) - ret.append(r); - return toString = ret.toString(); - } - ret.append(" r : results) { - if (!first) ret.append(' '); - first = false; - ret.append(r); - } - ret.append("?>"); - return toString = ret.toString(); - } } // Statics ////////////////////////////////////////////////////////////////////////////// private static Tree[] tree_hint = new Tree[0]; private static final Forest[] emptyForestArray = new Forest[0]; + + protected String headToString() { return null; } + protected String headToJava() { return null; } + protected String left() { return ""; } + protected boolean ignoreSingleton() { return true; } }