}
/** the empty sequence (matches the empty string) */
- public static final Sequence empty = new Sequence.Constant.Empty();
+ public static Sequence newEmptySequence() { return new Sequence.Constant.Empty(); }
/** after matching the sequence, do not add anything to the output tree */
- public static Sequence drop(Element[] e) { return new Constant.Drop(e); }
+ public static Sequence newDropSequence(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 static Sequence newConstantSequence(Element[] e, Object o) { return new Constant(e, o); }
/** after matching the sequence, place the result of the <tt>idx</tt>th match in the output tree */
- public static Sequence singleton(Element[] e, int idx) { return new Singleton(e, idx); }
- public static Sequence singleton(Element e) { return singleton(new Element[] { e }, 0); }
+ public static Sequence newSingletonSequence(Element[] e, int idx) { return new Singleton(e, idx); }
+ public static Sequence newSingletonSequence(Element e) { return newSingletonSequence(new Element[] { e }, 0); }
/**
* after matching the sequence, create the specified output tree
* @param drops only elements of <tt>e</tt> whose corresponding <tt>boolean</tt> in <tt>drops</tt>
* is <i>false</i> will be included in the output tree
**/
- public static Sequence rewritingSequence(Object tag, Element[] e, boolean[] drops) {
+ public static Sequence newRewritingSequence(Object tag, Element[] e, boolean[] drops) {
return new RewritingSequence(tag, e, drops); }
- public static Sequence regionRewritingSequence(Functor<Input.Region,Object> tagfunctor, Element[] e, boolean[] drops) {
- return new RegionRewritingSequence(tagfunctor, e, drops); }
+ public static Sequence newUnwrapSequence(Element[] e, Object tag, boolean[] drops) { return new Unwrap(e, tag, drops); }
////////////////////////////////////////////////////////////////////////////////
+ /** return a new sequence identical to this one, but with a positive conjunct <tt>s</tt> */
public Sequence and(Sequence s) { Sequence ret = dup(); ret.needs.add(s); return ret; }
+
+ /** return a new sequence identical to this one, but with a negative conjunct <tt>s</tt> */
public Sequence not(Sequence s) { Sequence ret = dup(); ret.hates.add(s); s.hated.add(ret); return ret; }
+
+ /** return a new sequence identical to this one, but with a follow-set restricted to <tt>a</tt> */
public Sequence followedBy(Atom a) { Sequence ret = dup(); ret.follow = a; return ret; }
- public Iterable<Sequence> needs() { return needs; }
- public Iterable<Sequence> hates() { return hates; }
+ Iterable<Sequence> needs() { return needs; }
+ Iterable<Sequence> hates() { return hates; }
Position firstp() { return firstp; }
Sequence _clone() { return new Singleton(elements,idx); }
}
- public static Unwrap unwrap(Element[] e, Object tag, boolean[] drops) { return new Unwrap(e, tag, drops); }
static class Unwrap extends Sequence {
private boolean[] drops;
private final Object tag;
public Unwrap(Element[] e, Object tag) { super(e); this.drops = null; this.tag = tag; }
public Unwrap(Element[] e, Object tag, boolean[] drops) { super(e); this.drops = drops; this.tag = tag; }
- Sequence _clone() { return new Unwrap(elements, drops); }
+ Sequence _clone() { return new Unwrap(elements, tag, drops); }
public <T> Forest<T> postReduce(Input.Region loc, Forest<T>[] args, Position p) {
for(int i=0; i<args.length; i++) if (args[i]==null) throw new Error();
if (drops==null) return Forest.create(loc, (T)tag, args, true);
}
}
- // Repeat //////////////////////////////////////////////////////////////////////////////
-
- /** repeat zero or one times */
- public static Element maybe(Element e) { return new Repeat(e, true, false, null, null); }
- public static Element maybe(Element e, Object tag) { return new Repeat(e, true, false, null, tag); }
- /** repeat zero or more times */
- public static Element many0(Element e) { return new Repeat(e, true, true, null, null); }
- public static Element many0(Element e, Object tag) { return new Repeat(e, true, true, null, tag); }
- /** repeat zero or more times, separated by <tt>sep</tt> */
- public static Element many0(Element e, Element sep) { return new Repeat(e, true, true, sep, null); }
- public static Element many0(Element e, Element sep, Object tag) { return new Repeat(e, true, true, sep, tag); }
- /** repeat one or more times */
- public static Element many1(Element e) { return new Repeat(e, false, true, null, null); }
- public static Element many1(Element e, Object tag) { return new Repeat(e, false, true, null, tag); }
- /** repeat one or more times, separated by <tt>sep</tt> */
- public static Element many1(Element e, Element sep) { return new Repeat(e, false, true, sep, null); }
- public static Element many1(Element e, Element sep, Object tag) { return new Repeat(e, false, true, sep, tag); }
-
- /** repeat zero or more times, matching a maximal sequence of atoms */
- public static Element maximal0(Atom e) { return new Repeat.Maximal(e, true, true, null); }
- public static Element maximal0(Atom e, Object tag) { return new Repeat.Maximal(e, true, true, tag); }
- /** repeat one or more times, matching a maximal sequence of atoms */
- public static Element maximal1(Atom e) { return new Repeat.Maximal(e, false, true, null); }
- public static Element maximal1(Atom e, Object tag) { return new Repeat.Maximal(e, false, true, tag); }
- /** repeat one or more times, separated by an atom <tt>sep</tt>, matching a maximal sequence */
- public static Element maximal1(Element e, Atom sep) { return new Repeat.Maximal(e, false, true, sep, null); }
- public static Element maximal1(Element e, Atom sep, Object tag) { return new Repeat.Maximal(e, false, true, sep, tag); }
-
- public static Element repeatMaximal(Atom e, boolean zero, boolean many, Object tag) {
- return new Repeat.Maximal(e, zero, many, tag); }
- public static Element repeatMaximal(Element e, boolean zero, boolean many, Atom sep, Object tag) {
- return new Repeat.Maximal(e, zero, many, sep, tag); }
- public static Element repeat(Element e, boolean zero, boolean many, Object tag) {
- return new Repeat(e, zero, many, tag); }
- public static Element repeat(Element e, boolean zero, boolean many, Element sep, Object tag) {
- return new Repeat(e, zero, many, sep, tag); }
}
projects / sbp.git / blobdiff