[plt-scheme] Refs for creating non-lispy DSLs

From: Robby Findler (robby at eecs.northwestern.edu)
Date: Mon Nov 2 20:18:39 EST 2009

I have one more example that's pretty self contained if you'd like.
See the file rca-hdl.ss as an example use of the language. Sorry, no
docs, but feel free to ask me questions if you can't figure anything

It is a (mini) hardware description language. The one in the example
file just evaluates the program. Switch it to "mini-hdl-gc.ss" to see
it do some gate counting. In that language you can also leave off some
of the inputs (remove the "= <number>" part of the declaration) and it
will compute the gate counts for all possible inputs.


On Mon, Nov 2, 2009 at 6:27 PM, Paulo J. Matos <pocmatos at gmail.com> wrote:
> Hi all,
> I am interested on references about creating DSLs using PLT-Scheme whose
> final syntax do not resemble lispy-languages (with parenthesis all over
> the place and possibly prefix notation.
> I guess one example of this might be scribble, right?
> Are there any others I should look at? Any docs/papers specific to the
> design and implementation of DSLs like this?
> Cheers,
> --
> Paulo Jorge Matos - pocmatos at gmail.com
> Webpage: http://www.pmatos.net
> _________________________________________________
>  For list-related administrative tasks:
>  http://list.cs.brown.edu/mailman/listinfo/plt-scheme
-------------- next part --------------
A non-text attachment was scrubbed...
Name: hdl.tar.gz
Type: application/x-gzip
Size: 3516 bytes
Desc: not available
URL: <http://lists.racket-lang.org/users/archive/attachments/20091102/c4ac3fc6/attachment.gz>

Posted on the users mailing list.