Hacker News with Generative AI: Formal Languages

(Right-Nulled) Generalised LR Parsing (jeffsmits.net)
I hope you know a bit about LR parsing, otherwise this blog post won’t make much sense to you. You can read all about it in a previous post of mine. Today I want to discuss the problems with getting your language parsed in LR(1), or even LR(k). And how an old way to solve those problems is with a more powerful algorithm, that can parse any context-free grammar, no restrictions, no complaints about conflicts.
How to enumerate trees from a context-free grammar (arxiv.org)
Is there a BNF grammar of the TeX language? (2010) (stackexchange.com)