X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FSequence.java;h=a75bafa008243da5b7f83fd045e8362002e1af5d;hp=7071ecb5ba0a5f36ebc395572f4f37b2476a3e34;hb=6ae224025882c9929e2e4e9e8461decbf3b9cae4;hpb=b366a301b090a285c372f4fd77ab7472440f7d30 diff --git a/src/edu/berkeley/sbp/Sequence.java b/src/edu/berkeley/sbp/Sequence.java index 7071ecb..a75bafa 100644 --- a/src/edu/berkeley/sbp/Sequence.java +++ b/src/edu/berkeley/sbp/Sequence.java @@ -17,7 +17,7 @@ public abstract class Sequence extends Element implements Iterable { 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; return ret; } @@ -32,6 +32,7 @@ public abstract class Sequence extends Element implements Iterable { /** after matching the sequence, place the result of the idxth 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 @@ -44,8 +45,8 @@ public abstract class Sequence extends Element implements Iterable { //////////////////////////////////////////////////////////////////////////////// - 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); @@ -162,6 +163,10 @@ public abstract class Sequence extends Element implements Iterable { sb.append(elements[i].toString()); sb.append(' '); } + if (follow != null) { + sb.append("-> "); + sb.append(follow); + } return sb; } @@ -195,7 +200,8 @@ public abstract class Sequence extends Element implements Iterable { 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; } @@ -237,12 +243,49 @@ public abstract class Sequence extends Element implements Iterable { } 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 sep */ + 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 sep */ + 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 sep, 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); } }