in scala/util/automata
  
    class WordBerrySethi
  
  
  
  - 
  abstract class WordBerrySethi()
- extends BaseBerrySethi
- with ScalaObject
  
    - 
     this turns a regexp into a NondetWordAutom using the
  celebrated position automata construction (also called Berry-Sethi or
  Glushkov)
 
  
  
  
    
      | Method Summary | 
    
      |  | def automatonFrom(pat: lang.RegExp, finalTag: Int): NondetWordAutom | 
    
      | 
        protected | def collectTransitions(): Unit | 
    
      | 
        protected override | def compFirst(r: lang.RegExp): Set[Int]computes first( r ) where the word regexp r
 | 
    
      | 
        protected override | def compFollow1(fol1: Set[Int], r: lang.RegExp): Set[Int]returns the first set of an expression, setting the follow set along 
  the way
 | 
    
      | 
        protected override | def compLast(r: lang.RegExp): Set[Int]computes last( r ) where the word regexp r
 | 
    
      | 
        protected | var defaultq: Array[List[Int]] | 
    
      | 
        protected | var deltaq: Array[HashMap[lang.T_label,List[Int]]] | 
    
      | 
        protected | def initialize(subexpr: Seq[lang.RegExp]): Unit | 
    
      | 
        protected | def initializeAutom(): Unit | 
    
      | 
        protected | var initials: Set[Int] | 
    
      | 
        protected | var labelAt: TreeMap[Int,lang.T_label] | 
    
      | 
        protected | var labels: HashSet[lang.T_label] | 
    
      | 
        protected | def makeTransition(src: Int, dest: Int, label: lang.T_label): Unit | 
    
      | 
        protected | def seenLabel(r: lang.RegExp, i: Int, label: lang.T_label): Unitcalled at the leaves of the regexp
 | 
    
      | 
        protected | def seenLabel(r: lang.RegExp, label: lang.T_label): Unit | 
    
      | 
        override | def traverse(r: lang.RegExp): Unitreturns "Sethi-length" of a pattern, creating the set of position
  along the way
 | 
  
  
  
    
      | Methods inherited from java/lang/Object-class | 
    
      | clone, eq, equals, finalize, getClass, hashCode, notify, notifyAll, synchronized, toString, wait, wait, wait | 
  
  
  
  
  
  
  
  
  
  
  lang
  abstract override val lang: WordExp
  
  
  T_label
  type T_label = lang.T_label
  
  
  labels
  protected var labels: HashSet[lang.T_label]
  
  
  labelAt
  protected var labelAt: TreeMap[Int,lang.T_label]
  
  
  deltaq
  protected var deltaq: Array[HashMap[lang.T_label,List[Int]]]
  
  
  defaultq
  protected var defaultq: Array[List[Int]]
  
  
  initials
  protected var initials: Set[Int]
  
  
  compFirst
  protected override def compFirst(r: lang.RegExp): Set[Int]
  
    - 
     computes first( r ) where the word regexp r 
  
  compLast
  protected override def compLast(r: lang.RegExp): Set[Int]
  
    - 
     computes last( r ) where the word regexp r 
  
  compFollow1
  protected override def compFollow1(fol1: Set[Int], r: lang.RegExp): Set[Int]
  
    - 
     returns the first set of an expression, setting the follow set along 
  the way
   
  
  seenLabel
  protected def seenLabel(r: lang.RegExp, i: Int, label: lang.T_label): Unit
  
    - 
     called at the leaves of the regexp 
  
  seenLabel
  protected def seenLabel(r: lang.RegExp, label: lang.T_label): Unit
  
  
  traverse
  override def traverse(r: lang.RegExp): Unit
  
    - 
     returns "Sethi-length" of a pattern, creating the set of position
  along the way
   
  
  makeTransition
  protected def makeTransition(src: Int, dest: Int, label: lang.T_label): Unit
  
  
  initialize
  protected def initialize(subexpr: Seq[lang.RegExp]): Unit
  
  
  initializeAutom
  protected def initializeAutom(): Unit
  
  
  collectTransitions
  protected def collectTransitions(): Unit
  
  
  automatonFrom
  def automatonFrom(pat: lang.RegExp, finalTag: Int): NondetWordAutom