Generation of Components for Software Renovation Factories from Context-Free Grammars
نویسندگان
چکیده
We present an approach for the generation of components for a software renovation factory. These components are generated from a contex-free grammar de nition that recognizes the code that has to be renovated. We generate analysis and transformation components that can be instantiated with a speci c transformation or analysis task. We apply our approach to COBOL and we discuss the construction of realistic software renovation components using our approach. c © 2000 Elsevier Science B.V. All rights reserved. MSC: D.2.6; D.2.7; D.2.m
منابع مشابه
Generation of Software Renovation Factories from Compilers
When a compiler is designed carefully, it is possible to extract its grammar. We reengineer the extracted grammar to one that is geared towards reengineering. From this reengineering grammar we generate an architecture called a software renovation factory. This includes: generic analysis and transformation functionality and a native pattern language using the concrete syntax of the language for...
متن کاملThe Grammar Deployment Kit - System Demonstration
Grammar deployment is the process of turning a given grammar specification into a working parser. The Grammar Deployment Kit (for short, GDK) provides tool support in this process based on grammar engineering methods. We are mainly interested in the deployment of grammars for software renovation tools, that is, tools for software reand reverse engineering. The current version of GDK is optimize...
متن کاملThe G rammar D eployment K it — System Demonstration — Jan Kort
Grammar deployment is the process of turning a given grammar specification into a working parser. The Grammar Deployment Kit (for short, GDK) provides tool support in this process based on grammar engineering methods. We are mainly interested in the deployment of grammars for software renovation tools, that is, tools for software reand reverse engineering. The current version of GDK is optimize...
متن کاملIncrementally Inferring Context-Free Grammars for Domain-Specific Languages
Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to the programming language problem domain has been limited. We propose a new application area for grammar inference which intends to make domain-specific language development easier and finds a second application in ren...
متن کاملGenInc: An Incremental Context-Free Grammar Learning Algorithm for Domain-Specific Language Development
While grammar inference (or grammar induction) has found extensive application in the areas of robotics, computational biology, speech and pattern recognition, its application to problems in programming language and software engineering domains has been limited. We have found a new application area for grammar inference which intends to make domainspecific language development easier for domain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Sci. Comput. Program.
دوره 36 شماره
صفحات -
تاریخ انتشار 1997