0 votes 0 votes Find an s-grammar for $L =$ {$a^nb^n : n ≥ 1$}. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation grammar + – Naveen Kumar 3 asked Apr 14, 2019 Naveen Kumar 3 478 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes S→AB A→ aAB A→ a B→b correct me if i am wrong JAINchiNMay answered Oct 11, 2020 • edited Jun 8, 2021 by JAINchiNMay JAINchiNMay comment Share Follow See all 3 Comments See all 3 3 Comments reply abcS commented Jun 2, 2021 reply Follow Share How will you terminate A? I’m not able to understand. 0 votes 0 votes JAINchiNMay commented Jun 8, 2021 reply Follow Share check it now 0 votes 0 votes abcS commented Jun 9, 2021 reply Follow Share yes, now A is being terminated but in s-grammar there should be only one production with (A,a) pair. Here there are two productions, 2nd and 3rd with the same (A,a) pair. 0 votes 0 votes Please log in or register to add a comment.
