Scala 2.7.1.final API

This document is the API specification for Scala Library

Class Summary
abstract class BaseBerrySethi extends AnyRef
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 DetWordAutom [T <: AnyRef] extends AnyRef
A deterministic automaton. States are integers, where 0 is always the only initial state. Transitions are represented in the delta function. A default transitions is one that is taken when no other transition can be taken. All states are reachable. Accepting states are those for which the partial function 'finals' is defined.
trait Inclusion [A <: AnyRef] extends AnyRef
A fast test of language inclusion between minimal automata. inspired by the AMoRE automata library
abstract class NondetWordAutom [T <: AnyRef] extends AnyRef
A nondeterministic automaton. States are integers, where 0 is always the only initial state. Transitions are represented in the delta function. Default transitions are transitions that are taken when no other transitions can be applied. All states are reachable. Accepting states are those for which the partial function 'finals' is defined.
class SubsetConstruction [T <: AnyRef](val nfa : NondetWordAutom[T]) extends AnyRef
abstract class WordBerrySethi extends BaseBerrySethi
This class turns a regexp into a NondetWordAutom using the celebrated position automata construction (also called Berry-Sethi or Glushkov)