Consider the following grammar G: E → T E'; E' → + T E' | ε; T → F T'; T' → *…
PYQ Coal India Management Trainee CBT 2026Modified — slightly modified from the official paper; see the solution
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?
- A.
The grammar requires backtracking since FIRST and FOLLOW sets of E’ overlap.
- B.
The grammar is left-recursive and hence cannot be used for top-down parsing.
- C.
The grammar is suitable for LL(1) (predictive) parsing and does not require backtracking.
- D.
The grammar is not left-recursive but cannot be parsed using a predictive (LL(1)) parser.
Attempted by 37 students.
Sign up free to check your answer
Sign up freeLoading lesson…

