X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FAmbiguous.java;h=8f7fb249225caa5b2aae658b1ea35aae5c5fe89c;hp=37a857ca0874161e83b9b8127c13685a434de774;hb=HEAD;hpb=8a5250c184672495fae152e096b2e800749cd0db diff --git a/src/edu/berkeley/sbp/Ambiguous.java b/src/edu/berkeley/sbp/Ambiguous.java index 37a857c..8f7fb24 100644 --- a/src/edu/berkeley/sbp/Ambiguous.java +++ b/src/edu/berkeley/sbp/Ambiguous.java @@ -1,28 +1,30 @@ +// Copyright 2006-2007-2007 all rights reserved; see LICENSE file for BSD-style license + package edu.berkeley.sbp; -import edu.berkeley.sbp.*; import edu.berkeley.sbp.util.*; -import edu.berkeley.sbp.Sequence.Position; -import java.io.*; import java.util.*; -/** if ambiguity checking is enabled, this exception is thrown to signal that the parse was ambiguous */ +/** thrown to signal that a parse was ambiguous */ public class Ambiguous extends Exception { - final Forest ambiguity; - private final HashSet> ht; - Ambiguous(Forest ambiguity, HashSet> ht) { + + private final Forest ambiguity; + private final HashSet> possibilities; + + /** + * @param possibilities is a specially-constructed set of trees with shared nodes replaced by '*' + */ + Ambiguous(Forest ambiguity, HashSet> possibilities) { this.ambiguity = ambiguity; - this.ht = ht; + this.possibilities = possibilities; } - public Forest getAmbiguity() { return ambiguity; } + public Forest getForest() { return ambiguity; } public String toString() { - // FIXME: print the input region that was ambiguously matched StringBuffer sb = new StringBuffer(); sb.append("unresolved ambiguity at "+ambiguity.getRegion()+"; shared subtrees are shown as \"*\" "); - //sb.append("\noffending text: "); - for(Tree result : ht) { - sb.append("\n possibility: "); + for(Tree result : possibilities) { + sb.append("\n possibility: "); StringBuffer sb2 = new StringBuffer(); result.toPrettyString(sb2); sb.append(StringUtil.indent(sb2.toString(), 15));