X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;ds=sidebyside;f=src%2Fedu%2Fberkeley%2Fsbp%2FSequence.java;h=975b2b11802575d307372cc90b8445835e2e46da;hb=b8a597c8d1a29afc24f9b89f726d5b1a9b9aeec1;hp=adf93fa64d35b8c645d7e3c72928f8585fdf2e03;hpb=21c2c8445fd1d0c6ed630a2ecb259ddd9712c750;p=sbp.git
diff --git a/src/edu/berkeley/sbp/Sequence.java b/src/edu/berkeley/sbp/Sequence.java
index adf93fa..975b2b1 100644
--- a/src/edu/berkeley/sbp/Sequence.java
+++ b/src/edu/berkeley/sbp/Sequence.java
@@ -7,87 +7,98 @@ import java.util.*;
import java.lang.reflect.*;
import java.lang.ref.*;
-/** juxtaposition; zero or more adjacent Elements; can specify a rewriting */
+/** juxtaposition; zero or more adjacent Elements; can specify a rewriting */
public abstract class Sequence extends Element implements Iterable {
+ protected final Element[] elements;
+
+ final HashSet hated = new HashSet();
+
+ final HashSet needs = new HashSet();
+ final HashSet hates = new HashSet();
+
+ final Position firstp;
+
+ Atom follow = null;
+
// Static Constructors //////////////////////////////////////////////////////////////////////////////
+ abstract Sequence _clone();
+ Sequence dup() {
+ Sequence ret = _clone();
+ for(Sequence s : needs) { ret.needs.add(s); }
+ for(Sequence s : hates) { ret.hates.add(s); s.hated.add(ret); }
+ ret.follow = follow;
+ return ret;
+ }
+
/** the empty sequence (matches the empty string) */
public static final Sequence empty = new Sequence.Constant.Empty();
/** after matching the sequence, do not add anything to the output tree */
- public static Sequence drop(Element[] e, HashSet and, HashSet not, boolean lame) { return new Constant.Drop(e, and, not, lame); }
+ public static Sequence drop(Element[] e) { return new Constant.Drop(e); }
/** after matching the sequence, insert a constant into the output tree */
- public static Sequence constant(Element[] e, Object o, HashSet and, HashSet not) { return new Constant(e, o, and, not); }
+ public static Sequence constant(Element[] e, Object o) { return new Constant(e, o); }
/** after matching the sequence, place the result of the idxth match in the output tree */
- public static Sequence singleton(Element[] e, int idx, HashSet and, HashSet not) { return new Singleton(e, idx, and, not); }
+ 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 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, boolean[] drops, HashSet and, HashSet not) {
- return new RewritingSequence(tag, e, drops, and, not); }
+ public static Sequence rewritingSequence(Object tag, Element[] e, boolean[] drops) {
+ return new RewritingSequence(tag, e, drops); }
- ////////////////////////////////////////////////////////////////////////////////
-
- public Element noFollow = null;
- public String name = null;
- public void setName(String name) { this.name = name; }
- public final Topology noFollow() { return noFollow==null ? null : noFollow.toAtom(); }
+ public static Sequence regionRewritingSequence(Functor tagfunctor, Element[] e, boolean[] drops) {
+ return new RegionRewritingSequence(tagfunctor, e, drops); }
- Topology toAtom() {
- if (elements.length!=1) throw new RuntimeException("cannot invoke toAtom() on a Sequence with " + elements.length + " elements: " + this);
- return elements[0].toAtom();
- }
+ ////////////////////////////////////////////////////////////////////////////////
- protected final Element[] elements;
+ public Sequence and(Sequence s) { Sequence ret = dup(); ret.needs.add(s); return ret; }
+ 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; }
- HashSet needed;
- HashSet hated;
- final HashSet needs;
- final HashSet hates;
- public boolean lame = false;
+ public Iterable needs() { return needs; }
+ public Iterable hates() { return hates; }
- final Position firstp;
Position firstp() { return firstp; }
public Iterator iterator() { return new ArrayIterator(elements); }
- protected Sequence(Element[] elements, HashSet and, HashSet not) {
- this.needs = and==null ? new HashSet() : and;
- this.hates = not==null ? new HashSet() : not;
- if (this.needs != null)
- for(Sequence s : this.needs)
- (s.needed==null?(s.needed=new HashSet()):s.needed).add(this);
- if (this.hates != null)
- for(Sequence s : this.hates)
- (s.hated==null?(s.hated=new HashSet()):s.hated).add(this);
+ protected Sequence(Element[] elements) {
this.elements = elements;
this.firstp = new Position(0);
}
// DO NOT MESS WITH THE FOLLOWING LINE!!!
- private Forest.Ref epsilonForm = null;
- private boolean eps = false;
+ private Forest.Many epsilonForm = null;
Forest epsilonForm() {
- if (epsilonForm==null) {
- epsilonForm = new Forest.Ref();
- epsilonForm.merge(firstp().rewrite2(null));
- }
+ if (epsilonForm!=null) return epsilonForm;
+ epsilonForm = new Forest.Many();
+ epsilonForm.merge(firstp().rewrite(null, false));
return epsilonForm;
}
- protected abstract Forest postReduce(Token.Location loc, Forest[] args);
+ protected abstract Forest postReduce(Input.Region loc, Forest[] args, Position p);
// Position //////////////////////////////////////////////////////////////////////////////
/** the imaginary position before or after an element of a sequence; corresponds to an "LR item" */
- public class Position {
+ class Position implements IntegerMappable {
+
+ private Forest zero = null;
+ public Forest zero() {
+ if (zero != null) return zero;
+ if (pos > 0) throw new Error();
+ return zero = rewrite(null);
+ }
+
final int pos;
private final Position next;
@@ -100,11 +111,6 @@ public abstract class Sequence extends Element implements Iterable {
}
boolean isFirst() { return pos==0; }
- boolean isRightNullable(Walk.Cache cache) {
- if (isLast()) return true;
- if (!element().possiblyEpsilon(cache)) return false;
- return next().isRightNullable(cache);
- }
/** the element immediately after this Position, or null if this is the last Position */
public Element element() { return pos>=elements.length ? null : elements[pos]; }
@@ -118,21 +124,18 @@ public abstract class Sequence extends Element implements Iterable {
/** true iff this Position is the last one in the sequence */
public boolean isLast() { return next()==null; }
- // Reduction /////////////////////////////////////////////////////////////////////////////////
-
- final Forest rewrite(Token.Location loc) {
- if (this==firstp()) return epsilonForm();
- return rewrite2(loc);
- }
+ // Position /////////////////////////////////////////////////////////////////////////////////
- final Forest rewrite2(Token.Location loc) {
+ final Forest rewrite(Input.Region loc) { return rewrite(loc, true); }
+ private final Forest rewrite(Input.Region loc, boolean epsilonCheck) {
+ if (epsilonCheck && this==firstp()) return epsilonForm();
for(int i=0; i ret = Sequence.this.postReduce(loc, holder);
- for(int k=0; k ret = Sequence.this.postReduce(loc, holder, this);
+ //for(int k=0; k {
for(Position p = Sequence.this.firstp(); p != null; p = p.next()) {
ret.append(' ');
if (p==this) ret.append(" | ");
- if (p.element()!=null) ret.append(p.element().possiblyEpsilon(null) ? "["+p.element()+"]" : p.element());
+ if (p.element()!=null) ret.append(p.element());
else ret.append(' ');
}
ret.append("}>");
return ret.toString();
}
+ private final int idx = master_position_idx++;
+ public int toInt() { return idx; }
}
-
+ private static int master_position_idx = 0;
// toString //////////////////////////////////////////////////////////////////////////////
@@ -160,6 +165,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;
}
@@ -168,68 +177,127 @@ public abstract class Sequence extends Element implements Iterable {
static class Constant extends Sequence {
private final Object result;
- public Constant(Element[] e, Object result, HashSet and, HashSet not) { super(e, and, not); this.result = result; }
- public Forest postReduce(Token.Location loc, Forest[] args) {
- return (Forest)Forest.leaf(loc, result);
+ public Constant(Element[] e, Object result) { super(e); this.result = result; }
+ Sequence _clone() { return new Constant(elements, result); }
+ public Forest postReduce(Input.Region loc, Forest[] args, Position p) {
+ return (Forest)Forest.create(loc, result, null, false);
}
static class Drop extends Constant {
- public Drop(Element[] e, HashSet and, HashSet not, boolean lame) {
- super(e, null, and, not);
- this.lame = lame;
- }
+ Sequence _clone() { return new Drop(elements); }
+ public Drop(Element[] e) { super(e, null); }
}
- static class Empty extends Sequence.Constant.Drop { public Empty() { super(new Element[] { }, null, null, false); } }
+ static class Empty extends Sequence.Constant.Drop {
+ Sequence _clone() { return new Empty(); }
+ public Empty() { super(new Element[] { }); } }
}
static class Singleton extends Sequence {
private final int idx;
- public Singleton(Element e, HashSet and, HashSet not) { this(new Element[] { e }, 0, and, not); }
- public Singleton(Element[] e, int idx, HashSet and, HashSet not) { super(e, and, not); this.idx = idx; }
- public Forest postReduce(Token.Location loc, Forest[] args) { return (Forest)Forest.singleton(loc, args[idx]); }
+ public Singleton(Element e) { this(new Element[] { e }, 0); }
+ public Singleton(Element[] e, int idx) { super(e); this.idx = idx; }
+ public Forest postReduce(Input.Region loc, Forest[] args, Position p) { return args[idx]; }
+ 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;
- public Unwrap(Element[] e, HashSet and, HashSet not) { super(e, and, not); this.drops = null; }
- public Unwrap(Element[] e, boolean[] drops, HashSet and, HashSet not) { super(e, and, not); this.drops = drops; }
- public Forest postReduce(Token.Location loc, Forest[] args) {
+ 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); }
+ public Forest postReduce(Input.Region loc, Forest[] args, Position p) {
for(int i=0; i[] args2 = new Forest[count];
int j = 0;
for(int i=0; i tagf;
+ public RegionRewritingSequence(Functor tagfunctor, Element[] e, boolean[] drops) {
+ super(null, e, drops);
+ this.tagf = tagfunctor;
+ }
+ public Forest postReduce(Input.Region loc, Forest[] args, Position p) {
+ this.tag = tagf.invoke(loc);
+ Forest ret = super.postReduce(loc, args, p);
+ this.tag = null;
+ return ret;
}
}
static class RewritingSequence extends Sequence {
- /*private*/public final Object tag;
+ /*private*/public /*final*/ Object tag;
private final boolean[] drops;
private int count = 0;
- public RewritingSequence(Object tag, Element[] e, HashSet and, HashSet not) { this(tag, e, null, and, not); }
- public RewritingSequence(Object tag, Element[] e, boolean[] drops, HashSet and, HashSet not) {
- super(e, and, not);
+ Sequence _clone() { return new RewritingSequence(tag, elements, drops); }
+ public RewritingSequence(Object tag, Element[] e) { this(tag, e, null); }
+ public RewritingSequence(Object tag, Element[] e, boolean[] drops) {
+ super(e);
this.tag = tag;
this.drops = drops == null ? new boolean[e.length] : drops;
for(int i=0; i Forest postReduce(Token.Location loc, Forest[] args) {
+ public Forest postReduce(Input.Region loc, Forest[] args, Position p) {
Forest[] args2 = new Forest[count];
int j = 0;
for(int i=0; i ");
- 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); }
}