Wouldn't that still be a finite state automata? He mentioned recursion, so no :-...

		bad_user on Feb 4, 2011 \| parent \| context \| favorite \| on: I'm graduating with a CS degree but I don't feel l... `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 :))

Aaahhh, ofc, now I see why that wouldnt work. Guess I learn something every day :)