%META:TOPICINFO{author="BrynKeller" date="1051296242" format="1.0" version="1.1"}% %META:TOPICPARENT{name="NiceDoc"}% Parser combinators are a functional approach to parsing that uses a combination of functions to define the grammar. Some (like me) find that this leads to a pleasantly natural expression of the parser. Also, it means you can write your parser entirely in the host language (Nice, e.g.) rather than having to learn a new, specialized language for your parser generator.

Haskell examples:

• Parsec
• UU_Parsing

-- BrynKeller - 25 Apr 2003