Idiots don't know how to parse...

http://stackoverflow.com/questions/28256/equation-expression-parser-with-precedence

WTF? The accepted answer is from someone who thinks recursive descent is "hard" and a ridiculously bloated parser-generator is "easy"? Pure bisonshit! Almost every real (and toy) compiler uses some variant of recursive-descent. Even GCC, which would probably be the biggest user of Bison, moved to recursive-descent years ago.

These aren't even programmers, these are Java-sipping codemonkeys who know next to nothing about how anything really works and can only parrow "reinventing the wheel" and other "enterprise best practices" bullshit.

>>51
That would make compilation SLOW AS BALLS though. Not that it's a bad thing, I'm all for it, though tt might not be feasible in those cases where it actually is the most useful, like compiling a big ``low-level'' language (which might be hard to debug) on a slow embedded device.