rain1

currently we have `(pegvm-update-best-error!)` implementing longest match. I find the current error reporting is enough help me fix my parsers so improving error messages would be nice, but not highest...

Good question! * I want to make sure it's easy to use. Making the API useful and the documentation clear. * I want to make sure anybody can contribute to...

What do you want to know?

I think `B B B? B? B?` is not good because there are 2^3 ways for it to parse (although maybe this PEG will always go for the first one,...

if we wrote something like `B{1,9999}` it would generate such an enormous output it might use up to much memory and maybe crash. Should `{x,y}` be implemented as a new...

I don't understand what you mean

ah yes, something like that would do it

We should use a named let loop rather than for/fold, I think. I prefer to avoid for and fold.

Can you give me permissions to push to your repo? https://github.com/petrolifero/racket-peg I have made one commit and want to push it.

The implementation should look kind of like this ``` #lang racket (define (peg-compile exp) (match exp (`(and ,x ,y) `(and ,(peg-compile x) ,(peg-compile y))) (`(optional ,x) `(optional ,(peg-compile x))) (`(range...