<Table> <Tr> <Td> </Td> <Td> This article includes a list of references, but its sources remain unclear because it has insufficient inline citations . Please help to improve this article by introducing more precise citations . (February 2009) (Learn how and when to remove this template message) </Td> </Tr> </Table> <Tr> <Td> </Td> <Td> This article includes a list of references, but its sources remain unclear because it has insufficient inline citations . Please help to improve this article by introducing more precise citations . (February 2009) (Learn how and when to remove this template message) </Td> </Tr> <P> 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 usually implements one of the productions of the grammar . Thus the structure of the resulting program closely mirrors that of the grammar it recognizes . </P>

Difference between recursive descent parser and non recursive descent parser