0 votes 0 votes Find an LL grammar for the language L = {$w : n_a (w) = n_b (w)$}. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar context-free-language + – Naveen Kumar 3 asked Jun 25, 2019 Naveen Kumar 3 174 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.