MATCHING-BASED INCREMENTAL EVALUATORS FOR HIERARCHICAL ATTRIBUTE GRAMMAR DIALECTS

Authors
Citation
A. Carle et L. Pollock, MATCHING-BASED INCREMENTAL EVALUATORS FOR HIERARCHICAL ATTRIBUTE GRAMMAR DIALECTS, ACM transactions on programming languages and systems, 17(2), 1995, pp. 394-429
Citations number
20
Categorie Soggetti
Computer Sciences","Computer Science Software Graphycs Programming
ISSN journal
01640925
Volume
17
Issue
2
Year of publication
1995
Pages
394 - 429
Database
ISI
SICI code
0164-0925(1995)17:2<394:MIEFHA>2.0.ZU;2-3
Abstract
Although attribute grammars have been very effective for defining indi vidual modules of language translators, they have been rather ineffect ive for specifying large program-transformational systems. Recently, s everal new attribute grammar ''dialects'' have been developed that sup port the modular specification of these systems by allowing modules, e ach described by an attribute grammar, to be composed to form a comple te system. Acceptance of these new hierarchical attribute grammar dial ects requires the availability of efficient batch and incremental eval uators for hierarchical specifications. This paper addresses the probl em of developing efficient incremental evaluators for hierarchical spe cifications. A matching-based approach is taken in order to exploit ex isting optimal change propagation algorithms for nonhierarchical attri bute grammars. A sequence of four new matching algorithms is presented , each increasing the number of previously computed attribute values t hat are made available for reuse during the incremental update.