Abstract- The Maximum Homologous Crossover attempts to preserve similar structures from parents by aligning them according to their homology. In this paper, it is successfully tested on the classical Even-N Parity Problem where it demonstrates interesting abilities in bloat reduction. Then, we show that this operator gives an accurate control of the size of programs during the evolution and thus, allows the development of new strategies for the search space exploration.