Interesting paper on regex NFA matching

From	John R Levine <johnl@taugh.com>
Newsgroups	comp.compilers
Subject	Interesting paper on regex NFA matching
Date	2024-01-25 22:10 -0500
Organization	Compilers Central
Message-ID	<24-01-003@comp.compilers> (permalink)

Show all headers | View raw

The easiest way to implement regular expressions is to turn them into
NFAs, but that has well known problems that if you feed hostile input
to the NFAs, they can take exponential time and it's a way to DDoS the
server. If you translate the NFA to a DFA it runs in linear time, but
if the regex is ambiguous, as many are, the DFA may match something
different from the NFA.

This paper on the Arxiv preprint server proposes some rather complex
tweaks to NFA regex matching to fix many performance issues while giving
the same answers as before.

https://arxiv.org/abs/2401.12639

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

Back to comp.compilers | Previous | Next — Next in thread | Find similar

Thread

Interesting paper on regex NFA matching John R Levine <johnl@taugh.com> - 2024-01-25 22:10 -0500
  Re: Interesting paper on regex NFA matching cross@spitfire.i.gajendra.net - 2024-01-26 04:15 +0000
  Re: Interesting paper on regex NFA matching Kaz Kylheku <433-929-6894@kylheku.com> - 2024-01-26 04:16 +0000

csiph-web