It is well known that classical regexes recognize exactly regular languages. But in practice, many programming languages have extensions to the regex syntax which potentially broaden the field of recognized languages. (For example, recursive regexes, lookarounds, ...)
Are there any papers or is there literature that explore(s) which formal languages are recognized by the regex constructs in different programming languages (including extensions), maybe sorted after specific extensions added?
Something like "classical regexes extended with lookarounds and recursive regexes recognize exactly context-free grammars. Proof: ..."