Test by Bikram | Compiler Design | Test 1 | Question: 11

Question

In the construction of $LL(1)$ parsing table for the following grammar $M[S,( ] \& M [W, \$]$ are respectively

• $S \rightarrow XY$
• $X \rightarrow (S) \mid \text{ int } W$
• $Y\rightarrow +S \mid \epsilon$
• $W \rightarrow ^*X \mid \epsilon$

• A. $X \rightarrow (S), \ W \rightarrow \epsilon$
• B. $S \rightarrow XY, \ W \rightarrow ^*x$
• C. $S \rightarrow XY,  \ W \rightarrow \epsilon$
• D. $S \rightarrow YX, \ W \rightarrow \epsilon$

Answer 1

$$\textbf{LL(1) Parsing Table} \\ \begin{array}{|l|l|l|l|} \hline  & ( & ) & \text{int} & + & \ast & \$  \\ \hline S & S\rightarrow XY & & S\rightarrow XY  \\ \hline X & X\rightarrow (S) & & X\rightarrow \text{int} \:W \\ \hline Y & & Y\rightarrow \epsilon & Y\rightarrow +S & & & Y\rightarrow \epsilon \\ \hline W & & W\rightarrow \epsilon & W\rightarrow \epsilon  & & W\rightarrow \ast X & W\rightarrow \epsilon  \\ \hline \end{array}$$