It is significantly more clear if you only parse infix expressions which is why it is used for many introductory "lets write a calculator" examples.
In context of more complex language with small set of infix operators and their precedence classes it is probably not worthwhile unless you really want user-defined operators.
My very fuzzy recollection is there's long-ago work compiling user-defined mixfix operator precedence parsing down to recursive descent, but yes, opp implementation is pretty for large complex user-defined operator sets.
In context of more complex language with small set of infix operators and their precedence classes it is probably not worthwhile unless you really want user-defined operators.