admin管理员组

文章数量:1399116

I would like to use this regular expression new RegExp("\b"+pat+"\b") in greek text but the "\b" metacharacter supports only ASCII characters.

I tried XregExp library but i didnt manage to solve the issue.

Any suggestions would be greatly appreciated.

I would like to use this regular expression new RegExp("\b"+pat+"\b") in greek text but the "\b" metacharacter supports only ASCII characters.

I tried XregExp library but i didnt manage to solve the issue.

Any suggestions would be greatly appreciated.

Share Improve this question edited Sep 1, 2012 at 5:22 slevithan 1,41414 silver badges20 bronze badges asked Apr 13, 2011 at 13:33 kylitokylito 1211 silver badge4 bronze badges 11
  • 4 possible duplicate of utf-8 word boundary regex in javascript – mplungjan Commented Apr 13, 2011 at 13:40
  • Did you use the Unicode plugin to XRegExp? – R. Martinho Fernandes Commented Apr 13, 2011 at 13:40
  • 2 Javascript does not support Unicode, even though this is the dominant character set on the web. Use a language that does, and preferably one that meets at least the Level 1 requirements for basic Unicode regular expression support. – tchrist Commented Apr 13, 2011 at 13:58
  • 1 @Martinho, as I explain in my answer, the XRegExp plug in does not correct \b to work according to the requirements of The Unicode Standard. It cannot be correctly implemented using only Unicode general categories, and even its approximation is mind-bending: (?:(?<=\w)(?!\w)|(?<!\w)(?=\w)). You would have to replace \w with [\pL\pM\p{Nd}\p{Nd}\p{Pc}] wherever it occurs there, and you couldn’t — because Javascript cannot manage to do standard lookbehinds. So that plugin cannot solve this problem. – tchrist Commented Apr 13, 2011 at 14:41
  • 1 @Tim: Because the ECMA standard — and almost all implementations — have dragged their feet for so long that they’re easily more than a decade out of date, I can think of no alternative to offloading more of the heavy-lifting to server-side back-end processing. The ICU regex library and Perl are both Level-1(plus) pliant with the Unicode Standard, so either will work fine with Unicode. Also, PHP, Ruby 1.9, and Python (and in that order) all go a substantial distance further than Javascript does towards pliance, and would at least allow for what the OP desires. Sorry there’s no good news. – tchrist Commented Apr 13, 2011 at 14:46
 |  Show 6 more ments

2 Answers 2

Reset to default 4

I think this was helpful to your answer.,

<script src="xregexp.js"></script>
<script src="xregexp-unicode-base.js"></script>
<script>
    var unicodeWord = XRegExp("^\\p{L}+$");

    unicodeWord.test("Русский"); // true
    unicodeWord.test("日本語"); // true
    unicodeWord.test("العربية"); // true
</script>

<!-- \p{L} is included in the base script, but other categories, scripts,
and blocks require token packages -->
<script src="xregexp-unicode-scripts.js"></script>
<script>
    XRegExp("^\\p{Katakana}+$").test("カタカナ"); // true
</script>

Please refer the following location : http://xregexp./plugins/

So the answer is just, that you can not use the JavaScript native mechanisms or any library which uses those mechanisms to match words the way you want to. As you already stated, \b matches words. Words must consists of word characters. And in JavaScript (and actually other regex implementations word characters are a-z, A-Z, 0-9 and _. But many other Languages just implement the \b metacharacter in a different way JavaScript does.

The answer "JavaScript does not support Unicode" is a bit to easy and in fact pletely wrong. JavaScript just doesn't use unicode for the character classes. If JavaScript wouldn't support unicode you couldn't even use unicode Characters in String literals and of course this is possible in JavaScript.

According to the ECMA 262 Standard (ECMAScript) (Section 15.10.2.6):

[...] The production Assertion :: \ b evaluates by returning an internal AssertionTester closure that takes a State argument x and performs the following:

  1. Let e be x's endIndex.
  2. Call IsWordChar(e–1) and let a be the Boolean result.
  3. Call IsWordChar(e) and let b be the Boolean result.
  4. If a is true and b is false, return true.
  5. If a is false and b is true, return true.
  6. Return false. [..]

The abstract operation IsWordChar takes an integer parameter e and performs the following:

  1. If e == –1 or e == InputLength, return false.
  2. Let c be the character Input[e].
  3. If c is one of the sixty-three characters below, return true. a b c d e f g h i j k l m n o p q r s t u v w x y z A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 0 1 2 3 4 5 6 7 8 9 _
  4. Return false

This just shows, that the \b uses the Algorithm of "isWordChar" to check if what you try to match is actually a word. Int he definition of "isWordChar" you can see the exact definition of which characters will return true for "isWordChar".

In my Opinion this has absolutely nothing to do with the character set being used. It's neither ASCII nor UNICODE pilant here. It's just these 63 characters.

本文标签: regexJavascript unicode (greek) regular expressionsStack Overflow