Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
137 views
in General by (114k points)
closed by
Recursive descent parsing is an example of 
1. Top-down parsers
2. Bottom-up parsers
3. Predictive parsers 
4. None of these 

1 Answer

0 votes
by (115k points)
selected by
 
Best answer
Correct Answer - Option 1 : Top-down parsers

Recursive descent parsing is an example of Top-down parsers

  • 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.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...