Monadic Parser Combinators Export

@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}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.340}, keywords = {combinators, haskell, monads}, number = {NOTTCS-TR-96-4}, posted-at = {2005-01-02 19:21:50}, title = {Monadic Parser Combinators}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.340}, year = {1996} }

TY - RPRT ID - citeulike:71783 L3 - citeulike-article-id:71783 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 ... IS - NOTTCS-TR-96-4 TI - Monadic Parser Combinators KW - combinators KW - haskell KW - monads AU - Hutton, Graham AU - Meijer, Erik PY - 1996/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.340 ER -