Lazy Functional Parser Combinators in Java Export

@misc{citeulike:169580, abstract = {A parser is a program that checks if a text is a sentence of the language as described by a gramar traditionally, the program text of a parser is generated from a gramar description, after which it is compiled and subsequently run. The language accepted by such a parser is, by the nature of this process, hard coded in the program. Another approach, primarily taken in the context of functional languages, allows parsers to be constructed at run time, thus dynamically creating parsers by combining ...}, author = {Dijkstra, Atze and Swierstra, Doaitse S.}, citeulike-article-id = {169580}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.1452}, keywords = {combinators, java}, posted-at = {2005-04-24 18:25:28}, priority = {2}, title = {Lazy Functional Parser Combinators in Java}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.1452} }

TY - GEN ID - citeulike:169580 L3 - citeulike-article-id:169580 N2 - A parser is a program that checks if a text is a sentence of the language as described by a gramar traditionally, the program text of a parser is generated from a gramar description, after which it is compiled and subsequently run. The language accepted by such a parser is, by the nature of this process, hard coded in the program. Another approach, primarily taken in the context of functional languages, allows parsers to be constructed at run time, thus dynamically creating parsers by combining ... TI - Lazy Functional Parser Combinators in Java KW - combinators KW - java AU - Dijkstra, Atze AU - Swierstra, Doaitse UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.1452 ER -