tags:

views:

48

answers:

1

Is it possible to construct a PCRE-style regular expression that will only match each letter in a list only once?

For example, if you have the letters "lrsa" and you try matching a word list against:

^[lrsa]*m[lrsa]*$

you're going to match "lams" (valid), but also "lamas" (invalid for our purposes because you only had one "a"). If your letter set was "lrsaa", you would want to match "lamas".

Is this possible with regular expressions, or should I handle it programmatically?

+1  A: 

You can use negative look-ahead:

^(?!.*?(.).*?\1)[lrsa]*m[lrsa]*$

will do what you want

ZyX
Yes, that does work where each letter is unique. Very helpful. (I need to sort through that and figure how it works. Reading this as well: http://stackoverflow.com/questions/1749437/regular-expression-negative-lookahead)What about where there are more than one occurrance of a letter, e.g.: "abbcde" and you want to match on "babe" but not "dade"? Possible?
gtcaz
I am not sure that I understood you correctly, but maybe this will do the trick: `^(?!.*?(d).*?\1)\w+$`
ZyX