0 votes 0 votes Compiler Design compiler-design parsing lr-parser ambiguous ll-parser test-series + – Deepalitrapti asked Jul 19, 2018 • retagged Jul 16, 2022 by Anjana5051 Deepalitrapti 305 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes We can draw multiple parse tree so it is ambiguous grammar. abhishekmehta4u answered Jul 19, 2018 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Given grammar is ambiguous, Hence option A. We can generate more than 1 parse trees for even number of ';' like ;;. ;;;; . ;;;;;; aambazinga answered Jul 19, 2018 aambazinga comment Share Follow See all 0 reply Please log in or register to add a comment.