An Algorithm for the Design of Simple Precedence Grammars
Leon Presser, J. McAfee · Journal of the ACM · 1972
A practical incremental algorithm for transforming an arbitrary context-free grammar into an equivalent grammar with unique precedence relations between any two symbols in its vocabulary is presented, illustrated, and proved.The algorithm has been employed as a tool in the design and implementation of programming languages.It has also served as an effective instructional aid.It is assumed that the reader is familiar with basic concepts in formal language theory.