2 ms·
Wouldn't that still be a finite state automata? He mentioned recursion, so no :-) I also hate working with ANTLR/YACC ... heavy, hard to start with, steep lea
by bad_user 16y ago
Wouldn't that still be a finite state automata?
He mentioned recursion, so no :-)
I also hate working with ANTLR/YACC ... heavy, hard to start with, steep learning curve. These tools are designed for industrial-strength compilers, where performance / flexibility matters.
And PEGs are better than CFGs (that's teeshirt material right there :))
- johanbev 16y agoAaahhh, ofc, now I see why that wouldnt work. Guess I learn something every day :)