Transformation of SDF syntax definitions in the ASF SDF Meta-Environment

From GRK-Wiki

• Presented at the 1st Workshop on Language Descriptions, Tools and Applications (LDTA'01), Genova, Italy.
• Published as Electronical Notes of Theoretical Computer Science (ENTCS).

Authors

• Ralf Lämmel, CWI and Vrije Universiteit Amsterdam, The Netherlands
• Guido Wachsmuth, University of Rostock, Germany

Abstract

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. Grammar transformations form an important concept of grammar reengineering, implementation, recovery and others. Tool support for grammar transformations is essential to automate the corresponding processes. We have chosen SDF as target language for grammar transformations because it is an expressive syntax definition formalism which does not just cover BNF and extended BNF but also constructs for modularisation and disambiguation. The algebraic specification of the framework is immediately operational in the ASF+SDF Meta-Environment.

Download paper

.ps

BibTeX

@InProceedings{laemmel:fst,
  author =       {Ralf L{\"a}mmel and Guido Wachsmuth},
  title =        {Transformation of SDF syntax definitions in the ASF+SDF Meta-Environment},
  editor =       {Mark van den Brand and Didier Parigot},
  booktitle =    {Proceedings of the 1st Workshop on Language Descriptions,
                  Tools and Applications (LDTA'01)},
  year =         2001,
  month =        apr,
  series =       {Electronical Notes in Theoretical Computer Science},
  volume =       {44},
  number =       {2},
  publisher =    {Elsevier Science},
  doi =          {http://dx.doi.org/10.1016/S1571-0661(04)80918-6}
}