Extracting grammar from programs: Brute force approach

ACM SIGPLAN Notices

Volumn 40, Issue 4, 2005, Pages 29-38

  Črepinšek, Matej ^a   Mernik, Marjan ^a   Žumer, Viljem ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Exhaustive search; Grammar induction; Grammar inference; Learning from positive and negative examples

Indexed keywords

COMPUTATIONAL LINGUISTICS; INFORMATION ANALYSIS; LEARNING SYSTEMS; SOFTWARE ENGINEERING; TEXT PROCESSING;

EXHAUSTIVE SEARCH; GRAMMAR INDUCTION; GRAMMAR INFERENCE; LEARNING FROM POSITIVE AND NEGATIVE EXAMPLES;

CONTEXT FREE GRAMMARS;

EID: 33745214212     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1064165.1064171     Document Type: Article

References (22)

1. 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.
3. E. Bell. Exponential numbers. Amer. Math, 41:4111-419, 1934.
4. J. M. Borwein and D. H. Bailey. Mathematics by Experiment: Plausible Reasoning in the 21st Century. A. K. Peters, Ltd., Wellesley, MA, USA, 2004.
5. M. Črepinšek, M. Mernik, F. Javed, B. Bryant, and A. Sprague. Extracting grammar from programs: Evolutionary approach. Submitted to ACM Sigplan Notices, 2004.
6. P. Dupont, L. Miclet, and E. Vidal. What is the search space of the regular inference? In Grammatical Inference and Applications, Second International Colloquium, ICGI-94 Alicante, Spain, September 21-23, 1994; Proceedings, volume 862 of Lecture Notes in Computer Science, pages 25-37, 1994.
7. E. A. Gold. Complexity of automaton identification from given data. Information and Control, 37:302-320, 1978.
8. E. M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
9. C. de la. Higuera. Current trends in grammatical inference. In F. J. Ferri et al., editors, Advances in Pattern Recognition, Joint IAPR International Workshops SSPR+SPR'2000, volume 1876 of LNCS, pages 28-31. Springer, 2000.
10. J. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading, MA, 1979.
11. D. E. Knuth. The Art of Computer Programming, Vol.3 - Sorting and Searching. Addison-Wesley (Reading MA), 1973.
12. R. Lämmel and C. Verhoef. Semi-automatic grammar recovery. Software - Practice, & Experience, 31(15):1395-1438, Dec. 2001.
13. P. Langley and S. Stromsten. Learning context-free grammars with a simplicity bias. In Machine Learning: ECML 2000, 11th European Conference on Machine Learning, Barcelona, Catalonia, Spain, May 31-June 2, 2000, Proceedings, volume 1810 of Lecture Notes in Artificial Intelligence, pages 220-228. Springer, 2000.
14. J. A. Laxminarayana and G. Nagaraja. Inference of a subclass of context free grammars using positive samples. In ECML/PKDD 2003 Workshop on Learning Context-Free Grammars, 2003.
15. L. Lee. Learning of context-free languages: a survey of the literature. Technical Report TR-12-96, Center for Research in Computing Technology, Harvard University, Cambridge, MA, 1996.
16. K. Nakamura and T. Ishiwata. Synthesizing context free grammars from sample strings based on inductive CYK algorithm. In Grammatical Inference: Algorithms and Applications, 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000; Proceedings, volume 1891 of Lecture Notes in Artificial Intelligence, pages 186-195. Springer, 2000.
17. T. Oates, T. Armstrong, J. Harris, and M. Nejman. Leveraging lexical semantics to infer context-free grammars. In ECML/PKDD 2003 Workshop on Learning Context-Free Grammars, 2003.
18. J. Oncina and P. Garcia. Inferring regular languages in polynomial update time. In N. P. de la Blanca, A. Sanfeliu, and E. Vidal, editors, Pattern Recognition and Image Analysis, volume 1 of Series in Machine Perception and Artificial Intelligence, pages 49-61. World Scientific, Singapore, 1992.
19. B. Parekh and V. Honavar. An incremental interactive algorithm for grammar inference. In L. Miclet and C. de la Hieguera, editors, Proceedings of the Third International Colloquium on Grammatical Inference (ICGI-96): Learning Syntax from Sentences, volume 1147 of LNAI, pages 238-249. Springer, Sept. 25-27 1996.
20. Y. Sakakibara. Efficient learning of context-free grammars from positive structural examples. Information and Computation, 97(1):23-60, Mar. 1992.
21. Y. Sakakibara and H. Muramatsu. Learning context-free grammars from partially structured examples. In Grammatical Inference: Algorithms and Applications, 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000; Proceedings, volume 1891 of Lecture Notes in Artificial Intelligence, pages 229-240. Springer, 2000.
22. S. Savchenko. Regular expression mining. Dr. Dobb's Journal, 29:46-48, 2004.