Path: utzoo!attcan!uunet!husc6!spdcc!esegue!compilers-sender
From: rekers@cwi.nl
Newsgroups: comp.compilers
Subject: Re: Need References on Incremental Parsing and Compiling
Message-ID: <1990Feb7.175458.25985@esegue.segue.boston.ma.us>
Date: 7 Feb 90 17:54:58 GMT
Sender: compilers-sender@esegue.segue.boston.ma.us
Reply-To: rekers@cwi.nl
Organization: Compilers Central
Lines: 37
Approved: compilers@esegue.segue.boston.ma.us

I read the request for information on incremental parsers and generating
parsers for structure editors.

I have written an article about a parser/parser generator system with the
following cappabilities:
o The parser can handle general context-free grammars. This makes it easy
  to make it a multiple-entry parser, needed in structure editors.
o The parser is generated by need.
o On a modification of the grammar, the existing parser is incrementally
  updated.
o Parsing and parser generation is fast.

The parsing algorithm used is Tomita's algorithm, the LR tables needed by this
algorithm are generated by an incremental parser generator develloped by us.

You can find the article in the SIGPLAN '89 Conference proceedings:

%A J. Heering
%A P. Klint
%A J. Rekers
%Z Heering-Klint-Rekers--
%T Incremental generation of parsers
%P 179-191
%B Proceedings of the SIGPLAN'89 Conference on Programming Language
Design and Implementation
%S SIGPLAN Notices
%V 24
%N 7
%I ACM
%D 1989

Kind regards,
					Jan Rekers (rekers@cwi.nl)
-- 
Send compilers articles to compilers@esegue.segue.boston.ma.us
{spdcc | ima | lotus}!esegue.  Meta-mail to compilers-request@esegue.
Please send responses to the author of the message, not the poster.