Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Descriptional complexity of context-free grammar forms
Theoretical Computer Science
Semi-automatic grammar recovery
Software—Practice & Experience
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Cracking the 500-Language Problem
IEEE Software
A metrics suite for grammar-based software: Research Articles
Journal of Software Maintenance and Evolution: Research and Practice - Analyzing the Evolution of Large-Scale Software
A deterministic technique for extracting keyword based grammar rules from programs
Proceedings of the 2006 ACM symposium on Applied computing
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
Gramin: a system for incremental learning of programming language grammars
Proceedings of the 4th India Software Engineering Conference
| Hi-index | 0.00 |
The grammar of a programming language is important as it is used in developing software engineering tools. Sometimes grammars of programming languages are not readily available or they are incomplete; hence they are inferred from a set of valid programs. An exact grammar can not be learned from a set of positive samples (set of valid programs) alone as there exists many grammars which accept the given input programs; we call these grammars complete grammars. Therefore, given an incomplete grammar, there exists many sets of grammar rules which can make it complete. Due to many possible sets of grammar rules, the grammar inference process faces the problem of selecting a good set of grammar rules. We address the problem of grammar rule selection when they are inferred using an automatic are traditionally used for assessing the complexity of grammar based software. The experiments show that the grammar based metrics are not sufficient for this purpose as there exist several rules which have the same metric value. Hence we propose two rule selection criteria. Experiments are done to assess different criteria. Experiments show that proposed criteria, when coupled with grammar metrics, select reasonably good grammar rules.