RegExpFm
structure
signature REGEXPFM
structure RegExpFm
: REGEXPFM
This structure combines the structures RegExp for regular expressions and the structure Fm for finite machines, and adds translations between expressions and machines.
structure E : REGEQNS
structure M : FM
type ''a machine = ''a M.machine
datatype re = datatype E.re
val accept : ''a machine -> ''a list -> bool
val retofm : ''a re -> ''a machine
val retominfm : ''a re -> ''a machine
val fmtore : ''a machine -> ''a re
accept m l
retofm r
retominfm r
fmtore m
RegExp
,Fm
,ppRegExpFm
,RegEqnsFm
,ppRegEqnsFm
Since the translation from machines to expressions goes via equation systems, the structure RegEqnsFm
may sometimes be more appropriate.