-
I have a grammar where some input is parsed very slowly.
Consider a grammar like:
```
Expr < Plus / Minus / Term
Plus ...
Minus ...
Term < Mul / Div / Factor
Mul ...
Div ...
Factor < UnaryMinus / U…
-
ADL scanner must be re-implemented
skoba updated
13 years ago
-
It seems that there is a trick to permit left recursive rules in PEG grammars. Research into that and make parslet do it.
-
I've been writing a parser for a language with the aim of automating some code refactoring and rewriting, which means (among other things) I need to preserve comments & whitespace and hang them onto t…