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

Abstract We describe FST—a F ramework for S DF T ransformation. FST supports the adaptation (in a broad sense) of grammars based on the syntax definition formalism SDF. We further describe the prototype implementation of FST in 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.

[1]  Ralf Lämmel,et al.  Semi‐automatic grammar recovery , 2001, Softw. Pract. Exp..

[2]  Chris Verhoef,et al.  Development, assessment, and reengineering of language descriptions , 2000, Proceedings of the Fourth European Conference on Software Maintenance and Reengineering.

[3]  Khaled Bsaïes,et al.  Spes: A System for Logic Program Transformation , 1992, LPAR.

[4]  Ralf Lämmel,et al.  Grammar Adaptation , 2001, FME.

[5]  Paul Klint,et al.  A meta-environment for generating programming environments , 1989, TSEM.

[6]  Paul Klint,et al.  Term rewriting with traversal functions , 2003, TSEM.

[7]  J. Brunekreef,et al.  TransLog, an interactive tool for transformation of logic programs , 1995 .

[8]  Helmut A. Partsch,et al.  Specification and transformation of programs , 1990 .

[9]  Robert D. Cameron Extending context-free grammars with permutation phrases , 1993, LOPL.

[10]  Jan A. Bergstra,et al.  The algebraic specification formalism ASF , 1989 .

[11]  Ivan Moore,et al.  Automatic inheritance hierarchy restructuring and method refactoring , 1996, OOPSLA '96.

[12]  Ralph E. Johnson,et al.  A Refactoring Tool for Smalltalk , 1997, Theory Pract. Object Syst..

[13]  J. Rekers,et al.  Parser Generation for Interactive Environments , 1992 .

[14]  David S. Wile,et al.  Abstract Syntax from Concrete Syntax , 1997, Proceedings of the (19th) International Conference on Software Engineering.

[15]  Paul Klint,et al.  The syntax definition formalism SDF—reference manual— , 1989, SIGP.

[16]  Alberto Pettorossi,et al.  Rules and strategies for transforming functional and logic programs , 1996, CSUR.

[17]  Ralf Lämmel,et al.  Grammar Testing , 2001, FASE.

[18]  Masaru Tomita,et al.  Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems , 1985 .

[19]  Arie van Deursen,et al.  The ASF+SDF Meta-environment: A Component-Based Language Development Environment , 2001 .

[20]  Eelco Visser,et al.  Syntax definition for language prototyping , 1997 .

[21]  Chris Verhoef,et al.  Generation of components for software renovation factories from context-free grammars , 2000, Sci. Comput. Program..