Jump to content

Recursive descent parser

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jan Hidders (talk | contribs) at 05:26, 10 August 2002 (stub from FOLDOC). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Recursive_descent_parser&oldid=148912"