Thank you for your answers. I chose `pegs` because it says it works with
Unicode (and I need this).
I have already researched other options:
* `NPeg` seemed great, I wrote my grammar in it and tested it, it worked (for
matching), but I found it lacks enter/leave procs so I don't know how to build
my syntactic tree with it. My language includes nested parentheses.
* `Nimly`... frankly, I couldn't understand the docs/examples. :)
Well, it seems I will have to do it by hand (actually, I already have a working
parser written by hand in Python, I was just hoping for an automated tool in
Nim...). I will use regular expressions. Is this a good plan? Does anyone have
some advice on this?
PS: I read the `pegs` documentation, I saw the example, my question was about
using captured substrings (those enclosed in `{}`) in the enter/leave procs.
Not the whole `s` string with `start` and `length` \-- that matches the entire
rule, not the `{}` portions.
