114 lines
3.5 KiB
Standard ML
114 lines
3.5 KiB
Standard ML
structure ViHlDfa =
|
|
struct
|
|
val startState: Word8.word = 0w0
|
|
val notNewlineState: Word8.word = 0w1
|
|
val oneNewlineState: Word8.word = 0w2
|
|
val twoNewlineState: Word8.word = 0w3
|
|
val notNewlineAfterNewlineState: Word8.word = 0w4
|
|
|
|
fun makeStart i =
|
|
if Char.chr i = #"\n" then oneNewlineState else notNewlineState
|
|
|
|
fun makeOneNewline i =
|
|
if Char.chr i = #"\n" then twoNewlineState else notNewlineAfterNewlineState
|
|
|
|
fun makeTwoNeline i =
|
|
if Char.chr i = #"\n" then oneNewlineState else notNewlineAfterNewlineState
|
|
|
|
val startTable = Vector.tabulate (255, makeStart)
|
|
val notNewlineTable = startTable
|
|
val oneNewlineTable = Vector.tabulate (255, makeOneNewline)
|
|
val twoNewLineTable = startTable
|
|
val notNewlineAfterNewlineTable = notNewlineTable
|
|
|
|
val tables =
|
|
#[ startTable
|
|
, notNewlineTable
|
|
, oneNewlineTable
|
|
, twoNewLineTable
|
|
, notNewlineAfterNewlineTable
|
|
]
|
|
|
|
fun next (currentState, chr) =
|
|
let val table = Vector.sub (tables, Word8.toInt currentState)
|
|
in Vector.sub (table, Char.ord chr)
|
|
end
|
|
|
|
structure ViL =
|
|
MakeNextDfaLoop
|
|
(struct
|
|
val startState = startState
|
|
|
|
fun loop (idx, absIdx, str, tl, currentState, counter) =
|
|
if idx = String.size str then
|
|
case tl of
|
|
str :: tl => loop (0, absIdx, str, tl, currentState, counter)
|
|
| [] => absIdx
|
|
else
|
|
let
|
|
val chr = String.sub (str, idx)
|
|
val newState = next (currentState, chr)
|
|
in
|
|
if
|
|
newState = twoNewlineState
|
|
then
|
|
if counter - 1 = ~1 then
|
|
absIdx - 1
|
|
else
|
|
loop (idx + 1, absIdx + 1, str, tl, startState, counter - 1)
|
|
else if
|
|
newState = notNewlineState
|
|
orelse newState = notNewlineAfterNewlineState
|
|
then
|
|
if counter - 1 = ~1 then
|
|
absIdx
|
|
else
|
|
loop (idx + 1, absIdx + 1, str, tl, startState, counter - 1)
|
|
else
|
|
loop (idx + 1, absIdx + 1, str, tl, newState, counter)
|
|
end
|
|
|
|
val fStart = loop
|
|
end)
|
|
|
|
structure ViH =
|
|
MakePrevDfaLoop
|
|
(struct
|
|
val startState = startState
|
|
|
|
fun loop (idx, absIdx, str, tl, currentState, counter) =
|
|
if idx < 0 then
|
|
case tl of
|
|
str :: tl =>
|
|
loop
|
|
(String.size str - 1, absIdx, str, tl, currentState, counter)
|
|
| [] => 0
|
|
else
|
|
let
|
|
val chr = String.sub (str, idx)
|
|
val newState = next (currentState, chr)
|
|
in
|
|
if newState = twoNewlineState then
|
|
if counter - 1 = ~1 then absIdx
|
|
else loop (idx - 1, absIdx - 1, str, tl, newState, counter - 1)
|
|
else if newState = notNewlineState then
|
|
if counter - 1 = ~1 then
|
|
absIdx
|
|
else
|
|
loop (idx - 1, absIdx - 1, str, tl, startState, counter - 1)
|
|
else if newState = notNewlineAfterNewlineState then
|
|
if counter - 1 <= 0 then
|
|
absIdx
|
|
else
|
|
loop (idx - 1, absIdx - 1, str, tl, startState, counter - 1)
|
|
else
|
|
loop (idx - 1, absIdx - 1, str, tl, newState, counter)
|
|
end
|
|
|
|
val fStart = loop
|
|
end)
|
|
|
|
val l = ViL.next
|
|
val h = ViH.prev
|
|
end
|