Re^2: [RFC] Building Regex Alternations Dynamically

IIRC there is a hard limit for the length of a regex-string

Other than RAM, I haven't found one yet, I just built a qr// regex from a 1GB text file without alternations and a second from 40MB of text with over 10M alternations.

As you may have seen I added a TL;DR, thanks for the idea!

Regards,
-- Hauke D

Comment on Re^2: [RFC] Building Regex Alternations Dynamically Download Code

Replies are listed 'Best First'.
Re^3: [RFC] Building Regex Alternations Dynamically by LanX (Saint) on Jan 21, 2017 at 18:31 UTC
Yeah sorry I had > > (or was it only the repetition counter .{x} limited to x aprox 32000 ?) in mind. Since regexes are compiled to op codes hard limits are unlikely. > As you may have seen I added a TL;DR, thanks for the idea! Hmm probably it's time to include support for TOC = table of content in my wiki add on :) Cheers Rolf _{(addicted to the Perl Programming Language and ☆☆☆☆ :) Je suis Charlie!}	[reply]

Replies are listed 'Best First'.

Re^3: [RFC] Building Regex Alternations Dynamically
by LanX (Saint) on Jan 21, 2017 at 18:31 UTC

> > (or was it only the repetition counter .{x} limited to x aprox 32000 ?)

in mind. Since regexes are compiled to op codes hard limits are unlikely.

> As you may have seen I added a TL;DR, thanks for the idea!

Hmm probably it's time to include support for TOC = table of content in my wiki add on :)

Cheers Rolf
_{(addicted to the Perl Programming Language and ☆☆☆☆ :)

Je suis Charlie!}

[reply]