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:

    Indigenous to Minnesota, and almost completely ignored by its people, are the stark, unornamented, functional clusters of concrete—Minnesota’s grain elevators. These may be said to express unconsciously all the principles of modernism, being built for use only, with little regard for the tenets of esthetic design.
    —Federal Writers’ Project Of The Wor, U.S. public relief program (1935-1943)

    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)