makeExprParser: Mixing operators with different associativities in same precedence level does not work

When makeExprParser is given two infix operators at the same precedence level but with different associativit it stops before parsing the expression completely for some inputs.

Example:

operatorTable =
  [ [ prefix "-" Negation
    , prefix "+" id
    ]
  , [ binaryR "^" Expo
    , binaryL "*" Product
    , binaryL "/" Division
    ]
  , [ binaryL "+" Sum
    , binaryL "-" Subtr
    ]
  ]

For the above slightly modified example from the tutorial the parser stops unexpectedly:

ghci> parseTest pExpr "2 ^ 2 * 3 ^ 2"
Expo (Int 2) (Int 2)

This is unexpected because documentation says it should work:

All operators in one list have the same precedence (but may have different associativity).

Looking at the code it seems like this could be fixed by adding recursion to addPrecLevel. But I am not sure this is a good idea so have not created a PR to fix this.

Start with addPrecLevel in Control.Monad.Combinators.Expr and reproduce the issue using the operator table and input shown. Compare the documented mixed-associativity behavior with the parser result, then inspect nearby expression-parser code for existing tests or examples. Done means the full expression is parsed according to the documented precedence and associativity rules.