Genetic Programming for Induction of Context-Free Grammars

We present an evolutionary algorithm for the induction of context-free grammars from positive and negative examples. The algorithm is based on genetic programming and uses a local optimization operator that is capable of improving the learning task. Ordinary genetic operators were modified so as to bias the search and a new operator was proposed. The system was evaluated using benchmark problems and results were compared with another approach. Results show that the proposed approach is very promising.