Support algorithms for incremental attribute evaluation of asynchronous subtree replacements

A solution to the problem of incremental attribute evaluation for multiple asynchronous subtree replacements that is applicable to arbitrary noncircular attribute grammars is discussed. The algorithm supports multiple independent editing cursors. Concurrent evaluation processes proceed independently...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering 1993-03, Vol.19 (3), p.231-252
Main Authors: Micallef, J., Kaiser, G.E.
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Asynchronous
Collaboration
Collaborative work
Computer languages
Computer programming
Computer science
control theory
systems
Computer supported cooperative work
Editors
Error correction
Exact sciences and technology
Grammar
Graphs
Law
Legal factors
Programmers
Programming languages
Programming profession
Programming theory
Software engineering
Studies
Sun
Telecommunication computing
Text editing
Theoretical computing
User interface
User interfaces
Writing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A solution to the problem of incremental attribute evaluation for multiple asynchronous subtree replacements that is applicable to arbitrary noncircular attribute grammars is discussed. The algorithm supports multiple independent editing cursors. Concurrent evaluation processes proceed independently as long as they cover disjoint regions of the derivation tree. Evaluation processes are merged when they overlap, to prevent unnecessary attribute evaluations. The complexity of these three parts of the algorithm is discussed. The algorithm ensures that when evaluation terminates, the tree is consistently attributed. The results solve two open problems that arose in connection with the original algorithm for asynchronous subtree replacements reported by S.M. Kaplan and G.F. Kaiser (1986).< >
ISSN:0098-5589
1939-3520
DOI:10.1109/32.221136