in scala/util/grammar
class ImmutableTreeHedgeGrammar

abstract class ImmutableTreeHedgeGrammar[A <: Alphabet]()
extends TreeHedgeGrammar[All]
with ScalaObject
Implementing classes or objects:
class PatternGrammar() in scala/runtime/matching

a mutable representation of hedge grammars. A hedge grammar over an alphabet consists of tree and hedge nonterminals (consecutive integers), and tree and hedge productions that relate them. Hedge nonterminals that can derive the empty hedge are called "nullable". initials tree or hedge nonterminals.

Field Summary
abstract val hedgeInitials: BitSet
     inv: hedgeInitials.length == nHedgeNT
abstract val hedgeTransitions: Array[Set[HedgeRHS]]
abstract val isNullable: BitSet
     inv: isNullable.length == nHedgeNT
abstract val nHedgeNT: Int
     number of hedge nonterminals
abstract val nTreeNT: Int
     number of tree nonterminals
abstract val treeInitials: BitSet
     inv: treeInitials.length == nTreeNT
abstract val treeTransitions: Array[Set[TreeRHS]]

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

Field Detail

nTreeNT

  abstract val nTreeNT: Int
number of tree nonterminals

nHedgeNT

  abstract val nHedgeNT: Int
number of hedge nonterminals

treeInitials

  abstract val treeInitials: BitSet
inv: treeInitials.length == nTreeNT

hedgeInitials

  abstract val hedgeInitials: BitSet
inv: hedgeInitials.length == nHedgeNT

isNullable

  abstract val isNullable: BitSet
inv: isNullable.length == nHedgeNT

treeTransitions

  abstract val treeTransitions: Array[Set[TreeRHS]]

hedgeTransitions

  abstract val hedgeTransitions: Array[Set[HedgeRHS]]