On 10/31/2013 07:10 AM, Philippe Sigaud wrote:
Now, if you want parsing specifically, what do you want to get? A parse
tree? In that case, you can for example use one of my projects, Pegged,
which generates CT-compatible parsers (that is, functions that can use
CTFE to parse a string at CT).
Parse trees can also be manipulated at compile-time, to modify the
expression, and then collapsed down again to a new expression, if that's
what is needed.
https://github.com/PhilippeSigaud/Pegged
Have any serious grammars been tested with this?
Are there any shortcomings?
