Build, test, and debug regular expressions
L(abc) = {abc} — a language containing exactly one string of length 3.
Unable to parse pattern
g
m
No matches found
.
\d
\w
\s
\b[A-Za-z0-9._%+-]+@[A-Za-z0-9.-]+\.[A-Z|a-z]{2,}\b
\(?\d{3}\)?[-.]?\d{3}[-.]?\d{4}