Q32

MCQ2 marks, −0.67

Consider the following expression grammar $G$ : $E \rightarrow E-T \mid T$ $T \rightarrow T + F \mid F$ $F \rightarrow (E) \mid id$ Which of the following grammars is not left recursive, but is equivalent to $G$ ?

(A)

$E \rightarrow E-T \mid T$ $T \rightarrow T +F \mid F$ $F \rightarrow (E) \mid id$

(B)

$E \rightarrow TE’$ $E’ \rightarrow -TE’ \mid \epsilon$ $T \rightarrow T + F \mid F$ $F \rightarrow (E) \mid id$

(C)

$E \rightarrow TX$ $X \rightarrow -TX \mid \epsilon$ $T \rightarrow FY$ $Y \rightarrow +FY \mid \epsilon$ $F \rightarrow (E) \mid id$

(D)

$E \rightarrow TX \mid (TX)$ $X \rightarrow -TX \mid +TX \mid \epsilon$ $T \rightarrow id$

Loading…