We are pleased to announce the first release of SyntaxMacros [1].<br>SyntaxMacros is an EDSL for constructing compilers out of a collection of pre-compiled, <br>
statically type-checked, possibly mutually dependent ``language-definition fragments&#39;&#39;. <br>This way of constructing a compiler brings syntax macros for free. <br><br>This approach is based on a collection of techniques we have previously developed:<br>

 - transformation of typed abstract syntax trees [2] makes it possible to construct parsers on the fly in a type-safe way<br> - parser combinators [3] make it possible to construct parsers dynamically<br> - first-class attribute grammars [4] make it possible to define semantics in a compositional way<br>

<br>More information can be found at: <a href="http://www.cs.uu.nl/wiki/Center/SyntaxMacrosForFree" target="_blank">http://www.cs.uu.nl/wiki/Center/SyntaxMacrosForFree</a><br><br>Regards,<br><br>Marcos Viera, Doaitse Swierstra, Atze Dijkstra and Arthur Baars<br>

<br><br>[1]- <a href="http://hackage.haskell.org/package/SyntaxMacros" target="_blank">http://hackage.haskell.org/package/SyntaxMacros</a> <br>[2]- <a href="http://www.cs.uu.nl/wiki/Center/TTTAS" target="_blank">http://www.cs.uu.nl/wiki/Center/TTTAS</a><br>

[3]- <a href="http://www.cs.uu.nl/wiki/bin/view/HUT/ParserCombinators" target="_blank">http://www.cs.uu.nl/wiki/bin/view/HUT/ParserCombinators</a><br>[4]- <a href="http://www.cs.uu.nl/wiki/Center/AspectAG" target="_blank">http://www.cs.uu.nl/wiki/Center/AspectAG</a><br>
<br>