Implementing an Embedded Compiler using Program Transformation RulesReport as inadecuate




Implementing an Embedded Compiler using Program Transformation Rules - Download this document for free, or read online. Document in PDF available to download.

1 SnT - Interdisciplinary Centre for Security, Reliability and Trust Luxembourg 2 LaBRI - Laboratoire Bordelais de Recherche en Informatique 3 Regal - Large-Scale Distributed Systems and Applications LIP6 - Laboratoire d-Informatique de Paris 6, Inria Paris-Rocquencourt

Abstract : Domain-specific languages DSLs are well-recognized to ease programming and improve robustness for a specific domain, by providing high-level domain-specific notations and verifications of domain-specific properties. The compiler of a DSL, however, is often difficult to develop and maintain, due to the need to define a specific treatment for a large and potentially increasing number of language constructs. To address this issue, we propose an approach for specifying a DSL compiler and verifier using control-flow sensitive concrete-syntax based matching rules. These rules either collect information about the source code to carry out verifications or perform transformations to carry out compilation. Because rules only mention the relevant constructs, using their concrete syntax, and hide the complexity of control-flow graph traversal, it is easy to understand the purpose of each rule. Furthermore, new compilation steps can be added using only a small number of lines of code. We explore this approach in the context of the z2z DSL for network gateway development, and show that the core of its compiler and verifier can be implemented in this manner.

Keywords : program transformation embedded compilers embedded languages internal languages compiler construction DSL





Author: Tegawendé F. Bissyandé - Laurent Réveillère - Julia Lawall - Yérom-David Bromberg - Gilles Muller -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents