Detailed description of metacharacters of Regular Expressions

/	Mark the next character as a special character, a literal character, a backward reference, or an octal escape character. For example, 'n' matches the character "N". '/N' to match a linefeed. The sequence '//' matches "/", and "/(" matches "(".
^	Matches the start value of the input string. If the multiline attribute of the Regexp object is set, ^ matches the position after '/N' or'/R.
$	Matches the end position of the input string. If the multiline attribute of the Regexp object is set, $ also matches the location before '/N' or'/R.
*	Match the previous subexpressionZero or multiple times.For example, Zo * can match "Z" and "Zoo ". * Is equivalent to {0 ,}.
+	Match the previous subexpressionOne or more times. For example, Zo + can match "zo" and "Zoo", but cannot match "Z ". + Is equivalent to {1 ,}.
?	Match the previous subexpressionOnce or zero. For example, do (ES )? Can match "do" or "does ". ? It is equivalent to {0.1 }.
{N}	N is a non-negative number, and it matches the specified n times. For example, 'O {2} 'cannot match 'O' in Bob, but can match two o in "food.
{N ,}	N is a non-negative number and can be matched at least N times. For example, 'O {2} 'cannot match 'O' in Bob, but it can match all o in "foooood.
{N, m}	N, and m are both non-negative, n <m, can match at least N times, and can match m times. "O {1, 3}" will match the first three o in "foooood. "O {0, 1}" is equivalent to 'o? ', Note that there must be no space between the comma and two numbers.
?	When this character is followed by any other delimiter (*, + ,?, {N}, {n ,},{ n, m}), the matching mode is not greedy. The non-Greedy mode matches as few strings as possible, the default greedy mode matches as many searched strings as possible. For example, for strings "oooo", 'O ++? 'Will match a single "O", and 'O +' will match all 'O '.
.	Matches any single character except "/N. To match any character including "/N", use a pattern like '[./N.
(Pattren)	Match pattern and modify the match. The obtained match can be obtained from the generated mathces set. Use the submatches set in VBScript and use the $0... $9 attribute in JScript. To match the parentheses, use '/(' or '/)'.
(? : Pattern)	Matches pattern but does not get the matching result. That is to say, this is a non-get match and is not stored for future use. This is useful when you use the "or" character (|) to combine each part of a pattern. For example, 'industr (? : Y | ies) is a simpler expression than 'industry | industries. Matches pattern but does not get the matching result. That is to say, this is a non-get match and is not stored for future use. This is useful when you use the "or" character (|) to combine each part of a pattern. For example, 'industr (? : Y | ies) is a simpler expression than 'industry | industries.
(? = Pattern)	Forward pre-query: matches the search string at the beginning of any string that matches the pattern. This is a non-get match, that is, the match does not need to be obtained for future use. For example, 'windows (? = 95 | 98 | nt | 2000) 'can match "Windows" in "Windows 2000", but cannot match "Windows" in "Windows 3.1 ". Pre-query does not consume characters, that is, after a match occurs, the next matching search starts immediately after the last match, instead of starting after the pre-query characters.
(?! Pattern)	Negative pre-query: matches the search string at the beginning of any string that does not match pattern. This is a non-get match, that is, the match does not need to be obtained for future use. For example, 'windows (?! 95 | 98 | nt | 2000) 'can match "Windows" in "Windows 3.1", but cannot match "Windows" in "Windows 2000 ". Pre-query does not consume characters. That is to say, after a match occurs, the next matching search starts immediately after the last match, instead of starting after the pre-query characters.
/B	Match A Word boundary, that is, the position between a word and a space. For example, 'er/B 'can match 'er' in "never", but cannot match 'er 'in "verb '.
/B	Match non-word boundary. 'Er/B 'can match 'er' in "verb", but cannot match 'er 'in "never '.
/D	Match a numeric character. It is equivalent to [0-9].
/D	Match a non-numeric character. It is equivalent to [^ 0-9].
/F	Match a form feed. It is equivalent to/x0c and/Cl.
/N	Match A linefeed. It is equivalent to/x0a and/CJ.
/R	Match a carriage return. It is equivalent to/x0d and/cm.
/S	Matches any blank characters, including spaces, tabs, and page breaks. It is equivalent to [/f/n/R/T/V].
/S	Match any non-blank characters. It is equivalent to [^/f/n/R/T/V].
/T	Match a tab. It is equivalent to/x09 and/CI.
/V	Match a vertical tab. It is equivalent to/x0b and/ck.
/W	Match any word characters that contain underscores. It is equivalent to '[A-Za-z0-9 _]'.
/W	Match any non-word characters. It is equivalent to '[^ A-Za-z0-9 _]'.
/XN	Match n, where N is the hexadecimal escape value. The hexadecimal escape value must be determined by the length of two numbers. For example, '/x41' matches "". '/X041' is equivalent to '/x04' & "1 ". The regular expression can use ASCII encoding ..
/Num	Matches num, where num is a positive integer. References to the obtained matching. For example, '(.)/1' matches two consecutive identical characters.
/N	Identifies an octal escape value or a backward reference. If there are at least N obtained subexpressions before/N, then n is a backward reference. Otherwise, if n is an octal digit (0-7), n is an octal escape value.
/Nm	Identifies an octal escape value or a backward reference. If at least one child expression is obtained before/nm, the NM is backward referenced. If at least N records are obtained before/nm, n is a backward reference followed by text M. If none of the preceding conditions are met, if n and m are Octal numbers (0-7),/nm matches the octal escape value nm.
/NML	If n is an octal number (0-3) and M and l are Octal numbers (0-7), the octal escape value NML is matched.
/UN	Match n, where n is a Unicode character represented by four hexadecimal numbers. For example,/u00a9 matches the copyright symbol (?).