Implementing attribute grammars by computational models
We describe the implementation of attribute grammars with the knowledge-based system NUT. NUT uses intuitionistic propositional calculus for automatic synthesis of programs . Penjam  discussed the connection between two formalisms — computational models, used in NUT system, and attribute grammars. We have developed this relation further. The system we are presenting is the extension of NUT and it allows automatic transformation from AG-representation to equivalent computational model (we call that the language model). NUT can then be used for automatic synthesis of tree-decoration algorithms for both — dynamic and static tree evaluation. For latter the algorithm synthesised is the multi-visit tree decoration algorithm.
- 1.Engelfriet, J. and Filé, G.: Passes, Sweeps and Visits in Attribute Grammars. Journal of the ACM. Vol 36, No. 4. Oct. 1989 841–869.Google Scholar
- 2.Mints, G.: Propositional Logic Programming. Machine Intelligence. 12:17–38, 1991. Oxford University Press.Google Scholar
- 3.Penjam, J.: Computational and Attribute Models of Formal Languages. Theoretical Computer Science. 71 (1990) 241–264.Google Scholar
- 4.Tyugu, E.: Knowledge Based Programming. Turing Institute Press, Addison Wesley, Glasgow, 1987.Google Scholar
- 5.Tyugu, E.: Modularity of Knowledge. Machine Intelligence. 12:3–16, 1991. Oxford University Press.Google Scholar
- 6.Vilo, J.: Attribute Grammars and Computational Models as Combined Language Development Tools. CS-43/92. Institute of Cybernetics, Tallinn 1992.Google Scholar