Extracting grammar from programs: brute force approach

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.

[1]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[2]  Rajesh Parekh,et al.  An incremental interactive algorithm for grammar inference , 1996 .

[3]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[4]  Jonathan M. Borwein,et al.  Mathematics by experiment - plausible reasoning in the 21st century , 2003 .

[5]  Yasubumi Sakakibara,et al.  Learning Context-Free Grammars from Partially Structured Examples , 2000, ICGI.

[6]  Yasubumi Sakakibara,et al.  Efficient Learning of Context-Free Grammars from Positive Structural Examples , 1992, Inf. Comput..

[7]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[8]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[9]  Ralf Lämmel,et al.  Semi‐automatic grammar recovery , 2001, Softw. Pract. Exp..

[10]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[11]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[12]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[13]  G. Nagaraja,et al.  Inference of a Subclass of Context Free Grammars Using Positive Samples , 2003, ECML Workshop on Learning Contex-Free Grammars.

[14]  Faizan Javed,et al.  Extracting grammar from programs: evolutionary approach , 2005, SIGP.

[15]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[16]  Tom Armstrong,et al.  Leveraging Lexical Semantics to Infer Context-Free Grammars , 2003, ECML Workshop on Learning Contex-Free Grammars.

[17]  Colin de la Higuera,et al.  Current Trends in Grammatical Inference , 2000, SSPR/SPR.

[18]  Enrique Vidal,et al.  What Is the Search Space of the Regular Inference? , 1994, ICGI.

[19]  J. Oncina,et al.  INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME , 1992 .

[20]  Pat Langley,et al.  Learning Context-Free Grammars with a Simplicity Bias , 2000, ECML.

[21]  Katsuhiko Nakamura,et al.  Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm , 2000, ICGI.

[22]  Lillian Lee,et al.  Learning of Context-Free Languages: A Survey of the Literature , 1996 .