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. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-language context-free-grammar + – Naveen Kumar 3 asked Jun 25, 2019 Naveen Kumar 3 269 views answer comment Share Follow See 1 comment See all 1 1 comment reply `JEET commented Aug 22, 2019 reply Follow Share 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 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes The grammar is ambiguous and left recursive sakharam answered Nov 6, 2019 sakharam comment Share Follow See all 0 reply Please log in or register to add a comment.
