Related articles |
---|
Speed of lex generated scanners??? rtrigg@crl.com (1994-05-26) |
Re: Speed of lex generated scanners??? bazyar@netcom.com (1994-05-29) |
Re: Speed of lex generated scanners??? wgsteven@undergrad.math.uwaterloo.ca (1994-05-30) |
Re: Speed of lex generated scanners??? peter@csg.uwaterloo.ca (1994-05-30) |
Re: Speed of lex generated scanners??? michi@km21.zfe.siemens.de (1994-06-01) |
Re: Speed of lex generated scanners??? euambn@eua.ericsson.se (1994-06-06) |
Newsgroups: | comp.compilers |
From: | wgsteven@undergrad.math.uwaterloo.ca (Warren Stevens) |
Keywords: | lex, performance |
Organization: | University of Waterloo, Pure Math and C&O Club |
References: | 94-05-114 94-05-127 |
Date: | Mon, 30 May 1994 12:51:51 GMT |
[re performance of lex scanners]
You may want to look at the Cocktail compiler suite. I've seen many
papers published where the author of the tools (J. Grosch, amoung
others) discusses 'high speed lexing and parsing'. I've been playing
with them for the past couple of days, and they take *forever* to
generate the code, but once done, it's pretty fast.
Ask archie for one of: rex, lalr, ell, ag, ast, cg, estra. Rex is the
lexing tool.
Warren
--
Warren Stevens <wgstevens@undergrad.math.uwaterloo.ca>
PGP public key availible via finger. Use it.
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.