Choose the correct answer of the following: Consider the following gra

Back to the 2022 paper

Module 2 : Syntax Analysis (Parser)

20222m

Choose the correct answer of the following:
Consider the following grammar:
$S \rightarrow cAd$
$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

Search Google Ask AI

Similar questions

Compiler DesignChoose the correct answer of the following: ________ is a top-down parser. (i) Operator precedence parser (ii) An LALR (k) parser (iii) An LR (k) parser (iv) Recursive descent parser20192m Compiler DesignChoose the correct answer of the following: Handle pruning forms the basis of ...........? (i) Bottom up parsing (ii) Top down parsing (iii) Predictive parsing (iv) Recursive descent parsing20232m Compiler DesignHandle pruning forms the basis of........ (i) Bottom up parsing (ii) Top down parsing (iii) Predictive parsing (iv) Recursive descent parsing20232m Compiler DesignChoose the correct answer of the following: Which of the following statement is true? (i) Every left recursive grammar can be LL(1) (ii) LL(1) grammar can be ambiguous (iii) both (i) and (ii) (iv) None of these20232m

PreviousChoose the correct answer of the following: A grammar that produces more than one parse tree for some sentence is said to be (i) Ambiguous (ii) context free (iii) disambiguous (iv) regular NextChoose the correct answer of the following: A compiler for a high-level language that runs on one machine and produce code for different machines is called (i) optimizing compiler (ii) one-pass compiler (iii) cross-compiler (iv) multipass compiler