Yes, all longest regex matches in linear time is possible
Summary
The article argues that finding all regex matches in general breaks linear-time guarantees for single-match engines, introduces RE# as a true linear all-matches engine via a two-pass approach, and discusses hardened mode, streaming implications, and current limitations.