private final boolean synthetic;
private final List<Sequence> alternatives = new ArrayList<Sequence>();
+ 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
* @param shortForm the "short form" display; usually
* @param synthetic if true, this Union's "long form" is "obvious" and should not be displayed when printing the grammar
*/
- public Union() { this(null, false); }
- public Union(String name) { this(name, false); }
public Union(String name, boolean synthetic) {
this.name = name;
this.synthetic = synthetic;
for(Sequence n : s.hates) add(n);
}
- // Epsilon Form //////////////////////////////////////////////////////////////////////////////
- // FIXME
- public static Union epsilon = new Union("()");
- static { epsilon.add(Sequence.empty); }
+ // Epsilon Form //////////////////////////////////////////////////////////////////////////////
// FIXME
private Forest.Many epsilonForm = null;
return epsilonForm;
}
+
// Display //////////////////////////////////////////////////////////////////////////////
public String getName() {