1 votes 1 votes If my solution is wrong then please correct it and give proper explanation why it is wrong. learner_geek asked Aug 5, 2017 learner_geek 218 views answer comment Share Follow See 1 comment See all 1 1 comment reply Bikram commented Aug 7, 2017 reply Follow Share @ learner_geek An unambiguous grammar is a context-free grammar for which every valid string has a unique leftmost derivation or parse tree. Now draw the parse tree and find the required grammar. 0 votes 0 votes Please log in or register to add a comment.