Abstract
An attribute grammar is a declarative specification of dependence
among computations carried out at the nodes of a tree. Attribute
grammars have proven remarkably difficult to decompose into logical
fragments. As a result, they have not yet been accepted as a viable
specification technique. By combining the ideas of remote attribute
access and inheritance, we have been able to define ``attribution
modules'' that can be reused in a variety of applications. As an
example, we show how to define reusable modules for name analysis
that embody different scope rules.
Users
Please
log in to take part in the discussion (add own reviews or comments).