Question 100Asked in CIL MT Systems, 24 Aug 2026 (3:00 PM, CBT-26)
Consider the following grammar G: E → T E'
Consider the following grammar G:
E → T E'
E' → + T E' ε
T → F T'
T' → * F T' ε
F → (E) id
Which of the following statements about top-down parsing of grammar G is true?
AThe grammar is not left-recursive and can be parsed using a predictive (LL(1)) parser.
BThe grammar requires backtracking since FIRST and FOLLOW sets of E’ overlap.
CThe grammar is left-recursive and hence cannot be used for top-down parsing.
DThe grammar is suitable for LL(1) (predictive) parsing and does not require backtracking.
Show answerHide answer
Correct answer: (D) The grammar is suitable for LL(1) (predictive) parsing and does not require backtracking.
From CIL MT Systems PYQ, 24 Aug 2026 (3:00 PM, CBT-26)