A recursive descent parser is a 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 recognises.
References
- Recursive Programming Techniques, W.H. Burge, 1975, ISBN 0-201-14450-6
This article (or an earlier version of it) contains material from FOLDOC, used with permission.