|Incremental lexer implementation email@example.com (2002-02-28)|
|Re: Incremental lexer implementation firstname.lastname@example.org (Ira D. Baxter) (2002-03-09)|
|Re: Incremental lexer implementation maratb@CS.Berkeley.EDU (Marat Boshernitsan) (2002-03-09)|
|Re: Incremental lexer implementation email@example.com (Ira D. Baxter) (2002-03-11)|
|From:||Marat Boshernitsan <maratb@CS.Berkeley.EDU>|
|Date:||9 Mar 2002 02:50:58 -0500|
|Posted-Date:||09 Mar 2002 02:50:58 EST|
On Wed, 2002-02-27 at 21:16, gcc_learner wrote:
> In his Ph.D. thesis, Tim Wagner descibres an incremental lexer by
> driving a batch lexer. Has anybody published an implementation of the
> algorithms Wagner decribes?
We use Tim Wagner's implementation of the incremental lexing algorithm
in the Harmonia framework (http://www.cs.berkeley.edu/~harmonia),
which is a successor to the system that Tim was working on. The
source code for Harmonia is not publically available, yet.
I also reimplemented his incremental lexing alogrithm in Java for the
CodeProcessor program editor (
implementation was directly based on the algorithms Tim describes in
his thesis, though the underlying data structures were somewhat
Tim Wagner's algorithm also appears to be finding its way into the
editor of NetBeans Java IDE.
(http://www.netbeans.org/source/browse/editor/www/doc/Proposals/Lexer/Proposal.html?rev=1.4&content-type=text/html). I do not know much about that implementation.
Return to the
Search the comp.compilers archives again.