Skip to main content

Grammatical evolution: Evolving programs for an arbitrary language

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1391))

Abstract

We describe a Genetic Algorithm that can evolve complete programs. Using a variable length linear genome to govern how a Backus Naur Form grammar definition is mapped to a program, expressions and programs of arbitrary complexity may be evolved. Other automatic programming methods are described, before our system, Grammatical Evolution, is applied to a symbolic regression problem.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Elseth Gerald D., Baumgardner Kandy D. Principles of Modern Genetics. West Publishing Company

    Google Scholar 

  2. Goldberg D E, Korb B, Deb K. Messy genetic algorithms: motivation, analysis, and first results. Complex Syst. 3

    Google Scholar 

  3. Gruau, F. 1994. Neural Network synthesis using cellular encoding and the genetic algorithm. PhD Thesis from Centre d’etude nucleaire de Grenoble, France.

    Google Scholar 

  4. Homer, H A C++ class library for GP. Vienna University of Economics.

    Google Scholar 

  5. Keller, R. & Banzhaf, W. 1996. GP using mutation, reproduction and genotype-phenotype mapping from linear binary genomes into linear LALR phenotypes. In Genetic Programming 1996, pages 116–122. MIT Press.

    Google Scholar 

  6. Koza, J. 1992. Genetic Programming. MIT Press.

    Google Scholar 

  7. O’Reilly, U. 1997. The impact of external dependency in Genetic Programming Primitives. In Emerging Technologies 1997, pages 45–58. University College London. To Appear.

    Google Scholar 

  8. Paterson, N & Livesey, M. 1997. Evolving caching algorithms in C by GP. In Genetic Programming 1997, pages 262–267. MIT Press.

    Google Scholar 

  9. Ryan, C. & Walsh P. 1997. The Evolution of Provable Parallel Programs. In Genetic Programming 1996, pages 406–409. MIT Press.

    Google Scholar 

  10. Ryan, C. 1997. Shades — A Polygenic Inheritance scheme. In Proceedings of Mendel ’97, pages 140–147. PC-DIR, Brno, Czech Republic.

    Google Scholar 

  11. Schutz, M. 1997. Gene Duplication and Deletion, in the Handbook of Evolutionary Computation. (1997) Section C3.4.3

    Google Scholar 

  12. Whigham, P. 1995. Inductive bias and genetic programming. In First International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, pages 461–466. UK:IEE.

    Google Scholar 

  13. Whigham, P. 1996. Search Bias, Language Bias and Genetic Programming. In Genetic Programming 1996, pages 230–237. MIT Press.

    Google Scholar 

  14. Wong, M. and Leung, K. 1995. Applying logic grammars to induce subfunctions in genetic prorgramming. In Proceedings of the 1995 IEEE conference on Evolutionary Computation, pages 737–740. USA:IEEE Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wolfgang Banzhaf Riccardo Poli Marc Schoenauer Terence C. Fogarty

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ryan, C., Collins, J., Neill, M.O. (1998). Grammatical evolution: Evolving programs for an arbitrary language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds) Genetic Programming. EuroGP 1998. Lecture Notes in Computer Science, vol 1391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055930

Download citation

  • DOI: https://doi.org/10.1007/BFb0055930

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64360-9

  • Online ISBN: 978-3-540-69758-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics