|
Scala
1.2.0.1 |
|||
Class Summary | |
abstract
|
class BaseBerrySethi()
this turns a regexp over A into a NondetWorkAutom over A using the celebrated position automata construction (also called Berry-Sethi or Glushkov) |
abstract
|
class NondetWordAutom[A <: Alphabet]()
0 is always the only initial state |
abstract
|
class WordBerrySethi[A <: Alphabet]()
this turns a regexp over A into a NondetWordAutom over A using the celebrated position automata construction (also called Berry-Sethi or Glushkov) |
|
Scala
1.2.0.1 |
|||