import java.lang.ref.*;
/** currently this class exports only static methods to create repetitions; there are no public instance methods or constructors */
-/* FIXME make private again */ public class Repeat extends Union {
+class Repeat extends Union {
+ public Repeat(final Element e, boolean zeroOkay, boolean manyOkay, Object tag) {
+ this(e, zeroOkay, manyOkay, null, false, tag); }
public Repeat(final Element e, boolean zeroOkay, boolean manyOkay, final Element separator, Object tag) {
- this(e, zeroOkay, manyOkay, separator, false, tag);
- }
+ this(e, zeroOkay, manyOkay, separator, false, tag); }
protected Repeat(final Element e, boolean zeroOkay, boolean manyOkay, final Element separator, boolean maximal, Object tag) {
super(e+(!manyOkay ? "?" : (zeroOkay ? (maximal ? "**" : "*") : (maximal ? "++" : "+")))+(separator==null?"":("/"+separator)), true);
if (zeroOkay) {
if (zeroOkay && separator != null)
throw new RuntimeException("cannot create a maximal repetition of zero or more items with a separator (yet): " + this);
for(Sequence s : this)
- s.follow = new edu.berkeley.sbp.misc.MetaGrammar.Invert(separator);
+ s.follow = new Invert(separator);
}
public Maximal(final Atom e, boolean zeroOkay, boolean manyOkay, Object tag) {
super(e, zeroOkay, manyOkay, null, true, tag);
for(Sequence s : this)
- s.follow = new edu.berkeley.sbp.misc.MetaGrammar.Invert(e);
+ s.follow = new Invert(e);
}
}
+
+ /** an atom which tracks the inverse of some other atom */
+ private static class Invert<T extends Input> extends Atom<T> {
+ private final Atom<T> a;
+ public Invert(Atom<T> a) { this.a = a; }
+ public Topology<T> top() { return a.complement(); }
+ public String toString() { return "~"+a; }
+ }
}
// 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 <tt>sep</tt> */
- 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 <tt>sep</tt> */
- 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 <tt>sep</tt>, 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); }
}
public static Object repeatTag = null;
- /** an atom which tracks the possible tokenset of some element, provided that element can only match single-token sequences */
- public static class Infer<T extends Input> extends Atom<T> {
- private final Element e;
- public Infer(Element e) { this.e = e; }
- public Topology<T> top() { return (Topology<T>)toAtom(e); }
- public String toString() { return e.toString(); }
- }
-
- public static Atom infer(Element e) { return new CharRange((Topology<Character>)Atom.toAtom(e)); }
-
- /** an atom which tracks the inverse of some other atom */
- public static class Invert<T extends Input> extends Atom<T> {
- private final Atom<T> a;
- public Invert(Atom<T> a) { this.a = a; }
- public Topology<T> top() { return a.complement(); }
- public String toString() { return "~"+a; }
- }
-
- public static class Hack<T extends Input> extends Atom<T> {
- private final Atom<T> a;
- static final Topology leftright = CharRange.rightBrace.union(CharRange.leftBrace);
- public Hack(Atom<T> a) { this.a = a; }
- public Topology<T> top() { return a.minus(leftright); }
- public String toString() { return a.toString(); }
- }
-
public static Union make() throws Exception { return make(MetaGrammarTree.meta, "s"); }
public static Union make(Tree<String> tree, String nt) throws Exception {
Meta.MetaGrammarFile mgf = new MetaGrammar.Meta.MetaGrammarFile(tree);
////////////////////////////////////////////////////////////////////////////////
- private static boolean strings;
- private static Element set(Range.Set r) { if (strings) throw new Error(); return CharRange.set(r); }
- private static Element string(String s) { return strings ? StringInput.string(s) : CharRange.string(s); }
+ private static Element set(Range.Set r) { return CharRange.set(r); }
+ private static Element string(String s) { return CharRange.string(s); }
+ private static Atom infer(Element e) { return infer(Atom.toAtom(e)); }
+ private static Atom infer(Topology t) { return new CharRange((Topology<Character>)t); }
private MetaGrammar() { }
if (idx != -1) ret = Sequence.singleton(els, idx);
else ret = Sequence.drop(els, false);
}
- if (this.followedBy != null) ret.follow = new Hack(infer(this.followedBy.build(bc)));
+ if (this.followedBy != null)
+ ret.follow = infer(this.followedBy.build(bc));
return ret;
}
private MetaConjunct(Tree<String> t) {
public boolean maximal, zero, many;
public Element build(BuildContext bc) {
return !maximal
- ? new Repeat(element.build(bc), zero, many, separator==null?null:separator.build(bc), null)
- : separator==null
- ? new Repeat.Maximal(infer(element.build(bc)), zero, many, null)
- : new Repeat.Maximal(element.build(bc), zero, many, infer(separator.build(bc)), null);
+ ? (separator==null
+ ? Sequence.repeat(element.build(bc), zero, many, null, null)
+ : Sequence.repeat(element.build(bc), zero, many, separator.build(bc), null))
+ : (separator==null
+ ? Sequence.repeatMaximal(infer(element.build(bc)), zero, many, null)
+ : Sequence.repeatMaximal(element.build(bc), zero, many, infer(separator.build(bc)), null));
}
public MetaRepeat(MetaClause element, boolean maximal, MetaClause separator, boolean zero, boolean many) {
this.separator = separator;
public MetaClause element;
public MetaInvert(Tree<String> t, MetaConjunct c) { this.element = make(t, c); }
public String toString() { return "~"+element; }
- public Element build(BuildContext bc) { return new Hack(new Invert(infer(element.build(bc)))); }
+ public Element build(BuildContext bc) { return infer(Atom.toAtom(element.build(bc)).complement()); }
}
}
p.flush();
os.close();
}
+
}
projects / sbp.git / commitdiff