in Compiler Design
10,458 views
12 votes
12 votes

Recursive descent parsing is an example of

  1. Top-down parsers
  2. Bottom-up parsers
  3. Predictive parsers
  4. None of the above
in Compiler Design
10.5k views

5 Answers

13 votes
13 votes
Best answer
RDP is a Top-Down Predictive Parser Answer : A

LL(1) is also a Top-Down Predictive Parser.
selected by

1 comment

Recursive descent parsing is an example of Both Top-down as well as Recursive descent .So how only Top down is correct why not Predictive is correct?
0
0
7 votes
7 votes

Answer : Top Down Parser

Recursive descent is a top-down parsing technique that constructs the parse tree from the top and the input is read from left to right. It uses procedures for every terminal and non-terminal entity. This parsing technique recursively parses the input to make a parse tree, which may or may not require back-tracking. But the grammar associated with it (if not left factored) cannot avoid back-tracking. A form of recursive-descent parsing that does not require any back-tracking is known as predictive parsing.

Reference 1 : RDP

Reference 2 : RDP

0 votes
0 votes
Recursive descent parsing is a Top-down parsers.
0 votes
0 votes
Recursive descent parser is nothing but Top down parsers

So Ans will be (A)
Answer:

Related questions