Yes, I am aware that parsing s-expressions is trivial, but the full Lisp
(or Scheme) grammar is somewhat more complicated, and I do not feel like
reinventing the wheel.
Any technology that integrates well with Ocaml is fine, since in the end
in-memory ASTs is going to be what we're really interested in.
PS: Other than CIL for C, are there other programming languages for
which I can just get an off-the-shelf (non-commercial) parser?
Caml-list mailing list. Subscription management:
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
There is an implementation of a minimal lisp called Minilisp here :
It may fulfill your needs.
Empreinte GPG [pgp.mit.edu] :
F8CC 61DD 40B7 933F 17CA 061F 5591 AAE6 D3EC 7357
John Skaller <skaller at users dot sf dot net>
Felix, successor to C++: http://felix.sf.net
http://topdog.cc/ - EL to C# compiler
http://wagerlabs.com/ - blog
Thanks to all who have responded to this,
I wrote an OCaml parser for Java a while ago:
It handled the full language at the time I wrote it, but it probably
needs to be updated now (for generics at least).
Eric Cooper e c c @ c m u . e d u