| 
 | 
          Scala 1.3.0.7 | |||
| Field Summary | |
| val hedgeTransitions: (Int) => Set[HedgeRHS] | |
| val treeTransitions: (Int) => Set[TreeRHS] | |
| Method Summary | |
| def getChildren(t: Any): Iterator[Any] | |
| def isApplicableHedge(initialNTs: Set[Int], it: Iterator[Any]): Set[Int]given set of hedge nonterms initialNTs and input hedge h, returns { H | H in initialNTs, T -> a<H> in rules, isApplicable( H, t.children ) | |
| def isApplicableHedge1(H: Int, h: Iterator[Any]): Booleantop-level call | |
| 
        protected | def isApplicableTree(initialNTs: Set[Int], t: Any): Set[Int]given set of tree nonterms initialNTs and input tree t, returns { T | T in initialNTs, T -> a<H> in rules, isApplicable( H, t.children ) } | 
| def isApplicableTree1(T: Int, t: Any): Booleantop-level call | |
| def matchesH(h: Seq[Any]): Iterator[Int]top-level call | |
| def matchesT(input: Any): Iterator[Int]top-level call | |
| def singH(H: Int): ListSet[Int]convenience method | |
| def singT(T: Int): ListSet[Int]convenience method | |
| Methods inherited from java/lang/Object-class | 
| clone, eq, equals, finalize, getClass, hashCode, notify, notifyAll, synchronized, toString, wait, wait, wait | 
| Methods inherited from scala/Any-class | 
| !=, ==, asInstanceOf, isInstanceOf, match | 
| Methods inherited from scala/ScalaObject-class | 
| getType | 
| Field Detail | 
val treeTransitions: (Int) => Set[TreeRHS]
val hedgeTransitions: (Int) => Set[HedgeRHS]
| Method Detail | 
def singT(T: Int): ListSet[Int]
def singH(H: Int): ListSet[Int]
def matchesT(input: Any): Iterator[Int]
def matchesH(h: Seq[Any]): Iterator[Int]
def isApplicableTree1(T: Int, t: Any): Boolean
def isApplicableHedge1(H: Int, h: Iterator[Any]): Boolean
def getChildren(t: Any): Iterator[Any]
protected def isApplicableTree(initialNTs: Set[Int], t: Any): Set[Int]
def isApplicableHedge(initialNTs: Set[Int], it: Iterator[Any]): Set[Int]
| 
 | 
          Scala 1.3.0.7 | |||