Commit f5c4e6a0 authored by POTTIER Francois's avatar POTTIER Francois

A simpler test automaton.

parent 29584df7
......@@ -152,13 +152,13 @@ let _ =
(* An automaton that searches for a word that belongs in a dictionary. *)
let k =
one @@ (keywords |> map word |> disjunction)
one @@ ([ "dead" ] |> map word |> disjunction)
let _ =
register {
basename = "k";
regexp = k;
accepted = [ "abed"; "bace"; ];
accepted = [ "dead"; "addead"; ];
rejected = [ "beca"; ];
}
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment