We present grammatical evolution, an evolutionary algorithm that can evolve complete programs in an arbitrary language using a variable-length binary string. The binary genome determines which production rules in a Backus-Naur form grammar definition are used in a genotype-to-phenotype mapping process to a program. We demonstrate how expressions and programs of arbitrary complexity may be evolved and compare its performance to genetic programming.
No takes yet. Share an insight, caveat, or question.
O’Neill et al. (2001) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: