%0 Journal Article %1 Kastens94 %A Kastens, Uwe %A Waite, William M. %D 1994 %J Acta Informatica %K imported %P 601--627 %T Modularity and Reusability in Attribute Grammars %V 31 %X 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.

@article{Kastens94, 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.}, added-at = {2009-05-10T18:36:57.000+0200}, author = {Kastens, Uwe and Waite, William M.}, biburl = {https://www.bibsonomy.org/bibtex/283fdf258c970be791b9ec654a6b996b2/dparigot}, description = {Attribute Grammar}, interhash = {29e203a1e81ee16574e419b84931d84d}, intrahash = {83fdf258c970be791b9ec654a6b996b2}, journal = {Acta Informatica}, keywords = {imported}, pages = {601--627}, timestamp = {2009-05-10T18:37:03.000+0200}, title = {Modularity and {R}eusability in {A}ttribute {G}rammars}, volume = 31, year = 1994 }