Some data types are so simple that they tend to be reimplemented over and over again. This is certainly true for terms, tree-like data structures that can represent prefix formulae, syntax …
In meta programming with concrete object syntax, object-level programs are composed from fragments written in concrete syntax. The use of small program fragments in such quotations …
This unique guide book explains and teaches the concept of trustworthy compilers based on 50+ years of worldwide experience in the area of compilers, and on the author's own 30+ …
Extending a language by embedding within it another language presents significant parsing challenges, especially if the embedding is recursive. The composite grammar is likely to be …
Before consuming this manuscript the reader should know that I owe gratitude to many people. First of all, it is a family accomplishment. I want to thank my mother, Annelies, for …
MGJ Van Den Brand, P Klint - … (CWI), URL: http://www. cwi. nl …, 2005 - researchgate.net
ASF+SDF Meta-Environment User Manual Revision : 1.149 Page 1 ASF+SDF Meta-Environment User Manual Revision : 1.149 MGJ van den Brand and P. Klint Centrum voor Wiskunde en …
Modular grammatical formalisms provide an essential step towards improved grammar engineering practices. However, as we depart from traditional deterministic models, some …
RL Akers, ID Baxter, M Mehlich, BJ Ellis… - Information and Software …, 2007 - Elsevier
Automated program transformation holds promise for a variety of software life cycle endeavors, particularly where the size of legacy systems makes manual code analysis, re …
A Stevenson, JR Cordy - Science of Computer Programming, 2015 - Elsevier
We propose an enhancement to current parsing and transformation systems by leveraging the expressive power of Boolean grammars, a generalization of context-free grammars that …