Javascript正则表达式-匹配多次出现

Question

我在这里遇到了一个问题。 我试图匹配一个字符串中多次出现的正则表达式，但是我没有得到所有出现的次数：

样品：

      s = new RegExp(';' + y[p][0] + '_' + y[p][1] + '_' + y[p][2] + '_([0-9]*);', 'g');
        e = null;
        e = s.exec(grArr);
        while (e != null) {
            alert(e[0]+'-'+e[1]+'-'+e[2]); //debugging output
            r = r + e[0]; //adding results to output var
            e = s.exec(grArr);
        }

Sample variables:
//to be searched:
var grArr=';0_0_709711498101583267971121121179999105110111_11994876;0_0_709711498101583267971121121179999105110111_11994877;0_0_709711498101583267971121121179999105110111_11994878;0_0_709711498101583267971121121179999105110111_11994879;0_0_709711498101583268117110107101108103114252110_11994872;0_0_709711498101583268117110107101108103114252110_11994873;0_0_709711498101583268117110107101108103114252110_11994874;0_0_709711498101583268117110107101108103114252110_11994875;0_0_7097114981015832839910411997114122_11994868;0_0_7097114981015832839910411997114122_11994869;0_0_7097114981015832839910411997114122_11994870;0_0_7097114981015832839910411997114122_11994871;0_1_71114246115115101583276_11994870;0_1_71114246115115101583276_11994874;0_1_71114246115115101583276_11994878;0_1_71114246115115101583277_11994869;0_1_71114246115115101583277_11994873;0_1_71114246115115101583277_11994877;0_1_71114246115115101583283_11994868;0_1_71114246115115101583283_11994872;0_1_71114246115115101583283_11994876;0_1_7111424611511510158328876_11994871;0_1_7111424611511510158328876_11994875;0_1_7111424611511510158328876_11994879;'
//search Pattern:
y[0][0]='0';
y[0][1]='1';
y[0][2]='71114246115115101583283';

这导致2次出现-而不是应有的3次。

Answer 1

问题是您两次使用分号：一次在正则表达式开始，一次在末尾。

由于在您的示例中，三个“匹配项”彼此直接相邻，因此未找到第二个匹配项，因为在先前的匹配项中已经使用了其前面的分号。

解决方案：使用单词边界（ '\\\\b' ）代替';' 在您的正则表达式中。