for(Sequence s : needs) { ret.needs.add(s); s.needed.add(ret); }
for(Sequence s : hates) { ret.hates.add(s); s.hated.add(ret); }
ret.follow = follow;
- ret.lame = lame;
return ret;
}
public static final Sequence empty = new Sequence.Constant.Empty();
/** after matching the sequence, do not add anything to the output tree */
- public static Sequence drop(Element[] e, boolean lame) { return new Constant.Drop(e, lame); }
+ public static Sequence drop(Element[] e) { return new Constant.Drop(e); }
/** after matching the sequence, insert a constant into the output tree */
public static Sequence constant(Element[] e, Object o) { return new Constant(e, o); }
////////////////////////////////////////////////////////////////////////////////
- public Element follow = null;
- public final Topology follow() { return follow==null ? null : Atom.toAtom(follow); }
-
- Topology toAtom() {
- if (elements.length!=1)
- throw new RuntimeException("cannot invoke toAtom() on a Sequence with " + elements.length + " elements: " + this);
- return Atom.toAtom(elements[0]);
- }
+ public Atom follow = null;
+ public final Topology follow() { return follow; }
public Sequence and(Sequence s) { Sequence ret = dup(); ret.needs.add(s); s.needed.add(ret); return ret; }
public Sequence not(Sequence s) { Sequence ret = dup(); ret.hates.add(s); s.hated.add(ret); return ret; }
+ public Iterable<Sequence> needs() { return needs; }
+ public Iterable<Sequence> hates() { return hates; }
+
protected final Element[] elements;
final HashSet<Sequence> needed = new HashSet<Sequence>();
final HashSet<Sequence> hated = new HashSet<Sequence>();
final HashSet<Sequence> needs = new HashSet<Sequence>();
final HashSet<Sequence> hates = new HashSet<Sequence>();
- public boolean lame = false;
final Position firstp;
Position firstp() { return firstp; }
}
// DO NOT MESS WITH THE FOLLOWING LINE!!!
- private Forest.Ref epsilonForm = null;
+ private Forest.Many epsilonForm = null;
Forest epsilonForm() {
if (epsilonForm!=null) return epsilonForm;
- epsilonForm = new Forest.Ref();
+ epsilonForm = new Forest.Many();
epsilonForm.merge(firstp().rewrite(null, false));
return epsilonForm;
}
return (Forest<T>)Forest.create(loc, result, null, false);
}
static class Drop extends Constant {
- Sequence _clone() { return new Drop(elements, lame); }
- public Drop(Element[] e, boolean lame) {
- super(e, null);
- this.lame = lame;
- }
+ Sequence _clone() { return new Drop(elements); }
+ public Drop(Element[] e) { super(e, null); }
}
static class Empty extends Sequence.Constant.Drop {
Sequence _clone() { return new Empty(); }
- public Empty() { super(new Element[] { }, false); } }
+ public Empty() { super(new Element[] { }); } }
}
static class Singleton extends Sequence {