https://jeffreykegler.github.io/personal/timeline_v3
which contains this easily overlooked but IMHO extremely significant statement:
"a recursive descent implementation can parse operator expressions as lists, and add associativity in post-processing"
Personally, it has always seemed like a no-brainer to me that this is clearly the Right Answer. It is a mystery to me that the computing world at large has spent so much effort on a problem whose solution is actually very straightforward if you just give in on one tiny little piece of theoretical purity.
See http://www.flownet.com/ron/lisp/parcil.lisp for my own implementation of such a parser. As you will see if you count LOCs, it's very, very simple by parser standards, and yet it handles all the "hard" problems: associativity, precedence, infix and prefix operators.