How recursive decent parser works? Elaborate with suitable example. Also state its drawbacks?
Answers
Answered by
0
Answer:
Explanation:
In computer science, a recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive equivalent) where each such procedure implements one of the nonterminals of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognizes.
may be it's helpful for you
Similar questions