… We describe FST - a Framework for SDF Transformation. FST supports the adaptation (in a broad sense) of grammars based on the syntax definition formalism SDF. The executable specification of FST is based on the ASF+SDF Meta-Environment …
ENTCS, 44(2):9-33, 2001. [doi]… This document assumes you have a reasonable knowlegde of SDF and parser generation concepts. It helps you solve a common issue when developing or maintaining a grammar for a (legacy) programming language: syntactical ambiguity. SDF has …
Technical Report SEN-1107, 2011. [doi]… This thesis describes several optimizations of the run-time behavior of list matching and list construction in the ASF+SDF run-time. The basic semantics of lists in ASF+SDF is based on a persistent data-structure called ATerms that employs …
Master's thesis, Universiteit van Amsterdam, nov 1999.… SDF is a formalism for the definition of syntax which is comparable to BNF in some respects, but has a wider scope in that it also covers the definition … implementation which accepts arbitrary context-free syntax definitions. SDF can …
SIGPLAN, 24(11):43-75, 1989. [doi]… The Asf+Sdf Meta-environment is an interactive development environment for the automatic generation of interactive systems for constructing language definitions and generating tools for them. Over the years, this system has been used …
CC 2001: 365-370 [doi]