12 votes 12 votes Recursive descent parsing is an example of Top-down parsers Bottom-up parsers Predictive parsers None of the above Compiler Design isro2016 compiler-design parsing + – go_editor asked Jul 6, 2016 go_editor 10.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 13 votes 13 votes RDP is a Top-Down Predictive Parser Answer : A LL(1) is also a Top-Down Predictive Parser. Jithin Jayan answered Jul 6, 2016 • selected Aug 11, 2016 by Prashant. Jithin Jayan comment Share Follow See 1 comment See all 1 1 comment reply Warrior commented May 3, 2017 reply Follow Share 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 votes 0 votes Please log in or register to add a comment.
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 shekhar chauhan answered Jul 6, 2016 shekhar chauhan comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Recursive descent parsing is a Top-down parsers. MURARI1051 answered Mar 30, 2017 MURARI1051 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Recursive descent parser is nothing but Top down parsers So Ans will be (A) akash.dinkar12 answered Apr 7, 2017 akash.dinkar12 comment Share Follow See all 0 reply Please log in or register to add a comment.