CODE COMPACTION BY EVOLUTIONARY ALGORITHM

摘要

A code compaction based on macro substitutions is presented wherein the choice of possible macro substitutions is guided by an evolutionary algorithm process. In a preferred embodiment, a random population of sets of macro substitutions are generated and a compaction effectiveness is evaluated for each set. This random population is partitioned into pairs of "parents", and each pair of parents produce a pair of "offspring". The effectiveness of the compaction provided by each of the offspring is evaluated, and a "survival of the fittest" algorithm is applied to identify the individuals that have the best compaction effectiveness. These preferred individuals are partitioned into pairs of parents who produce pairs of offspring, and the most compaction-effective individuals are selected to be parents for the next generation. This process continues until subsequent generations show insignificant improvement, and the best individual is selected as the solution.