Recursive descent parser: Difference between revisions

Revision as of 16:47, 25 November 2002

Revision as of 10:44, 7 April 2003

Line 28:

To determine which rule should be applied in case of a certain terminal the same algorithm can be used as the one for constructing the parsing table of an [[LL parser]].

=== Implementation in functional languages ===

Recursive descent parsers are particularly easy to implement in functional languages such as [[Haskell programming language|Haskell]]. See [http://www.cs.nott.ac.uk/~gmh/pearl.pdf Functional Pearls: Monadic Parsing in Haskell] (pdf format).

=== References ===