Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I’d like to figure out (in runtime) whether or not two regular expressions intersect (i.e. if they do there exist one or more string the matches both regular expressions).
Algorithm needs to be pretty fast as I need to loop through a database and check existing values.
Found some theory on this but no implementations?
The obvious solution would be to convert the regexes to DFAs, compute the intersection of the DFAs (trivial) and see if there’s anything the resulting DFA can accept (also trivial). The only hard part is converting the regexes to DFAs, which requires some work.