package impl
Ordering
- Alphabetic
Visibility
- Public
- All
Type Members
-
sealed
trait
AtomPart extends AnyRef
A single or null char, i.e., including epsilon values
- case class BiState[A <: State](first: A, second: A) extends State with Product with Serializable
- case class CharInterval(from: UnicodeChar, to: UnicodeChar) extends AtomPart with Ordered[CharInterval] with Product with Serializable
-
class
Compiler extends AnyRef
Take a regex AST and produce a NFA.
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
- 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
- class SimpleState extends State
- trait State extends AnyRef
- case class UnicodeChar(codePoint: Int) extends Ordered[UnicodeChar] with Product with Serializable
Value Members
- object CharInterval extends Serializable
- object Condition
- object Dfa extends Serializable
- object DfaAlgorithms
- object Direction
- object Epsilon extends AtomPart with Product with Serializable
- object GeneralCategory
- object PredefinedCharSets
- object RangeOps
- object RegexParser
- object RegexTree
- object SimpleState
- object UnicodeChar extends Serializable
- object Util
Dregex is a Scala/JVM library that implements a regular expression engine using deterministic finite automata (DFA). The range of features supported is an middle ground between Perl-style (slow) engines and DFA-based ones. Yet it retains the linear matching time offered by the latter.