[clean-list] questions

Attila Ondi aondi@fit.edu
Wed, 26 Nov 2003 13:07:20 -0500


-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Hi all,

Thanks for pointing out parser combinators. I even found a paper
(actually a chapter of a (still written?) book) at the Clean website
(http://www.cs.kun.nl/~clean/download/papers/cleanbook/II.05.ParserCombinators.pdf)
just about parser combinators. It was very useful and helped a lot in
solving my problem more nicely.

This leaves open only my second question: Is there any data structure
library for Clean? One that contains data structures (and functions for
handling them), like HashTable, Set and so on?

Thank you for the help,
Attila

fzuurbie@inter.nl.net wrote:
|>There's nothing better than regexps for string handling
|
|
| Until you found out about combinator parsing (type this in in Google
or CiteSeer). I have a library based on Koopman's and Rojemo's work
(continuation passing style), extended with elaborated error messages.

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.7 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iQCVAwUBP8Tr2B5adN4t/v+OAQIplQQAhip1dBaM1j0UNsOq5gYSdjqlbBwkK3kp
IA9+TqvGNkke7KXud2YQh0mHyiAkCcCIc6enjKy1KRa0vKHIZTRhbIMeW7Efl6U7
alPfeb+4TFk8DZ+V3U4sW6kJDhk/Rs0rM8JVZYpvsSazCn1PLGVWfhDmZG6Y8x5S
Kt6rTDUS7Qk=
=69ME
-----END PGP SIGNATURE-----