Recursive Descent Parser - Implementation in Functional Languages

Implementation in Functional Languages

Recursive descent parsers are particularly easy to implement in functional languages such as Haskell, Lisp or ML as they tend to be better suited for recursion in general.

See Functional Pearls: Monadic Parsing in Haskell

Read more about this topic:  Recursive Descent Parser

Famous quotes containing the words functional and/or languages:

    Stay-at-home mothers, . . . their self-esteem constantly assaulted, . . . are ever more fervently concerned that their offspring turn out better so they won’t have to stoop to say “I told you so.” Working mothers, . . . their self-esteem corroded by guilt, . . . are praying their kids turn out functional so they can stop being defensive and apologetic and instead assert “See? I did do it all.”
    Melinda M. Marshall (20th century)

    No doubt, to a man of sense, travel offers advantages. As many languages as he has, as many friends, as many arts and trades, so many times is he a man. A foreign country is a point of comparison, wherefrom to judge his own.
    Ralph Waldo Emerson (1803–1882)