Comparison of Regular-Expression Engines: Comparison
View Latest Version
Please note this is a comparison between Version 1 by Sirius Huang and Version 3 by Sirius Huang.

This is a comparison of regular-expression engines.

  • regular-expression

1. Libraries

2. Languages

  1. ↑ Formerly called Regex++.
  1. ↑ Non-greedy quantifiers match as few characters as possible, instead of the default as many. Note that many older, pre-POSIX engines were non-greedy and didn't have greedy quantifiers at all.

4. API Features

  1. ↑ Also known as flags modifiers, modes modifiers or option letters
  2. ↑ 2.0 2.1
  3. ↑
  4. One of fuzzy-regular-expression engines.
  5. Shy groups, also called non-capturing
  6. ↑ Included since version 2.13.0.
  7. groups cannot be referred to with backreferences; non-capturing groups are used to speed up matching where the group's content does not need to be accessed later.
  8. . Example pattern: "(?i:test)".
  9. ↑ Also called independent sub-expressions.
  10. ↑ Backreferences enable referring to previously matched groups in later parts of the regex and/or replacement string (where applicable). For instance, ([ab]+)\1 matches "abab" but not "abaab".
  11. ↑ ICU4J, the Java version, does not support regular expressions.
  12. ↑ C++ bindings were developed by Google and became officially part of PCRE in 2006.
Licensed by the respective implementation

3. Language Features

  1. ↑ http://www.digitalmars.com/d/2.0/phobos/std_regex.html
  2. ↑ https://github.com/dotnet/corefx/blob/7116584186f8f3a886616aaf8cb5d4a982c60e27/src/System.Text.RegularExpressions/src/System/Text/RegularExpressions/Regex.cs#L2
  3. ↑ https://github.com/dotnet/corefx#license
  4. ↑
  5. ↑ Similar to back references, but with names instead of indices.
  6. http://www.boost.org/doc/libs/1_47_0/libs/regex/doc/html/boost_regex/syntax/perl_syntax.html#boost_regex.syntax.perl_syntax.recursive_expressions
  7. ↑ Special feature allowing to match balanced constructs without recursion.
  8. ↑ http://www.boost.org/doc/libs/1_47_0/doc/html/xpressive/user_s_guide.html#boost_xpressive.user_s_guide.grammars_and_nested_matches.embedding_a_regex_by_reference
  9. ↑ Refers to the possibility of including quantifiers in look-behinds, thus making their length unpredictable.
  10. ↑ 6.0 6.1
  11. ↑ 6.0 6.1 6.2 6.3 6.4
  12. FREJ have no repetitive quantifiers, but have "optional" element which behaves similar to simple "?" quantifier.
