0 votes 0 votes Show that the grammar with productions $S\rightarrow aSb|SS|\lambda$ does in fact generate the language $L=$ {$w∈ $ {$a,b$}$^*:n_a(w)=n_b(w) $ and $n_a(v)\geq n_b(v),$ where $v$ is any prefix of $w$}. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar + – Naveen Kumar 3 asked Apr 13, 2019 Naveen Kumar 3 214 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.