An Algorithm for Optimizing the Performance of Regular Expressions Using Population Algorithms

The problem of optimization of regular expressions and the method of representing regular expressions in the form of an incidence list of an abstract syntax tree are considered. An algorithm for optimizing the speed of regular expressions using population algorithms is proposed. The main metrics of the quality of regular expressions are proposed. The results of calculating metrics for the original and optimized regular expressions using the proposed algorithm are presented, confirming the feasibility of its use in practice.