A Technique for Extracting Keyword Based Rules from a Set of Programs

Authors:
Alpana Dubey;Sanjeev K. Aggarwal;Pankaj Jalote
Affiliations:
Indian Institute of Technology - Kanpur;Indian Institute of Technology - Kanpur;Indian Institute of Technology - Kanpur
Venue:
CSMR '05 Proceedings of the Ninth European Conference on Software Maintenance and Reengineering
Year:
2005

Citing 0
Cited 5

Toward an engineering discipline for grammarware

ACM Transactions on Software Engineering and Methodology (TOSEM)
A deterministic technique for extracting keyword based grammar rules from programs

Proceedings of the 2006 ACM symposium on Applied computing
The Amsterdam Toolkit for Language Archaeology

Electronic Notes in Theoretical Computer Science (ENTCS)
Recovering grammar relationships for the Java Language Specification

Software Quality Control
Inferring grammar rules of programming language dialects

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel technique for extracting a grammar from a set of programs. A grammar is important for generating software analysis and modification tools. Most legacy applications are written in languages which are minor variations (dialects) of the standard language. Normally, we have a grammar of the standard language, but the grammars of dialects are unavailable. In this paper we propose an iterative technique with backtracking for grammar extraction. Our technique extracts keyword based rules. This uses the CYK parsing algorithm and the LR error recovery technique for finding out new production rules. In each iteration a set of possible rules is built and one rule from them is selected. Finally, we get a grammar which parses all programs in the set.