Combinator parsers: From toys to tools

@misc{citeulike:1793891, abstract = {We develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left recursive. Extensive use is made of lazy evaluation, and the parsers constructed \"analyze themselves\". Our new combinators may be used for the construction of large parsers to be used in compilers in practical use. Categories and Subject Descriptors D.1.1 [Programming techniques]: Applicative (functional)...}, author = {Swierstra, S. }, citeulike-article-id = {1793891}, keywords = {combinators, parsers}, posted-at = {2007-10-20 16:23:24}, priority = {2}, title = {Combinator parsers: From toys to tools}, url = {http://citeseer.ist.psu.edu/363886.html}, year = {2001} }

TY - GEN ID - citeulike:1793891 L3 - citeulike-article-id:1793891 TI - Combinator parsers: From toys to tools N2 - We develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left recursive. Extensive use is made of lazy evaluation, and the parsers constructed "analyze themselves". Our new combinators may be used for the construction of large parsers to be used in compilers in practical use. Categories and Subject Descriptors D.1.1 [Programming techniques]: Applicative (functional)... KW - combinators KW - parsers AU - Swierstra, S PY - 2001/// UR - http://citeseer.ist.psu.edu/363886.html ER -