235 views
0 votes
0 votes
Is it possible to find, for every context-free language without $\in,$ a grammar such that all its  productions are either of the form $A\rightarrow BCD$ $($i.e., a body consisting of three variables$),$  or $A\rightarrow a$ $($i.e., a body consisting of a single terminal$)?$ Give either a proof or a counterexample.

Please log in or register to answer this question.

Related questions