Enumerating the Strings of a Regular Expression
Technical Report TR2000-30, University of Texas at Austin, Department of Computer Sciences,
Austin, TX, December 2000.
We present a Haskell solution to the problem of enumerating the
strings of a regular expression with respect to a regular preorder, a
term we soon define. A version of this problem was considered in a
note by Jayadev Misra. We have generalized the problem. The use of
Haskell was suggested by Edsger W. Dijkstra and our solution makes
critical use of Haskell's lazy evaluation.
Gzipped Postscript (55K)
Haskell Code (4K)