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

Question

Consider the following grammar:

$E \rightarrow E + T \mid T$
$T \rightarrow T ^* F \mid F$
$F \rightarrow (E) \mid id$

What are the productions for E, T and F after converting the above mentioned grammar to LL(1) grammar?

• A. $E \rightarrow +TE', \ \ T \rightarrow ^*FT ', \ \  F \rightarrow (E) \mid id$
• B. $E \rightarrow +TE' \mid \epsilon, \ \ T \rightarrow ^*FT ' \mid  \epsilon$
• C. $E \rightarrow  T, \ \  T \rightarrow F, \ \  F\rightarrow (E)  \mid  id$
• D. $E \rightarrow TE' , \ \  T \rightarrow FT' , \ \  F \rightarrow (E)  \mid id$

Comments

E----> T E'

E'---> + T E' | ∈

T---> F T'

T'-----> * F T' | ∈

F----> ( E ) | id

---

epsilon is missing in 2nd last.

---

options don't match?

---

incorrect options

Answer 1

D is Correct.

Comments

Why are we not including the E’ and T’ production? Can anyone explain?