This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
RE: Very Fast: Directly Coded Lexical Analyzer
- From: "Dave Korn" <dave dot korn at artimi dot com>
- To: "'Robert Dewar'" <dewar at adacore dot com>
- Cc: <gcc at gcc dot gnu dot org>
- Date: Fri, 10 Aug 2007 12:58:13 +0100
- Subject: RE: Very Fast: Directly Coded Lexical Analyzer
- References: <998d0e4a0705311334w7eba684cwcfe1ed70c4b63add@mail.gmail.com> <20070601072828.236560@gmx.net> <200706011226.49596.RonnyPeine@gmx.de> <46BC50BE.3090800@adacore.com>
On 10 August 2007 12:49, Robert Dewar wrote:
On 01 June 2007 11:27, Ronny Peine wrote:
>> Hi,
>>
>> my questions is, why not use the element construction algorithm?
> To me, very fast (millions of lines a second) lexical analyzers are
> trivial to write by hand,
I think you need one to lex the dates in the old back-dated emails in your
mailbox for you! :-)
cheers,
DaveK
--
Can't think of a witty .sigline today....