class Automaton[Node, Token] extends AnyRef
Immutable Automaton implementation. Adding nodes or edges will create a new Automaton instance
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Automaton
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
- type NodeSet = Set[Node]
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def addEdge(src: Node, token: Token, dest: Node): Automaton[Node, Token]
- def addNode(n: Node): Automaton[Node, Token]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- val edges: Set[Edge[Node, Token]]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def nextNodes(current: Node, token: Token): Set[Node]
- val nodes: Set[Node]
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def outEdgesFrom(n: Node): Set[Edge[Node, Token]]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toDFA(init: Node, defaultToken: Token): DFA[NodeSet, Token]
Converting NFA to DFA
Converting NFA to DFA
NFA: (Node, Token) -> Seq[Node] (multiple next nodes can be found for a given token) DFA: State = Seq[Node] (State, Token) -> State (only a single state can be found for a given token)
- init
initial node to start
- def toString(): String
- Definition Classes
- Automaton → AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated