What regex can match sequences of the same character?

user_181 0
Viewed 64124

A friend asked me this and I was stumped: Is there a way to craft a regular expression that matches a sequence of the same character? E.g., match on 'aaa', 'bbb', but not 'abc'?

m|\w{2,3}|

Wouldn't do the trick as it would match 'abc'.

m|a{2,3}|

Wouldn't do the trick as it wouldn't match 'bbb', 'ccc', etc.

perl regex
9 Answers

Sure thing! Grouping and references are your friends:

(.)\1+

Will match 2 or more occurences of the same character. For word constituent characters only, use \w instead of ., i.e.:

(\w)\1+
David_Hanak_421360

Note that in Perl 5.10 we have alternative notations for backreferences as well.

foreach (qw(aaa bbb abc)) {
  say;
  say ' original' if /(\w)\1+/;
  say ' new way'  if /(\w)\g{1}+/;
  say ' relative' if /(\w)\g{-1}+/;
  say ' named'    if /(?'char'\w)\g{char}+/;
  say ' named'    if /(?<char>\w)\k<char>+/;
}
oylenshpeegul_106270

This will match more than \w would, like @@@: 

/(.)\1+/
gpojd_280710

Answering my own question, but got it:

m|(\w)\1+|
user_1810

This is what backreferences are for.

m/(\w)\1\1/

will do the trick.

friedo_207450

This is also possible using pure regular expressions (i.e. those that describe regular languages -- not Perl regexps). Unfortunately, it means a regexp whose length is proportional to the size of the alphabet, e.g.:

(a* + b* + ... + z*)

Where a...z are the symbols in the finite alphabet.

So Perl regexps, although a superset of pure regular expressions, definitely have their advantages even when you just want to use them for pure regular expressions!

user_639910

For same 3 characters:

  • /(.)/1/1/
  • /(.)/1{2}/

For 2 characters:

  • /(.)/1/

For unknown number of same characters:

  • /(.)/1*/

PS: I use javascript

user_143809400 
".*(.)\\1{2,}.*"

Works for any two or more repeated symbols in the string

user_187913830
Related