X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FSequence.java;h=8d6709d5f4e1d0164faacedbe0a6c60eb244ad80;hp=975b2b11802575d307372cc90b8445835e2e46da;hb=e6be1f03f79b16cd410991d7e64cfa7beab6de59;hpb=b8a597c8d1a29afc24f9b89f726d5b1a9b9aeec1 diff --git a/src/edu/berkeley/sbp/Sequence.java b/src/edu/berkeley/sbp/Sequence.java index 975b2b1..8d6709d 100644 --- a/src/edu/berkeley/sbp/Sequence.java +++ b/src/edu/berkeley/sbp/Sequence.java @@ -33,7 +33,8 @@ public abstract class Sequence extends Element implements Iterable { } /** the empty sequence (matches the empty string) */ - public static final Sequence empty = new Sequence.Constant.Empty(); + static final Sequence empty = new Sequence.Constant.Empty(); + public static Sequence empty() { return empty; } /** after matching the sequence, do not add anything to the output tree */ public static Sequence drop(Element[] e) { return new Constant.Drop(e); } @@ -64,8 +65,8 @@ public abstract class Sequence extends Element implements Iterable { public Sequence not(Sequence s) { Sequence ret = dup(); ret.hates.add(s); s.hated.add(ret); return ret; } public Sequence followedBy(Atom a) { Sequence ret = dup(); ret.follow = a; return ret; } - public Iterable needs() { return needs; } - public Iterable hates() { return hates; } + Iterable needs() { return needs; } + Iterable hates() { return hates; } Position firstp() { return firstp; } @@ -199,13 +200,13 @@ public abstract class Sequence extends Element implements Iterable { Sequence _clone() { return new Singleton(elements,idx); } } - public static Unwrap unwrap(Element[] e, Object tag, boolean[] drops) { return new Unwrap(e, tag, drops); } + public static Sequence 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 Forest postReduce(Input.Region loc, Forest[] args, Position p) { for(int i=0; i { } } - // 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); } }