Semantic equivalence of covering attribute grammars

  • Gregor V. Bochmann
Article

DOI: 10.1007/BF00995501

Cite this article as:
Bochmann, G.V. International Journal of Computer and Information Sciences (1979) 8: 523. doi:10.1007/BF00995501
  • 48 Downloads

Abstract

This paper investigates some methods for proving the equivalence of different language specifications that are given in terms of attribute grammars. Different specifications of the same language may be used for different purposes, such as language definition, program verification, or language implementation. The concept of syntactic coverings is extended to the semantic part of attribute grammars. Given two attribute grammars, the paper discusses several propositions that give sufficient conditions for one attribute grammar to be semantically covered by the other one. These tools are used for a comparison of two attribute grammars that specify syntax and semantics of mixed-type expressions. This example shows a trade-off between the complexity of syntactic and semantic specifications. Another example discussed is the equivalence of different attribute grammars for the translation of the while-statement, as used in compilers for top-down and bottom-up syntax analysis.

Key words

Semantic equivalence attribute grammars equivalent semantic specifications coverings compiler correctness formal specification of semantics semantics of programming languages 

Copyright information

© Plenum Publishing Corporation 1979

Authors and Affiliations

  • Gregor V. Bochmann
    • 1
  1. 1.Département d'Informatique et de Recherche OperationnelleUniversité de MontréalMontréalCanada

Personalised recommendations