Abstract
Simple precedence and other precedence-based grammars are traditionally defined to be without productions with the empty right-parts. Generalizing the simple precedence grammars to include productions with the empty right-parts, yields a class of grammars that defines exactly the deterministic context-free languages. Using a family of iteration theorems, it is shown that the descriptive power of the generalized simple precedence grammars increases directly as the number of the productions with the empty right-parts increases. That is, the number of productions with the empty right-parts induce an infinite hierarchy upon the class of deterministic context-free languages. The class of languages in each layer of this infinite hierarchy is characterized in terms of their number of “counting schemes” and required “middle markers”.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call