Abstract
A significant recent addition to the repertoire of grammar-based approaches to genetic programming (GP) is the use of tree-adjunct and tree-adjoining grammars (TAG). A TAG is a tree-generating grammar, and as such is a natural representation for GP and for computer programs. One of the primary benefits of a TAG is that the application of any rule within a TAG to an existing tree results in an executable tree, which overcomes the possibility of creating invalid programs (incomplete programs which cannot be executed). The creation of invalid phenotypes can occur in methods such as grammatical evolution without enforcing some sort of repair-like strategy during the genotype–phenotype mapping process.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brabazon, A., O’Neill, M., McGarraghy, S. (2015). Tree-Adjoining Grammars and Genetic Programming. In: Natural Computing Algorithms. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43631-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-662-43631-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43630-1
Online ISBN: 978-3-662-43631-8
eBook Packages: Computer ScienceComputer Science (R0)