Back to the 2022 paper

Module 2 : Syntax Analysis (Parser)

20222m

Choose the correct answer of the following:
Consider the following grammar:
S→cAdS \rightarrow cAd
A→ab∣ac∣a.A \rightarrow ab | ac | a.
For input string cad, how many times the recursive descent parser will backtrack?
(i) 2
(ii) 3
(iii) 4
(iv) 5

Similar questions

AI LearningWeb Platform

Coursify — Personal AI Course Generator

Struggling with a difficult subject or concept? Turn any engineering topic into a structured course with interactive lessons, quizzes, and research-backed explanations.