RegexMatch (String function): Difference between revisions
mNo edit summary |
|||
(7 intermediate revisions by 2 users not shown) | |||
Line 5: | Line 5: | ||
==Syntax== | ==Syntax== | ||
{{Template:String:RegexMatch syntax}} | {{Template:String:RegexMatch syntax}} | ||
===Syntax terms=== | ===Syntax terms=== | ||
<table class="syntaxTable"> | <table class="syntaxTable"> | ||
<tr><th>%number</th> | <tr><th>%number</th> | ||
<td>A variable to return the position of the character <b><i>after</i></b> the last character matched, or a zero if no characters in the method object string match the regular expression.</td></tr> | <td>A variable to return the position of the character <b><i>after</i></b> the last character matched, or a zero if no characters in the method object string match the regular expression.</td></tr> | ||
<tr><th>string</th> | <tr><th>string</th> | ||
<td>The input string, to which the regular expression <var class="term">regex</var> is applied.</td></tr> | <td>The input string, to which the regular expression <var class="term">regex</var> is applied.</td></tr> | ||
<tr><th>regex</th> | <tr><th>regex</th> | ||
<td>A string that is interpreted as a regular expression and is applied to the method object <var class="term">string</var> to determine whether the regex matches <var class="term">string</var>.</td></tr> | <td>A string that is interpreted as a regular expression and is applied to the method object <var class="term">string</var> to determine whether the regex matches <var class="term">string</var>.</td></tr> | ||
<tr><th><var>Options</var></th> | <tr><th><var>Options</var></th> | ||
<td>This is an optional, but | <td>This is an optional, but [[Notation conventions for methods#Named parameters|name required]], parameter supplying a string of single letter options, which may be specified in uppercase or lowercase, in any combination, and blank separated or not as you prefer. For more information about these options, see [[Regex_processing#Common_regex_options|Common regex options]]. | ||
</td></tr> | |||
<tr><th><var>CaptureList</var></th> | |||
<td>This argument is available for Sirius development testing purposes only. Not an ordinary user parameter.</td></tr> | |||
<tr><th><var> | |||
<td> | |||
</table> | </table> | ||
Line 36: | Line 33: | ||
==Usage notes== | ==Usage notes== | ||
<ul><li>It is strongly recommended that you protect your environment from regular expression processing demands on PDL and STBL space by setting, say, <code>UTABLE LPDLST 3000</code> and <code>UTABLE LSTBL 9000</code>. See | <ul> | ||
<li>For information about additional methods that support regular expressions, see | <li>It is strongly recommended that you protect your environment from regular expression processing demands on PDL and STBL space by setting, say, <code>UTABLE LPDLST 3000</code> and <code>UTABLE LSTBL 9000</code>. See [[Regex processing#SOUL programming considerations|SOUL programming considerations]]. | ||
<li><var>RegexMatch</var> is something of a misnomer. It does not determine if a string matches a regular expression, it determines if a string <b><i>contains</i></b> a substring that matches a regular expression. <var>RegexMatch</var> behaves more like a matching method if the regular expression is "anchored" (begins with a caret ( | |||
<li>For information about additional methods that support regular expressions, see [[Regex processing]]. | |||
<li><var>RegexMatch</var> is something of a misnomer. It does not determine if a string matches a regular expression, it determines if a string <b><i>contains</i></b> a substring that matches a regular expression. <var>RegexMatch</var> behaves more like a matching method if the regular expression is "anchored" (begins with a caret (<tt>^</tt>) and ends with a dollar sign (<tt>$</tt>)), or if the <var>C</var> option indicates XML Schema mode. | |||
</ul> | |||
==Examples== | ==Examples== | ||
===Finding the first position of one of several characters=== | |||
====Finding the first position of one of several characters==== | |||
A common programming problem is to "scan" a string, and find the first position which is one of several characters. This can be readily accomplished with <var>RegexMatch</var>; here is an example: | A common programming problem is to "scan" a string, and find the first position which is one of several characters. This can be readily accomplished with <var>RegexMatch</var>; here is an example: | ||
<p class="code">%regex = '[aeiou]'; * Scan for any vowel | <p class="code">%regex = '[aeiou]'; * Scan for any vowel | ||
Line 60: | Line 61: | ||
<ul> | <ul> | ||
<li>The position returned by <var>RegexMatch</var> is the position of the character after the first successful match. | <li>The position returned by <var>RegexMatch</var> is the position of the character after the first successful match. | ||
<li>The square brackets enclose a <b>character class</b> (<code>[aeiou]</code>), which matches any of the characters listed within it. <var>RegexMatch</var> recognizes either the [[Unicode#Code points, character set mappings|codepage 1047]] (X'AD'/X'BD') or codepage 0037 (X'BA'/X'BB') characters as square brackets. | <li>The square brackets enclose a <b>character class</b> (<code>[aeiou]</code>), which matches any of the characters listed within it. <var>RegexMatch</var> recognizes either the [[Unicode#Code points, character set mappings|codepage 1047]] (X'AD'/X'BD') or codepage 0037 (X'BA'/X'BB') characters as square brackets. | ||
<li>In many cases, this programming problem is better performed using the <var>[[StringTokenizer class|StringTokenizer]]</var>. | <li>In many cases, this programming problem is better performed using the <var>[[StringTokenizer class|StringTokenizer]]</var>. | ||
</ul> | </ul> | ||
===Finding the first position that is not one of several characters=== | ====Finding the first position that is not one of several characters==== | ||
A programming task similar to that in the preceding example is finding the position of the first character that is not one of a set of characters. This task, which is not as amenable to processing with the <var>StringTokenizer</var> as the task in the preceding example, is readily accomplished with <var>RegexMatch</var>. Here is an example: | A programming task similar to that in the preceding example is finding the position of the first character that is not one of a set of characters. This task, which is not as amenable to processing with the <var>StringTokenizer</var> as the task in the preceding example, is readily accomplished with <var>RegexMatch</var>. Here is an example: | ||
<p class="code">%regex = '[' '5F':HexToString 'aeiou]'; * Scan for any non-vowel | <p class="code">%regex = '[' '5F':HexToString 'aeiou]'; * Scan for any non-vowel | ||
%str = 'albatross' | |||
%i = %str:regexMatch(%regex) | %i = %str:regexMatch(%regex) | ||
if %i then | if %i then | ||
printText Before non-vowel: {%str:Left(%i - 2)} | printText Before non-vowel: {%str:Left(%i - 2)} | ||
Line 84: | Line 87: | ||
<p class="code">%regex = '[' '5F':HexToString 'aeiou]'</p> | <p class="code">%regex = '[' '5F':HexToString 'aeiou]'</p> | ||
This is the same as <code>%regex = '[^aeiou]'</code>; the circumflex, or "caret," (<tt>^</tt>) has the meaning of "negation" at the start of a character class. The EBCDIC code that <var>RegexMatch</var> uses for the circumflex is X'5F', as used by codepage 1047. Using the hex code point as above ensures that your regex will work whether the program was entered with codepage 1047 or 0037. | This is the same as <code>%regex = '[^aeiou]'</code>; the circumflex, or "caret," (<tt>^</tt>) has the meaning of "negation" at the start of a character class. The EBCDIC code that <var>RegexMatch</var> uses for the circumflex is X'5F', as used by codepage 1047. Using the hex code point as above ensures that your regex will work whether the program was entered with codepage 1047 or 0037. | ||
<li>The right hand side of that statement (<code>'[' '5F':HexToString 'aeiou]'</code>) uses the [[Implicit concatenation|implicit concatenation]] feature | |||
<li>This use of <var>RegexMatch</var> is like the standard <var class="product"> | <li>The right hand side of that statement (<code>'[' '5F':HexToString 'aeiou]'</code>) uses the [[Implicit concatenation|implicit concatenation]] feature. | ||
<li>This use of <var>RegexMatch</var> is like the standard <var class="product">SOUL</var> <var>$Verify</var> function, although it indicates not just whether all characters in the given string are in the regex, but also the position (plus one) of the first character that is not in the regex. | |||
</ul> | </ul> | ||
===Using some other regex features=== | ====Using some other regex features==== | ||
The following example tests whether the regex <code>\*bc?[5-8]</code> matches <code>a*b6</code> (it does, and note that it matches "in the middle" of the string). | The following example tests whether the regex <code>\*bc?[5-8]</code> matches <code>a*b6</code> (it does, and note that it matches "in the middle" of the string). | ||
<p class="code">begin | <p class="code">begin | ||
Line 110: | Line 115: | ||
</p> | </p> | ||
This regex demonstrates the following: | This regex demonstrates the following: | ||
<ul><li>To match a string, a regex pattern must merely "fit" a substring of the string. | <ul> | ||
<li>Metacharacters, in this case star ( | <li>To match a string, a regex pattern must merely "fit" a substring of the string. | ||
<li>An optional character ( | |||
<li>The character class range ( | <li>Metacharacters, in this case star (<code>*</code>), must be escaped. | ||
<li>An optional character (<code>c?</code>) may fail to find a match, but this does not prevent the success of the overall match. | |||
<li>The character class range (<code>[5-8]</code>) matches the <code>6</code> in the input string. | |||
</ul> | </ul> | ||
Line 119: | Line 128: | ||
{{Template:String:RegexMatch footer}} | {{Template:String:RegexMatch footer}} | ||
[[Category:Regular expression processing]] |
Latest revision as of 17:05, 21 January 2022
Position after match of regex (String class)
The RegexMatch intrinsic function determines whether a given pattern (regular expression, or "regex") matches within a given string according to the rules of regular expression matching.
Syntax
%number = string:RegexMatch( regex, [Options= string], - [CaptureList= stringlist]) Throws InvalidRegex
Syntax terms
%number | A variable to return the position of the character after the last character matched, or a zero if no characters in the method object string match the regular expression. |
---|---|
string | The input string, to which the regular expression regex is applied. |
regex | A string that is interpreted as a regular expression and is applied to the method object string to determine whether the regex matches string. |
Options | This is an optional, but name required, parameter supplying a string of single letter options, which may be specified in uppercase or lowercase, in any combination, and blank separated or not as you prefer. For more information about these options, see Common regex options. |
CaptureList | This argument is available for Sirius development testing purposes only. Not an ordinary user parameter. |
Exceptions
RegexMatch can throw the following exceptions:
- InvalidRegex
- If the regex parameter does not contain a valid regular expression. The exception object indicates the position of the character in the regex parameter where it was determined that the regular expression is invalid, and a description of the nature of the error.
Usage notes
- It is strongly recommended that you protect your environment from regular expression processing demands on PDL and STBL space by setting, say,
UTABLE LPDLST 3000
andUTABLE LSTBL 9000
. See SOUL programming considerations. - For information about additional methods that support regular expressions, see Regex processing.
- RegexMatch is something of a misnomer. It does not determine if a string matches a regular expression, it determines if a string contains a substring that matches a regular expression. RegexMatch behaves more like a matching method if the regular expression is "anchored" (begins with a caret (^) and ends with a dollar sign ($)), or if the C option indicates XML Schema mode.
Examples
Finding the first position of one of several characters
A common programming problem is to "scan" a string, and find the first position which is one of several characters. This can be readily accomplished with RegexMatch; here is an example:
%regex = '[aeiou]'; * Scan for any vowel %str = 'That quick brown fox' %i = %str:regexMatch(%regex) if %i then printText Before vowel: {%str:Left(%i - 2)} printText The vowel: {%str:Char(%i-1)} printText After vowel: {%str:Substring(%i)}
The result of the above fragment is:
Before vowel: Th The vowel: a After vowel: t quick brown fox
Notes:
- The position returned by RegexMatch is the position of the character after the first successful match.
- The square brackets enclose a character class (
[aeiou]
), which matches any of the characters listed within it. RegexMatch recognizes either the codepage 1047 (X'AD'/X'BD') or codepage 0037 (X'BA'/X'BB') characters as square brackets. - In many cases, this programming problem is better performed using the StringTokenizer.
Finding the first position that is not one of several characters
A programming task similar to that in the preceding example is finding the position of the first character that is not one of a set of characters. This task, which is not as amenable to processing with the StringTokenizer as the task in the preceding example, is readily accomplished with RegexMatch. Here is an example:
%regex = '[' '5F':HexToString 'aeiou]'; * Scan for any non-vowel %str = 'albatross' %i = %str:regexMatch(%regex) if %i then printText Before non-vowel: {%str:Left(%i - 2)} printText The non-vowel: {%str:Char(%i-1)} printText After non-vowel: {%str:Substring(%i)}
The result of the above fragment is:
Before non-vowel: a The non-vowel: l After non-vowel: batross
Notes:
- The regex is specified with the following less-than-obvious statement:
%regex = '[' '5F':HexToString 'aeiou]'
This is the same as
%regex = '[^aeiou]'
; the circumflex, or "caret," (^) has the meaning of "negation" at the start of a character class. The EBCDIC code that RegexMatch uses for the circumflex is X'5F', as used by codepage 1047. Using the hex code point as above ensures that your regex will work whether the program was entered with codepage 1047 or 0037. - The right hand side of that statement (
'[' '5F':HexToString 'aeiou]'
) uses the implicit concatenation feature. - This use of RegexMatch is like the standard SOUL $Verify function, although it indicates not just whether all characters in the given string are in the regex, but also the position (plus one) of the first character that is not in the regex.
Using some other regex features
The following example tests whether the regex \*bc?[5-8]
matches a*b6
(it does, and note that it matches "in the middle" of the string).
begin %rc float %regex longstring %string longstring %regex = '\*bc?[5-8]' %string = 'a*b6' %rc = %string:regexmatch(%regex) if %rc then printText '{%regex}' matches '{%string}' else printText '{%regex}' does not match '{%string}' end if end
The regex matches the input string; the example result is:
'\*bc?[5-8]' matches 'a*b6'
This regex demonstrates the following:
- To match a string, a regex pattern must merely "fit" a substring of the string.
- Metacharacters, in this case star (
*
), must be escaped. - An optional character (
c?
) may fail to find a match, but this does not prevent the success of the overall match. - The character class range (
[5-8]
) matches the6
in the input string.