Generating Rewritable Abstract Syntax Trees
No abstract available.
Related papers
- Lightweight multi-language syntax transformation with parser parser combinators PLDI 2019
- Trieste: A C++ DSL for Flexible Tree Rewriting SLE 2024
- PAGODE: A Back End Generator Using Attribute Abstract Syntaxes and Term Rewritings CC 1990
- Reference attribute grammar controlled graph rewriting: motivation and overview SLE 2015
- Rewriting a shallow DSL using a GHC compiler extension GPCE 2017
- Self-optimizing AST interpreters DLS 2012
- A generic abstract syntax model for embedded languages ICFP 2012
- Verifying Term Graph Optimizations using Isabelle/HOL CPP 2023