Hacker News with Generative AI: Formal Languages

Grammars of Formal Uncertainty (arxiv.org)
Large language models (LLMs) show remarkable promise for democratizing automated reasoning by generating formal specifications.
Formal Languages, Artificial Intelligence, Computer Science
34 points by barthelomew 32 days ago | 5 comments
(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.
Programming, Computer Science, Formal Languages, Parsing, LR Parsing
61 points by Apanatshka 166 days ago | 2 comments
How to enumerate trees from a context-free grammar (arxiv.org)
Computer Science, Formal Languages, Algorithms
53 points by luu 380 days ago | 9 comments
Is there a BNF grammar of the TeX language? (2010) (stackexchange.com)
TeX, Programming Languages, Formal Languages, Grammar
61 points by nequo 386 days ago | 39 comments