Prerequisite – Construction of LL(1) Parsing Table, Classification of top down parsers
Parsing is the process to determine whether the start symbol can derive the program or not. If the Parsing is successful then the program is a valid program otherwise the program is invalid.
There are generally two types of Parsers:

TopDown Parsers:
 In this Parsing technique we expand the start symbol to the whole program.
 Recursive Descent and LL parsers are the TopDown parsers.

BottomUp Parsers:
 In this Parsing technique we reduce the whole program to start symbol.
 Operator Precedence Parser, LR(0) Parser, SLR Parser, LALR Parser and CLR Parser are the BottomUp parsers.
Recursive Descent Parser:
It is a kind of TopDown Parser. A topdown parser builds the parse tree from the top to down, starting with the start nonterminal. A Predictive Parser is a special case of Recursive Descent Parser, where no Back Tracking is required.
By carefully writing a grammar means eliminating left recursion and left factoring from it, the resulting grammar will be a grammar that can be parsed by a recursive descent parser.
Example:
Before removing left recursion  After removing left recursion 

E –> E + T  T T –> T * F  F F –> ( E )  id 
E –> T E’ E’ –> + T E’  e T –> F T’ T’ –> * F T’  e F –> ( E )  id 
**Here e is Epsilon
For Recursive Descent Parser, we are going to write one program for every variable.
Example: Grammar: E > i E' E' > + i E'  e
int main() { // E is a start symbol. E(); // if lookahead = $, it represents the end of the string // Here l is lookahead. if (l == '$' ) printf ( "Parsing Successful" ); } // Definition of E, as per the given production E() { if (l == 'i' ) { match( 'i' ); E'(); } } // Definition of E' as per the given production E'() { if (l == '+' ) { match( '+' ); match( 'i' ); E'(); } else return (); } // Match function match( char t) { if (l == t) { l = getchar (); } else printf ( "Error" ); } 
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a studentfriendly price and become industry ready.
Recommended Posts:
 Difference between Recursive Predictive Descent Parser and NonRecursive Predictive Descent Parser
 Total Recursive Functions and Partial Recursive Functions in Automata
 Operator grammar and precedence parser in TOC
 Shift Reduce Parser in Compiler
 Parsing ambiguos grammars using LR parser
 Working of Bottom up parser
 Working of top down parser
 Recursive Relationships in ER diagrams
 Algorithm for non recursive Predictive Parsing
 Importance of Computer Networking
 Attribute Closure Algorithm and its Utilization
 Parse Tree in Compiler Design
 Moore Machines implementation in C++
 Relation in FCFS and Preemptive Priority Scheduling Algorithm
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.