[racket] Developing a Recursive Descent Parser in Racket

From: Gregory Gelfond (gelfond.greg at gmail.com)
Date: Thu Oct 24 00:15:28 EDT 2013

Hi All,

I would like to develop a simple compiler for a declarative language in
Racket (as a personal project), and am at a bit of a loss as to how to
proceed with respect to how to process text in Racket. What is the standard
means of reading a sequence of string (or characters) from a file?

Also, I'm coming from Python, and was wondering if there was anything
similar to the LEPL library available for Racket. The basic idea is that
the library provides a syntax similar to EBNF syntax allowing me to declare
the grammar, and then generates a parser for me, whose function interface
is defined by the nonterminal symbols of the grammar.

Thank you kindly for both your time an patience with a new Racket user,
- Gregory Gelfond
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20131023/b874bf80/attachment-0001.html>

Posted on the users mailing list.