Recursive descent parsing is an example of
2016
Recursive descent parsing is an example of
- A.
Top-down parsers
- B.
Bottom-up parsers
- C.
Predictive parsers
- D.
None of the above
Attempted by 248 students.
Show answer & explanation
Correct answer: A
Recursive descent parsing is a top-down parsing technique used in compiler design. It starts with the start symbol of the grammar and attempts to derive the input string by expanding non-terminals. Since it constructs the parse tree from the root down to the leaves, it is classified as a top-down parser.
A video solution is available for this question — log in and enroll to watch it.