Lazy Lexing is Fast Export

@inproceedings{citeulike:3033309, abstract = {This paper introduces a set of combinators for building lexical analysers in a lazy functional language. During lexical analysis, the combinators generate a deterministic, table-driven analyser on the fly. Consequently, the presented method combines the efficiency of off-line scanner generators with the flexibility of the combinator approach. The method makes essential use of the lazy semantics of the implementation language Haskell. Finally, the paper discusses benchmarks of a scanner...}, author = {Chakravarty, Manuel M. T.}, booktitle = {Fuji International Symposium on Functional and Logic Programming}, citeulike-article-id = {3033309}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.5166}, keywords = {lazy-evaluation, lexing}, pages = {68--84}, posted-at = {2008-07-22 18:46:56}, priority = {2}, title = {Lazy Lexing is Fast}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.5166}, year = {1999} }

TY - CONF ID - citeulike:3033309 L3 - citeulike-article-id:3033309 N2 - This paper introduces a set of combinators for building lexical analysers in a lazy functional language. During lexical analysis, the combinators generate a deterministic, table-driven analyser on the fly. Consequently, the presented method combines the efficiency of off-line scanner generators with the flexibility of the combinator approach. The method makes essential use of the lazy semantics of the implementation language Haskell. Finally, the paper discusses benchmarks of a scanner... EP - 84 TI - Lazy Lexing is Fast T2 - Fuji International Symposium on Functional and Logic Programming SP - 68 KW - lazy-evaluation KW - lexing AU - Chakravarty, Manuel PY - 1999/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.5166 ER -