Abstract
In this paper we benchmark the matching time of regular expression matching engines when they use either the Thompson or Glushkov regular expressions to state machine conversion algorithms, with or without using memoisation while matching, and doing matching either by using a lockstep or a Spencer type scheduler. We conduct our empirical investigation by expanding on the virtual machine for regular expressions matching approach, introduced by Russ Cox.
Original language | English |
---|---|
Title of host publication | Implementation and Application of Automata - 28th International Conference, CIAA 2024, Proceedings |
Editors | Szilárd Zsolt Fazekas |
Publisher | Springer Science and Business Media Deutschland GmbH |
Pages | 316-331 |
Number of pages | 16 |
ISBN (Print) | 9783031711114 |
DOIs | |
Publication status | Published - 2024 |
Event | 28th International Conference on Implementation and Application of Automata, CIAA 2024 - Akita, Japan Duration: 2024 Sept 3 → 2024 Sept 6 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 15015 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 28th International Conference on Implementation and Application of Automata, CIAA 2024 |
---|---|
Country/Territory | Japan |
City | Akita |
Period | 24/9/3 → 24/9/6 |
Bibliographical note
Publisher Copyright:© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science