Simple precedence grammar

A Simple precedence grammar is a formal grammar that can be parsed with Simple precedence parser

Formal definition

G = (N, Σ, P, S) is a Simple precedence grammar such that all the productions rules in P complies with the following constraints:

1. There is no Erasing Rules (ε-productions)
2. There is no Useless Rules (unreacheable symbols or unproductives rules)
3. For each pair of symbols X, Y (X, Y $\in$ (N ∪ Σ)) there is only one Wirth-Weber precedence relation.
4. G is Uniquely Inversible