1 package edu.berkeley.sbp;
2 import edu.berkeley.sbp.util.*;
3 import edu.berkeley.sbp.*;
4 import edu.berkeley.sbp.*;
7 import java.lang.reflect.*;
8 import java.lang.ref.*;
10 /** an element which can produce one of several alternatives */
11 public class Union extends Element implements Iterable<Sequence> {
13 private final String name;
14 private final boolean synthetic;
15 private final List<Sequence> alternatives = new ArrayList<Sequence>();
18 * Since every cycle in a non-degenerate grammar contains at
19 * least one Union, every instance of this class must be able to
20 * display itself in both "long form" (list of the long forms of
21 * its alternatives) and "short form" (some abbreviation).
23 * @param shortForm the "short form" display; usually
24 * @param synthetic if true, this Union's "long form" is "obvious" and should not be displayed when printing the grammar
26 public Union() { this(null, false); }
27 public Union(String name) { this(name, false); }
28 public Union(String name, boolean synthetic) {
30 this.synthetic = synthetic;
33 public Iterator<Sequence> iterator() { return alternatives.iterator(); }
34 public boolean contains(Sequence s) { return alternatives.contains(s); }
36 /** adds an alternative */
37 public void add(Sequence s) {
40 // FIXME: does this make sense?
41 for(Sequence n : s.needs) add(n);
42 for(Sequence n : s.hates) add(n);
45 // Epsilon Form //////////////////////////////////////////////////////////////////////////////
48 private Forest.Many epsilonForm = null;
49 Forest epsilonForm() {
50 if (epsilonForm != null) return epsilonForm;
51 epsilonForm = new Forest.Many();
52 for(Sequence s : this) {
54 if (new Walk.Cache().possiblyEpsilon(s))
55 epsilonForm.merge(s.epsilonForm());
60 // Display //////////////////////////////////////////////////////////////////////////////
62 public String getName() {
63 if (name != null) return name;
64 return "(anon_union)";
66 public String toString() {
67 if (name != null) return name;
68 StringBuffer sb = new StringBuffer();
70 bodyToString(sb, "", " | ");
74 public StringBuffer toString(StringBuffer sb) {
75 if (synthetic) return sb;
77 String before = StringUtil.pad(15, getName()) + " = ";
78 if (alternatives.size()==0) {
83 "\n" + StringUtil.pad(15, "") + " | ");
89 private void bodyToString(StringBuffer sb, String before, String between) {
91 for(Sequence s : this) {
93 // FIXME: what to do here about printing out negated sequences?
94 sb.append(first ? before : between);
96 sb.append(s.toString());