in scala.util.automata
class BaseBerrySethi

abstract class BaseBerrySethi
extends java.lang.Object
with ScalaObject
this turns a regexp over A into a NondetWorkAutom over A using the celebrated position automata construction (also called Berry-Sethi or Glushkov)

Constructor Summary
def this



Def Summary
protected def compFirst ( r : RegExp ) : Set
computes first( r ) for the word regexp r
protected def compFollow ( r : Seq ) : Set

protected def compFollow1 ( fol1 : Set , r : RegExp ) : Set
returns the first set of an expression, setting the follow set along the way
protected def compLast ( r : RegExp ) : Set
computes last( r ) for the regexp r
def lang : Base

protected def traverse ( r : RegExp ) : scala.Unit
returns "Sethi-length" of a pattern, creating the set of position along the way


Constructor Detail
def this

Def Detail
protected def compFirst ( r : RegExp ) : Set
computes first( r ) for the word regexp r

protected def compFollow ( r : Seq ) : Set

protected def compFollow1 ( fol1 : Set , r : RegExp ) : Set
returns the first set of an expression, setting the follow set along the way

protected def compLast ( r : RegExp ) : Set
computes last( r ) for the regexp r

def lang : Base

protected def traverse ( r : RegExp ) : scala.Unit
returns "Sethi-length" of a pattern, creating the set of position along the way