TDFA regular expression matching

John R Levine <johnl@taugh.com>
Thu, 22 Feb 2024 14:28:40 -0500

          From comp.compilers
Related articles
TDFA regular expression matching johnl@taugh.com (John R Levine) (2024-02-22)
| List of all articles for this month |
From: John R Levine <johnl@taugh.com>
Newsgroups: comp.compilers
Date: Thu, 22 Feb 2024 14:28:40 -0500
Organization: Compilers Central
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="93830"; mail-complaints-to="abuse@iecc.com"
Keywords: lex, performance
Posted-Date: 22 Feb 2024 14:29:18 EST

This 2022 paper describes tagged DFA matching of regular expressions that
have tags to track which input matched where in the regex. Tagging is
easy when matching with an NFA but harder with a DFA since the tag
locations in the NFA may end up combined or split in the DFA.


It seems pretty clever. And it does work, implemented in re2c.


https://arxiv.org/abs/2206.01398


Regards,
John Levine, johnl@taugh.com, Taughannock Networks, Trumansburg NY
Please consider the environment before reading this e-mail. https://jl.ly

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.