Compiler design

Question

8:14 AM
37\%
Deepali bansal's doubt
7 hrs
Jaipur

Compiler Design
CS \& IT Engg
Where €,; IF THEN and all capital letters are terminal and stmt, ifstmt, whilestmt and bexpr are non terminal

The above grammar is
1 ambiguous
2 unambiguous
3 LL(1)
4 LR(1)
Pls expain with the draw parse tree and how to generate the grammar

T4. Consider the following CFG.
stmt $\rightarrow \varepsilon$ | stmt; stmt; lifstmt | whilestmt ifstmt $\rightarrow$ If bexpr THEN stmt |IF bexpr THEN stmt ELSE stmt END whilestmt $\rightarrow$ WHILE bexpr DO stmt END bexpr $\rightarrow$ TRUE|FALSE

Answers (0)

Answer 1

We can draw multiple parse tree so it is ambiguous grammar.

Answer 2

Given grammar is ambiguous, Hence option A.

We can generate more than 1 parse trees for even number of ';' like ;;.    ;;;; .      ;;;;;;