如何将2个字母的特定组合与正则表达式匹配

Question

given this set of letters

xx | af | an | bf | bn | cf | cn

how can I see if, given two characters, they match against one of the above?

I could easily hardcode the solution with a switch case, but I think regex is a more elegant solution.

Answer 1

您基本上是自己编写正则表达式的：

xx|af|an|bf|bn|cf|cn

Answer 2

如前所述，您自己编写了正则表达式，可以将其简化为...

var re = /xx|[abc][fn]/

Answer 3

Try this:

^(xx|af|an|bf|bn|cf|cn)$

xx  => Correct
af  => Correct
aff => Incorrect
kk  => Incorrect

Live demo

Answer 4

You can use this code:

// regex to match your words
var re = /\b(xx|af|an|bf|bn|cf|cn)\b/g; 

// your text string
var str = 'as ww zx af ad we re an ana ';
var m;

while ((m = re.exec(str)) != null) {
    if (m.index === re.lastIndex) {
        re.lastIndex++;
    }
    // View your result using the m-variable.
    // eg m[0] etc.
}

Working demo