X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FSequence.java;h=e09ff720a3cab47f5356130662b5b04ef164bf91;hp=e5e984f4e95b307c10b60b61e0c67e5aac07bab1;hb=b205c5ee125119b0372328b70e8a66164df18fd0;hpb=c48a9498daf7604e41cf4aea7f6f7110388fd659 diff --git a/src/edu/berkeley/sbp/Sequence.java b/src/edu/berkeley/sbp/Sequence.java index e5e984f..e09ff72 100644 --- a/src/edu/berkeley/sbp/Sequence.java +++ b/src/edu/berkeley/sbp/Sequence.java @@ -18,6 +18,7 @@ public abstract class Sequence extends Element implements Iterable { 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; } @@ -38,7 +39,8 @@ public abstract class Sequence extends Element implements Iterable { * 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 e whose corresponding boolean in drops is false will be included in the output tree + * @param drops only elements of e whose corresponding boolean in drops + * is false 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); } @@ -49,7 +51,8 @@ public abstract class Sequence extends Element implements Iterable { 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]); } @@ -59,9 +62,9 @@ public abstract class Sequence extends Element implements Iterable { protected final Element[] elements; final HashSet needed = new HashSet(); - final HashSet hated = new HashSet(); - final HashSet needs = new HashSet(); - final HashSet hates = new HashSet(); + final HashSet hated = new HashSet(); + final HashSet needs = new HashSet(); + final HashSet hates = new HashSet(); public boolean lame = false; final Position firstp; @@ -133,7 +136,7 @@ public abstract class Sequence extends Element implements Iterable { if (holder[i]==null) throw new Error("bad " + i); } Forest ret = Sequence.this.postReduce(loc, holder, this); - for(int k=0; k { // Repeat ////////////////////////////////////////////////////////////////////////////// /** repeat zero or one times */ - public static Repeat maybe(Element e) { return new Repeat(e, true, false, null, null); } - public static Repeat maybe(Element e, Object tag) { return new Repeat(e, true, false, null, tag); } + 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 Repeat many0(Element e) { return new Repeat(e, true, true, null, null); } - public static Repeat many0(Element e, Object tag) { return new Repeat(e, true, true, null, tag); } + 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 Repeat many0(Element e, Element sep) { return new Repeat(e, true, true, sep, null); } - public static Repeat many0(Element e, Element sep, Object tag) { return new Repeat(e, true, true, sep, tag); } + 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 Repeat many1(Element e) { return new Repeat(e, false, true, null, null); } - public static Repeat many1(Element e, Object tag) { return new Repeat(e, false, true, null, tag); } + 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 Repeat many1(Element e, Element sep) { return new Repeat(e, false, true, sep, null); } - public static Repeat many1(Element e, Element sep, Object tag) { return new Repeat(e, false, true, sep, tag); } + 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 Repeat maximal0(Atom e) { return new Repeat.Maximal(e, true, true, null); } - public static Repeat maximal0(Atom e, Object tag) { return new Repeat.Maximal(e, true, true, tag); } + 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 Repeat maximal1(Atom e) { return new Repeat.Maximal(e, false, true, null); } - public static Repeat maximal1(Atom e, Object tag) { return new Repeat.Maximal(e, false, true, tag); } + 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 Repeat maximal1(Element e, Atom sep) { return new Repeat.Maximal(e, false, true, sep, null); } - public static Repeat maximal1(Element e, Atom sep, Object tag) { return new Repeat.Maximal(e, false, true, sep, tag); } - - + 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); } }