How can I show that every context-free language can be generated by a grammar in which every production is of the form A → a,A → aB,A → aBC where a is a terminal, and A,B,C are variables?
Asked
Active
Viewed 17 times
0
-
1This is an interesting question, but since it’s primarily a theoretical question rather than a coding question it might be a better fit at cs.stackexchange.com. – templatetypedef Dec 10 '18 at 03:53
-
4Look for a proof of "Greibach normal form." – Peter Leupold Dec 10 '18 at 05:25