X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FSequence.java;h=a029274a0a01f7cbe48db426e645c1def564e64a;hp=0ac3500bfd476d358c509062fdc2785dce43b54b;hb=0620c2d97d6df986d74dbe13160afb1435096431;hpb=c8a17fdd2e149fe5feecd96c71b7f2cab286ab96 diff --git a/src/edu/berkeley/sbp/Sequence.java b/src/edu/berkeley/sbp/Sequence.java index 0ac3500..a029274 100644 --- a/src/edu/berkeley/sbp/Sequence.java +++ b/src/edu/berkeley/sbp/Sequence.java @@ -1,3 +1,5 @@ +// Copyright 2006 all rights reserved; see LICENSE file for BSD-style license + package edu.berkeley.sbp; import edu.berkeley.sbp.util.*; import edu.berkeley.sbp.*; @@ -7,67 +9,84 @@ import java.util.*; import java.lang.reflect.*; import java.lang.ref.*; -/** juxtaposition; zero or more adjacent Elements; can specify a rewriting */ -public abstract class Sequence extends Element implements Iterable { +/** juxtaposition; zero or more adjacent Elements; can specify a rewriting */ +public abstract class Sequence implements Iterable, SequenceOrElement { + + protected final Element[] elements; + + public boolean needed_or_hated = false; + + public HashMap canNeed = new HashMap(); + public HashMap canKill = new HashMap(); + + 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); s.needed.add(ret); } + for(Sequence s : needs) { ret.needs.add(s); } for(Sequence s : hates) { ret.hates.add(s); s.hated.add(ret); } ret.follow = follow; - ret.lame = lame; return ret; } - /** the empty sequence (matches the empty string) */ - public static final Sequence empty = new Sequence.Constant.Empty(); + /** create an empty sequence (matches the empty string) */ + public static Sequence create() { return new Sequence.Constant.Empty(); } - /** after matching the sequence, do not add anything to the output tree */ - public static Sequence drop(Element[] e, boolean lame) { return new Constant.Drop(e, lame); } + /** create a sequence of one element */ + public static Sequence create(Element e) { return create(new Element[] { e }, 0); } - /** after matching the sequence, insert a constant into the output tree */ - public static Sequence constant(Element[] e, Object o) { return new Constant(e, o); } + /** create a sequence which drops the result of all but one of its element */ + public static Sequence create(Element[] e, int which) { return new Singleton(e, which); } - /** 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); } + /** create a sequence which always evaluates to a constant result */ + public static Sequence create(Element[] e, Object result) { return new Constant(e, result); } /** - * 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 + * create a sequence (general form) + * @param head the head of the output tree + * @param e the elements to match + * @param drop only elements of e whose corresponding boolean in drops + * is false will be included in the output tree + * @param foster if true, all children of the last child (ie + * grandchildren) are promoted to children of this + * node; this is very useful for matching repetitions **/ - public static Sequence rewritingSequence(Object tag, Element[] e, boolean[] drops) { - return new RewritingSequence(tag, e, drops); } + public static Sequence create(Object head, Element[] e, boolean[] drop, boolean foster) { + return foster + ? new Unwrap(e, head, drop) + : new RewritingSequence(head, e, drop); + } //////////////////////////////////////////////////////////////////////////////// - public Element follow = null; - public final Topology follow() { return follow==null ? null : Atom.toAtom(follow); } + /** return a new sequence identical to this one, but with a positive conjunct s */ + public Sequence and(Sequence s) { Sequence ret = dup(); ret.needs.add(s); s.needed_or_hated=true; return ret; } - Topology toAtom() { - if (elements.length!=1) - throw new RuntimeException("cannot invoke toAtom() on a Sequence with " + elements.length + " elements: " + this); - return Atom.toAtom(elements[0]); - } + /** return a new sequence identical to this one, but with a negative conjunct s */ + public Sequence andnot(Sequence s) { Sequence ret = dup(); ret.hates.add(s); s.hated.add(ret); s.needed_or_hated=true; return ret; } - public Sequence and(Sequence s) { Sequence ret = dup(); ret.needs.add(s); s.needed.add(ret); return ret; } - public Sequence not(Sequence s) { Sequence ret = dup(); ret.hates.add(s); s.hated.add(ret); return ret; } + /** return a new sequence identical to this one, but with a follow-set restricted to a */ + public Sequence followedBy(Atom a) { Sequence ret = dup(); ret.follow = a; return ret; } - protected final Element[] elements; + boolean hatesAny(Iterable it) { + if (hates.isEmpty()) return false; + for(Sequence s : it) if (hates.contains(s)) return true; + return false; + } - final HashSet needed = new HashSet(); - final HashSet hated = new HashSet(); - final HashSet needs = new HashSet(); - final HashSet hates = new HashSet(); - public boolean lame = false; + Iterable needs() { return needs; } + Iterable hates() { return hates; } - final Position firstp; Position firstp() { return firstp; } public Iterator iterator() { return new ArrayIterator(elements); } @@ -77,11 +96,11 @@ public abstract class Sequence extends Element implements Iterable { } // DO NOT MESS WITH THE FOLLOWING LINE!!! - private Forest.Ref epsilonForm = null; - Forest epsilonForm() { + private Forest.Many epsilonForm = null; + Forest epsilonForm(Input.Region loc) { if (epsilonForm!=null) return epsilonForm; - epsilonForm = new Forest.Ref(); - epsilonForm.merge(firstp().rewrite(null, false)); + epsilonForm = new Forest.Many(); + epsilonForm.merge(firstp().rewrite(loc, false)); return epsilonForm; } @@ -91,13 +110,27 @@ public abstract class Sequence extends Element implements Iterable { // Position ////////////////////////////////////////////////////////////////////////////// /** the imaginary position before or after an element of a sequence; corresponds to an "LR item" */ - public class Position implements IntegerMappable { + class Position implements IntegerMappable { + + public int ord = -1; + public int compareTo(Position p, Walk.Cache cache) { + Position position = this; + Position rposition = p; + int ret = 0; + if (Reduction.canKill(cache, position, rposition) && + Reduction.canKill(cache, rposition, position)) throw new Error(); + if (Reduction.canKill(cache, position, rposition)) ret = 1; + else if (Reduction.canKill(cache, rposition, position)) ret = -1; + if (Reduction.canNeed(cache, position, rposition)) ret = 1; + else if (Reduction.canNeed(cache, rposition, position)) ret = -1; + return ret; + } private Forest zero = null; - public Forest zero() { + public Forest zero(Input.Region reg) { if (zero != null) return zero; if (pos > 0) throw new Error(); - return zero = rewrite(null); + return zero = rewrite(reg); } @@ -129,10 +162,10 @@ public abstract class Sequence extends Element implements Iterable { 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(); + if (epsilonCheck && this==firstp()) return epsilonForm(loc); for(int i=0; i ret = Sequence.this.postReduce(loc, holder, this); @@ -170,6 +203,14 @@ public abstract class Sequence extends Element implements Iterable { sb.append("-> "); sb.append(follow); } + for(Sequence s : needs) { + sb.append("& "); + sb.append(s); + } + for(Sequence s : hates) { + sb.append("&~ "); + sb.append(s); + } return sb; } @@ -181,49 +222,61 @@ public abstract class Sequence extends Element implements Iterable { 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.leaf(loc, result, p); + return (Forest)Forest.create(loc, result, null, false); } static class Drop extends Constant { - Sequence _clone() { return new Drop(elements, lame); } - public Drop(Element[] e, boolean lame) { - super(e, null); - this.lame = lame; - } + Sequence _clone() { return new Drop(elements); } + public Drop(Element[] e) { super(e, null); } } static class Empty extends Sequence.Constant.Drop { Sequence _clone() { return new Empty(); } - public Empty() { super(new Element[] { }, false); } } + public Empty() { super(new Element[] { }); } } } static class Singleton extends Sequence { private final int 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 (Forest)Forest.singleton(loc, args[idx], p); } + public Forest postReduce(Input.Region loc, Forest[] args, Position p) { return args[idx]; } Sequence _clone() { return new Singleton(elements,idx); } } - 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; } 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[] 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; Sequence _clone() { return new RewritingSequence(tag, elements, drops); } @@ -239,7 +292,7 @@ public abstract class Sequence extends Element implements Iterable { int j = 0; 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); } }