Hi, I have a problem with the CAML language..I need to write a CAML prog (
not OCAML) that given three 3-letter words serch if the letters are present
in the given words and in that case it will return true otherwise false.
The program must use the deterministic automata.
Do you have any idea? thanks
Program without automa:
let string_check c1 c2 string = (index_char string c1)>0 && (index_char
string c2)>0;;
let rec progCaml a b s_list =
match s_list with
[] -> false
| x::xs -> try
(string_check a b x)
with
Not_found -> progCaml a b xs;;
--
--
You received this message because you are subscribed to the Google Groups
"ocaml-developer" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/ocaml-developer?hl=en
For other OCaml forums, see http://caml.inria.fr/resources/forums.en.html
---
You received this message because you are subscribed to the Google Groups
"ocaml-developer" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/groups/opt_out.
