Regular expressions are one of the worst aspects of debugging hell. Since they are contained in string literals, It's hard to comment how they work when the expressions are fairly long.
Say I have the following regular expression to match phone numbers
\b\d{3}[-.]?\d{3}[-.]?\d{4}\b
Source: Re...
While the concept of regular expressions exists in many languages, the syntax varies wildly. A cross-language solution would therefore be hypothetical code, which is off-topic for Code Review.
If you could revise the question such that it contains an actual working phone number matcher in a specific language, we may be able to reopen the question.
Such a vague question would likely be considered "too broad" on all other Stack Exchange sites. You're welcome to ask a specific question n times for n different languages, though — right here on Code Review. Just make sure that each one contains tested working code that solves a real task. (See help center.)
I get the feeling that you aren't taking our standards seriously. Where is this hypothetical regexMatch() function defined? How could your regex possibly work?
I'm still not convinced that you have working code. Could you please provide a complete program, starting with public static void main(String[] args) that demonstrates both a successful and rejected match against the pattern?
@FracturedRetina Thank you very much for revising the question to meet our standards. I hope my answer demonstrates why we want to review concrete examples with real, working code, not cross-language hypothetical questions.
Discussion between FracturedRetina an…
Discussion between FracturedRetina an…