3 ms·
> It's almost trivial to translate a language specification's grammar productions into a recursive descent parser. It's also potentially quite slow.
by dataflow 5y ago
> It's almost trivial to translate a language specification's grammar productions into a recursive descent parser.
It's also potentially quite slow.
- thomasmg 5y agoIn my experience (with both hand-written and generators, eg Antler), that's not the case. Hand-written recursive descent are simple to write, debug and maintain and extend, while with generators I always had to fight the tool at some point, and that always ended in frustration.
- dataflow 5y agoWe've just had different experiences then. It's funny you mention ANTLR because it was in particular very slow last time I tried it (just a couple years ago). As for fighting the tool and simplicity, sure, that's beside my point.