1 // Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
3 package edu.berkeley.sbp;
4 import edu.berkeley.sbp.*;
5 import edu.berkeley.sbp.util.*;
6 import edu.berkeley.sbp.Parser.Table.*;
7 import edu.berkeley.sbp.Sequence.Position;
10 import java.lang.reflect.*;
12 final class Reduction implements Comparable<Reduction> {
14 public Position position;
15 public GSS.Phase phase;
20 public Reduction(Node node, Position position, Forest result, GSS.Phase target) {
21 this.position = position;
27 public void perform() {
30 node.finish(position, result, phase);
33 public String toString() { return position+""; }
35 public int compareTo(Reduction r) {
36 int ret = compareTo0(r);
38 Walk.Cache cache = node.state().cache();
39 if (canKill(cache, position, r.position) && canKill(cache, r.position, position)) throw new Error();
40 if (canKill(cache, position, r.position)) ret = 1;
41 else if (canKill(cache, r.position, position)) ret = -1;
42 if (canNeed(cache, position, r.position)) ret = 1;
43 else if (canNeed(cache, r.position, position)) ret = -1;
48 private static boolean isRightNullable(Walk.Cache c, Position p) {
49 if (p.isLast()) return true;
50 if (!c.possiblyEpsilon(p.element())) return false;
51 return isRightNullable(c, p.next());
54 public static boolean canKill(Walk.Cache cache, Position mep, Position himp) {
55 if (!isRightNullable(cache, mep)) return false;
56 if (!isRightNullable(cache, himp)) return false;
57 Sequence me = mep.owner();
58 Sequence him = himp.owner();
59 for(Sequence killer : him.hates()) {
60 HashSet<Sequence> eq2 = new Walk.EquivalentTo(killer, cache).walk();
61 if (eq2.contains(me)) return true;
66 public static final int LESS_THAN = -1;
67 public static final int EQUAL_TO = 0;
68 public static final int GREATER_THAN = 1;
70 public int compareTo0(Reduction n) {
71 if (targetPhase()==null && n.targetPhase()==null) return EQUAL_TO;
72 if (targetPhase()==null) return LESS_THAN;
73 if (n.targetPhase()==null) return GREATER_THAN;
74 if (targetPhase().pos < n.targetPhase().pos) return LESS_THAN;
75 if (targetPhase().pos > n.targetPhase().pos) return GREATER_THAN;
78 public int pos() { return targetPhase()==null ? 0 : targetPhase().pos; }
79 public GSS.Phase targetPhase() { return node.phase(); }
81 public static boolean canNeed(Walk.Cache cache, Position mep, Position himp) {
82 if (!isRightNullable(cache, mep)) return false;
83 if (!isRightNullable(cache, himp)) return false;
84 Sequence me = mep.owner();
85 Sequence him = himp.owner();
86 for(Sequence needer : him.needs()) {
87 HashSet<Sequence> eq2 = new Walk.EquivalentTo(needer, cache).walk();
88 if (eq2.contains(me)) return true;