2025-09-28 22:01:44 +01:00
|
|
|
structure Nfa =
|
|
|
|
|
struct
|
2025-09-29 00:46:05 +01:00
|
|
|
datatype state = VALID of int | INVALID | UNTESTED
|
|
|
|
|
|
2025-09-28 22:01:44 +01:00
|
|
|
datatype regex =
|
2025-09-29 00:46:05 +01:00
|
|
|
CHAR_LITERAL of char * state
|
|
|
|
|
| CONCAT of (regex * state) list * state
|
|
|
|
|
| ALTERNATION of (regex * state) list * state
|
|
|
|
|
| ZERO_OR_ONE of regex * state
|
|
|
|
|
| ZERO_OR_MORE of regex * state
|
|
|
|
|
| ONE_OR_MORE of regex * state
|
|
|
|
|
| GROUP of regex * state
|
|
|
|
|
|
|
|
|
|
datatype alternation_state = ALL_VALID of int | ALL_INVALID | SOME_UNTESTED
|
2025-09-28 22:01:44 +01:00
|
|
|
|
|
|
|
|
val groupLevel = 1
|
|
|
|
|
val postfixLevel = 2
|
|
|
|
|
val concatLevel = 3
|
|
|
|
|
val altLevel = 4
|
|
|
|
|
|
2025-09-29 00:46:05 +01:00
|
|
|
local
|
|
|
|
|
fun rebuildConcat (lst, chr, idx) =
|
|
|
|
|
case lst of
|
|
|
|
|
[(hd, _)] =>
|
|
|
|
|
let
|
|
|
|
|
val (hd: regex, state: state) = rebuild (hd, chr, idx)
|
|
|
|
|
val result = [(hd, state)]
|
|
|
|
|
val concat = CONCAT (result, state)
|
|
|
|
|
in
|
|
|
|
|
(concat, state)
|
|
|
|
|
end
|
|
|
|
|
| (hd, _) :: tl =>
|
|
|
|
|
let
|
|
|
|
|
val (hd, state) = rebuild (hd, chr, idx)
|
|
|
|
|
in
|
|
|
|
|
case state of
|
|
|
|
|
UNTESTED =>
|
|
|
|
|
let val concat = CONCAT ((hd, state) :: tl, UNTESTED)
|
|
|
|
|
in (concat, UNTESTED)
|
|
|
|
|
end
|
|
|
|
|
| INVALID =>
|
|
|
|
|
let val concat = CONCAT ([], INVALID)
|
|
|
|
|
in (concat, INVALID)
|
|
|
|
|
end
|
|
|
|
|
| VALID _ =>
|
|
|
|
|
let val concat = CONCAT (tl, UNTESTED)
|
|
|
|
|
in (concat, UNTESTED)
|
|
|
|
|
end
|
|
|
|
|
end
|
|
|
|
|
| [] =>
|
|
|
|
|
(* should never occur *)
|
|
|
|
|
raise Fail
|
|
|
|
|
"nfa.sml, rebuildConcat 45: \
|
|
|
|
|
\should never try to rebuild empty concat list"
|
|
|
|
|
|
|
|
|
|
and rebuild (nfa, chr, idx) =
|
|
|
|
|
case nfa of
|
|
|
|
|
CHAR_LITERAL (lit, UNTESTED) =>
|
|
|
|
|
if chr = lit then (CHAR_LITERAL (lit, VALID idx), VALID idx)
|
|
|
|
|
else (CHAR_LITERAL (lit, INVALID), INVALID)
|
|
|
|
|
| CHAR_LITERAL (lit, state) => (nfa, state)
|
|
|
|
|
|
|
|
|
|
| CONCAT (lst, UNTESTED) => rebuildConcat (lst, chr, idx)
|
|
|
|
|
| CONCAT (_, state) => (nfa, state)
|
|
|
|
|
|
|
|
|
|
| _ => raise Fail "nfa.sml 69: not char literal or concat"
|
|
|
|
|
|
|
|
|
|
fun loop (pos, str, nfa) =
|
|
|
|
|
if pos = String.size str then
|
|
|
|
|
case nfa of
|
|
|
|
|
CHAR_LITERAL (_, VALID _) => true
|
|
|
|
|
| CHAR_LITERAL (_, _) => false
|
|
|
|
|
| CONCAT (_, VALID _) => true
|
|
|
|
|
| CONCAT (_, _) => false
|
|
|
|
|
| ALTERNATION (_, VALID _) => true
|
|
|
|
|
| ALTERNATION (_, _) => false
|
|
|
|
|
| ZERO_OR_ONE (_, VALID _) => true
|
|
|
|
|
| ZERO_OR_ONE (_, _) => false
|
|
|
|
|
| ZERO_OR_MORE (_, VALID _) => true
|
|
|
|
|
| ZERO_OR_MORE (_, _) => false
|
|
|
|
|
| ONE_OR_MORE (_, VALID _) => true
|
|
|
|
|
| ONE_OR_MORE (_, _) => false
|
|
|
|
|
| GROUP (_, VALID _) => true
|
|
|
|
|
| GROUP (_, _) => false
|
|
|
|
|
else
|
|
|
|
|
let
|
|
|
|
|
val chr = String.sub (str, pos)
|
|
|
|
|
val (nfa, state) = rebuild (nfa, chr, pos)
|
|
|
|
|
in
|
|
|
|
|
case state of
|
|
|
|
|
VALID _ => true
|
|
|
|
|
| INVALID => false
|
|
|
|
|
| UNTESTED => loop (pos + 1, str, nfa)
|
|
|
|
|
end
|
|
|
|
|
in
|
|
|
|
|
fun exists (str, nfa) = loop (0, str, nfa)
|
|
|
|
|
end
|
|
|
|
|
|
2025-09-28 22:01:44 +01:00
|
|
|
local
|
|
|
|
|
fun loop (pos, str, openParens, closeParens) =
|
|
|
|
|
if pos = String.size str then
|
|
|
|
|
pos
|
|
|
|
|
else
|
|
|
|
|
case String.sub (str, pos) of
|
|
|
|
|
#"(" => loop (pos + 1, str, openParens + 1, closeParens)
|
|
|
|
|
| #")" =>
|
|
|
|
|
if closeParens + 1 = openParens then pos
|
|
|
|
|
else loop (pos + 1, str, openParens, closeParens + 1)
|
|
|
|
|
| _ => loop (pos + 1, str, openParens, closeParens)
|
|
|
|
|
in
|
|
|
|
|
fun getRightParenIdx (pos, str) = loop (pos, str, 1, 0)
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
fun helpClimb (pos, str, lhs, level) =
|
|
|
|
|
if pos = String.size str then
|
|
|
|
|
(pos, lhs)
|
|
|
|
|
else
|
|
|
|
|
case String.sub (str, pos) of
|
|
|
|
|
#")" => (pos + 1, lhs)
|
|
|
|
|
| #"(" =>
|
|
|
|
|
if level < groupLevel then
|
|
|
|
|
(pos, lhs)
|
|
|
|
|
else
|
|
|
|
|
let
|
|
|
|
|
val groupEndIdx = getRightParenIdx (pos + 1, str)
|
|
|
|
|
val substr = String.substring
|
|
|
|
|
(str, pos + 1, groupEndIdx - pos - 1)
|
|
|
|
|
val rhs = climb substr
|
2025-09-29 00:46:05 +01:00
|
|
|
val rhs = GROUP (rhs, UNTESTED)
|
|
|
|
|
val result = CONCAT ([(lhs, UNTESTED), (rhs, UNTESTED)], UNTESTED)
|
2025-09-28 22:01:44 +01:00
|
|
|
in
|
|
|
|
|
helpClimb (groupEndIdx + 1, str, result, groupLevel)
|
|
|
|
|
end
|
|
|
|
|
| #"|" =>
|
|
|
|
|
if level < altLevel then
|
|
|
|
|
(pos, lhs)
|
|
|
|
|
else
|
|
|
|
|
let
|
|
|
|
|
val chr = String.sub (str, pos + 1)
|
2025-09-29 00:46:05 +01:00
|
|
|
val chr = CHAR_LITERAL (chr, UNTESTED)
|
2025-09-28 22:01:44 +01:00
|
|
|
val (pos, rhs) = helpClimb (pos + 2, str, chr, altLevel)
|
2025-09-28 22:23:48 +01:00
|
|
|
val result =
|
|
|
|
|
case rhs of
|
2025-09-29 00:46:05 +01:00
|
|
|
ALTERNATION (lst, state) =>
|
|
|
|
|
ALTERNATION ((lhs, UNTESTED) :: lst, UNTESTED)
|
|
|
|
|
| _ =>
|
|
|
|
|
ALTERNATION ([(lhs, UNTESTED), (rhs, UNTESTED)], UNTESTED)
|
2025-09-28 22:01:44 +01:00
|
|
|
in
|
|
|
|
|
(pos, result)
|
|
|
|
|
end
|
|
|
|
|
| #"?" =>
|
|
|
|
|
if level < postfixLevel then
|
|
|
|
|
(pos, lhs)
|
|
|
|
|
else
|
2025-09-29 00:46:05 +01:00
|
|
|
let val lhs = ZERO_OR_ONE (lhs, UNTESTED)
|
2025-09-28 22:01:44 +01:00
|
|
|
in helpClimb (pos + 1, str, lhs, postfixLevel)
|
|
|
|
|
end
|
|
|
|
|
| #"*" =>
|
|
|
|
|
if level < postfixLevel then
|
|
|
|
|
(pos, lhs)
|
|
|
|
|
else
|
2025-09-29 00:46:05 +01:00
|
|
|
let val lhs = ZERO_OR_MORE (lhs, UNTESTED)
|
2025-09-28 22:01:44 +01:00
|
|
|
in helpClimb (pos + 1, str, lhs, postfixLevel)
|
|
|
|
|
end
|
|
|
|
|
| #"+" =>
|
|
|
|
|
if level < postfixLevel then
|
|
|
|
|
(pos, lhs)
|
|
|
|
|
else
|
2025-09-29 00:46:05 +01:00
|
|
|
let val lhs = ONE_OR_MORE (lhs, UNTESTED)
|
2025-09-28 22:01:44 +01:00
|
|
|
in helpClimb (pos + 1, str, lhs, postfixLevel)
|
|
|
|
|
end
|
|
|
|
|
| chr =>
|
|
|
|
|
if level < concatLevel then
|
|
|
|
|
(pos, lhs)
|
|
|
|
|
else
|
|
|
|
|
let
|
2025-09-29 00:46:05 +01:00
|
|
|
val chr = CHAR_LITERAL (chr, UNTESTED)
|
2025-09-28 22:01:44 +01:00
|
|
|
val (pos, rhs) = helpClimb (pos + 1, str, chr, concatLevel)
|
2025-09-28 22:23:48 +01:00
|
|
|
val result =
|
|
|
|
|
case rhs of
|
2025-09-29 00:46:05 +01:00
|
|
|
CONCAT (lst, _) => CONCAT ((lhs, UNTESTED) :: lst, UNTESTED)
|
|
|
|
|
| _ => CONCAT ([(lhs, UNTESTED), (rhs, UNTESTED)], UNTESTED)
|
2025-09-28 22:01:44 +01:00
|
|
|
in
|
|
|
|
|
(pos, result)
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
and loop (pos, str, ast) =
|
|
|
|
|
if pos = String.size str then
|
|
|
|
|
ast
|
|
|
|
|
else
|
|
|
|
|
let val (pos, ast) = helpClimb (pos, str, ast, altLevel)
|
|
|
|
|
in loop (pos, str, ast)
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
and climb str =
|
|
|
|
|
let
|
|
|
|
|
val chr = String.sub (str, 0)
|
2025-09-29 00:46:05 +01:00
|
|
|
val chr = CHAR_LITERAL (chr, UNTESTED)
|
2025-09-28 22:01:44 +01:00
|
|
|
in
|
|
|
|
|
loop (1, str, chr)
|
|
|
|
|
end
|
|
|
|
|
end
|