Tags: Programming Language.
A simple precedence grammar is a context-free formal grammar that can be parsed with a simple precedence parser. The concept was first developed by Niklaus Wirth and Helmut Weber from the ideas of Robert Floyd in their paper EULER: a generalization of ALGOL and its formal definition in the Communications of the ACM in 1966.