This is the mail archive of the gcc@gcc.gnu.org mailing list for the GCC project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: Very Fast: Directly Coded Lexical Analyzer

From: Ronny Peine <RonnyPeine at gmx dot de>
To: gcc at gcc dot gnu dot org
Date: Fri, 1 Jun 2007 12:26:45 +0200
Subject: Re: Very Fast: Directly Coded Lexical Analyzer
References: <998d0e4a0705311334w7eba684cwcfe1ed70c4b63add@mail.gmail.com> <20070601072828.236560@gmx.net>

Hi,

my questions is, why not use the element construction algorithm? The Thomson 
Algorithm creates an epsilon-NFA which needs quite a lot of memory. The 
element construction creates an NFA directly and therefor has fewer states. 
Well, this is only interesting in the scanner creation which is not so 
important than the scanner itself, but it can reduce the memory footprint of 
generator. It's a pity i can't find a url for the algorithmdescription, maybe 
i even have the wrong naming of it. I have only read it in script Compiler 
Construction at the University.

cu,
Ronny

Attachment: pgp00000.pgp
Description: PGP signature

References:
- Re: Very Fast: Directly Coded Lexical Analyzer
  - From: Frank Schaefer

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]