The paper describes an approach to implementing genetic programming, which uses the LLVM library to just-in-time compile/interpret the evolved abstract syntax trees. The solution is described in some detail, including a parser (based on FlexC++ and BisonC++) that can construct the trees from a simple toy language with C-like syntax. The approach is compared with a previous implementation (based on direct execution of trees using polymorphic functors) in terms of execution speed.
@article{arxiv.1701.05730,
title = {Using LLVM-based JIT Compilation in Genetic Programming},
author = {Michal Gregor and Juraj Spalek},
journal= {arXiv preprint arXiv:1701.05730},
year = {2017}
}
Comments
Link to the IEEE published version: http://ieeexplore.ieee.org/document/7512108/