Higher-order Functions for Parsing Export

@article{hutton2008higher, abstract = {In combinator parsing, the text of parsers resembles BNF notation. We present the basic method, and a number of extensions. We address the special problems presented by white– space, and parsers with separate lexical and syntactic phases. In particular, a combining form for handling the ” offside rule” is given. Other extensions to the basic method include an ” into” combining form with many useful applications, and a simple means by which combinator parsers can produce more informative error messages.}, author = {Hutton, G.}, citeulike-article-id = {5219115}, journal = {Journal of Functional Programming}, keywords = {fp, miranda, monad, parsing, rating-4}, number = {03}, pages = {323--343}, posted-at = {2009-07-21 14:56:17}, priority = {0}, publisher = {Cambridge Univ Press}, title = {{Higher-order Functions for Parsing}}, volume = {2}, year = {1992} }

TY - JOUR ID - hutton2008higher L3 - citeulike-article-id:5219115 N2 - In combinator parsing, the text of parsers resembles BNF notation. We present the basic method, and a number of extensions. We address the special problems presented by white– space, and parsers with separate lexical and syntactic phases. In particular, a combining form for handling the “offside rule” is given. Other extensions to the basic method include an “into” combining form with many useful applications, and a simple means by which combinator parsers can produce more informative error messages. IS - 03 JF - Journal of Functional Programming EP - 343 TI - {Higher-order Functions for Parsing} PB - Cambridge Univ Press VL - 2 SP - 323 KW - fp KW - miranda KW - monad KW - parsing KW - rating-4 AU - Hutton, G PY - 1992/// ER -