X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FUnion.java;h=5932ac39ec7423a1c124afa28dc6eef896d0c2ab;hp=ece239dc005e5ceea961a2fb3eacf72240cb4ae3;hb=24112db237318c030b4d4f457d90c34fd69d652b;hpb=23091054a6842031d168c2628216c2310149cc5d diff --git a/src/edu/berkeley/sbp/Union.java b/src/edu/berkeley/sbp/Union.java index ece239d..5932ac3 100644 --- a/src/edu/berkeley/sbp/Union.java +++ b/src/edu/berkeley/sbp/Union.java @@ -12,18 +12,18 @@ public class Union extends Element implements Iterable { private final String name; private final boolean synthetic; + private final List alternatives = new ArrayList(); - public Union() { this(null, false); } public Union(String name) { this(name, false); } /** * Since every cycle in a non-degenerate grammar contains at * least one Union, every instance of this class must be able to * display itself in both "long form" (list of the long forms of - * its alternatives) and "short form" (some abbreviation). + * its alternatives) and "short form" (some name). * - * @param shortForm the "short form" display; usually + * @param shortForm the "short form" display; for display purposes only * @param synthetic if true, this Union's "long form" is "obvious" and should not be displayed when printing the grammar */ public Union(String name, boolean synthetic) { @@ -31,16 +31,13 @@ public class Union extends Element implements Iterable { this.synthetic = synthetic; } - public Iterator iterator() { return alternatives.iterator(); } public boolean contains(Sequence s) { return alternatives.contains(s); } + public Iterator iterator() { return alternatives.iterator(); } /** adds an alternative */ public void add(Sequence s) { + if (alternatives.contains(s)) return; alternatives.add(s); - - // FIXME: does this make sense? - for(Sequence n : s.needs) add(n); - for(Sequence n : s.hates) add(n); } @@ -92,7 +89,6 @@ public class Union extends Element implements Iterable { private void bodyToString(StringBuffer sb, String before, String between) { boolean first = true; for(Sequence s : this) { - if (s.lame) continue; // FIXME: what to do here about printing out negated sequences? sb.append(first ? before : between); first = false;