Recursive descent parser: Difference between revisions

Revision as of 09:25, 13 August 2004

Revision as of 04:30, 24 August 2004

Line 2:

== Example parser ==

Consider the following [[formal grammar|grammar]] in [[Backus-Naur form|BNF]]:

Line 29 ⟶ 28:

== Formalizing recursive descent parsers ==

Although [[context-free grammar]]s are commonly used to [[formal|formalize]] the syntax of the language recognized by a recursive descent parser (as in the example above), an alternate and more direct way to formalize recursive descent parsing is via [[parsing expression grammar]]s, which model the structure and behavior of typical recursive descent parsers directly.

Line 38 ⟶ 36:

* ''Recursive Programming Techniques'', W.H. Burge, 1975, ISBN 0-201-14450-6

* The [[Dragon book]]

{{FOLDOC}}

----

''This article (or an earlier version of it) contains material from [[FOLDOC]], used with [[Public Domain Resources/Foldoc license|permission]].''

[[Category:Parsing algorithms]]