News for hackers. Stuff that matters.
Re:So you want to be a compiler wizard (2016) by amelius on Sunday April 12, 2020 @05:53PM (#22851274)
What is the class of grammar they can handle? (I mean in the sense of LALR(k), LL(k), etc.)

And is there a large (e.g. exponential) performance penalty for large lookahead?

Re:So you want to be a compiler wizard (2016) by tanin on Sunday April 12, 2020 @11:46PM (#22853009)
There's still "lookahead" in a hand written parser. The lookahead is decided case by case.

Performance penalty only comes if we backtrack in our hand written parsers. I don't think we usually do that.

Any glimpse of top-down parser would be simply too slow.