As I said "In the latter case" of general vulnerabilities, these are some issues to be aware of.
The OP said
> > These regexes are in the dozens, and are scattered across several scripts and libraries.
> > maintenance of these mappings is easier.
I doubt the general case can be solved with a DB of simple strings. Maintainable regexes are composed of smaller ones by interpolation and dynamic compilation. Which brings us back to start.
> is only allowed within the scope of use re 'eval';
with "newer" Perls yes. I noticed that you changed it around 2013, and am thankful for that. *
> The third one is a genuine issue, in terms of both CPU and memory usage.
well some regex engines optimize sometimes better than Perl's.
I remember a demo of a case with nested quantifiers where unix' grep did very well and Perl waited for the end of times.
This could be eased by analyzing the regex for potential traps like listed here and warning accordingly.
This analyze could be done by parsing the compilation with re 'debug'; °
But again this could open the door for those general vulnerabilities, that's why I prefer to point to them.
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
°) for completeness TheDamian published a static parser for perl regexes, I can't tell how closely it incorporates new features.
*) Some IDEs do perl -c on default when they open a perl file. Sending a troyan script with a evil BEGIN block will execute instantly after opening. And obfuscation with Acme::EyeDrops will still allow hiding the evil logic into a regex, one just needs to add use re 'eval'; for newer Perls