Monadic Parser Combinators

@techreport{citeulike:71783, abstract = {In functional programming, a popular approach to building recursive descent parsers is to model parsers as functions, and to define higher-order functions (or combinators) that implement grammar constructions such as sequencing, choice, and repetition. Such parsers form an instance of a monad , an algebraic structure from mathematics that has proved useful for addressing a number of computational problems. The purpose of this article is to provide a step-by-step tutorial on the monadic approach ...}, author = {Hutton, Graham and Meijer, Erik }, citeulike-article-id = {71783}, keywords = {combinators, haskell, parsing}, number = {NOTTCS-TR-96-4}, posted-at = {2006-05-02 20:12:45}, priority = {2}, title = {Monadic Parser Combinators}, url = {http://citeseer.ist.psu.edu/50754.html}, year = {1996} }

TY - RPRT ID - citeulike:71783 L3 - citeulike-article-id:71783 TI - Monadic Parser Combinators IS - NOTTCS-TR-96-4 N2 - In functional programming, a popular approach to building recursive descent parsers is to model parsers as functions, and to define higher-order functions (or combinators) that implement grammar constructions such as sequencing, choice, and repetition. Such parsers form an instance of a monad , an algebraic structure from mathematics that has proved useful for addressing a number of computational problems. The purpose of this article is to provide a step-by-step tutorial on the monadic approach ... KW - combinators KW - haskell KW - parsing AU - Hutton, Graham AU - Meijer, Erik PY - 1996/// UR - http://citeseer.ist.psu.edu/50754.html ER -