[plt-scheme] BNF parser generator

Hello

I've a couple of translations (from Caml and Haskell) of parser 
combinators here:

http://slackwise.org/spt/scheme.html


Unfortunately they're very much toy implementations - no error handling, 
slow...

There's also an implentation of a GLR parser but it only supports 
drawing output to Dot so it isn't overly useful :-(


Regards

stephen



David Herman wrote:
>  For list-related administrative tasks:
>  http://list.cs.brown.edu/mailman/listinfo/plt-scheme
> 
> I've written a little parser generator for BNF grammars that turned out 
> pretty well. It's similar to Dorai Sitaram's implementation of regular 
> expressions (i.e., the two-continuation backtracking model).