0 votes 0 votes Construct an unambiguous grammar equivalent to the grammar in Exercise 6. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation grammar ambiguous + – Naveen Kumar 3 asked Apr 14, 2019 Naveen Kumar 3 220 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes the language generated is simple (aa*b) hence, s→ aA A→aA | b JAINchiNMay answered Oct 11, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.