Peter Linz Edition 4 Exercise 7.4 Question 2 (Page No. 204)

Question

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.

Comments

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?

Answer 1

The grammar is ambiguous and left recursive