Look-arounds can be implemented in quadratic time for unbounded expressions (i.e...

		nitely on May 21, 2024 \| parent \| context \| favorite \| on: Regular expression matching can be simple and fast... Look-arounds can be implemented in quadratic time for unbounded expressions (i.e: containing +, *), and linear time for bounded expressions quite easily. And I suspect they can be implemented in (super)linear time in general by matching them in parallel to the NFA.