blob: 5d709106f81eb8655d644370ab1b0fb95a9cb898 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
/* __ *\
** ________ ___ / / ___ Scala API **
** / __/ __// _ | / / / _ | (c) 2003-2013, LAMP/EPFL **
** __\ \/ /__/ __ |/ /__/ __ | http://scala-lang.org/ **
** /____/\___/_/ |_/____/_/ | | **
** |/ **
\* */
package scala.util.automata
import scala.collection.{ mutable, immutable }
/** 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.
*
* @author Burak Emir
* @version 1.0
*/
@deprecated("This class will be removed", "2.10.0")
abstract class DetWordAutom[T <: AnyRef] {
val nstates: Int
val finals: Array[Int]
val delta: Array[mutable.Map[T, Int]]
val default: Array[Int]
def isFinal(q: Int) = finals(q) != 0
def isSink(q: Int) = delta(q).isEmpty && default(q) == q
def next(q: Int, label: T) = delta(q).getOrElse(label, default(q))
override def toString() = {
val sb = new StringBuilder("[DetWordAutom nstates=")
sb.append(nstates)
sb.append(" finals=")
val map = Map(finals.zipWithIndex map (_.swap): _*)
sb.append(map.toString())
sb.append(" delta=\n")
for (i <- 0 until nstates) {
sb append "%d->%s\n".format(i, delta(i))
if (i < default.length)
sb append "_>%s\n".format(default(i))
}
sb.toString
}
}
|
