Affiliation:
1. University of Maribor, Maribor, Slovenia
Abstract
Extracting grammar from programs attracts researchers from several fields such as software engineering, pattern recognition, computational linguistic and natural language acquisition. So far, only regular grammar induction has been successful, while purposeful context-free grammar induction is still elusive. We discuss the search space of context-free grammar induction and propose the Brute Force approach to the problem which, along with its various enhancements, can be further used in collaboration with the Evolutionary approach, as described in the accompanying paper.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference21 articles.
1. Usenet news group comp.compilers reference 96-02-306. http://compilers.iecc.com/comparch/article/99-02-306.]] Usenet news group comp.compilers reference 96-02-306. http://compilers.iecc.com/comparch/article/99-02-306.]]
2. Usenet news group comp.compilers. reference 99-02-025. http://compilers.iecc.com/comparch/article/99-02-025.]] Usenet news group comp.compilers. reference 99-02-025. http://compilers.iecc.com/comparch/article/99-02-025.]]
3. Exponential Numbers
4. M. Črepinšek M. Mernik F. Javed B. Bryant and A. Sprague. Extracting grammar from programs: Evolutionary approach. Submitted to ACM Sigplan Notices 2004.]] M. Črepinšek M. Mernik F. Javed B. Bryant and A. Sprague. Extracting grammar from programs: Evolutionary approach. Submitted to ACM Sigplan Notices 2004.]]
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献