Abstract

We present a new method for regular expression matching in large static texts. The method maintains a search table T which stores the results of previous regular expression matches. A new regular expression match is answered first by using the results in T. This requires comparing the new regular expression to those in T. For the remaining part, the text is searched in a regular fashion, and T is updated. In our experiments, on average our method is more than 1,000 times faster that Grep, and 20 times faster than RunAutomaton. The speed up values in finding first results (response times) are even better.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.