in Theory of Computation
123 views
0 votes
0 votes
Show that the grammar $S_0\rightarrow aSbS,S\rightarrow aSbS|\lambda$ is an LL grammar and that it is equivalent to the grammar $S\rightarrow SS|aSb|ab$.
in Theory of Computation
123 views

Please log in or register to answer this question.

Related questions