Tree transformation techniques and experiences

  • Authors:
  • S. E. Keller;J. A. Perkins;T. F. Payton;S. P. Mardinly

  • Affiliations:
  • SDC, A Burroughs Company, R&D, Paoli, Pa.;SDC, A Burroughs Company, R&D, Paoli, Pa.;SDC, A Burroughs Company, R&D, Paoli, Pa.;SDC, A Burroughs Company, R&D, Paoli, Pa.

  • Venue:
  • SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

A formal description technique for describing transformations from one well-defined language to another is introduced. A TT-grammar contains context-free grammars for describing the syntax of both languages. The transformation between the languages is described by a relationship of productions from the grammars. The TT-grammar is supported by an automated tool. SSAGS -- a translator writing system based on attribute grammars -- has been extended to support certain classes of TT-grammars. SSAGS analyzes TT-grammars and automatically generates Ada source programs implementing the transformation specified by the TT-grammar. Experience with two different restricted forms of TT-grammars is described with respect to their practical application. The experience demonstrates the readability, ease of development, and additional verification available through the use of TT-grammars.