?
  1. ↑ 1.0 1.1 Means the format can be used internally without explicit conversion.
  2. ↑ Partial match of the whole regular expression. For example the pattern ".*END$" will match any string partially, but only strings ending with END fully.[1].
  3. 6.5
  4. 6.6 6.7 6.8 Unicode property support may be incomplete (products are continuously updated!). All will be incomplete when a new Unicode revision is released until they are updated to comply.
  5. ↑
  6. ↑
  7. As of ES2018
  8. Available as of ICU55.
  9. ↑ Lua's only non-greedy quantifier is -, which is a non-greedy version of *. It does not have non-greedy versions of + or ?; in the former case, the non-greedy effect can be achieved by repeating the token followed by -, but in the latter case, there is no equivalent.
  10. ↑ Supported by the optional regex library only.
  11. ↑ Available as of JDK7.
  12. ↑
  13. ↑
  14. The support and range of properties is dependent on implementation.
  15. Supports Unicode 4.0 standard from 2003; latest plans for JDK7 include Unicode 6.0 (2011) support.[2].
  16. ↑ Implementation uses original UCS-2 support/features, so it only recognizes 64K chars total (vs UTF-16's 1,112,064 characters). A Microsoft developer-representative answered a bug report on this as "will not fix" in 2010.[3].
  17. ↑
  18. ↑
  19. Experimental support added in v5.29.9.
  20. Since version 8.30.
  21. ↑ 11.0
  22. ↑ Tcl includes facilities to convert to and from UTF-8.
  23. 11.1 Supported by the optional regex library only.
  24. ↑
  25. ↑
  26. May only be available in the regex library when used with Python versions after 3.3.
  27. wxRegEx uses any system supplied POSIX library or if not available and for Unicode mode uses Henry Spencer's library.
List of regular-expression libraries
Name Official website Programming language Software license Used by
Boost.Regex[1] Boost C++ Libraries C++ Boost Notepad++ >= 6.0.0, EmEditor
Boost Xpressive Boost C++ Libraries C++ Boost  
DEELX RegExLab C++ Free personal and commercial use  
FREJ[2] Fuzzy Regular Expressions for Java Java LGPL  
GLib/GRegex[3] GLib reference manual C LGPL  
GRETA Microsoft Research C++ Microsoft  
Gregex Grovf Inc. RTL, HLS Proprietary FPGA accelerated >100Gbit/s regex engine for cybersecurity, financial, e-commerce industries.
RXP Titan IC RTL Proprietary hardware-accelerated search acceleration using RegEx available for ASIC, FPGA and cloud. Enables massively parallel content processing at ultra-high speeds.
Hyperscan Intel C, x86-specific assembly (SSSE3+[4]) 3-clause BSD Rspamd
ICU International Components for Unicode C, C++[5] ICU Foundation (Apple and Swift open-source versions)
Jakarta/Regexp The Apache Jakarta Project Java Apache  
java.util.regex Java's User manual Java GNU GPLv2 with Classpath exception jEdit
JRegex JRegex Java BSD  
MATLAB Regular Expressions MATLAB Language MATLAB, The Language of Technical Computing  
Oniguruma Kosako C BSD Atom, Take Command Console, Tera Term, TextMate, Sublime Text, SubEthaEdit, EmEditor and jq
Pattwo Stevesoft Java (compatible with Java 1.0) LGPL  
PCRE pcre.org C, C++[6] BSD Apache HTTP Server, Nginx, BBEdit, Julia, HHVM, Notepad++ < 6.0.0, PHP, Delphi, R, Exim
Qt/QRegExp Digia C++ Qt GNU GPL v. 3.0,

Qt GNU LGPL v. 2.1, Qt Commercial

 Kate, Kile
regex - Henry Spencer's regular expression libraries ArgList C BSD  
RE2 RE2 C++ BSD Go, Google Sheets, Gmail, G Suite
Henry Spencer's Advanced Regular Expressions Tcl C BSD  
RGX RGX C++ based component library P6R  
SubReg Matt Bucknall C MIT  
TPerlRegEx TPerlRegEx VCL Component Object Pascal MPLv1.1  
TRE[2] Ville Laurikari C BSD musl
TRegExpr RegExp Studio Object Pascal Dual-license: freeware, or LGPL with static linking exception Total Commander
XRegExp XRegExp JavaScript MIT  
Wolfram Language (Mathematica) Wolfram Language Documentation Center Wolfram Language   Mathematica, the Wolfram Development Platform
List of languages and frameworks including regular-expression support
LanguageOfficial websiteSoftware licenseRemarks
ActionScript 3ActionScript Technology CenterFree 
APL (APLX, Dyalog, GNU)APL WikiLicensed by the respective implementation⎕SS (PCRE), ⎕R/⎕S (PCRE), ⎕SS (PCRE2), respectively
C++11 (C++)C++ standards websiteLicensed by the respective implementationSince ISO14822:2011(e), similar to ECMAScript on default (Grammar Description)
DDBoost Software License[7] 
GoGolang.orgBSD-style 
HaskellHaskell.orgBSD3Omitted in the language report, and in GHC's Hierarchical Libraries
JavaJavaGNU General Public LicenseREs are written as strings in source code: all backslashes must be doubled, harming readability.
JavaScript (ECMAScript)ECMA-262BSD3Limited but REs are first-class citizens of the language with a specific /.../mod syntax.
JuliaJuliaLang.orgMIT LicenseREs are part of the language core library using PCRE built-in and an optional wrapper for (C code) ICU is available.
LuaLua.orgMIT LicenseUses simplified, limited dialect; can be bound to more powerful library, like PCRE or an alternative parser like LPeg.
MathematicaWolframProprietary 
.NETMSDNMIT License[8][9] 
Nimnim-lang.orgMIT LicenseStandard library includes PCRE-based re and nre modules, as well as various alternatives (ex. strutils, pegs (Parsing Expression Grammar matching), strscans, parseutils, etc.).
Free Pascal (Object Pascal)www.freepascal.orgLGPL with static linking exceptionFree Pascal 2.6+ ships with TRegExpr from Sorokin and two other regular expression libraries; See wiki.lazarus.freepascal.org/Regexpr.
OCamlCamlLGPL(As of 2010), the standard module is generally regarded as deprecated;[10] often recommended libraries are pcre (with full support for PCRE) and re (which is not as complete but claims better performance and provides frontends to popular syntaxes: PCRE, Perl, Posix, Emacs, shell globbing).
PerlPerl.comArtistic License, or GNU General Public LicenseFull, central part of the language
PHPPHP.netPHP LicenseHas two implementations, with PCRE being the more efficient in speed, functions
POSIX C (C)POSIX.1 web publicationLicensed by the respective implementationSupports POSIX BRE and ERE syntax
Pythonpython.orgPython Software Foundation LicensePython has two major implementations, the built in re and the regex library.
Rubyruby-doc.orgGNU Library General Public LicenseRuby 1.8, Ruby 1.9, and Ruby 2.0 and later versions use different engines; Ruby 1.9 integrates Oniguruma, Ruby 2.0 and later integrate Onigmo, a fork from Oniguruma.
Rustdocs.rsMIT LicenseThe primary regex crate does not allow look-around expressions. There is an Oniguruma binding called onig that does.
SAP ABAPSAP.comProprietary 
Tcltcl.tkTcl/Tk License

(BSD-style)		Tcl library doubles as a regular expression library.
Wolfram LanguageWolfram ResearchProprietary: usable for free on a limited scale on the Wolfram Development platform
 
XML SchemaW3CLicensed by the respective implementation
XPath 3/XQueryW3CLicensed by the respective implementation

2. Languages

List of languages and frameworks including regular-expression support
LanguageOfficial websiteSoftware licenseRemarks
ActionScript 3ActionScript Technology CenterFree 
APL (APLX, Dyalog, GNU)APL WikiLicensed by the respective implementation⎕SS (PCRE), ⎕R/⎕S (PCRE), ⎕SS (PCRE2), respectively
C++11 (C++)C++ standards websiteLicensed by the respective implementationSince ISO14822:2011(e), similar to ECMAScript on default (Grammar Description)
DDBoost Software License[7] 
GoGolang.orgBSD-style 
HaskellHaskell.orgBSD3Omitted in the language report, and in GHC's Hierarchical Libraries
JavaJavaGNU General Public LicenseREs are written as strings in source code: all backslashes must be doubled, harming readability.
JavaScript (ECMAScript)ECMA-262BSD3Limited but REs are first-class citizens of the language with a specific /.../mod syntax.
JuliaJuliaLang.orgMIT LicenseREs are part of the language core library using PCRE built-in and an optional wrapper for (C code) ICU is available.
LuaLua.orgMIT LicenseUses simplified, limited dialect; can be bound to more powerful library, like PCRE or an alternative parser like LPeg.
MathematicaWolframProprietary 
.NETMSDNMIT License[8][9] 
Nimnim-lang.orgMIT LicenseStandard library includes PCRE-based re and nre modules, as well as various alternatives (ex. strutils, pegs (Parsing Expression Grammar matching), strscans, parseutils, etc.).
Free Pascal (Object Pascal)www.freepascal.orgLGPL with static linking exceptionFree Pascal 2.6+ ships with TRegExpr from Sorokin and two other regular expression libraries; See wiki.lazarus.freepascal.org/Regexpr.
OCamlCamlLGPL(As of 2010), the standard module is generally regarded as deprecated;[10] often recommended libraries are pcre (with full support for PCRE) and re (which is not as complete but claims better performance and provides frontends to popular syntaxes: PCRE, Perl, Posix, Emacs, shell globbing).
PerlPerl.comArtistic License, or GNU General Public LicenseFull, central part of the language
PHPPHP.netPHP LicenseHas two implementations, with PCRE being the more efficient in speed, functions
POSIX C (C)POSIX.1 web publicationLicensed by the respective implementationSupports POSIX BRE and ERE syntax
Pythonpython.orgPython Software Foundation LicensePython has two major implementations, the built in re and the regex library.
Rubyruby-doc.orgGNU Library General Public LicenseRuby 1.8, Ruby 1.9, and Ruby 2.0 and later versions use different engines; Ruby 1.9 integrates Oniguruma, Ruby 2.0 and later integrate Onigmo, a fork from Oniguruma.
Rustdocs.rsMIT LicenseThe primary regex crate does not allow look-around expressions. There is an Oniguruma binding called onig that does.
SAP ABAPSAP.comProprietary 
Tcltcl.tkTcl/Tk License

(BSD-style)		Tcl library doubles as a regular expression library.
Wolfram LanguageWolfram ResearchProprietary: usable for free on a limited scale on the Wolfram Development platform
 
XML SchemaW3CLicensed by the respective implementation
XPath 3/XQueryW3C

3. Language Features

NOTE: An application using a library for regular expression support does not necessarily offer the full set of features of the library, e.g. GNU grep which uses PCRE does not offer lookahead support, though PCRE does.

3.1. Part 1

Language feature comparison (part 1)
 "+" quantifierNegated character classesNon-greedy quantifiers

[11]		Shy groups

[12]		RecursionLook-aheadLook-behindBackreferences

[13]		>9 indexable captures
Boost.RegexYesYesYesYesYes[14]YesYesYesYes
Boost.XpressiveYesYesYesYesYes[15]YesYesYesYes
CL-PPCREYesYesYesYesNoYesYesYesYes
EmEditorYesYesYesYesNoYesYesYesNo
FREJNo[16]NoSome[16]YesNoNoNoYesYes
GLib/GRegexYesYesYesYesYesYesYesYesYes
GNU grepYesYesYesYesNoYesYesYes?
HaskellYesYesYesYesNoYesYesYesYes
RXPYesYesYesYesNoNoNoYesYes
ICU RegexYesYesYesYesNoYesYesYesYes
JavaYesYesYesYesNoYesYesYesYes
JavaScript (ECMAScript)YesYesYesYesNoYesYes[17]YesYes
JGsoftYesYesYesYesNoYesYesYesYes
LuaYesYesSome[18]NoNoNoNoYesNo
.NETYesYesYesYesNoYesYesYesYes
OCamlYesYesNoNoNoNoNoYesNo
PCREYesYesYesYesYesYesYesYesYes
PerlYesYesYesYesYesYesYesYesYes
PHPYesYesYesYesYesYesYesYesYes
PythonYesYesYesYesYes[19]YesYesYesYes
Qt/QRegExpYesYesYesYesNoYesNoYesYes
RE2YesYesYesYesNoNoNoNoYes
Ruby / OnigmoYesYesYesYesYesYesYesYesYes
TREYesYesYesYesNoNoNoYesNo
Vim Template:Latest preview release/VimYesYesYesYesNoYesYesYesNo
RGXYesYesYesYesNoYesYesYesYes
TclYesYesYesYesNoYesYesYesYes
TRegExprYes?Yes??????
XML SchemaYesYesNoN/ANoNoNoNoN/A
XPath 3/XQueryYesYesYesYesNoNoNoYesYes
XRegExpYesYesYesYesNoYesNoYesYes

3.2. Part 2

Language feature comparison (part 21)
  D"+" quantirectives

[20]fier		 ConNegateditional character classes AtNomic groupn-greedy quantifiers

[2111]		 NamedShy capturegroups

[2212]		 CRecursiomments EmbLook-ahedded coade UnicLode property support [23]ok-behind Balackreferencing groupes

[2413]		 Var>9 iable-length look-behindndexable captures

[25]
Boost.Regex Yes Yes Yes Yes Yes[14] NoYes Some[26]Yes NoYes NoYes
Boost.Xpressive Yes NoYes Yes Yes Yes[15] NoYes NoYes NoYes NoYes
CL-PPCRE Yes Yes Yes Yes YesNo Yes Some[26]Yes NoYes NoYes
EmEditor Yes Yes ?Yes ?Yes YesNo NoYes ?Yes NoYes No
FREJ No[16] No YesSome[16] Yes YesNo No ?No NoYes NoYes
GLib/GRegex Yes Yes Yes Yes Yes NoYes Some[26]Yes NoYes NoYes
GNU grep Yes Yes ?Yes Yes YesNo NoYes NoYes NoYes No?
Haskell ?Yes ?Yes ?Yes ?Yes ?No NoYes NoYes NoYes NoYes
RXP Yes Yes NoYes Yes YesNo No No NoYes NoYes
ICU Regex Yes NoYes Yes Yes[27] YesNo NoYes Yes NoYes NoYes
Java Yes NoYes Yes Yes[28] YesNo NoYes Some[26]Yes NoYes NoYes
JavaScript (ECMAScript) NoYes NoYes NoYes NoYes No NoYes SomeYes[2617][29][30] NoYes NoYes
JGsoft Yes Yes Yes Yes YesNo NoYes Some[26]Yes NoYes Yes
Lua NoYes NoYes NoSome[18] No No No No NoYes No
.NET Yes Yes Yes Yes YesNo NoYes Some[26]Yes Yes Yes
OCaml NoYes NoYes No No No No No NoYes No
PCRE Yes Yes Yes Yes Yes Yes Yes NoYes NoYes
Perl Yes Yes Yes Yes Yes Yes Yes NoYes No[31]Yes
PHP Yes Yes Yes Yes Yes NoYes NoYes NoYes NoYes
Python Yes Yes Yes[32] Yes Yes[19] NoYes Yes[33] NoYes Yes[32]
Qt/QRegExp NoYes NoYes NoYes NoYes No NoYes No NoYes NoYes
RE2 Yes NoYes ?Yes Yes No No Some[26]No No NoYes
Ruby / Onigmo Yes Yes Yes Yes Yes Yes Some[26]Yes NoYes NoYes
TclRE Yes NoYes Yes NoYes YesNo No YesNo NoYes No
Vim TREemplate:Latest preview release/Vim Yes NoYes NoYes NoYes YesNo NoYes ?Yes NoYes No
VimRGX Yes NoYes Yes NoYes No NoYes NoYes NoYes Yes
RGXTcl Yes Yes Yes Yes YesNo NoYes Yes NoYes NoYes
XML SchTRemagExpr NoYes No? NoYes No? No? No? Yes? No? No?
XPatML Sch 3/XQueryema NoYes NoYes No NoN/A No No YesNo No NoN/A
XRPath 3/XQuegExpry Leading onlyYes NoYes NoYes Yes YesNo No YesNo NoYes NoYes
XRegExpYesYesYesYesNoYesNoYesYes

3.2. Part 2

4. API Features

API feature comparison
 Native UTF-16 support[34]Native UTF-8 support[34]Multi-line matchingPartial match[35]
Boost.RegexNoNoYesYes
GLib/GRegexYesYesYesYes
RXPYesYesNoYes
ICU RegexYesNoYes?
JavaNoPartial[36]YesYes
.NETNo[37]YesYes?
PCREYes[38]YesYesYes
Qt/QRegExpYesNoNo?
TclYesYes[39]Yes?
TREYesYesYes?
RGXNoNoYes?
wxWdigets::wxRegEx[40]YesYesYes?
XRegExpYes?Yes?
Language feature comparison (part 2)
 Directives

[20]		ConditionalsAtomic groups

[21]		Named capture

[22]		CommentsEmbedded codeUnicode property support [23]Balancing groups

[24]		Variable-length look-behinds

[25]
Boost.RegexYesYesYesYesYesNoSome[26]NoNo
Boost.XpressiveYesNoYesYesYesNoNoNoNo
CL-PPCREYesYesYesYesYesYesSome[26]NoNo
EmEditorYesYes??YesNo?NoNo
FREJNoNoYesYesYesNo?NoNo
GLib/GRegexYesYesYesYesYesNoSome[26]NoNo
GNU grepYesYes?YesYesNoNoNoNo
Haskell?????NoNoNoNo
RXPYesYesNoYesYesNoNoNoNo
ICU RegexYesNoYesYes[27]YesNoYesNoNo
JavaYesNoYesYes[28]YesNoSome[26]NoNo
JavaScript (ECMAScript)NoNoNoNoNoNoSome[26][29][30]NoNo
JGsoftYesYesYesYesYesNoSome[26]NoYes
LuaNoNoNoNoNoNoNoNoNo
.NETYesYesYesYesYesNoSome[26]YesYes
OCamlNoNoNoNoNoNoNoNoNo
PCREYesYesYesYesYesYesYesNoNo
PerlYesYesYesYesYesYesYesNoNo[31]
PHPYesYesYesYesYesNoNoNoNo
PythonYesYesYes[32]YesYesNoYes[33]NoYes[32]
Qt/QRegExpNoNoNoNoNoNoNoNoNo
RE2YesNo?YesNoNoSome[26]NoNo
Ruby / OnigmoYesYesYesYesYesYesSome[26]NoNo
TclYesNoYesNoYesNoYesNoNo
TREYesNoNoNoYesNo?NoNo
VimYesNoYesNoNoNoNoNoYes
RGXYesYesYesYesYesNoYesNoNo
XML SchemaNoNoNoNoNoNoYesNoNo
XPath 3/XQueryNoNoNoNoNoNoYesNoNo
XRegExpLeading onlyNoNoYesYesNoYesNoNo
API feature comparison
 Native UTF-16 support[34]Native UTF-8 support[34]Multi-line matchingPartial match[35]
Boost.RegexNoNoYesYes
GLib/GRegexYesYesYesYes
RXPYesYesNoYes
ICU RegexYesNoYes?
JavaNoPartial[36]YesYes
.NETNo[37]YesYes?
PCREYes[38]YesYesYes
Qt/QRegExpYesNoNo?
TclYesYes[39]Yes?
TREYesYesYes?
RGXNoNoYes?
wxWdigets::wxRegEx[40]YesYesYes?
XRegExpYes?Yes

References

  1. Formerly called Regex++.
  2. One of fuzzy-regular-expression engines.
  3. Included since version 2.13.0.
  4. https://intel.github.io/hyperscan/dev-reference/getting_started.html#requirements
  5. ICU4J, the Java version, does not support regular expressions.
  6. C++ bindings were developed by Google and became officially part of PCRE in 2006.
  7. http://www.digitalmars.com/d/2.0/phobos/std_regex.html
  8. https://github.com/dotnet/corefx/blob/7116584186f8f3a886616aaf8cb5d4a982c60e27/src/System.Text.RegularExpressions/src/System/Text/RegularExpressions/Regex.cs#L2
  9. https://github.com/dotnet/corefx#license
  10. https://stackoverflow.com/questions/3221067/regular-expressions-in-ocaml#comment3323649_3221067[4]
  11. Non-greedy quantifiers match as few characters as possible, instead of the default as many. Note that many older, pre-POSIX engines were non-greedy and didn't have greedy quantifiers at all.
  12. Shy groups, also called non-capturing groups cannot be referred to with backreferences; non-capturing groups are used to speed up matching where the group's content does not need to be accessed later.
  13. Backreferences enable referring to previously matched groups in later parts of the regex and/or replacement string (where applicable). For instance, ([ab]+)\1 matches "abab" but not "abaab".
  14. http://www.boost.org/doc/libs/1_47_0/libs/regex/doc/html/boost_regex/syntax/perl_syntax.html#boost_regex.syntax.perl_syntax.recursive_expressions
  15. http://www.boost.org/doc/libs/1_47_0/doc/html/xpressive/user_s_guide.html#boost_xpressive.user_s_guide.grammars_and_nested_matches.embedding_a_regex_by_reference
  16. FREJ have no repetitive quantifiers, but have "optional" element which behaves similar to simple "?" quantifier.
  17. As of ES2018
  18. Lua's only non-greedy quantifier is -, which is a non-greedy version of *. It does not have non-greedy versions of + or ?; in the former case, the non-greedy effect can be achieved by repeating the token followed by -, but in the latter case, there is no equivalent.
  19. Supported by the optional regex library only. https://pypi.org/project/regex/#recursive-patterns-hg-issue-27
  20. Also known as flags modifiers, modes modifiers or option letters. Example pattern: "(?i:test)".
  21. Also called independent sub-expressions.
  22. Similar to back references, but with names instead of indices.
  23. https://www.unicode.org/reports/tr18/
  24. Special feature allowing to match balanced constructs without recursion.
  25. Refers to the possibility of including quantifiers in look-behinds, thus making their length unpredictable.
  26. Unicode property support may be incomplete (products are continuously updated!). All will be incomplete when a new Unicode revision is released until they are updated to comply.
  27. Available as of ICU55.
  28. Available as of JDK7.
  29. The support and range of properties is dependent on implementation.
  30. "ECMA-262, 9th edition, June 2018 ECMAScript® 2018 Language Specification". https://www.ecma-international.org/ecma-262/9.0/#sec-runtime-semantics-unicodematchproperty-p. Retrieved 4 August 2020. 
  31. Experimental support added in v5.29.9.
  32. Supported by the optional regex library only. https://pypi.python.org/pypi/regex
  33. May only be available in the regex library when used with Python versions after 3.3.
  34. Means the format can be used internally without explicit conversion.
  35. Partial match of the whole regular expression. For example the pattern ".*END$" will match any string partially, but only strings ending with END fully.Partial match of the whole regular expression. For example the pattern ".*END$" will match any string partially, but only strings ending with END fully.[1].
  36. Supports Unicode 4.0 standard from 2003; latest plans for JDK7 include Unicode 6.0 (2011) support.Supports Unicode 4.0 standard from 2003; latest plans for JDK7 include Unicode 6.0 (2011) support.[2].
  37. Implementation uses original UCS-2 support/features, so it only recognizes 64K chars total (vs UTF-16's 1,112,064 characters). A Microsoft developer-representative answered a bug report on this as "will not fix" in 2010.Implementation uses original UCS-2 support/features, so it only recognizes 64K chars total (vs UTF-16's 1,112,064 characters). A Microsoft developer-representative answered a bug report on this as "will not fix" in 2010.[3].
  38. Since version 8.30.
  39. Tcl includes facilities to convert to and from UTF-8.
  40. wxRegEx uses any system supplied POSIX library or if not available and for Unicode mode uses Henry Spencer's library.
More
© Text is available under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/)
Video Production Service
Feedback