A technique for extracting keyword based rules from a set of programs

Proceedings of the European Conference on Software Maintenance and Reengineering, CSMR

Volumn , Issue , 2005, Pages 217-225

  Dubey, Alpana ^a   Aggarwal, Sanjeev K ^a   Jalote, Pankaj ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

DIALECTS; LEGACY APPLICATIONS; PARSING; SOFTWARE ANALYSIS;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; ERROR ANALYSIS; ITERATIVE METHODS; LEGACY SYSTEMS;

COMPUTATIONAL GRAMMARS;

EID: 26844532133     PISSN: 15345351     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSMR.2005.5     Document Type: Conference Paper

References (18)

1. H. Ahonen. Generating grammars for structured documents using grammatical inference methods. PhD thesis, University of Helsinki, Department of Computer Science, 1994.
2. S. Biswas. A technique for recovering grammar from legacy programs. Master's thesis, Department of computer science and engineering IIT Kanpur, India, 2003.
3. S. Biswas and S. K. Agarwal. A technique for extracting grammar from legacy programs. In 22nd International Conference on Applied Informatics, 2004.
4. C. de la Higuera. A bibliographical study of grammatical inference, 2004. Paper available online at http://eprints.pascal-network.org/archive/00000098/.
5. R. Jain. Extracting grammar from programs. Master's thesis. Department of computer science and engineering IIT Kanpur, India, 2000.
6. R. Jain, S. K. Agarwal, P. Jalote, and S. Biswas. An interactive method for extracting grammar from programs. Software - Practice & Experience, 2004.
7. F. Javed, B. R. Bryant, M. Crepinsek, M. Mernik, and A. Sprague. Context-free grammar induction using genetic programming. In Proceedings of the 42nd annual Southeast regional conference, pages 404-405. ACM Press, 2004.
8. T. Kasami. An efficient recognition and syntax analysis algorithm for context free languages, special, Air Force Cambridge Research Laboratory, BedFord, MA, 1965.
9. R. Lämmel and C. Verhoef. Cracking the 500-Language Problem. IEEE Software, pages 78-88, Nov./Dec. 2001. Paper available online at http://www.cs.vu.nl/grammars/500/.
10. R. Lämmel and C. Verhoef. Semi-automatic Grammar Recovery. Software - Practice & Experience, 31(15):1395-1438, December 2001.
11. S. Lawrence, C. L. Giles, and S. Fong. Natural language grammatical inference with recurrent neural networks. IEEE Transactions on Knowledge and Data Engineering, 12(1):126-140, 2000.
12. L. Lee. Learning of context-free languages: A survey of the literature. Technical Report TR-12-96, Harvard University, 1996. Available via ftp, ftp://deas-ftp.harvard.edu/techreports/tr-12-96.ps.gz.
13. M. Mernik, G. Gerlic, V. Zumer, and B. Bryant. Can a parser be generated from examples? In Proceedings of 18th ACM symposium on applied computing, pages 1063-1067. ACM Press, 2003.
14. K. Nakamura. Incremental learning of context free grammars by extended inductive cyk algorithm. In Proceedings of 15th European Conference on Machine Learning (ECML) and the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), 2003.
15. R. Parekh and V. Honovar. Grammar Inference, Automata Induction, and Language Acquision, chapter Invited chapter. Dale, Moisl and Somers (Ed). New York: Marcel Dekker, 2000.
16. M. Seilink and C. Verhoef. Development, Assessment, and Reengineering of Language Descriptions. In J. Ebert and C. Verhoef, editors, Proceedings of the Fourth European Conference on Software Maintenance and Reengineering, pages 151-160. IEEE Computer Society, March 2000.
17. M. van Zaanen. ABL: Alignment-based learning. In COLING 2000 - Proceedings of the 18th International Conference on Computational Linguistics, pages 961-967, 2000.
18. 3. Technical Report 2, Information and Control, 1967.