A note on transforming context-free grammars to Wirth-Weber precedence form
A. Learner · The Computer Journal · 1970
It is shown that every context-free grammar can be transformed into an equivalent Wirth-Weber precedence grammar. A general algorithm for the transformation is given. This is followed by a description of a practical program.