Possible bug in Pager's algorithm
(Reported by Andrej Bauer.)
The two attached grammars are examples where no precedence declarations are used, the canonical automaton has no conflicts, yet the automaton produced by Menhir in normal mode (using our implementation of Pager's algorithm) has a reduce/reduce conflict. This seems abnormal.
As a result, the conflict cannot be explained (which is normal, since it does not exist in the canonical automaton).
A temporary work-around is to use