Recursive descent parsing is an example of
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
64.3k questions
77.9k answers
244k comments
80.0k users