Generator of Lexical Analyzers now available

As mentioned about a month ago, our group working on compiler tools
built a generator for lexical analyzers (GLA). GLA produces C code
which scans tokens about 5 times faster than LEX. The concepts are
explained in W. Waite's article "The Cost of Lexical Analysis",
Software Practice & Experience #16 (1986). The tool works smoothly
with YACC. We believe GLA's specification of basic symbols is much
clearer than an equivalent specification for LEX. Furthermore, we
provide modules for handling identifiers, keywords, numeric denotations,
strings and error handling. The software is available for a nominal fee.


For more details send your Snail Mail address to maejean and request
tech report (SEG 86-1-1), "GLA - A Generator for Lexical Analyzers".


maejean@boulder.csnet maejean@csnet-relay.arpa
{seismo!hao, decvax!sunybcs, ucbvax!nbires}!boulder!maejean
Mae Jean Ruehlman; Dept of Electrical and Computer Engineering;
University or Colorado; Boulder, CO 80309-0425.


-bob gray
--
Send compiers mail to ima!compilers or, in a pinch to Levine@YALE.EDU
Plausible paths are { ihnp4 | decvax | cbosgd | harvard | yale | bbncca}!ima
Send meta-mail to ima!compilers-requests

Return to the comp.compilers page.
Search the comp.compilers archives again.