Recursive Descent Parsing
Parsing means generating a parse tree. Now, in Top-Down parsing, a parse tree is generated by taking the parent node or the starting variable of the grammar and constructing the nodes in preorder.
The recursive descent parsing method is the general form or general way of representing top-down parsing. In this type of parser, The concept of repeated reading of the input is called backtracking.
Steps For Parsing
Every non-terminal has a separate procedure. The procedure body of the corresponding non-terminal is referred to as its RHS. The RHS of the production rule is converted to a code by parsing symbol by symbol using a recursive descent parser.
Reference Link