Answer:
Parser is type of program that can determine that whether the start symbol can derive the program or not. Parser done carefully then parser is right otherwise it is wrong.
Step-by-step explanation:
Recursive descent Parser example: It is also called the top down parser. In this parser, the symbol can be expand for whole program.
The recursive Descent and LL parser are called the top down parser.
Example:
E->E+T / T
T-T*F / F
F-> (E) / id
S -cAd
A- ab/a Input string is w= cad