New answers tagged

0 votes

Formally Verify if a Sequence of Regex-Based Modifications is Idempotent

This is likely to be a very hard problem, so hard that I don't think you should expect a useful solution that can handle all possible regexes. The extended regular expressions supported by Python's <...
D.W.'s user avatar
  • 156k
2 votes

How does a regular expression match `.+x`?

This is probably the main difference between "regular expressions" as a formal language, and "regexes" as an implementation tool. Extending a regular expression matching algorithm ...
Pseudonym's user avatar
  • 21.6k

Top 50 recent answers are included