Learning regular sets from queries and counterexamples
Information and Computation
Learning deterministic even linear languages from positive examples
Theoretical Computer Science - Special issue on algorithmic learning theory
Semi-automatic grammar recovery
Software—Practice & Experience
Natural Language Grammatical Inference with Recurrent Neural Networks
IEEE Transactions on Knowledge and Data Engineering
Learning Context-Free Grammars with a Simplicity Bias
ECML '00 Proceedings of the 11th European Conference on Machine Learning
A minimum description length approach to grammar inference
Connectionist, Statistical, and Symbolic Approaches to Learning for Natural Language Processing
Can a parser be generated from examples?
Proceedings of the 2003 ACM symposium on Applied computing
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
A Technique for Extracting Keyword Based Rules from a Set of Programs
CSMR '05 Proceedings of the Ninth European Conference on Software Maintenance and Reengineering
An interactive method for extracting grammar from programs
Software—Practice & Experience - Research Articles
Extracting grammar from programs: brute force approach
ACM SIGPLAN Notices
Extracting grammar from programs: evolutionary approach
ACM SIGPLAN Notices
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)
A bibliographical study of grammatical inference
Pattern Recognition
Towards Machine Learning of Grammars and Compilers of Programming Languages
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
AN UNSUPERVISED INCREMENTAL LEARNING ALGORITHM FOR DOMAIN-SPECIFIC LANGUAGE DEVELOPMENT
Applied Artificial Intelligence
Gramin: a system for incremental learning of programming language grammars
Proceedings of the 4th India Software Engineering Conference
Recovering grammar relationships for the Java Language Specification
Software Quality Control
| Hi-index | 0.00 |
In this paper we address the problem of grammatical inference in the programming language domain. The grammar of a programming language is an important asset because it is used in developing many software engineering tools. Sometimes, grammars of languages are not available and have to be inferred from the source code; especially in the case of programming language dialects. We propose an approach for inferring the grammar of a programming language when an incomplete grammar along with a set of correct programs is given as input. The approach infers a set of grammar rules such that the addition of these rules makes the initial grammar complete. A grammar is complete if it parses all the input programs successfully. We also proposes a rule evaluation order, i.e. an order in which the rules are evaluated for correctness. A set of rules are correct if their addition makes the grammar complete. Experiments show that the proposed rule evaluation order improves the process of grammar inference.