package
impl
Type Members
-
sealed
trait
AtomPart extends AnyRef
-
case class
BiState[A <: State](first: A, second: A) extends State with Product with Serializable
-
-
class
Compiler extends AnyRef
-
sealed
trait
Condition extends AnyRef
-
case class
Dfa[A <: State](initial: A, defTransitions: Map[A, SortedMap[CharInterval, A]], accepting: Set[A], minimal: Boolean = false) extends Product with Serializable
-
sealed
trait
Direction extends AnyRef
-
case class
MultiState(states: Set[State]) extends State with Product with Serializable
-
case class
Nfa(initial: State, transitions: Seq[NfaTransition], accepting: Set[State]) extends Product with Serializable
-
case class
NfaTransition(from: State, to: State, char: AtomPart) extends Product with Serializable
-
class
RegexParser extends JavaTokenParsers
-
-
trait
State extends AnyRef
-
case class
UnicodeChar(codePoint: Int) extends Ordered[UnicodeChar] with Product with Serializable
Take a regex AST and produce a NFA. Except when noted the Thompson-McNaughton-Yamada algorithm is used. Reference: http://stackoverflow.com/questions/11819185/steps-to-creating-an-nfa-from-a-regular-expression