Less is more: unparser-completeness of metalanguages for template engines

  • Authors:

  • B. J. Arnoldus;M. G.J. van den Brand;A. Serebrenik

  • Affiliations:

  • Eindhoven University of Technology, Eindhoven, Netherlands;Eindhoven University of Technology, Eindhoven, Netherlands;Eindhoven University of Technology, Eindhoven, Netherlands

  • Venue:
  • Proceedings of the 10th ACM international conference on Generative programming and component engineering
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A code generator is a program translating an input model into code. In this paper we focus on template-based code generators in the context of the model view controller architecture (MVC). The language in which the code generator is written is known as a metalanguage in the code generation parlance. The metalanguage should be, on the one side, expressive enough to be of practical value, and, on the other side, restricted enough to enforce the separation between the view and the model, according to the MVC. In this paper we advocate the notion of unparser-complete metalanguages as providing the right level of expressivity. An unparser-complete metalanguage is capable of expressing an unparser, a code generator that translates any legal abstract syntax tree into an equivalent sentence of the corresponding context-free language. A metalanguage not able to express an unparser will fail to produce all sentences belonging to the corresponding context-free language. A metalanguage able to express more than an unparser will also be able to implement code violating the model/view separation. We further show that a metalanguage with the power of a linear deterministic tree-to-string transducer is unparser-complete. Moreover, this metalanguage has been successfully applied in a non-trivial case study where an existing code generator is refactored using templates.