Re: Incremental lexer implementation

Marat Boshernitsan <maratb@CS.Berkeley.EDU>
9 Mar 2002 02:50:58 -0500

          From comp.compilers
Related articles
Incremental lexer implementation chenderson@iname.com (2002-02-28)
Re: Incremental lexer implementation idbaxter@semdesigns.com (Ira D. Baxter) (2002-03-09)
Re: Incremental lexer implementation maratb@CS.Berkeley.EDU (Marat Boshernitsan) (2002-03-09)
Re: Incremental lexer implementation idbaxter@semdesigns.com (Ira D. Baxter) (2002-03-11)
| List of all articles for this month |
From: Marat Boshernitsan <maratb@CS.Berkeley.EDU>
Newsgroups: comp.compilers
Date: 9 Mar 2002 02:50:58 -0500
Organization: Compilers Central
Keywords: lex, incremental
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 (
http://research.sun.com/people/mlvdv/COM.Sun.Labs.Forest.doc.coset_2000.abs.html). That
implementation was directly based on the algorithms Tim describes in
his thesis, though the underlying data structures were somewhat
different.


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.


Marat.

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.