Using LLVM-based JIT Compilation in Genetic Programming

01/20/2017
by   Michal Gregor, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/17/2017

Self-adaptation of Genetic Operators Through Genetic Programming Techniques

Here we propose an evolutionary algorithm that self modifies its operato...
research
01/13/2020

Fast Generation of Big Random Binary Trees

random_tree() is a linear time and space C++ implementation able to crea...
research
07/05/2018

Abstract Representation of Binders in OCaml using the Bindlib Library

The Bindlib library for OCaml provides a set of tools for the manipulati...
research
03/31/2018

Generic Description of Well-Scoped, Well-Typed Syntaxes

We adapt the technique of type-generic programming via descriptions poin...
research
10/05/2018

TRANX: A Transition-based Neural Abstract Syntax Parser for Semantic Parsing and Code Generation

We present TRANX, a transition-based neural semantic parser that maps na...
research
07/24/2018

Racets: Faceted Execution in Racket

Faceted Execution is a linguistic paradigm for dynamic information-flow ...
research
03/10/2014

Parsing using a grammar of word association vectors

This paper was was first drafted in 2001 as a formalization of the syste...

Please sign up or login with your details

Forgot password? Click here to reset