Answer:
recursive-descent
Step-by-step explanation:
A recursive parser mainly refers to each of non-terminal that has an associated parsing procedure that can recognize any sequence of tokens generated by that non-terminal.
The major associated weakness of repercursicve parser is that it makes a quite bit of function calls before matching hence it is not really super efficient.
A repercursicve parser is an LL parser that is implemented by writing code directly from the grammar of the source language.