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 need to simplify the following regular expression to include all the letters of the alphabet:
(a{3})|(b{3})|(c{3})|(z{3})|(A{3})|(B{3})|(C{3})|(Z{3})
In practice I want to find all the sequences of same three chars, for example:
aaa
bbb
nnn
VVV
JJJ
and so on.
Use backreferences. Eg. in sed:
or in PERL regular expressions