Issue No. 03 - March (1993 vol. 19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.221136
<p>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).</p>
incremental attribute evaluation; multiple asynchronous subtree replacements; arbitrary noncircular attribute grammars; multiple independent editing cursors; disjoint regions; derivation tree; complexity; open problems; attribute grammars; computational complexity; text editing; tree data structures; trees (mathematics)
J. Micallef and G. Kaiser, "Support Algorithms for Incremental Attribute Evaluation of Asynchronous Subtree Replacements," in IEEE Transactions on Software Engineering, vol. 19, no. , pp. 231-252, 1993.