Q45

MCQ2 marks, −0.67

Which one of the following grammars is free from left recursion?

(A)

$S \rightarrow AB$ $A \rightarrow Aa \mid b$ $B \rightarrow c$

(B)

$S \rightarrow Ab \mid Bb \mid c$ $A \rightarrow Bd \mid \epsilon$ $B \rightarrow e$

(C)

$S \rightarrow Aa \mid B$ $A \rightarrow Bb \mid Sc \mid \epsilon$ $B \rightarrow d$

(D)

$S \rightarrow Aa \mid Bb \mid c$ $A \rightarrow Bd \mid \epsilon$ $B \rightarrow Ae \mid \epsilon$

Loading…