Learning Automata from Ordered Examples
Machine Learning - Connectionist approaches to language learning
Attribute grammar paradigms—a high-level methodology in language implementation
ACM Computing Surveys (CSUR)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Domain-specific languages: an annotated bibliography
ACM SIGPLAN Notices
Learning in Humans and Machines
Learning in Humans and Machines
Principles of Program Analysis
Principles of Program Analysis
Cracking the 500-Language Problem
IEEE Software
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Learning Context-Free Grammars from Partially Structured Examples
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Implementing Alignment-Based Learning
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
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
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
It's time to think outside the computational box
Communications of the ACM
When and how to develop domain-specific languages
ACM Computing Surveys (CSUR)
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
MARS: A metamodel recovery system using grammar inference
Information and Software Technology
Natural language grammar induction with a generative constituent-context model
Pattern Recognition
Inferring grammar rules of programming language dialects
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
KM3: a DSL for metamodel specification
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Incremental programming language development
Computer Languages, Systems and Structures
A memetic grammar inference algorithm for language learning
Applied Soft Computing
Unsupervised grammar inference using the minimum description length principle
MLDM'12 Proceedings of the 8th international conference on Machine Learning and Data Mining in Pattern Recognition
| Hi-index | 0.00 |
While grammar inference (or grammar induction) has found extensive application in the areas of robotics, computational biology, and speech 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 domain-specific language development easier for domain experts not well versed in programming language design, and finds a second application in construction of renovation tools for legacy software systems. As a continuation of our previous efforts to infer context-free grammars (CFGs) for domain-specific languages which previously involved a genetic-programming based CFG inference system, we discuss extensions to the inference capabilities of GenInc, an incremental learning algorithm for inferring CFGs. We show that these extensions enable GenInc to infer more comprehensive grammars, discuss the results of applying GenInc to various domain-specific languages and evaluate the results using a comprehensive suite of grammar metrics.