X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FForest.java;h=073e37bc84185ea26970216ed2ee2db153ecdc13;hp=5807545eb981c564a3f9be9839a2d66bc8d14b0c;hb=HEAD;hpb=76bc0ff98c5e67f4fe6fa2593bffdf31b6db437a

diff --git a/src/edu/berkeley/sbp/Forest.java b/src/edu/berkeley/sbp/Forest.java
index 5807545..073e37b 100644
--- a/src/edu/berkeley/sbp/Forest.java
+++ b/src/edu/berkeley/sbp/Forest.java
@@ -1,151 +1,323 @@
+// Copyright 2006-2007 all rights reserved; see LICENSE file for BSD-style license
+
 package edu.berkeley.sbp;
-import edu.berkeley.sbp.*;
-import edu.berkeley.sbp.*;
 import edu.berkeley.sbp.util.*;
 import java.io.*;
 import java.util.*;
-import java.lang.reflect.*;
 
-/** an efficient representation of a collection of trees (Tomita's shared packed parse forest) */
-public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/ implements Visitable<Forest.Body<T>> {
+/**
+ *   <font color=blue>
+ *   An efficient representation of a collection of trees (Tomita's
+ *   shared packed parse forest).
+ *   </font>
+ */
+public abstract class Forest<NodeType> implements GraphViz.ToGraphViz {
 
     /** assume that this forest contains exactly one tree and return it; otherwise throw an exception */
-    public final Tree<T> expand1() throws Ambiguous, ParseFailed {
-        Iterator<Tree<T>> it = expand(true).iterator();
-        if (!it.hasNext()) throw new ParseFailed();
-        return it.next();
-    }
+    public abstract Tree<NodeType> expand1() throws Ambiguous;
 
     /** expand this forest into a set of trees */
-    public HashSet<Tree<T>> expand(boolean toss) {
-        final HashSet<Tree<T>> hs = new HashSet<Tree<T>>();
-        TreeMaker<T> ret = new TreeMaker<T>(toss) {
-            public void add(Tree<T> t) { hs.add(t); }
-        };
-        visit(ret, null, null);
-        if (toss && hs.size() > 1) throw new Ambiguous(this);
-        return hs;
+    public Iterable<Tree<NodeType>> expand() {
+        HashSet<Tree<NodeType>> ht = new HashSet<Tree<NodeType>>();
+        expand(ht, new HashSet<Forest<NodeType>>(), null);
+        return ht;
     }
 
-    static        <T> Forest<T> singleton(Input.Location loc)                       { return create(loc, null, new Forest[] { }, false, true); }
-    static        <T> Forest<T> singleton(Input.Location loc, Forest<T> body)       { return create(loc, null, new Forest[] { body },  false, true); }
-    static        <T> Forest<T> leaf(Input.Location loc, T tag) { return create(loc, tag, null, false, false); }
-    public static <T> Forest<T> create(Input.Location loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton) {
-        return new MyBody<T>(loc, tag, tokens, unwrap, singleton);
-    }
+    /** returns the input Region which this Forest was parsed from */
+    public abstract Input.Region getRegion();
 
-    // Body //////////////////////////////////////////////////////////////////////////////
+    // Package-Private //////////////////////////////////////////////////////////////////////////////
 
-    protected static interface Body<T> {
-        TreeMaker<T> expand(int i, TreeMaker<T> h);
+    public static <NodeType> Forest<NodeType> create(Input.Region region, NodeType head, Forest<NodeType>[] children) {
+        return create(region, head, children, new boolean[children==null ? 0 : children.length]); }
+    public static <NodeType> Forest<NodeType> create(Input.Region region, NodeType head, Forest<NodeType>[] children, boolean[] lifts) {
+        if (region == null) throw new RuntimeException("invoked Forest.create(region=null) -- this should never happen");
+        return new One<NodeType>(region, head, children, lifts);
     }
 
-    protected static class MyBody<T> extends Forest<T> implements Body<T> /* extends PrintableTree<Forest<T>> implements */, Invokable<Tree<T>, TreeMaker<T>, Integer> {
+    abstract void expand(HashSet<Tree<NodeType>> ht, HashSet<Forest<NodeType>> ignore, Tree<NodeType> bogus);
+    abstract void gather(HashSet<Forest<NodeType>> ignore);
+    abstract void edges(GraphViz.StateNode n);
+    boolean ambiguous() { return false; }
+    
+    // One //////////////////////////////////////////////////////////////////////////////
 
-        public <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c) {
-            ivbc.invoke(this, b, c);
-        }
+    /** A "single" forest with a head and child subforests */    
+    private static class One<NodeType> extends Forest<NodeType> {
 
-        private final Input.Location    location;
-        private final T                 tag;
-        private final Forest<T>[]       tokens;
-        private final boolean           unwrap;
-        private final boolean           singleton;
+        private final Input.Region      location;
+        private final NodeType                head;
+        private final Forest<NodeType>[]       children;
 
-        private MyBody(Input.Location loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton) {
-            this.location = loc;
-            this.tag = tag;
-            this.tokens = tokens==null ? emptyForestArray : new Forest[tokens.length];
-            if (tokens != null) System.arraycopy(tokens, 0, this.tokens, 0, tokens.length);
-            if (tokens != null) for(int i=0; i<tokens.length; i++) if (tokens[i]==null) throw new Error(i+"");
-            this.unwrap = unwrap;
-            this.singleton = singleton;
-        }
+        /** if true, the last child's children are considered children of this node */
+        private final boolean[]         lifts;
 
-        public TreeMaker<T> expand(final int i, final TreeMaker<T> h) {
-            if (singleton) {
-                tokens[0].visit(h, null, i);
+        public Input.Region getRegion() { return location; }
 
-            } else if (i==tokens.length) {
-                h.add(new Tree<T>(null, tag, h.toks.toArray(tree_hint)));
+        private One(Input.Region loc, NodeType head, Forest<NodeType>[] children, boolean[] lifts) {
+            this.location = loc;
+            this.head = head;
+            if (head==null) throw new RuntimeException("invoked Forest.create(,null,,,) -- this should never happen");
+            this.children = children==null ? emptyForestArray : new Forest[children.length];
+            if (children != null) System.arraycopy(children, 0, this.children, 0, children.length);
+            if (children != null) for(int i=0; i<children.length; i++) if (children[i]==null) throw new Error(i+"");
+            this.lifts = lifts;
+        }
 
-            } else if (unwrap && i==tokens.length-1) {
-                if (tokens[i] != null)
-                    tokens[i].visit(h, null, 0);
+        public Tree<NodeType> expand1() throws Ambiguous {
+            if (children.length == 0)
+                return new Tree<NodeType>(location, head);
+            else
+                return expand1ForOneAndMany((Forest<NodeType>)this);
+        }
 
+        void gather(HashSet<Forest<NodeType>> hf) {
+            hf.add(this);
+            for(Forest<NodeType> f : children) f.gather(hf);
+        }
+        void expand(HashSet<Tree<NodeType>> ht, HashSet<Forest<NodeType>> ignore, Tree<NodeType> bogus) {
+            if (ignore.contains(this)) { ht.add(bogus); return; }
+            expand(0, new Tree[children.length], ht, ignore, bogus);
+        }
+        private void expand(final int i, Tree<NodeType>[] ta, HashSet<Tree<NodeType>> ht, HashSet<Forest<NodeType>> ignore,
+                            Tree<NodeType> bogus) {
+            if (i==children.length) {
+                ht.add(new Tree<NodeType>(location, head, ta, lifts));
             } else {
-                tokens[i].visit(new TreeMaker<T>(h.toss) {
-                    public void add(Tree<T> r) {
-                        int old = h.toks.size();
-                        h.toks.add(r);
-                        expand(i+1, h);
-                        while(h.toks.size() > old) h.toks.remove(h.toks.size()-1);
-                    }
-                }, null, null);
+                HashSet<Tree<NodeType>> ht2 = new HashSet<Tree<NodeType>>();
+                children[i].expand(ht2, ignore, bogus);
+                for(Tree<NodeType> tc : ht2) {
+                    ta[i] = tc;
+                    expand(i+1, ta, ht, ignore, bogus);
+                    ta[i] = null;
+                }
             }
-            return h;
         }
-        public void invoke(Tree<T> r, TreeMaker<T> h, Integer i) {
-            //hit = true;
-            int old = h.toks.size();
-            h.toks.add(r);
-            expand(i+1, h);
-            while(h.toks.size() > old) h.toks.remove(h.toks.size()-1);
-            //ivbc.invoke(this, b, c);
+
+        // GraphViz, ToInt //////////////////////////////////////////////////////////////////////////////
+
+        public boolean isTransparent() { return false; }
+        public boolean isHidden() { return false; }
+        public GraphViz.StateNode toGraphViz(GraphViz gv) {
+            if (gv.hasNode(this)) return gv.createNode(this);
+            GraphViz.StateNode n = gv.createNode(this);
+            n.label = headToString()==null?"":headToString();
+            n.directed = true;
+            edges(n);
+            return n;
+        }
+        boolean edges = false; // FIXME ??
+        public void edges(GraphViz.StateNode n) {
+            if (edges) return;
+            edges = true;
+            for(int i=0; i<children.length; i++) {
+                if (lifts[i] && !children[i].ambiguous()) {
+                    children[i].edges(n);
+                } else {
+                    n.edge(children[i], null);
+                }
+            }
         }
 
-        protected String  headToString()         { return null; }
-        protected String  headToJava()           { return null; }
+        protected String  headToString()         { return head==null?null:head.toString(); }
+        protected String  headToJava()           { return "null"; }
         protected String  left()                 { return "{"; }
         protected String  right()                { return "}"; }
         protected boolean ignoreSingleton()      { return false; }
     }
 
 
-    // Ref //////////////////////////////////////////////////////////////////////////////
+    // Many //////////////////////////////////////////////////////////////////////////////
+
+    /** An "ambiguity node"; this is immutable once it has been "looked at" */
+    static class Many<NodeType> extends Forest<NodeType> {
+
+        private FastSet<Forest<NodeType>> hp = new FastSet<Forest<NodeType>>();
+        private boolean touched = false;
+
+        public Many() { }
+
+        public Input.Region getRegion() { return hp.iterator().next().getRegion(); } // all should be identical
+
+        Forest<NodeType> simplify() throws Ambiguous {
+            touched();
+            if (hp.size() > 1) {
+                HashSet<Forest<NodeType>> hf0 = new HashSet<Forest<NodeType>>();
+                Iterator<Forest<NodeType>> ih = hp.iterator();
+                ih.next().gather(hf0);
+                for(Forest<NodeType> f : hp) {
+                    HashSet<Forest<NodeType>> hf1 = new HashSet<Forest<NodeType>>();
+                    f.gather(hf1);
+                    hf0.retainAll(hf1);
+                }
+                HashSet<Tree<NodeType>> ht = new HashSet<Tree<NodeType>>();
+                expand(ht, hf0, new Tree(null, "*"));
+                throw new Ambiguous((Forest<?>)this,
+                                    (HashSet<Tree<?>>)(Object)ht);
+            }
+
+            return hp.iterator().next();
+        }
+
+        public Tree<NodeType> expand1() throws Ambiguous {
+            return simplify().expand1();
+        }
+        
+        void gather(HashSet<Forest<NodeType>> ht) {
+            touched();
+
+            // FIXME: do something more sensible here
+            if (ht.contains(this)) {
+                System.err.println("WARNING: grammar produced a circular forest\n" + this);
+                //throw new Error("grammar produced a circular forest:\n" + this);
+                return;
+            }
+
+            ht.add(this);
+            for(Forest<NodeType> f : hp) f.gather(ht);
+        }
+
+        private void touched() {
+            if (touched) return;
+            touched = true;
+            /*
+            FastSet<Forest<NodeType>> f2 = new FastSet<Forest<NodeType>>();
+            for(Forest f : hp)
+                if (f instanceof Forest.One) f2.add(f);
+                else for(Forest ff : ((Forest.Many<NodeType>)f))
+                    f2.add(ff);
+            hp = f2;
+            */
+        }
+        public boolean contains(Forest f) {
+            touched();
+            return hp.contains(f);
+        }
+        public void merge(Forest p) { 
+            if (touched) throw new RuntimeException("attempt to merge() on a Forest.Many that has already been examined");
+            if (p==this) throw new RuntimeException("attempt to merge() a Forest.Many to itself!");
+            hp.add(p, true);
+        }
+        boolean ambiguous() {
+            touched();
+            if (hp.size()==0) return false;
+            if (hp.size()==1) return hp.iterator().next().ambiguous();
+            return true;
+        }
+
+        void expand(HashSet<Tree<NodeType>> ht, HashSet<Forest<NodeType>> ignore, Tree<NodeType> bogus) {
+            touched();
+            if (ignore.contains(this)) { ht.add(bogus); return; }
+            for (Forest<NodeType> f : hp) f.expand(ht, ignore, bogus);
+        }
+
+
+        // GraphViz, ToInt //////////////////////////////////////////////////////////////////////////////
+
+        public boolean isTransparent() { return hp.size()==1; }
+        public boolean isHidden() { return hp.size()==0; }
+        public void edges(GraphViz.StateNode n) {
+            if (hp.size()==1) { hp.iterator().next().edges(n); return; }
+            for(Forest f : hp) f.edges(n);
+        }
+        public GraphViz.StateNode toGraphViz(GraphViz gv) {
+            if (hp.size()==1) return hp.iterator().next().toGraphViz(gv);
+            if (gv.hasNode(this)) return gv.createNode(this);
+            GraphViz.StateNode n = gv.createNode(this);
+            n.label = "?";
+            n.color = "red";
+            for(Forest f : hp) n.edge(f, null);
+            return n;
+        }
+    }
+
+
+    // Statics //////////////////////////////////////////////////////////////////////////////
+
+    /** Depth-first expansion, handling .One and .Many without recursion. */
+    private static <NodeType> Tree<NodeType> expand1ForOneAndMany(
+            Forest<NodeType> forest) throws Ambiguous {
+        List<Tree<NodeType>> nodes = new ArrayList<Tree<NodeType>>();
+        List<Tree<NodeType>> build = new ArrayList<Tree<NodeType>>();
+
+        // path stack
+        List<Forest.One<NodeType>> path = new ArrayList<Forest.One<NodeType>>();
+        List<Integer> sizes = new ArrayList<Integer>(),
+                      poss  = new ArrayList<Integer>();
+
+        // handle the left-most leaf
+        expand1Descend(path, nodes, sizes, poss, forest);
 
-    /**
-     *  This class represents a partially complete collection of
-     *  forests to be viewed as a forest at some later date; once
-     *  viewed, it becomes immutable
-     */
-    static class Ref<T> extends Forest<T> {
-        private FastSet<Forest<T>> hp = new FastSet<Forest<T>>();
-        public Ref() { }
-        public void merge(Forest p) { if (p!=this) hp.add(p, true); }
-        public <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c) {
-            if (hp==null) return;
-            for(Forest<T> f : hp)
-                f.visit(ivbc, b, c);
+        for (Forest.One<NodeType> f; path.size() > 0;) {
+            // up one
+            f = pop(path);
+            int size = pop(sizes) + 1;
+            int pos = pop(poss) + 1;
+            Forest<NodeType>[] children = f.children;
+            if (pos < children.length) {
+                // down the next branch
+                path.add(f);
+                sizes.add(new Integer(size));
+                poss.add(new Integer(pos));
+
+                // handle the left-most leaf
+                expand1Descend(path, nodes, sizes, poss, children[pos]);
+            } else {
+                if (path.size() > 0 && peek(path).lifts[peek(poss)]) {
+                    // skip assembling this node, lift children
+                    sizes.add(pop(sizes) + size - 1);
+                    continue;
+                }
+                // assemble this node
+                for (int i=size; i > 0; i--)
+                    build.add(nodes.remove(nodes.size() - i));
+                nodes.add(new Tree<NodeType>(f.location, f.head, build));
+                build.clear();
+            }
         }
-        public Forest resolve() { return this; }
+
+        return pop(nodes);
     }
 
-    public abstract <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c);
-    private static abstract class TreeMaker<T> implements Invokable<Forest.Body<T>,Boolean,Integer> {
-        public ArrayList<Tree<T>> toks = new ArrayList<Tree<T>>();
-        private boolean toss;
-        public TreeMaker(boolean toss) { this.toss = toss; }
-        public abstract void add(Tree<T> t);
-        public void invoke(Forest.Body<T> bod, Boolean o, Integer i) {
-            if (i==null) {
-                ArrayList<Tree<T>> toks = this.toks;
-                this.toks = new ArrayList<Tree<T>>();
-                bod.expand(0, this);
-                this.toks = toks;
+    /** Descend to the left-most leaf, building the path. */
+    private static <NodeType> void expand1Descend(
+            List<Forest.One<NodeType>> path, List<Tree<NodeType>> nodes,
+            List<Integer> sizes, List<Integer> poss, Forest<NodeType> f)
+            throws Ambiguous {
+        while (true) {
+            if (f instanceof Forest.Many)
+                f = ((Forest.Many<NodeType>)f).simplify();
+            else if (f instanceof Forest.One) {
+                Forest.One<NodeType> one = (Forest.One<NodeType>)f;
+                if (one.children.length == 0)
+                    break;
+                path.add(one);
+                sizes.add(0);
+                poss.add(0);
+                f = one.children[0];
             } else {
-                bod.expand(i, this);
+                nodes.add(f.expand1());
+                return;
             }
         }
+
+        if (path.size() > 0 && peek(path).lifts[peek(poss)])
+            sizes.add(pop(sizes) - 1); // ignore lifted leafs
+        else
+            nodes.add(f.expand1());
     }
 
-    // Statics //////////////////////////////////////////////////////////////////////////////
+    private static <T> T pop(List<T> list) {
+        return list.remove(list.size() - 1); }
+    private static <T> T peek(List<T> list) {
+        return list.get(list.size() - 1); }
 
     private static Tree[] tree_hint = new Tree[0];
+    private static String[] string_hint = new String[0];
     private static final Forest[] emptyForestArray = new Forest[0];
 
     protected String  headToString()    { return null; }
-    protected String  headToJava()      { return null; }
+    protected String  headToJava()      { return "null"; }
     protected String  left()            { return "<?"; }
     protected String  right()           { return "?>"; }
     protected boolean ignoreSingleton() { return true; }