(Enter summary)
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... (Update)
Context of citations to this paper: More
...g process. Finq ly we have in cluded basic parsers for rank s of symbols, thus maki n the combi ors also quite usable for describi lexers [2]. By de finn additionk combin ators that exten d the basic machin ery we may deal with ambiguous grammars too. As an example confi der a...
...process. Finally we have included basic parsers for ranges of symbols, thus making the combinators also quite usable for describing lexers [2]. By defining additional combinators that extend the basic machinery we may deal with ambiguous grammars too. As an example consider a...
Cited by: More
Mimico: A Monadic Combinator Compiler Generator - Camarao, Figueiredo (2001)
(Correct)
C -> HASKELL, or Yet Another Interfacing Tool - Chakravarty
(Correct)
Combinator Parsers: From Toys to Tools - Swierstra (2001)
(Correct)
Active bibliography (related documents): More All
0.5: HASDF: A Generalized LR-parser generator for Haskell - de Jonge, Kuipers, Visser (1999)
(Correct)
0.5: Generic Attribute Grammars - Saraiva, Swierstra (1999)
(Correct)
0.2: Development and Verification of Parallel Algorithms in the.. - Lisper, Holmerin (2000)
(Correct)
Similar documents based on text: More All
0.4: Parsec: A practical parser library - Leijen, Meijer (2001)
(Correct)
0.3: Under consideration for publication in J. Functional.. - Parallel Parsing..
(Correct)
0.2: Take: A Distributed Testing Harness in Haskell (Application.. - Chakravarty
(Correct)
Related documents from co-citation: More All
2: error-correcting combinator parsers (context) - Swierstra, Duponcheel - 1996
2: Recursvie Programming Techniques (context) - Burge - 1975
BibTeX entry: (Update)
M.M.T.Chakravarty.Lazylexin gisfast.In A. Middeldorp a n T. Sato, editors, Fourth Fu ji http://citeseer.ist.psu.edu/chakravarty99lazy.html More
@inproceedings{ chakravarty99lazy,
author = "Manuel M. T. Chakravarty",
title = "Lazy Lexing is Fast",
booktitle = "Fuji International Symposium on Functional and Logic Programming",
pages = "68-84",
year = "1999",
url = "citeseer.ist.psu.edu/chakravarty99lazy.html" }
Citations (may not include all citations):
1399
Compilers --- Principles (context) - Aho, Sethi et al. - 1986
65
Higher-order functions for parsing
- Hutton - 1992
28
A lexical analyzer generator for Standard ML (context) - Appel, Mattson et al. - 1994
20
error-correcting combinator parsers (context) - Swierstra, Duponcheel - 1996
19
Monadic parsing in Haskell
- Hutton, Meijer - 1998
17
Waite and Gerhard Goos (context) - William - 1985
4
Massachussets Institute of Technology (context) - Nikhil, James et al. - 1995
2
ML-Yacc user's manual (context) - Tarditi, Appel - 1994
2
Happy user guide (context) - Marlow - 1997
Documents on the same site (http://www.cse.unsw.edu.au/~chak/papers/): More
Flattening Trees - Keller, Chakravarty (1998)
(Correct)
How Portable is Nested Data Parallelism? - Chakravarty, Keller (1999)
(Correct)
Enlarging the Scope of Vector-Based Computations.. - Au, Chakravarty.. (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC