|Need References on Incremental Parsing and Compiling firstname.lastname@example.org (Sanjeev Y. Dharap) (1990-02-06)|
|Re: Need References on Incremental Parsing and Compiling email@example.com (1990-02-07)|
|Date:||Wed, 7 Feb 90 10:33:59 +0100|
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
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
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
%T Incremental generation of parsers
%B Proceedings of the SIGPLAN'89 Conference on Programming Language
Design and Implementation
%S SIGPLAN Notices
Jan Rekers (firstname.lastname@example.org)
Return to the
Search the comp.compilers archives again.