Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Lesk, E. Schmidt (1990)
Lex—a lexical analyzer generator
J. Hennessy, N. Mendelsohn (1982)
Compilation of the Pascal case statementSoftware: Practice and Experience, 12
(1987)
Tuning UNIX Lex or it's NOT true what they say about Lex
C. Fraser (1991)
A retargetable compiler for ANSI CACM SIGPLAN Notices, 26
M. Ellis, B. Stroustrup (1990)
The Annotated C++ Reference Manual
A. Sale (1981)
The implementation of case statements in PascalSoftware: Practice and Experience, 11
(1988)
flex-Man pages
Josef Grosch (1989)
Efficient generation of lexical analysersSoftware: Practice and Experience, 19
F. DeRemer, T. Pennello (1979)
Efficient computation of LALR(1) look-ahead sets
T. Pennello (1986)
Very fast LR parsing
(1988)
In ex-2.3.7.tar.Z. Available for anonymous ftp from ftp.uu
(1988)
Y-GM-A generator for lexical analyzers that programmers can use
(1993)
Received February
M. Garey, David Johnson (1979)
Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran
M. Whitney (1990)
Even faster lr parsingSoftware: Practice and Experience, 20
R. Bernstein (1985)
Producing good code for the case statementSoftware: Practice and Experience, 15
B. Stroustrup (1991)
The C++ programming language (2nd ed.)
(1991)
SIGPLAN Notices
ACM Trans. Program. Lang. Syst
David Johnson, W. Freeman
The Np-completeness Column: an Ongoing Guide Garey and Myself in Our Book ''computers and Intractability: a Guide to the Theory of Np-completeness,''
M. Harrison (1978)
Introduction to formal language theory
B. Kernighan, D. Ritchie (1978)
The C Programming Language
R. Moll, M. Arbib, A. Kfoury (1988)
An Introduction to Formal Language Theory
R. Gray, Steven Levi, V. Heuring, A. Sloane, W. Waite (1992)
Eli: a complete, flexible compiler construction systemCommun. ACM, 35
B. Stroustrup (1986)
C++ Programming LanguageIEEE Softw., 3
RE2C: A More Versatile Scanner Generator PETER BUMBULlS University and DONALD D. COWAN of Waterloo It is usually claimed that lexical analysis routines are still coded by hand, despite the widespread availability of scanner generators, for efficiency reasons. While efficiency is a consideration, there exist freely available scanner generators such as GLA [Gray 19881 that can generate scanners that are faster than most hand-coded ones. However, most generated scanners are tailored for a particular environment, and retargeting these scanners to other environments, if possible, is usually complex enough to make a hand-coded scanner more appealing, In this paper we describe RE2C, a scanner generator that not only generates scanners that are faster (and usually smaller) than those produced by any other scanner generator known to the authors, including GLA, but that also adapt easily to any environment. Categories and Subject Descriptors: D.3.2 [Programming Languages]: Language Classitlcations specialized application languages; D.3.4 [Programming Languages]: Processors General Additional Terms: Algorithms, Languages, Performance analysis, scanner generator Key Words and Phrases: Lexical 1. INTRODUCTION Lexical analysis routines are still often coded by hand despite the widespread availability of scanner generators. have a scanner generator installed 1988]), few UNIX applications For example, while most
ACM Letters on Programming Languages and Systems (LOPLAS) – Association for Computing Machinery
Published: Mar 1, 1993
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.