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)

    “The less sophisticated of my forbears avoided foreigners at all costs, for the very good reason that, in their circles, speaking in tongues was commonly a prelude to snake handling. The more tolerant among us regarded foreign languages as a kind of speech impediment that could be overcome by willpower.”
    —Barbara Ehrenreich (b. 1941)