DocumentCode
2176095
Title
Parsing for structural editors
Author
Wegman, Mark
fYear
1980
fDate
13-15 Oct. 1980
Firstpage
320
Lastpage
327
Abstract
We present techniques that enable the construction of an algorithm capable of re-parsing a string after another string has been inserted into it. Let M be the minimal, under certain restrictions, number of changes which must be made to the parse tree to reflect the insertions. Then the algorithm we present should work in no more time than M times a log factor of the height of the parse tree. The grammars we allow include all LR(1) grammars.
Keywords
Data structures; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1980., 21st Annual Symposium on
Conference_Location
Syracuse, NY, USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1980.33
Filename
4567833
Link To Document