We were promised flying cars but I would settle for decent parser combinators. It’s been 17 years since someone published a way to gracefully handle left recursion and basically no one implements it. There’s a paper on how to do good error recovery in PEG, and there’s like one blog post talking about how you can do this with parser combinators but that’s it. And combining parser combinators with Pratt parsers to have a reasonable way of working with operators has a single reddit thread where people dumped a load of undocumented Haskell code. There’s gotta be a way to put all this stuff together once and for all.