Grammatical Optimization

This project is a result for my curiosity for how grammatical evolution (GE) works. Eventually, I made this wrapper for GE that should work with any numerical optimization algorithm.

So the idea behind GE is that it takes production rules for computer programs using a context free grammar in Backus Naur form. The production rules can be used to evolve computer programs by running an algorithm such as a genetic algorithm or a particle swarm optimizer in the background.