Implementing an embedded compiler using program transformation rules. (6th September 2013)

• Record Type: Journal Article
• Authors: Bissyandé, Tegawendé F.; Réveillère, Laurent; Lawall, Julia L.; Bromberg, Yérom‐David ; Muller, Gilles
• Is Part Of: Software, practice & experience. Volume 45:Number 2(2015)
• Page Start: 177
• Page End: 196
• Publication Date: 2013-09-06
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2225
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2225-abs-0001"> <title>SUMMARY</title> <p>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 checks of domain‐specific properties. The compiler of a DSL, however, is often difficult to develop and maintain, because of 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 using control‐flow sensitive concrete‐syntax based matching rules. These rules either collect information about the source code to carry out checks 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 it is beneficial to implement the core of its compiler in this manner.Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>