Hi. I talked with Matthias Felleisen and Ryan Culpepper this afternoon about parsing recursive structures using syntax/parse. I thought I'd give it a shot, so here's what I have so far:
https://gist.github.com/iitalics/fb83780fd4cd6731d6fc046fb2dbac92 It turned out to be far too inconvenient to construct a new syntax-class, although that is what you would regularly do when parsing recursively. The problem with my implementation is that the recursive pattern doesn't capture literals/datum-literals from the enclosing pattern. I'm not sure how you could go about solving this, with the current public-facing syntax/parse API. -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
