Matching Text from Start to Finish Against Multiple Regular Expressions

As part of this research the problem of matching one string with multiple regular expressions (regex) will be reviewed with the only limitation being that the regex should match the whole string from start to finish. This task is implemented in the web servers where multiple routes are defined as regexes. The server tries to detect which response is appropriate for the currently requested URL by looking for the regex that matches the URL and then getting the response related to this regex. This application motivated us to implement a more lightweight data structure and algorithm to solve this problem in a more efficient way. The current realization of the problem is done by going sequentially through all the regexes and testing them to match with the given URL. The algorithm presented in this research similarly to the Aho-Corasick algorithm is optimizing this process by using a modification of the structure tree (also known as prefix tree).