Sequence ret = _clone();
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.noFollow = noFollow;
+ ret.follow = follow;
+ ret.lame = lame;
return ret;
}
/** 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); }
/**
* after matching the sequence, create the specified output tree
* @param tag the tag for the output tree
* @param e the elements to match
- * @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
+ * @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, Object[] labs, boolean[] drops) {
return new RewritingSequence(tag, e, labs, drops); }
////////////////////////////////////////////////////////////////////////////////
- public Element noFollow = null;
- public final Topology noFollow() { return noFollow==null ? null : Atom.toAtom(noFollow); }
+ 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);
+ if (elements.length!=1)
+ throw new RuntimeException("cannot invoke toAtom() on a Sequence with " + elements.length + " elements: " + this);
return Atom.toAtom(elements[0]);
}
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>();
+ 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;
if (holder[i]==null) throw new Error("bad " + i);
}
Forest<T> ret = Sequence.this.postReduce(loc, holder, this);
- for(int k=0; k<pos; k++) holder[k] = null; // to help GC
+ //for(int k=0; k<pos; k++) holder[k] = null; // to help GC
return ret;
}
sb.append(elements[i].toString());
sb.append(' ');
}
+ if (follow != null) {
+ sb.append("-> ");
+ sb.append(follow);
+ }
return sb;
}
Sequence _clone() { return new Singleton(elements,idx); }
}
- public static class Unwrap extends Sequence {
+ 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 StringBuffer toString(StringBuffer sb, boolean spacing) {
int len = sb.length();
+ if (tag != null)
+ sb.append("\""+StringUtil.escapify(tag.toString(),"\"\r\n")+"\":: ");
super.toString(sb, spacing);
len = sb.length()-len;
if (spacing) for(int i=0; i<50-len; i++) sb.append(' ');
- sb.append(" => ");
- sb.append(tag);
return sb;
}
}
+
+ // 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