Hello to all. "I'm trying to implement the algorithm of Thompson. It 's the computer of a non-deterministic finite automaton with e- moves ... But I have a problem with the definition of the type of initial data.
I use Emacs with Tuareg mode and write: Type regexp 'to [One Symb 'A | | Union of regexp 'regexp and' a | Conc regexp 'to When compiling with emacs is: Type regexp 'a =' a Error syntax error (the value 'a) I forgot to implement some form-library? -- 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
