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: | michi@km21.zfe.siemens.de (Michael Klug) |
Keywords: | lex, performance |
Organization: | Siemens AG, Munich |
References: | 94-05-114 94-05-133 |
Date: | Wed, 1 Jun 1994 13:24:56 GMT |
> You may want to look at the Cocktail compiler suite.
> Ask archie for one of: rex, lalr, ell, ag, ast, cg, estra. Rex is the
> lexing tool
rex is not only much, much faster than lex, rex provides everything which
lex just promises. Just try to build a lexer with a lookahead, a complete
structured token (not only a single character). lex's generator tables
will explode. Josef Grosch developed the technique called tunnel automaton
which is used in rex. There are several papers about this technique.
-Mike
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.