in Theory of Computation
179 views
0 votes
0 votes
Show that the grammar for L = {$w : n_a (w) = n_b (w)$} which is, $S\rightarrow SS,S\rightarrow \lambda,S\rightarrow aSb,S\rightarrow bSa$ is not an LL grammar.
in Theory of Computation
179 views

1 comment

Hey, just curios to know. I can see a lot of textbook questions on the GO these days. Just want to know what's the objective of doing this maybe?
0
0

1 Answer

0 votes
0 votes
The grammar is ambiguous and left recursive

Related questions