Syntax and semantics of a high-level intermediate representation for ASF+SDF
Jan Aldert Bergstra, Mark van den Brand · Data Archiving and Networked Services (DANS) · 2000
Developing a compiler for Asf+Sdf has been a challenging task. The compilation of Asf+Sdf is performed using an intermediate language asf, an abstract syntax representation of Asf+Sdf. Although Asf+Sdf is quite simple to use, it provides a number of features which have an unclear semantics. By means of a number of examples in asf and a more mathematical notation a number of these semantic issues are claried. These examples are helpful for both the compiler designer and the specication writer. 1998 ACM Computing Classication System: D.3.1, D.3.2, F.4.2 Keywords and Phrases: rewriting system compiler, language denition, semantics denition language Note: Work carried out under project SEN1.4, ASF+SDF 1. Introduction Since its denition in [BHK89] developing a compiler for Asf and Asf+Sdf [DHK96, HHKR89] has been a challenging task. Several methods to obtain fast interpreters and/or compilers have been investigated. We mention [Dik89, Hen91, Wal91, KW93, Moo94, Kam96, FKW98]. W...