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:

    In short, the building becomes a theatrical demonstration of its functional ideal. In this romanticism, High-Tech architecture is, of course, no different in spirit—if totally different in form—from all the romantic architecture of the past.
    Dan Cruickshank (b. 1949)

    People in places many of us never heard of, whose names we can’t pronounce or even spell, are speaking up for themselves. They speak in languages we once classified as “exotic” but whose mastery is now essential for our diplomats and businessmen. But what they say is very much the same the world over. They want a decent standard of living. They want human dignity and a voice in their own futures. They want their children to grow up strong and healthy and free.
    Hubert H. Humphrey (1911–1978)