Abstract
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.

This publication has 0 references indexed in Scilit: