A monadic combinator compiler compiler Export

@misc{citeulike:71782, abstract = {This article describes a novel approach to compiler generation, based on monadic combinators. A prototype of a compiler generator, called M'imico, is described, that handles infinite look-ahead and left recursive context free grammars, and dyadic infix operator precedence and associativity. Novel ideas and the general principle from which this work has been based are presented, as well as limitations of M'imico and a comparison with related work. 1}, author = {Camarao, C. and Figueiredo, L.}, citeulike-article-id = {71782}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.8671}, keywords = {combinators, compilers, for-matt, haskell, monads}, posted-at = {2005-01-02 19:21:18}, title = {A monadic combinator compiler compiler}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.8671}, year = {2001} }

TY - GEN ID - citeulike:71782 L3 - citeulike-article-id:71782 N2 - This article describes a novel approach to compiler generation, based on monadic combinators. A prototype of a compiler generator, called M'imico, is described, that handles infinite look-ahead and left recursive context free grammars, and dyadic infix operator precedence and associativity. Novel ideas and the general principle from which this work has been based are presented, as well as limitations of M'imico and a comparison with related work. 1 TI - A monadic combinator compiler compiler KW - combinators KW - compilers KW - for-matt KW - haskell KW - monads AU - Camarao, C AU - Figueiredo, L PY - 2001/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.8671 ER -