A regular expression is a sequence of characters that defines a certain text pattern, typically one that one wishes to find in some large body of text.
In theoretical computer science and formal language theory, regular expressions are used to describe so-called regular languages. Since their inception in the 1950's, practical implementations of regular expressions, for instance in the text search and replace functions of text editors, have outgrown their strict scientific definition. In acknowledgement of this, and in an attempt to disambiguate, a regular expression in Raku is normally referred to as a regex (from: regular expression), a term that is also in common use in other programming languages.
In Raku, regexes are written in a domain-specific language, i.e. a sublanguage or slang. This page describes this language, and explains how regexes can be used to search for text patterns in strings in a process called pattern matching.
Lexical conventions §
Fundamentally, Raku regexes are very much like subroutines: both are code objects, and just as you can have anonymous subs and named subs, you can have anonymous and named regexes.
A regex, whether anonymous or named, is represented by a Regex object. Yet, the syntax for constructing anonymous and named Regex objects differs. We will therefore discuss them in turn.
Anonymous regex definition syntax §
An anonymous regex may be constructed in one of the following ways:
rx/pattern/; # an anonymous Regex object; 'rx' stands for 'regex' /pattern/; # an anonymous Regex object; shorthand for 'rx/.../' ; # keyword-declared anonymous regex; this form is # intended for defining named regexes and is discussed # in that context in the next sectionThe rx/ / form has two advantages over the bare shorthand form / /.
Firstly, it enables the use of delimiters other than the slash, which may be used to improve the readability of the regex definition:
rx{ '/tmp/'.* }; # the use of curly braces as delimiters makes this first rx/ '/tmp/'.* /; # definition somewhat easier on the eyes than the secondAlthough the choice is vast, not every character may be chosen as an alternative regex delimiter:
You cannot use whitespace or alphanumeric characters as delimiters. Whitespace in regex definition syntax is generally optional, except where it is required to distinguish from function call syntax (discussed hereafter).
Parentheses can be used as alternative regex delimiters, but only with a space between
rxand the opening delimiter. This is because identifiers that are immediately followed by parentheses are always parsed as a subroutine call. For example, inrx()the call operator()invokes the subroutinerx. The formrx ( abc ), however, does define aRegexobject.Use of a colon as a delimiter would clash with the use of adverbs, which take the form
:adverb; accordingly, such use of the colon is forbidden.The hash character
#is not available as a delimiter since it is parsed as the start of a comment that runs until the end of the line.
Secondly, the rx form allows you to insert regex adverbs between rx and the opening delimiter to modify the definition of the entire regex. This is equivalent to inserting the adverb at the beginning of the regex, but may be clearer:
rx:r:s/pattern/; # :r (:ratchet) and :s (:sigspace) adverbs, defining # a ratcheting regex in which whitespace is significant rx/:r:s pattern/; # Same, but possibly less readableAlthough anonymous regexes are not, as such, named, they may effectively be given a name by putting them inside a named variable, after which they can be referenced, both outside of an embedding regex and from within an embedding regex by means of interpolation:
my = / R \w+ /;say "Zen Buddhists like Raku too" ~~ ; # OUTPUT: «｢Raku｣» my = /pottery/;"Japanese pottery rocks!" ~~ / /; # Interpolation of $regex into /.../ say $/; # OUTPUT: «｢pottery｣»Named regex definition syntax §
A named regex may be constructed using the regex declarator as follows:
; # a named Regex object, named 'R'Unlike with the rx form, you cannot chose your preferred delimiter: curly braces are mandatory. In this regard it should be noted that the definition of a named regex using the regex form is syntactically similar to the definition of a subroutine:
my sub S ; # definition of Sub object (returning a Regex) my ; # definition of Regex objectwhich emphasizes the fact that a Regex object represents code rather than data:
~~ Code; # OUTPUT: «True» ~~ Code; # OUTPUT: «True» ~~ Method; # OUTPUT: «True» (A Regex is really a Method!) Also unlike with the rx form for defining an anonymous regex, the definition of a named regex using the regex keyword does not allow for adverbs to be inserted before the opening delimiter. Instead, adverbs that are to modify the entire regex pattern may be included first thing within the curly braces:
; # :i (:ignorecase), renders pattern case insensitiveAlternatively, by way of shorthand, it is also possible (and recommended) to use the rule and token variants of the regex declarator for defining a Regex when the :ratchet and :sigspace adverbs are of interest:
; # apply :r (:ratchet) to entire pattern and, alternatively
; # same thing: 'token' implies ':r' Or
; # apply :r (:ratchet) and :s (:sigspace) to pattern with this alternative:
; # same thing: 'rule' implies ':r:s' Named regexes may be used as building blocks for other regexes, as they are methods that may called from within other regexes using the <regex-name> syntax. When they are used this way, they are often referred to as subrules; see for more details on their use here. Grammars are the natural habitat of subrules, but many common predefined character classes are also implemented as named regexes.
Regex readability: whitespace and comments §
Whitespace in regexes is ignored unless the :sigspace adverb is used to make whitespace syntactically significant.
In addition to whitespace, comments may be used inside of regexes to improve their comprehensibility just as in code in general. This is true for both single line comments and multi line/embedded comments:
my = rx/ \d ** 4 #`(match the year YYYY) '-' \d ** 2 # ...the month MM '-' \d ** 2 /; # ...and the day DD say '2015-12-25'.match(); # OUTPUT: «｢2015-12-25｣»Match syntax §
There are a variety of ways to match a string against a regex. Irrespective of the syntax chosen, a successful match results in a Match object. In case the match is unsuccessful, the result is Nil. In either case, the result of the match operation is available via the special match variable $/.
The most common ways to match a string against an anonymous regex /pattern/ or against a named regex R include the following:
Smartmatch: "string" ~~ /pattern/, or "string" ~~ /<R>/
Smartmatching a string against a
Regexperforms a regex match of the string against theRegex:say "Go ahead, make my day." ~~ / \w+ /; # OUTPUT: «｢Go｣»my ;say "You talkin' to me?" ~~ / /; # OUTPUT: «｢me｣ R => ｢me｣»say "May the force be with you." ~~ ; # OUTPUT: «｢you｣»The different outputs of the last two statements show that these two ways of smartmatching against a named regex are not identical. The difference arises because the method call
<R>from within the anonymous regex/ /installs a so-called 'named capture' in theMatchobject, while the smartmatch against the namedRegexas such does not.Explicit topic match: m/pattern/, or m/<R>/
The match operator
m/ /immediately matches the topic variable$_against the regex following them.As with the
rx/ /syntax for regex definitions, the match operator may be used with adverbs in betweenmand the opening regex delimiter, and with delimiters other than the slash. However, while therx/ /syntax may only be used with regex adverbs that affect the compilation of the regex, them/ /syntax may additionally be used with matching adverbs that determine how the regex engine is to perform pattern matching.Here's an example that illustrates the primary difference between the
m/ /and/ /syntax:my ;= "abc";= m/.+/; say ; say .^name; # OUTPUT: «｢abc｣Match»= /.+/; say ; say .^name; # OUTPUT: «/.+/Regex»Implicit topic match in sink and Boolean contexts
In case a
Regexobject is used in sink context, or in a context in which it is coerced toBool, the topic variable$_is automatically matched against it:= "dummy string"; # Set the topic explicitlyrx/ s.* /; # Regex object in sink context matches automaticallysay $/; # OUTPUT: «｢string｣»say $/ if rx/ d.* /; # Regex object in Boolean context matches automatically# OUTPUT: «｢dummy string｣»Match method: "string".match: /pattern/, or "string".match: /<R>/
The
matchmethod is analogous to them/ /operator discussed above. Invoking it on a string, with aRegexas an argument, matches the string against theRegex.Parsing grammars: grammar-name.parse($string)
Although parsing a Grammar involves more than just matching a string against a regex, this powerful regex-based text destructuring tool can't be left out from this overview of common pattern matching methods.
If you feel that your needs exceed what simple regexes have to offer, check out this grammar tutorial to take regexes to the next level.
Literals and metacharacters §
A regex describes a pattern to be matched in terms of literals and metacharacters. Alphanumeric characters and the underscore _ constitute the literals: these characters match themselves and nothing else. Other characters act as metacharacters and may, as such, have a special meaning, either by themselves (such as the dot ., which serves as a wildcard) or together with other characters in larger metasyntactic constructs (such as <?before ...>, which defines a lookahead assertion).
In its simplest form a regex comprises only literals:
/Cześć/; # "Hello" in Polish /こんばんは/; # "Good afternoon" in Japanese /Καλησπέρα/; # "Good evening" in GreekIf you want a regex to literally match one or more characters that normally act as metacharacters, those characters must either be escaped using a backslash, or be quoted using single or double quotes.
The backslash serves as a switch. It switches a single metacharacter into a literal, and vice versa:
/ \# /; # matches the hash metacharacter literally / \w /; # turns literal 'w' into a character class (see below) /Hallelujah\!/; # matches string 'Hallelujah!' incl. exclamation markEven if a metacharacter does not (yet) have a special meaning in Raku, escaping (or quoting) it is required to ensure that the regex compiles and matches the character literally. This allows the clear distinction between literals and metacharacters to be maintained. So, for instance, to match a comma this will work:
/ \, /; # matches a literal comma ','while this will fail:
/ , /; # !! error: an as-yet meaningless/unrecognized metacharacter
# does not automatically match literally
While an escaping backslash exerts its effect on the next individual character, both a single metacharacter and a sequence of metacharacters may be turned into literally matching strings by quoting them in single or double quotes:
/ "abc" /; # quoting literals does not make them more literal / "Hallelujah!" /; # yet, this form is generally preferred over /Hallelujah\!/ / "two words" /; # quoting a space renders it significant, so this matches # the string 'two words' including the intermediate space / '#!:@' /; # this regex matches the string of metacharacters '#!:@'Quoting does not simply turn every metacharacter into a literal, however. This is because quotes allow for backslash-escapes and interpolation. Specifically: in single quotes, the backslash may be used to escape single quotes and the backslash itself; double quotes additionally enable the interpolation of variables, and of code blocks of the form {...}. Hence all of this works:
/ '\\\'' /; # matches a backslash followed by a single quote: \' my = 'Hi';/ "$x there!" /; # matches the string 'Hi there!' / "1 + 1 = {1+1}" /; # matches the string '1 + 1 = 2'while these examples illustrate mistakes that you will want to avoid:
/ '\' /; # !! error: this is NOT the way to literally match a
# backslash because now it escapes the second quote
/"Price tag $0.50"/; # !! error: "$0" is interpreted as the first positional
# capture (which is Nil), not as '$0'
Strings are searched left to right, so it is enough if only part of the string matches the regex:
if 'Life, the Universe and Everything' ~~ / and / ;Match results are always stored in the $/ variable and are also returned from the match. They are both of type Match if the match was successful; otherwise both are of type Nil.
Wildcards §
An unescaped dot . in a regex matches any single character.
So, these all match:
'raku' ~~ /rak./; # matches the whole string 'raku' ~~ / rak . /; # the same; whitespace is ignored 'raku' ~~ / ra.u /; # the . matches the k 'raker' ~~ / rak. /; # the . matches the ewhile this doesn't match:
'raku' ~~ / . rak /;because there's no character to match before rak in the target string.
Notably . also matches a logical newline \n:
my = qq:to/END/ Although I am a multi-line text, I can be matched with /.*/. END ; say ~~ / .* /;# OUTPUT: «｢Although I am amulti-line text,I can be matchedwith /.*/.｣»Character classes §
Backslashed character classes §
There are predefined character classes of the form \w. Its negation is written with an upper-case letter, \W.
\n and \N
§
\n matches a logical newline. \N matches a single character that's not a logical newline.
The definition of what constitutes a logical newline follows the Unicode definition of a line boundary and includes in particular all of: a line feed (LF) \U+000A, a vertical tab (VT) \U+000B, a form feed (FF) \U+000C, a carriage return (CR) \U+000D, and the Microsoft Windows style newline sequence CRLF.
The interpretation of \n in regexes is independent of the value of the variable $?NL controlled by the newline pragma.
\t and \T
§
\t matches a single tab/tabulation character, U+0009. \T matches a single character that is not a tab.
Note that exotic tabs like the U+000B VERTICAL TABULATION character are not included here.
\h and \H
§
\h matches a single horizontal whitespace character. \H matches a single character that is not a horizontal whitespace character.
Examples of horizontal whitespace characters are
U+0020 SPACE U+00A0 NO-BREAK SPACE U+0009 CHARACTER TABULATION U+2001 EM QUAD
Vertical whitespace such as newline characters are explicitly excluded; those can be matched with \v; \s matches any kind of whitespace.
\v and \V
§
\v matches a single vertical whitespace character. \V matches a single character that is not vertical whitespace.
Examples of vertical whitespace characters:
U+000A LINE FEED U+000B VERTICAL TABULATION U+000C FORM FEED U+000D CARRIAGE RETURN U+0085 NEXT LINE U+2028 LINE SEPARATOR U+2029 PARAGRAPH SEPARATOR
Use \s to match any kind of whitespace, not just vertical whitespace.
\s and \S
§
\s matches a single whitespace character. \S matches a single character that is not whitespace.
say $/.prematch if 'Match the first word.' ~~ / \s+ /;# OUTPUT: «Match»\d and \D
§
\d matches a single decimal digit (Unicode General Category Number, Decimal Digit, Nd); conversely, \D matches a single character that is not a decimal digit.
'ab42' ~~ /\d/ and say ~$/; # OUTPUT: «4» 'ab42' ~~ /\D/ and say ~$/; # OUTPUT: «a»Note that not only the Arabic digits (commonly used in the Latin alphabet) match \d, but also decimal digits from other scripts.
Examples of decimal digits include:
U+0035 5 DIGIT FIVE U+0BEB ௫ TAMIL DIGIT FIVE U+0E53 ๓ THAI DIGIT THREE U+17E5 ៥ KHMER DIGIT FIVE
Also note that "decimal digit" is a narrower category than "Number" because (Unicode) numbers include not only decimal numbers (Nd) but also letter numbers (Nl) and other numbers (No) Examples of Unicode numbers that are not decimal digits include:
U+2464 ⑤ CIRCLED DIGIT FIVE U+2476 ⑶ PARENTHESIZED DIGIT THREE U+2083 ₃ SUBSCRIPT THREE
To match against all numbers, you can use the Unicode property N:
say '⑤' ~~ // # OUTPUT: «｢⑤｣»\w and \W
§
\w matches a single word character, i.e. a letter (Unicode category L), a digit or an underscore. \W matches a single character that is not a word character.
Examples of word characters:
0041 A LATIN CAPITAL LETTER A 0031 1 DIGIT ONE 03B4 δ GREEK SMALL LETTER DELTA 03F3 ϳ GREEK LETTER YOT 0409 Љ CYRILLIC CAPITAL LETTER LJE
\c and \C
§
\c takes a parameter delimited by square-brackets which is the name of a Unicode character as it appears in the Unicode Character Database (UCD) and matches that specific character. For example:
'a.b' ~~ /\c[FULL STOP]/ and say ~$/; # OUTPUT: «.»\C matches a single character that is not the named Unicode character.
Note that the word "character" is used, here, in the sense that the UCD does, but because Raku uses NFG, combining code points and the base characters to which they are attached, will generally not match individually. For example if you compose "ü" as "u\x[0308]", that works just fine, but matching may surprise you:
say "u\x[0308]" ~~ /\c[LATIN SMALL LETTER U]/; # OUTPUT: «Nil»To match the unmodified character, you can use the :ignoremark adverb.
\x and \X
§
\x takes a parameter delimited by square-brackets which is the hexadecimal representation of the Unicode codepoint representing the character to be matched. For example:
'a.b' ~~ /\x[2E]/ and say ~$/; # OUTPUT: «.»\X matches a single character that is not the given Unicode codepoint.
In addition, \x and \X can be used without square brackets, in which case, any characters that follow the x or X that are valid hexadecimal digits will be consumed. This means that all of these are equivalent:
/\x2e/ and /\x002e/ and /\x00002e/But this format can be ambiguous, so the use of surrounding whitespace is highly recommended in non-trivial expressions.
For additional provisos with respect to combining codepoints, see \c and \C.
Predefined character classes §
| Class | Shorthand | Description |
|---|---|---|
| <alpha> | Alphabetic characters plus underscore (_) | |
| <digit> | \d | Decimal digits |
| <xdigit> | Hexadecimal digit [0-9A-Fa-f] | |
| <alnum> | \w | <alpha> plus <digit> |
| <punct> | Punctuation and Symbols (only Punct beyond ASCII) | |
| <graph> | <alnum> plus <punct> | |
| <space> | \s | Whitespace |
| <cntrl> | Control characters | |
| <print> | <graph> plus <space>, but no <cntrl> | |
| <blank> | \h | Horizontal whitespace |
| <lower> | <:Ll> | Lowercase characters |
| <upper> | <:Lu> | Uppercase characters |
The predefined character classes in the leftmost column are all of the form <name>, a hint to the fact that they are implemented as built-in named regexes. As such they are subject to the usual capturing semantics. This means that if a character class is called with the syntax <name> (i.e. as indicated in the leftmost column), it will not only match, but also capture, installing a correspondingly named 'named capture' in the resulting Match object. In case just a match and no capture is desired, the capture may be suppressed through the use of call syntax that includes a leading dot: <.name>.
Predefined Regexes §
Besides the built-in character classes, the following other rules are built into Raku:
| Regex |Zero-width | Matches | |
|---|---|---|
| <same> | yes | Matches between two identical characters |
| <wb> | yes | Word boundary |
| <ws> | no | Whitespace, same as C« <!ww>\s* » |
| <ww> | yes | Within word |
| <ident> | no | Basic identifier (no support for C<'> or C<->). Same as C« <.alpha> \w* » |
Unicode properties §
The character classes mentioned so far are mostly for convenience; another approach is to use Unicode character properties. These come in the form <:property>, where property can be a short or long Unicode General Category name. These use pair syntax.
To match against a Unicode property you can use either smartmatch or uniprop:
"a".uniprop('Script'); # OUTPUT: «Latin» "a" ~~ / > /; # OUTPUT: «｢a｣» "a".uniprop('Block'); # OUTPUT: «Basic Latin» "a" ~~ / /; # OUTPUT: «｢a｣»These are the Unicode general categories used for matching:
| Short | Long |
|---|---|
| L | Letter |
| LC | Cased_Letter |
| Lu | Uppercase_Letter |
| Ll | Lowercase_Letter |
| Lt | Titlecase_Letter |
| Lm | Modifier_Letter |
| Lo | Other_Letter |
| M | Mark |
| Mn | Nonspacing_Mark |
| Mc | Spacing_Mark |
| Me | Enclosing_Mark |
| N | Number |
| Nd | Decimal_Number or digit |
| Nl | Letter_Number |
| No | Other_Number |
| P | Punctuation or punct |
| Pc | Connector_Punctuation |
| Pd | Dash_Punctuation |
| Ps | Open_Punctuation |
| Pe | Close_Punctuation |
| Pi | Initial_Punctuation |
| Pf | Final_Punctuation |
| Po | Other_Punctuation |
| S | Symbol |
| Sm | Math_Symbol |
| Sc | Currency_Symbol |
| Sk | Modifier_Symbol |
| So | Other_Symbol |
| Z | Separator |
| Zs | Space_Separator |
| Zl | Line_Separator |
| Zp | Paragraph_Separator |
| C | Other |
| Cc | Control or cntrl |
| Cf | Format |
| Cs | Surrogate |
| Co | Private_Use |
| Cn | Unassigned |
For example, <:Lu> matches a single, upper-case letter.
Its negation is this: <:!property>. So, <:!Lu> matches a single character that is not an upper-case letter.
Categories can be used together, with an infix operator:
| Operator | Meaning |
|---|---|
| + | set union |
| - | set difference |
To match either a lower-case letter or a number, write <:Ll+:N> or <:Ll+:Number> or <+ :Lowercase_Letter + :Number>.
It's also possible to group categories and sets of categories with parentheses; for example:
say $0 if 'raku9' ~~ /\w+()/ # OUTPUT: «｢9｣»Enumerated character classes and ranges §
Sometimes the pre-existing wildcards and character classes are not enough. Fortunately, defining your own is fairly simple. Within <[ ]>, you can put any number of single characters and ranges of characters (expressed with two dots between the end points), with or without whitespace.
"abacabadabacaba" ~~ / * /;# Unicode hex codepoint range "ÀÁÂÃÄÅÆ" ~~ / * /;# Unicode named codepoint range "αβγ" ~~ /*/;# Non-alphanumeric '$@%!' ~~ /+/ # OUTPUT: «｢$@%!｣»As the last line above illustrates, within <[ ]> you do not need to quote or escape most non-alphanumeric characters the way you do in regex text outside of <[ ]>. You do, however, need to escape the much smaller set of characters that have special meaning within <[ ]>, such as \, [, and ].
To escape characters that would have some meaning inside the <[ ]>, precede the character with a \.
say "[ hey ]" ~~ /+/; # OUTPUT: «｢hey｣»You do not have the option of quoting special characters inside a <[ ]> – a ' just matches a literal '.
Within the < > you can use + and - to add or remove multiple range definitions and even mix in some of the Unicode categories above. You can also write the backslashed forms for character classes between the [ ].
/ /;# starts with \d and removes odd ASCII digits, but not quite the same as / /;# because the first one also contains "weird" unicodey digitsYou can include Unicode properties in the list as well:
//# Any character with "Zs" property, or a tab, but not a "no-break space"To negate a character class, put a - after the opening angle bracket:
say 'no quotes' ~~ / + /; # <-["]> matches any character except "A common pattern for parsing quote-delimited strings involves negated character classes:
say '"in quotes"' ~~ / '"' * '"'/;This regex first matches a quote, then any characters that aren't quotes, and then a quote again. The meaning of * and + in the examples above are explained in the next section on quantifiers.
Just as you can use the - for both set difference and negation of a single value, you can also explicitly put a + in front:
/ / # same as <[123]>Quantifiers §
A quantifier makes the preceding atom match a variable number of times. For example, a+ matches one or more a characters.
Quantifiers bind tighter than concatenation, so ab+ matches one a followed by one or more bs. This is different for quotes, so 'ab'+ matches the strings ab, abab, ababab etc.
One or more: +
§
The + quantifier makes the preceding atom match one or more times, with no upper limit.
For example, to match strings of the form key=value, you can write a regex like this:
/ \w+ '=' \w+ /Zero or more: *
§
The * quantifier makes the preceding atom match zero or more times, with no upper limit.
For example, to allow optional whitespace between a and b you can write:
/ a \s* b /Zero or one: ?
§
The ? quantifier makes the preceding atom match zero or once.
For example, to match dog or dogs, you can write:
/ dogs? /General quantifier: ** min..max
§
To quantify an atom an arbitrary number of times, use the ** quantifier, which takes a single Int or a Range on the right-hand side that specifies the number of times to match. If a Range is specified, the end-points specify the minimum and maximum number of times to match.
say 'abcdefg' ~~ /\w ** 4/; # OUTPUT: «｢abcd｣» say 'a' ~~ /\w ** 2..5/; # OUTPUT: «Nil» say 'abc' ~~ /\w ** 2..5/; # OUTPUT: «｢abc｣» say 'abcdefg' ~~ /\w ** 2..5/; # OUTPUT: «｢abcde｣» say 'abcdefg' ~~ /\w ** 2^..^5/; # OUTPUT: «｢abcd｣» say 'abcdefg' ~~ /\w ** ^3/; # OUTPUT: «｢ab｣» say 'abcdefg' ~~ /\w ** 1..*/; # OUTPUT: «｢abcdefg｣» Only basic literal syntax for the right-hand side of the quantifier is supported, to avoid ambiguities with other regex constructs. If you need to use a more complex expression, for example, a Range made from variables, enclose the Range in curly braces:
my = 3;say 'abcdefg' ~~ /\w ** /; # OUTPUT: «｢abcde｣» say 'abcdefg' ~~ /\w ** /; # OUTPUT: «｢abc｣» Negative values are treated like zero:
say 'abcdefg' ~~ /\w ** /; # OUTPUT: «｢｣» say 'abcdefg' ~~ /\w ** /; # OUTPUT: «｢｣» say 'abcdefg' ~~ /\w ** /; # OUTPUT: «｢｣» say 'abcdefg' ~~ /\w ** /; # OUTPUT: «｢｣» If then, the resultant value is Inf or NaN or the resultant Range is empty, non-Numeric, contains NaN end-points, or has minimum effective end-point as Inf, the X::Syntax::Regex::QuantifierValue exception will be thrown:
(try say 'abcdefg' ~~ /\w ** / ) orelse say ($!.^name, $!.empty-range); # OUTPUT: «(X::Syntax::Regex::QuantifierValue True)» (try say 'abcdefg' ~~ /\w ** /) orelse say ($!.^name, $!.inf); # OUTPUT: «(X::Syntax::Regex::QuantifierValue True)» (try say 'abcdefg' ~~ /\w ** / ) orelse say ($!.^name, $!.non-numeric-range); # OUTPUT: «(X::Syntax::Regex::QuantifierValue True)» (try say 'abcdefg' ~~ /\w ** /) orelse say ($!.^name, $!.non-numeric-range); # OUTPUT: «(X::Syntax::Regex::QuantifierValue True)» (try say 'abcdefg' ~~ /\w ** /) orelse say ($!.^name, $!.inf); # OUTPUT: «(X::Syntax::Regex::QuantifierValue True)» (try say 'abcdefg' ~~ /\w ** /) orelse say ($!.^name, $!.non-numeric); # OUTPUT: «(X::Syntax::Regex::QuantifierValue True)» Modified quantifier: %, %%
§
To more easily match things like comma separated values, you can tack on a % modifier to any of the above quantifiers to specify a separator that must occur between each of the matches. For example, a+ % ',' will match a or a,a or a,a,a, etc. To also match trailing delimiters ( a, or a,a, ), you can use %% instead of %.
The quantifier interacts with % and controls the number of overall repetitions that can match successfully, so a* % ',' also matches the empty string. If you want match words delimited by commas, you might need to nest an ordinary and a modified quantifier:
say so 'abc,def' ~~ / ^ [\w+] ** 1 % ',' $ /; # Output: «False» say so 'abc,def' ~~ / ^ [\w+] ** 2 % ',' $ /; # Output: «True» Preventing backtracking: :
§
One way to prevent backtracking is through the use of the ratchet adverb as described below. Another more fine-grained way of preventing backtracking in regexes is attaching a : modifier to a quantifier:
my = "ACG GCT ACT An interesting chain";say ~~ /+ \s+ (+)/;# OUTPUT: «｢ACG GCT ACT An interesting chain｣ 0 => ｢An interesting chain｣» say ~~ /+: \s+ (+)/;# OUTPUT: «Nil» In the second case, the A in An had already been "absorbed" by the pattern, preventing the matching of the second part of the pattern, after \s+. Generally we will want the opposite: prevent backtracking to match precisely what we are looking for.
In most cases, you will want to prevent backtracking for efficiency reasons, for instance here:
say ~~ m:g/[( **: 3) \s*]+ \s+ (+)/;# OUTPUT: # «(｢ACG GCT ACT An interesting chain｣ # «0 => ｢ACG｣» # «0 => ｢GCT｣» # «0 => ｢ACT｣» # «1 => ｢An interesting chain｣)» Although in this case, eliminating the : from behind ** would make it behave exactly in the same way. The best use is to create tokens that will not be backtracked:
= "ACG GCT ACT IDAQT";say m:g/[(\w+:) \s*]+ (\w+) $$/;# OUTPUT: # «(｢ACG GCT ACT IDAQT｣» # «0 => ｢ACG｣» # «0 => ｢GCT｣» # «0 => ｢ACT｣» # «1 => ｢IDAQT｣)»Without the : following \w+, the ID part captured would have been simply T, since the pattern would go ahead and match everything, leaving a single letter to match the \w+ expression at the end of the line.
Greedy versus frugal quantifiers: ?
§
By default, quantifiers request a greedy match:
'abababa' ~~ /a .* a/ && say ~$/; # OUTPUT: «abababa» You can attach a ? modifier to the quantifier to enable frugal matching:
'abababa' ~~ /a .*? a/ && say ~$/; # OUTPUT: «aba» You can also enable frugal matching for general quantifiers:
say '/foo/o/bar/' ~~ /\/.**?\//; # OUTPUT: «｢/foo/｣» say '/foo/o/bar/' ~~ /\/.**!\//; # OUTPUT: «｢/foo/o/bar/｣»Greedy matching can be explicitly requested with the ! modifier.
Alternation: ||
§
To match one of several possible alternatives, separate them by ||; the first matching alternative wins.
For example, ini files have the following form:
[section] key = value
Hence, if you parse a single line of an ini file, it can be either a section or a key-value pair and the regex would be (to a first approximation):
/ '[' \w+ ']' || \S+ \s* '=' \s* \S* /That is, either a word surrounded by square brackets, or a string of non-whitespace characters, followed by zero or more spaces, followed by the equals sign =, followed again by optional whitespace, followed by another string of non-whitespace characters.
An empty string as the first branch is ignored, to allow you to format branches consistently. You could have written the previous example as
/|| '[' \w+ ']'|| \S+ \s* '=' \s* \S*/Even in non-backtracking contexts, the alternation operator || tries all the branches in order until the first one matches.
Longest alternation: |
§
In short, in regex branches separated by |, the longest token match wins, independent of the textual ordering in the regex. However, what | really does is more than that. It does not decide which branch wins after finishing the whole match, but follows the longest-token matching (LTM) strategy.
Briefly, what | does is this:
First, select the branch which has the longest declarative prefix.
say "abc" ~~ /ab | a.* /; # Output: «⌜abc⌟» say "abc" ~~ /ab | a .* /; # Output: «⌜ab⌟» say "if else" ~~ / if | if else /; # Output: «｢if｣» say "if else" ~~ / if | if \s+ else /; # Output: «｢if else｣»As is shown above, a.* is a declarative prefix, while a {} .* terminates at {}, then its declarative prefix is a. Note that non-declarative atoms terminate declarative prefix. This is quite important if you want to apply | in a rule, which automatically enables :s, and <.ws> accidentally terminates declarative prefix.
If it's a tie, select the match with the highest specificity.
say "abc" ~~ /a. | ab /; # Output: «win｢ab｣»When two alternatives match at the same length, the tie is broken by specificity. That is, ab, as an exact match, counts as closer than a., which uses character classes.
If it's still a tie, use additional tie-breakers.
say "abc" ~~ /a\w| a. /; # Output: «⌜ab⌟»If the tie breaker above doesn't work, then the textually earlier alternative takes precedence.
For more details, see the LTM strategy.
Quoted lists are LTM matches §
Using a quoted list in a regex is equivalent to specifying the longest-match alternation of the list's elements. So, the following match:
say 'food' ~~ //; # OUTPUT: «｢food｣»is equivalent to:
say 'food' ~~ / f | fo | foo | food /; # OUTPUT: «｢food｣»Note that the space after the first < is significant here: <food> calls the named rule food while < food > and < food> specify quoted lists with a single element, 'food'.
If the first branch is an empty string, it is ignored. This allows you to format your regexes consistently:
/| f| fo| foo| food/Arrays can also be interpolated into a regex to achieve the same effect:
my = <f fo foo food>;say 'food' ~~ /@increasingly-edible/; # OUTPUT: «｢food｣»This is documented further under Regex Interpolation, below.
Conjunction: &&
§
Matches successfully if all &&-delimited segments match the same substring of the target string. The segments are evaluated left to right.
This can be useful for augmenting an existing regex. For example if you have a regex quoted that matches a quoted string, then / <quoted> && <-[x]>* / matches a quoted string that does not contain the character x.
Note that you cannot easily obtain the same behavior with a lookahead, that is, a regex doesn't consume characters, because a lookahead doesn't stop looking when the quoted string stops matching.
say 'abc' ~~ / && . /; # OUTPUT: «Nil» say 'abc' ~~ / . && . /; # OUTPUT: «｢a｣» say 'abc' ~~ / . /; # OUTPUT: «｢a｣» say 'abc' ~~ / .. /; # OUTPUT: «｢ab｣» Just like with ||, empty first branches are ignored.
Conjunction: &
§
Much like && in a Regexes, it matches successfully if all segments separated by & match the same part of the target string.
& (unlike &&) is considered declarative, and notionally all the segments can be evaluated in parallel, or in any order the compiler chooses.
Just like with || and &, empty first branches are ignored.
Anchors §
Regexes search an entire string for matches. Sometimes this is not what you want. Anchors match only at certain positions in the string, thereby anchoring the regex match to that position.
Start of string and end of string §
The ^ anchor only matches at the start of the string:
say so 'karakul' ~~ / raku/; # OUTPUT: «True» say so 'karakul' ~~ /^ raku/; # OUTPUT: «False» say so 'rakuy' ~~ /^ raku/; # OUTPUT: «True» say so 'raku' ~~ /^ raku/; # OUTPUT: «True»The $ anchor only matches at the end of the string:
say so 'use raku' ~~ / raku /; # OUTPUT: «True» say so 'use raku' ~~ / raku $/; # OUTPUT: «True» say so 'rakuy' ~~ / raku $/; # OUTPUT: «False»You can combine both anchors:
say so 'use raku' ~~ /^ raku $/; # OUTPUT: «False» say so 'raku' ~~ /^ raku $/; # OUTPUT: «True»Keep in mind that ^ matches the start of a string, not the start of a line. Likewise, $ matches the end of a string, not the end of a line.
The following is a multi-line string:
my = chomp # 'safe' is at the end of the string say so ~~ /safe $/; # OUTPUT: «True» # 'secret' is at the end of a line, not the string say so ~~ /secret $/; # OUTPUT: «False» # 'Keep' is at the start of the string say so ~~ /^Keep /; # OUTPUT: «True» # 'and' is at the start of a line -- not the string say so ~~ /^and /; # OUTPUT: «False»Start of line and end of line §
The ^^ anchor matches at the start of a logical line. That is, either at the start of the string, or after a newline character. However, it does not match at the end of the string, even if it ends with a newline character.
The $$ anchor matches at the end of a logical line. That is, before a newline character, or at the end of the string when the last character is not a newline character.
To understand the following example, it's important to know that the q:to/EOS/...EOS heredoc syntax removes leading indention to the same level as the EOS marker, so that the first, second and last lines have no leading space and the third and fourth lines have two leading spaces each.
my = # 'There' is at the start of string say so ~~ /^^ There/; # OUTPUT: «True» # 'limericks' is not at the start of a line say so ~~ /^^ limericks/; # OUTPUT: «False» # 'as' is at start of the last line say so ~~ /^^ as/; # OUTPUT: «True» # there are blanks between start of line and the "When" say so ~~ /^^ When/; # OUTPUT: «False» # 'Japan' is at end of first line say so ~~ / Japan $$/; # OUTPUT: «True» # there's a . between "scan" and the end of line say so ~~ / scan $$/; # OUTPUT: «False» # matched at the last line say so ~~ / '."' $$/; # OUTPUT: «True»Word boundary §
To match any word boundary, use <|w> or <?wb>. This is similar to \b in other languages. To match the opposite, any character that is not bounding a word, use <!|w> or <!wb>. This is similar to \B in other languages; \b and \B will throw an X::Obsolete exception from version 6.d of Raku.
These are both zero-width regex elements.
say "two-words" ~~ / two\-words /; # OUTPUT: «｢two-words｣» say "twowords" ~~ / twowords /; # OUTPUT: «｢twowords｣»Left and right word boundary §
<< matches a left word boundary. It matches positions where there is a non-word character at the left, or the start of the string, and a word character to the right.
>> matches a right word boundary. It matches positions where there is a word character at the left and a non-word character at the right, or the end of the string.
These are both zero-width regex elements.
my = 'The quick brown fox';say so ' ' ~~ /\W/; # OUTPUT: «True» say so ~~ /br/; # OUTPUT: «True» say so ~~ /<< br/; # OUTPUT: «True» say so ~~ /br >>/; # OUTPUT: «False» say so ~~ /own/; # OUTPUT: «True» say so ~~ /<< own/; # OUTPUT: «False» say so ~~ /own >>/; # OUTPUT: «True» say so ~~ /<< The/; # OUTPUT: «True» say so ~~ /fox >>/; # OUTPUT: «True»You can also use the variants « and » :
my = 'The quick brown fox';say so ~~ /« own/; # OUTPUT: «False» say so ~~ /own »/; # OUTPUT: «True»To see the difference between <|w> and «, »:
say "stuff here!!!".subst(:g, />>/, '|'); # OUTPUT: «stuff| here|!!!» say "stuff here!!!".subst(:g, /<</, '|'); # OUTPUT: «|stuff |here!!!» say "stuff here!!!".subst(:g, //, '|'); # OUTPUT: «|stuff| |here|!!!»Summary of anchors §
Anchors are zero-width regex elements. Hence they do not use up a character of the input string, that is, they do not advance the current position at which the regex engine tries to match. A good mental model is that they match between two characters of an input string, or before the first, or after the last character of an input string.
| Anchor | Description | Examples |
|---|---|---|
| ^ | Start of string | "⏏two\nlines" |
| ^^ | Start of line | "⏏two\n⏏lines" |
| $ | End of string | "two\nlines⏏" |
| $$ | End of line | "two⏏\nlines⏏" |
| << or « | Left word boundary | "⏏two ⏏words" |
| >> or » | Right word boundary | "two⏏ words⏏" |
| <?wb> | Any word boundary | "⏏two⏏ ⏏words⏏~!" |
| <!wb> | Not a word boundary | "t⏏w⏏o w⏏o⏏r⏏d⏏s~⏏!" |
| <?ww> | Within word | "t⏏w⏏o w⏏o⏏r⏏d⏏s~!" |
| <!ww> | Not within word | "⏏two⏏ ⏏words⏏~⏏!⏏" |
Zero-width assertions §
Zero-Width assertions can help you implement your own anchor: it turns another regex into an anchor, making them consume no characters of the input string. There are two variants: lookahead and lookbehind assertions.
Technically, anchors are also zero-width assertions, and they can look both ahead and behind.
Lookaround assertions §
Lookaround assertions, which need a character class in its simpler form, work both ways. They match, but they don't consume a character.
my say "333" ~~ ; # OUTPUT: «｢333｣» say '333$' ~~ m/ \d+ /; # OUTPUT: «｢333｣» say '$333' ~~ m/^^ . \d+ /; # OUTPUT: «｢$333｣» They can be positive or negative: ![] is negative, while ?[] is positive; the square brackets will contain the characters or backslashed character classes that are going to be matched.
You can use predefined character classes and Unicode properties directly preceded by the exclamation or interrogation mark to convert them into lookaround assertions.:
say '333' ~~ m/^^ \d+ /; # OUTPUT: «｢333｣» say '333' ~~ m/^^ \d+ /; # OUTPUT: «｢333｣» say '333' ~~ m/^^ \d+ /; # OUTPUT: «｢333｣» say '333' ~~ m/^^ \d+ > /; # OUTPUT: «｢33｣» In the first two cases, the corresponding character class matches, but does not consume, the first digit, which is then consumed by the expression; in the third, the negative lookaround assertion behaves in the same way. In the fourth statement the last digit is matched but not consumed, thus the match includes only the first two digits.
Lookahead assertions §
To check that a pattern appears before another pattern, use a lookahead assertion via the before assertion. This has the form:
<?before pattern>Thus, to search for the string foo which is immediately followed by the string bar, use the following regexp:
/ foo /For example:
say "foobar" ~~ / foo /; # OUTPUT: «foo»However, if you want to search for a pattern which is not immediately followed by some pattern, then you need to use a negative lookahead assertion, this has the form:
<!before pattern>In the following example, all occurrences of foo which is not before bar would match with
say "foobaz" ~~ / foo /; # OUTPUT: «foo»Lookahead assertions can be used also with other patterns, like characters ranges, interpolated variables subscripts and so on. In such cases it does suffice to use a ?, or a ! for the negate form. For instance, the following lines all produce the very same result:
say 'abcdefg' ~~ rx{ abc }; # OUTPUT: «｢abc｣» say 'abcdefg' ~~ rx{ abc }; # OUTPUT: «｢abc｣» my = <d e f>;say 'abcdefg' ~~ rx{ abc }; # OUTPUT: «｢abc｣»Metacharacters can also be used in lookahead or -behind assertions.
say "First. Second" ~~ m:g/ \S+ /# OUTPUT: «(｢First.｣ ｢Second｣)»A practical use of lookahead assertions is in substitutions, where you only want to substitute regex matches that are in a certain context. For example, you might want to substitute only numbers that are followed by a unit (like kg), but not other numbers:
my = <kg m km mm s h>; = "Please buy 2 packs of sugar, 1 kg each";s:g[\d+ ] = 5 * $/;say ; # OUTPUT: «Please buy 2 packs of sugar, 5 kg each»Since the lookahead is not part of the match object, the unit is not substituted.
Lookbehind assertions §
To check that a pattern appears after another pattern, use a lookbehind assertion via the after assertion. This has the form:
<?after pattern>Therefore, to search for the string bar immediately preceded by the string foo, use the following regexp:
/ bar /For example:
say "foobar" ~~ / bar /; # OUTPUT: «bar»However, if you want to search for a pattern which is not immediately preceded by some pattern, then you need to use a negative lookbehind assertion, this has the form:
<!after pattern>Hence all occurrences of bar which do not have foo before them would be matched by
say "fotbar" ~~ / bar /; # OUTPUT: «bar»These are, as in the case of lookahead, zero-width assertions which do not consume characters, like here:
say "atfoobar" ~~ / (.**3) .**2 bar /;# OUTPUT: «｢atfoobar｣ 0 => ｢atf｣»where we capture the first 3 of the 5 characters before bar, but only if bar is preceded by foo. The fact that the assertion is zero-width allows us to use part of the characters in the assertion for capture.
Grouping and capturing §
In regular (non-regex) Raku, you can use parentheses to group things together, usually to override operator precedence:
say 1 + 4 * 2; # OUTPUT: «9», parsed as 1 + (4 * 2) say (1 + 4) * 2; # OUTPUT: «10»The same grouping facility is available in regexes:
/ a || b c /; # matches 'a' or 'bc' / ( a || b ) c /; # matches 'ac' or 'bc'The same grouping applies to quantifiers:
/ a b+ /; # matches an 'a' followed by one or more 'b's / (a b)+ /; # matches one or more sequences of 'ab' / (a || b)+ /; # matches a string of 'a's and 'b's, except empty stringAn unquantified capture produces a Match object. When a capture is quantified (except with the ? quantifier) the capture becomes a list of Match objects instead.
Capturing §
The round parentheses don't just group, they also capture; that is, they make the string matched within the group available as a variable, and also as an element of the resulting Match object:
my = 'number 42';if ~~ /'number ' (\d+) / Pairs of parentheses are numbered left to right, starting from zero.
if 'abc' ~~ /(a) b (c)/ The $0 and $1 etc. syntax is shorthand. These captures are canonically available from the match object $/ by using it as a list, so $0 is actually syntactic sugar for $/[0].
Coercing the match object to a list gives an easy way to programmatically access all elements:
if 'abc' ~~ /(a) b (c)/ Non-capturing grouping §
The parentheses in regexes perform a double role: they group the regex elements inside and they capture what is matched by the sub-regex inside.
To get only the grouping behavior, you can use square brackets [ ... ] which, by default, don't capture.
if 'abc' ~~ / [a||b] (c) / If you do not need the captures, using non-capturing [ ... ] groups provides the following benefits:
they more cleanly communicate the regex intent,
they make it easier to count the capturing groups that do match, and
they make matching a bit faster.
Capture numbers §
It is stated above that captures are numbered from left to right. While true in principle, this is also an over simplification.
The following rules are listed for the sake of completeness. When you find yourself using them regularly, it's worth considering named captures (and possibly subrules) instead.
Alternations reset the capture count:
/ (x) (y) || (a) (.) (.) /# $0 $1 $0 $1 $2Example:
if 'abc' ~~ /(x)(y) || (a)(.)(.)/ If two (or more) alternations have a different number of captures, the one with the most captures determines the index of the next capture:
if 'abcd' ~~ / a [ b (.) || (x) (y) ] (.) / Captures can be nested, in which case they are numbered per level; level 0 gets to use the capture variables, but it will become a list with the rest of the levels behaving as elements of that list
if 'abc' ~~ / ( a (.) (.) ) / These capture variables are only available outside the regex.
# !!WRONG!! The $0 refers to a capture *inside* the second capture say "11" ~~ /(\d) ($0)/; # OUTPUT: «Nil» In order to make them available inside the Regexes, you need to insert a code block behind the match; this code block may be empty if there's nothing meaningful to do:
# CORRECT: $0 is saved into a variable outside the second capture # before it is used inside say "11" ~~ /(\d) :my $c = $0; ($c)/; # OUTPUT: «｢11｣ 0 => ｢1｣ 1 => ｢1｣» say "Matched $c"; # OUTPUT: «Matched 1» This code block publishes the capture inside the regex, so that it can be assigned to other variables or used for subsequent matches
say "11" ~~ /(\d) $0/; # OUTPUT: «｢11｣ 0 => ｢1｣» :my helps scoping the $c variable within the regex and beyond; in this case we can use it in the next sentence to show what has been matched inside the regex. This can be used for debugging inside regular expressions, for instance:
my ="line\nline2\nline3"; ~~ rx| :my $counter = 0; ( \V* ) *%% \n |;say "Matched $counter lines"; # OUTPUT: «Matched 3 lines»Since :my blocks are simply declarations, the match variable $/ or numbered matches such as $0 will not be available in them unless they are previously published by inserting the empty block (or any block):
"aba" ~~ / (a) b :my $c = $/; /;say ; # OUTPUT: «｢ab｣ 0 => ｢a｣» Any other code block will also reveal the variables and make them available in declarations:
"aba" ~~ / (a) b :my $c = ~$0; /;# OUTPUT: «Check so far a» say "Capture $c"; # OUTPUT: «Capture a» The :our, similarly to our in classes, can be used in Grammars to declare variables that can be accessed, via its fully qualified name, from outside the grammar:
say HasOur.parse('Þor is mighty'); # OUTPUT: «｢Þor is mighty｣» say ::our; # OUTPUT: «Þor» Once the parsing has been done successfully, we use the FQN name of the $our variable to access its value, that can be none other than Þor.
Named captures §
Instead of numbering captures, you can also give them names. The generic, and slightly verbose, way of naming captures is like this:
if 'abc' ~~ / = [ \w+ ] / The square brackets in the above example, which don't usually capture, will now capture its grouping with the given name.
The access to the named capture, $<myname>, is a shorthand for indexing the match object as a hash, in other words: $/{ 'myname' } or $/<myname>.
We can also use parentheses in the above example, but they will work exactly the same as square brackets. The captured group will only be accessible by its name as a key from the match object and not from its position in the list with $/[0] or $0.
Named captures can also be nested using regular capture group syntax:
if 'abc-abc-abc' ~~ / =( [ =[abc] ]* % '-' ) / Coercing the match object to a hash gives you easy programmatic access to all named captures:
if 'count=23' ~~ / =\w+ '=' =\w+ / A more convenient way to get named captures is by using named regex as discussed in the Subrules section.
Capture markers: <( )>
§
A <( token indicates the start of the match's overall capture, while the corresponding )> token indicates its endpoint. The <( is similar to other languages \K to discard any matches found before the \K.
say 'abc' ~~ / a <( b )> c/; # OUTPUT: «｢b｣» say 'abc' ~~ / <(a <( b )> c)>/; # OUTPUT: «｢bc｣»As in the example above, you can see <( sets the start point and )> sets the endpoint; since they are actually independent of each other, the inner-most start point wins (the one attached to b) and the outer-most end wins (the one attached to c).
Substitution §
Regular expressions can also be used to substitute one piece of text for another. You can use this for anything, from correcting a spelling error (e.g., replacing 'Perl Jam' with 'Pearl Jam'), to reformatting an ISO8601 date from yyyy-mm-ddThh:mm:ssZ to mm-dd-yy h:m {AM,PM} and beyond.
Just like the search-and-replace editor's dialog box, the s/ / / operator has two sides, a left and right side. The left side is where your matching expression goes, and the right side is what you want to replace it with.
Lexical conventions §
Substitutions are written similarly to matching, but the substitution operator has both an area for the regex to match, and the text to substitute:
s/replace/with/; # a substitution that is applied to $_ ~~ s/replace/with/; # a substitution applied to a scalar The substitution operator allows delimiters other than the slash:
s|replace|with|;s!replace!with!;s,replace,with,;Note that neither the colon : nor balancing delimiters such as {} or () can be substitution delimiters. Colons clash with adverbs such as s:i/Foo/bar/ and the other delimiters are used for other purposes.
If you use balancing curly braces, square brackets, or parentheses, the substitution works like this instead:
s[replace] = 'with';The right-hand side is now a (not quoted) Raku expression, in which $/ is available as the current match:
= 'some 11 words 21';s:g[ \d+ ] = 2 * $/;.say; # OUTPUT: «some 22 words 42»Like the m// operator, whitespace is ignored in the regex part of a substitution.
Replacing string literals §
The simplest thing to replace is a string literal. The string you want to replace goes on the left-hand side of the substitution operator, and the string you want to replace it with goes on the right-hand side; for example:
= 'The Replacements';s/Replace/Entrap/;.say; # OUTPUT: «The Entrapments»Alphanumeric characters and the underscore are literal matches, just as in its cousin the m// operator. All other characters must be escaped with a backslash \ or included in quotes:
= 'Space: 1999';s/Space\:/Party like it's/;.say # OUTPUT: «Party like it's 1999»Note that the matching restrictions generally only apply to the left-hand side of the substitution expression, but some special characters or combinations of them may need to be escaped in the right-hand side (RHS). For example
= 'foo';s/foo/\%(/;.say # OUTPUT: «%(»or escape the '(' instead for the same result
s/foo/%\(/;.say # OUTPUT: «%(»but using either character alone does not require escaping. Forward slashes will need to be escaped, but escaping alphanumeric characters will cause them to be ignored. (NOTE: This RHS limitation was only recently noticed and this is not yet an exhaustive list of all characters or character pairs that require escapes for the RHS.)
By default, substitutions are only done on the first match:
= 'There can be twly two';s/tw/on/; # replace 'tw' with 'on' once .say; # OUTPUT: «There can be only two»Wildcards and character classes §
Anything that can go into the m// operator can go into the left-hand side of the substitution operator, including wildcards and character classes. This is handy when the text you're matching isn't static, such as trying to match a number in the middle of a string:
= "Blake's 9";s/\d+/7/; # replace any sequence of digits with '7' .say; # OUTPUT: «Blake's 7»Of course, you can use any of the +, * and ? modifiers, and they'll behave just as they would in the m// operator's context.
Capturing groups §
Just as in the match operator, capturing groups are allowed on the left-hand side, and the matched contents populate the $0..$n variables and the $/ object:
= '2016-01-23 18:09:00';s/ (\d+)\-(\d+)\-(\d+) /today/; # replace YYYY-MM-DD with 'today' .say; # OUTPUT: «today 18:09:00» "$1-$2-$0".say; # OUTPUT: «01-23-2016» "$/[1]-$/[2]-$/[0]".say; # OUTPUT: «01-23-2016»Any of these variables $0, $1, $/ can be used on the right-hand side of the operator as well, so you can manipulate what you've just matched. This way you can separate out the YYYY, MM and DD parts of a date and reformat them into MM-DD-YYYY order:
= '2016-01-23 18:09:00';s/ (\d+)\-(\d+)\-(\d+) /$1-$2-$0/; # transform YYYY-MM-DD to MM-DD-YYYY .say; # OUTPUT: «01-23-2016 18:09:00»Named capture can be used too:
= '2016-01-23 18:09:00';s/ =(\d+)\-=(\d+)\-=(\d+) /--/;.say; # OUTPUT: «01-23-2016 18:09:00»Since the right-hand side is effectively a regular Raku interpolated string, you can reformat the time from HH:MM to h:MM {AM,PM} like so:
= '18:38';s/(\d+)\:(\d+)/\:$1 /;.say; # OUTPUT: «6:38 PM»Using the modulo % operator above keeps the sample code under 80 characters, but is otherwise the same as $0 < 12 ?? $0 !! $0 - 12 . When combined with the power of the Parser Expression Grammars that really underlies what you're seeing here, you can use "regular expressions" to parse pretty much any text out there.
Common adverbs §
The full list of adverbs that you can apply to regular expressions can be found elsewhere in this document (section Adverbs), but the most common are probably :g and :i.
Global adverb
:g
Ordinarily, matches are only made once in a given string, but adding the :g modifier overrides that behavior, so that substitutions are made everywhere possible. Substitutions are non-recursive; for example:
= q{I can say "banana" but I don't know when to stop};s:g/na/nana,/; # substitute 'nana,' for 'na' .say; # OUTPUT: «I can say "banana,nana," but I don't ...»Here, na was found twice in the original string and each time there was a substitution. The substitution only applied to the original string, though. The resulting string was not impacted.
Insensitive adverb
:i
Ordinarily, matches are case-sensitive. s/foo/bar/ will only match 'foo' and not 'Foo'. If the adverb :i is used, though, matches become case-insensitive.
= 'Fruit';s/fruit/vegetable/;.say; # OUTPUT: «Fruit» s:i/fruit/vegetable/;.say; # OUTPUT: «vegetable»For more information on what these adverbs are actually doing, refer to the section Adverbs section of this document.
These are just a few of the transformations you can apply with the substitution operator. Some of the simpler uses in the real world include removing personal data from log files, editing MySQL timestamps into PostgreSQL format, changing copyright information in HTML files and sanitizing form fields in a web application.
As an aside, novices to regular expressions often get overwhelmed and think that their regular expression needs to match every piece of data in the line, including what they want to match. Write just enough to match the data you're looking for, no more, no less.
S/// non-destructive substitution
§
say S/o .+ d/new/ with 'old string'; # OUTPUT: «new string» S:g/« (.)/$0.uc()/.say for <foo bar ber>; # OUTPUT: «FooBarBer»S/// uses the same semantics as the s/// operator, except it leaves the original string intact and returns the resultant string instead of $/ ($/ still being set to the same values as with s///).
Note: since the result is obtained as a return value, using this operator with the ~~ smartmatch operator is a mistake and will issue a warning. To execute the substitution on a variable that isn't the $_ this operator uses, alias it to $_ with given, with, or any other way. Alternatively, use the .subst method.
Tilde for nesting structures §
The ~ operator is a helper for matching nested subrules with a specific terminator as the goal. It is designed to be placed between an opening and closing delimiter pair, like so:
/ '(' ~ ')' /However, it mostly ignores the left argument, and operates on the next two atoms (which may be quantified). Its operation on those next two atoms is to "twiddle" them so that they are actually matched in reverse order. Hence the expression above, at first blush, is merely another way of writing:
/ '(' ')' /Using ~ keeps the separators closer together but beyond that, when it rewrites the atoms it also inserts the apparatus that will set up the inner expression to recognize the terminator, and to produce an appropriate error message if the inner expression does not terminate on the required closing atom. So it really does pay attention to the left delimiter as well, and it actually rewrites our example to something more like:
$<OPEN> = '(' <SETGOAL: ')'> <expression> [ $GOAL || <FAILGOAL> ]
FAILGOAL is a special method that can be defined by the user and it will be called on parse failure:
say A.parse: '[good]'; # OUTPUT: «｢[good]｣» A.parse: '[bad'; # will throw FAILGOAL exception CATCH ;# OUTPUT: «X::AdHoc: Cannot find ']' near position 4»Note that you can use this construct to set up expectations for a closing construct even when there's no opening delimiter:
"3)" ~~ / ~ ')' \d+ /; # OUTPUT: «｢3)｣» "(3)" ~~ / ~ ')' \d+ /; # OUTPUT: «｢3)｣»Here <?> successfully matches the null string.
The order of the regex capture is original:
"abc" ~~ /a ~ (c) (b)/;say $0; # OUTPUT: «｢c｣» say $1; # OUTPUT: «｢b｣»Recursive Regexes §
You can use <~~> to recursively invoke the current Regex from within the Regex. This can be extremely helpful for matching nested data structures. For example, consider this Regex:
/ '(' * ')' || '('[ * * ]* ')' /This says "match either an open parentheses, followed by zero or more non-parentheses characters, followed by a close parentheses or an open parentheses followed by zero or more non-parentheses characters, followed by another match for this Regex, followed by zero or more non-parentheses characters, followed by a close parentheses." This Regex allows you to match arbitrarily many nested parentheses, as show below:
my = rx/ '(' * ')' || '('[ * * ]* ')' /;say 'text' ~~ ; # OUTPUT: «Nil» say '(1 + 1) = 2' ~~ ; # OUTPUT: «｢(1 + 1)｣» say '(1 + (2 × 3)) = 7' ~~ ; # OUTPUT: «｢(1 + (2 × 3))｣» say '((5 + 2) × 6) = 42 (the answer)' ~~ # OUTPUT: «｢((5 + 2) × 6)｣»Note that the last expression shown above does not match all the way to the final ), as would have happened with /'('.*')'/, nor does it match only to the first ). Instead, it correctly matches to the close parentheses paired with the first opening parentheses, an effect that is very difficult to duplicate without recursive regexes.
When using recursive regexes (as with any other recursive data structure) you should be careful to avoid infinite recursion, which will cause your program to hang or crash.
Subrules §
Just like you can put pieces of code into subroutines, you can also put pieces of regex into named rules.
my if "abc\ndef" ~~ / def/ A named regex can be declared with my regex named-regex { body here }, and called with <named-regex>. At the same time, calling a named regex installs a named capture with the same name.
To give the capture a different name from the regex, use the syntax <capture-name=named-regex>. If no capture is desired, a leading dot or ampersand will suppress it: <.named-regex> if it is a method declared in the same class or grammar, <&named-regex> for a regex declared in the same lexical context.
Here's more complete code for parsing ini files:
my my my my my = my ;if ~~ /*/ say .raku; # OUTPUT: «{:passwords(${:jack("password1"), :joy("muchmoresecure123")}), # :quotas(${:jack("123"), :joy("42")})}»Named regexes can and should be grouped in grammars. A list of predefined subrules is listed in S05-regex of design documents.
Regex interpolation §
Instead of using a literal pattern for a regex match, you can use a variable that holds that pattern. This variable can then be 'interpolated' into a regex, such that its appearance in the regex is replaced with the pattern that it holds. The advantage of using interpolation this way, is that the pattern need not be hardcoded in the source of your Raku program, but may instead be variable and generated at runtime.
There are four different ways of interpolating a variable into a regex as a pattern, which may be summarized as follows:
| Syntax | Description |
|---|---|
| $variable | Interpolates stringified contents of variable literally. |
| $(code) | Runs Raku code inside the regex, and interpolates the stringified return value literally. |
| <$variable> | Interpolates stringified contents of variable as a regex. |
| <{code}> | Runs Raku code inside the regex, and interpolates the stringified return value as a regex. |
Instead of the $ sigil, you may use the @ sigil for array interpolation. See below for how this works.
Let's start with the first two syntactical forms: $variable and $(code). These forms will interpolate the stringified value of the variable or the stringified return value of the code literally, provided that the respective value isn't a Regex object. If the value is a Regex, it will not be stringified, but instead be interpolated as such. 'Literally' means strictly literally, that is: as if the respective stringified value is quoted with a basic Q string Q[...]. Consequently, the stringified value will not itself undergo any further interpolation.
For $variable this means the following:
my = 'Is this a regex or a string: 123\w+False$pattern1 ?';my = 'string';my = '\w+';my = 123;my = /\w+/; say .match: / 'string' /; # [1] OUTPUT: «｢string｣» say .match: / $pattern1 /; # [2] OUTPUT: «｢string｣» say .match: / $pattern2 /; # [3] OUTPUT: «｢\w+｣» say .match: / $regex /; # [4] OUTPUT: «｢Is｣» say .match: / $number /; # [5] OUTPUT: «｢123｣»In this example, the statements [1] and [2] are equivalent and meant to illustrate a plain case of regex interpolation. Since unescaped/unquoted alphabetic characters in a regex match literally, the single quotes in the regex of statement [1] are functionally redundant; they have merely been included to emphasize the correspondence between the first two statements. Statement [3] unambiguously shows that the string pattern held by $pattern2 is interpreted literally, and not as a regex. In case it would have been interpreted as a regex, it would have matched the first word of $string, i.e. ｢Is｣, as can be seen in statement [4]. Statement [5] shows how the stringified number is used as a match pattern.
This code exemplifies the use of the $(code) syntax:
my = 'Is this a regex or a string: 123\w+False$pattern1 ?';my = 'string';my = 'gnirts';my = '$pattern1';my = True;my sub f1 ; say .match: / $pattern3.flip /; # [6] OUTPUT: «Nil» say .match: / "$pattern3.flip()" /; # [7] OUTPUT: «｢string｣» say .match: / $($pattern3.flip) /; # [8] OUTPUT: «｢string｣» say .match: / $([~] $pattern3.comb.reverse) /; # [9] OUTPUT: «｢string｣» say .match: / $(!$bool) /; # [10] OUTPUT: «｢False｣» say .match: / $pattern4 /; # [11] OUTPUT: «｢$pattern1｣» say .match: / $(f1) /; # [12] OUTPUT: «｢$pattern1｣»Statement [6] does not work as probably intended. To the human reader, the dot . may seem to represent the method call operator, but since a dot is not a valid character for an ordinary identifier, and given the regex context, the compiler will parse it as the regex wildcard . that matches any character. The apparent ambiguity may be resolved in various ways, for instance through the use of straightforward string interpolation from the regex as in statement [7] (note that the inclusion of the call operator () is key here), or by using the second syntax form from the above table as in statement [8], in which case the match pattern string first emerges as the return value of the flip method call. Since general Raku code may be run from within the parentheses of $( ), the same effect can also be achieved with a bit more effort, like in statement [9]. Statement [10] illustrates how the stringified version of the code's return value (the Boolean value False) is matched literally.
Finally, statements [11] and [12] show how the value of $pattern4 and the return value of f1 are not subject to a further round of interpolation. Hence, in general, after possible stringification, $variable and $(code) provide for a strictly literal match of the variable or return value.
Now consider the second two syntactical forms from the table above: <$variable> and <{code}>. These forms will stringify the value of the variable or the return value of the code and interpolate it as a regex. If the respective value is a Regex, it is interpolated as such:
my = 'Is this a regex or a string: 123\w+$x ?';my = '\w+';my = 123;my sub f1 ; say .match: / /; # OUTPUT: «｢Is｣» say .match: / /; # OUTPUT: «｢123｣» say .match: / /; # OUTPUT: «｢string｣»Importantly, 'to interpolate as a regex' means to interpolate/insert into the target regex without protective quoting. Consequently, if the value of the variable $variable1 is itself of the form $variable2, evaluation of <$variable1> or <{ $variable1 }> inside a target regex /.../ will cause the target regex to assume the form /$variable2/. As described above, the evaluation of this regex will then trigger further interpolation of $variable2:
my = Q[Mindless \w+ $variable1 $variable2];my = Q[\w+];my = Q[$variable1];my sub f1 ; # /<{ f1 }>/ ==> /$variable2/ ==> / '$variable1' / say .match: / /; # OUTPUT: «｢$variable1｣» # /<$variable2>/ ==> /$variable1/ ==> / '\w+' / say .match: //; # OUTPUT: «｢\w+｣» # /<$variable1>/ ==> /\w+/ say .match: //; # OUTPUT: «｢Mindless｣»When an array variable is interpolated into a regex, the regex engine handles it like a | alternative of the regex elements (see the documentation on embedded lists, above). The interpolation rules for individual elements are the same as for scalars, so strings and numbers match literally, and Regex objects match as regexes. Just as with ordinary | interpolation, the longest match succeeds:
my = '2', 23, rx/a.+/;say ('b235' ~~ / b @a /).Str; # OUTPUT: «b23»If you have an expression that evaluates to a list, but you do not want to assign it to an @-sigiled variable first, you can interpolate it with @(code). In this example, both regexes are equivalent:
my = a => 1, b => 2;my = .keys;say S:g/@(%h.keys)// given 'abc'; # OUTPUT: «12c> say S:g/@a// given 'abc'; # OUTPUT: «12c>The use of hashes in regexes is reserved.
Regex Boolean condition check §
The special operator <?{}> allows the evaluation of a Boolean expression that can perform a semantic evaluation of the match before the regular expression continues. In other words, it is possible to check in a Boolean context a part of a regular expression and therefore invalidate the whole match (or allow it to continue) even if the match succeeds from a syntactic point of view.
In particular the <?{}> operator requires a True value in order to allow the regular expression to match, while its negated form <!{}> requires a False value.
In order to demonstrate the above operator, please consider the following example that involves a simple IPv4 address matching:
my = '127.0.0.1';my ~~ / ^ ** 4 % "." $ /;say $/<ipv4-octet>; # OUTPUT: «[｢127｣ ｢0｣ ｢0｣ ｢1｣]» The octet regular expression matches against a number made by one up to three digits. Each match is driven by the result of the <?{}>, that being the fixed value of True means that the regular expression match has to be always considered as good. As a counter-example, using the special constant value False will invalidate the match even if the regular expression matches from a syntactic point of view:
my = '127.0.0.1';my ~~ / ^ ** 4 % "." $ /;say $/<ipv4-octet>; # OUTPUT: «Nil» From the above examples, it should be clear that it is possible to improve the semantic check, for instance ensuring that each octet is really a valid IPv4 octet:
my = '127.0.0.1';my ~~ / ^ ** 4 % "." $ /;say $/<ipv4-octet>; # OUTPUT: «[｢127｣ ｢0｣ ｢0｣ ｢1｣]» Please note that it is not required to evaluate the regular expression in-line, but also a regular method can be called to get the Boolean value:
my = '127.0.0.1';sub check-octet ( Int )my ~~ / ^ ** 4 % "." $ /;say $/<ipv4-octet>; # OUTPUT: «[｢127｣ ｢0｣ ｢0｣ ｢1｣]» Of course, being <!{}> the negation form of <?{}> the same Boolean evaluation can be rewritten in a negated form:
my = '127.0.0.1';sub invalid-octet( Int )my ~~ / ^ ** 4 % "." $ /;say $/<ipv4-octet>; # OUTPUT: «[｢127｣ ｢0｣ ｢0｣ ｢1｣]» Adverbs §
Adverbs, which modify how regexes work and provide convenient shortcuts for certain kinds of recurring tasks, are combinations of one or more letters preceded by a colon :.
The so-called regex adverbs apply at the point where a regex is defined; additionally, matching adverbs apply at the point that a regex matches against a string and substitution adverbs are applied exclusively in substitutions.
This distinction often blurs, because matching and declaration are often textually close but using the method form of matching, that is, .match, makes the distinction clear.
say "Abra abra CADABRA" ~~ m:exhaustive/:i a \w+ a/;# OUTPUT: «(｢Abra｣ ｢abra｣ ｢ADABRA｣ ｢ADA｣ ｢ABRA｣)» my = /:i a \w+ a /;say "Abra abra CADABRA".match(,:ex);# OUTPUT: «(｢Abra｣ ｢abra｣ ｢ADABRA｣ ｢ADA｣ ｢ABRA｣)»In the first example, the matching adverb (:exhaustive) is contiguous to the regex adverb (:i), and as a matter of fact, the "definition" and the "matching" go together; however, by using match it becomes clear that :i is only used when defining the $regex variable, and :ex (short for :exhaustive) as an argument when matching. As a matter of fact, matching adverbs cannot even be used in the definition of a regex:
my $regex = rx:ex/:i a \w+ a /; # ===SORRY!=== Error while compiling (...)Adverb ex not allowed on rx
Regex adverbs like :i go into the definition line and matching adverbs like :overlap (which can be abbreviated to :ov) are appended to the match call:
my = /:i . a/;for 'baA'.match(, :overlap) -> # OUTPUT: «baaA»Regex adverbs §
The adverbs that appear at the time of a regex declaration are part of the actual regex and influence how the Raku compiler translates the regex into binary code.
For example, the :ignorecase (:i) adverb tells the compiler to ignore the distinction between upper case, lower case and title case letters.
So 'a' ~~ /A/ is false, but 'a' ~~ /:i A/ is a successful match.
Regex adverbs can come before or inside a regex declaration and only affect the part of the regex that comes afterwards, lexically. Note that regex adverbs appearing before the regex must appear after something that introduces the regex to the parser, like 'rx' or 'm' or a bare '/'. This is NOT valid:
my $rx1 = :i/a/; # adverb is before the regex is recognized => exception
but these are valid:
my = rx:i/a/; # before my = m:i/a/; # before my = /:i a/; # insideThese two regexes are equivalent:
my = rx:i/a/; # before my = rx/:i a/; # insideWhereas these two are not:
my = rx/a :i b/; # matches only the b case insensitively my = rx/:i a b/; # matches completely case insensitivelySquare brackets and parentheses limit the scope of an adverb:
/ (:i a b) c /; # matches 'ABc' but not 'ABC' / [:i a b] c /; # matches 'ABc' but not 'ABC'When two adverbs are used together, they keep their colon at the front
"þor is Þor" ~~ m:g:i/þ/; # OUTPUT: «(｢þ｣ ｢Þ｣)»That implies that when there are multiple characters together after a :, they correspond to the same adverb, as in :ov or :P5.
Ignorecase §
The :ignorecase or :i adverb instructs the regex engine to ignore the distinction between upper case, lower case and title case letters.
See the section Regex adverbs for examples.
Ignoremark §
The :ignoremark or :m adverb instructs the regex engine to only compare base characters, and ignore additional marks such as combining accents:
say so 'a' ~~ rx/ä/; # OUTPUT: «False» say so 'a' ~~ rx:ignoremark /ä/; # OUTPUT: «True» say so 'ỡ' ~~ rx:ignoremark /o/; # OUTPUT: «True> Ratchet §
The :ratchet or :r adverb causes the regex engine to not backtrack (see backtracking). Mnemonic: a ratchet only moves in one direction and can't backtrack.
Without this adverb, parts of a regex will try different ways to match a string in order to make it possible for other parts of the regex to match. For example, in 'abc' ~~ /\w+ ./, the \w+ first eats up the whole string, abc but then the . fails. Thus \w+ gives up a character, matching only ab, and the . can successfully match the string c. This process of giving up characters (or in the case of alternations, trying a different branch) is known as backtracking.
say so 'abc' ~~ / \w+ . /; # OUTPUT: «True» say so 'abc' ~~ / :r \w+ . /; # OUTPUT: «False»Ratcheting can be an optimization, because backtracking is costly. But more importantly, it closely corresponds to how humans parse a text. If you have a regex my regex identifier { \w+ } and my regex keyword { if | else | endif }, you intuitively expect the identifier to gobble up a whole word and not have it give up its end to the next rule, if the next rule otherwise fails.
For example, you don't expect the word motif to be parsed as the identifier mot followed by the keyword if. Instead, you expect motif to be parsed as one identifier; and if the parser expects an if afterwards, best that it should fail than have it parse the input in a way you don't expect.
Since ratcheting behavior is often desirable in parsers, there's a shortcut to declaring a ratcheting regex:
my token thing { ... };
# short for
my regex thing { :r ... };
Sigspace §
The :sigspace or :s adverb changes the behavior of unquoted whitespace in a regex.
Without :sigspace, unquoted whitespace in a regex is generally ignored, to make regexes more readable by programmers. When :sigspace is present, unquoted whitespace may be converted into <.ws> subrule calls depending on where it occurs in the regex.
say so "I used Photoshop®" ~~ m:i/ photo shop /; # OUTPUT: «True» say so "I used a photo shop" ~~ m:i:s/ photo shop /; # OUTPUT: «True» say so "I used Photoshop®" ~~ m:i:s/ photo shop /; # OUTPUT: «False» m:s/ photo shop / acts the same as m/ photo <.ws> shop <.ws> /. By default, <.ws> makes sure that words are separated, so a b and ^& will match <.ws> in the middle, but ab won't:
say so "ab" ~~ m:s/a b/; # OUTPUT: «False» say so "a b" ~~ m:s/a b/; # OUTPUT: «True» say so "^&" ~~ m:s/'^' '&'/; # OUTPUT: «True» The third line is matched, because ^& is not a word. For more clarification on how <.ws> rule works, refer to WS rule description.
Where whitespace in a regex turns into <.ws> depends on what comes before the whitespace. In the above example, whitespace in the beginning of a regex doesn't turn into <.ws>, but whitespace after characters does. In general, the rule is that if a term might match something, whitespace after it will turn into <.ws>.
In addition, if whitespace comes after a term but before a quantifier (+, *, or ?), <.ws> will be matched after every match of the term. So, foo + becomes [ foo <.ws> ]+. On the other hand, whitespace after a quantifier acts as normal significant whitespace; e.g., "foo+ " becomes foo+ <.ws>.
In all, this code:
rx :s { ^^ characters_with_ws_after+ ws_separated_characters * [ | some "stuff" .. . | $$ ] :my $foo = "no ws after this"; $foo}Becomes:
rx { ^^ characters_with_ws_after+ [ws_separated_characters ]* [ | some "stuff" .. . | $$ ] :my $foo = "no ws after this"; $foo }If a regex is declared with the rule keyword, both the :sigspace and :ratchet adverbs are implied.
Grammars provide an easy way to override what <.ws> matches:
# doesn't parse, whitespace required between a and b say so Demo.parse("ab."); # OUTPUT: «False» say so Demo.parse("a b."); # OUTPUT: «True» say so Demo.parse("a\tb ."); # OUTPUT: «True» # \n is vertical whitespace, so no match say so Demo.parse("a\tb\n."); # OUTPUT: «False»When parsing file formats where some whitespace (for example, vertical whitespace) is significant, it's advisable to override ws.
Perl compatibility adverb §
The :Perl5 or :P5 adverb switch the Regex parsing and matching to the way Perl regexes behave:
so 'hello world' ~~ m:Perl5/^hello (world)/; # OUTPUT: «True» so 'hello world' ~~ m/^hello (world)/; # OUTPUT: «False» so 'hello world' ~~ m/^ 'hello ' ('world')/; # OUTPUT: «True»The regular behavior is recommended and more idiomatic in Raku of course, but the :Perl5 adverb can be useful when compatibility with Perl is required.
Matching adverbs §
In contrast to regex adverbs, which are tied to the declaration of a regex, matching adverbs only make sense when matching a string against a regex.
They can never appear inside a regex, only on the outside – either as part of an m/.../ match or as arguments to a match method.
Positional adverbs §
Positional adverbs make the expression match only the string in the indicated position:
my = "f fo foo fooo foooo fooooo foooooo";say ~~ m:nth(4)/fo+/; # OUTPUT: «｢foooo｣» say ~~ m:1st/fo+/; # OUTPUT: «｢fo｣» say ~~ m:3rd/fo+/; # OUTPUT: «｢fooo｣» say ~~ m:nth(1,3)/fo+/; # OUTPUT: «(｢fo｣ ｢fooo｣)»As you can see, the adverb argument can also be a list. There's actually no difference between the :nth adverb and the rest. You choose them only based on legibility. From 6.d, you can also use Junctions, Seqs and Ranges, even infinite ones, as arguments.
my = "f fo foo fooo foooo fooooo foooooo";say ~~ m:st(1|8)/fo+/; # OUTPUT: «True»In this case, one of them exists (1), so it returns True. Observe that we have used :st. As said above, it's functionally equivalent, although obviously less legible than using :nth, so this last form is advised.
Counting §
The :x counting adverb makes the expression match many times, like the :g adverb, but only up to the limit given by the adverb expression, stopping once the specified number of matches has been reached. The value must be a Numeric or a Range.
Continue §
The :continue or short :c adverb takes an argument. The argument is the position where the regex should start to search. By default, it searches from the start of the string, but :c overrides that. If no position is specified for :c, it will default to 0 unless $/ is set, in which case, it defaults to $/.to.
given 'a1xa2' Note: unlike :pos, a match with :continue() will attempt to match further in the string, instead of failing:
say "abcdefg" ~~ m:c(3)/e.+/; # OUTPUT: «｢efg｣» say "abcdefg" ~~ m:p(3)/e.+/; # OUTPUT: «False»Exhaustive §
To find all possible matches of a regex – including overlapping ones – and several ones that start at the same position, use the :exhaustive (short :ex) adverb.
given 'abracadabra' The above code produces this output:
abracadabra
abracada
abraca
abra
acadabra
acada
aca
adabra
ada
abra
Global §
Instead of searching for just one match and returning a Match object, search for every non-overlapping match and return them in a List. In order to do this, use the :global adverb:
given 'several words here' :g is shorthand for :global.
Pos §
Anchor the match at a specific position in the string:
given 'abcdef' :p is shorthand for :pos.
Note: unlike :continue, a match anchored with :pos() will fail, instead of attempting to match further down the string:
say "abcdefg" ~~ m:c(3)/e.+/; # OUTPUT: «｢efg｣» say "abcdefg" ~~ m:p(3)/e.+/; # OUTPUT: «False»Overlap §
To get several matches, including overlapping matches, but only one (the longest) from each starting position, specify the :overlap (short :ov) adverb:
given 'abracadabra' produces
abracadabra
acadabra
adabra
abra
Substitution adverbs §
You can apply matching adverbs (such as :global, :pos etc.) to substitutions. In addition, there are adverbs that only make sense for substitutions, because they transfer a property from the matched string to the replacement string.
Samecase §
The :samecase or :ii substitution adverb implies the :ignorecase adverb for the regex part of the substitution, and in addition carries the case information to the replacement string:
= 'The cat chases the dog';s:global:samecase[the] = 'a';say ; # OUTPUT: «A cat chases a dog» Here you can see that the first replacement string a got capitalized, because the first string of the matched string was also a capital letter.
Samemark §
The :samemark or :mm adverb implies :ignoremark for the regex, and in addition, copies the markings from the matched characters to the replacement string:
given 'äộñ' Samespace §
The :samespace or :ss substitution modifier implies the :sigspace modifier for the regex, and in addition, copies the whitespace from the matched string to the replacement string:
say S:samespace/a ./c d/.raku given "a b"; # OUTPUT: «"c d"» say S:samespace/a ./c d/.raku given "a\tb"; # OUTPUT: «"c\td"» say S:samespace/a ./c d/.raku given "a\nb"; # OUTPUT: «"c\nd"» The ss/.../.../ syntactic form is a shorthand for s:samespace/.../.../.
Backtracking §
Raku defaults to backtracking when evaluating regular expressions. Backtracking is a technique that allows the engine to try different matching in order to allow every part of a regular expression to succeed. This is costly, because it requires the engine to usually eat up as much as possible in the first match and then adjust going backwards in order to ensure all regular expression parts have a chance to match.
In order to better understand backtracking, consider the following example:
my = 'PostgreSQL is an SQL database!';say ~~ /(.+)(SQL) (.+) $1/; # OUTPUT: «｢PostgreSQL is an SQL｣» What happens in the above example is that the string has to be matched against the second occurrence of the word SQL, eating all characters before and leaving out the rest.
Since it is possible to execute a piece of code within a regular expression, it is also possible to inspect the Match object within the regular expression itself:
my = 0;sub show-captures( Match ) ~~ /(.+)(SQL) (.+) $1 .+ /;The show-captures method will dump all the elements of $/ producing the following output:
=== Iteration 1 === Capture 0 = Postgre Capture 1 = SQL Capture 2 = is an [Postgre][SQL][ is an ]
showing that the string has been split around the second occurrence of SQL, that is the repetition of the first capture ($/[1]).
With that in place, it is now possible to see how the engine backtracks to find the above match: it does suffice to move the show-captures in the middle of the regular expression, in particular before the repetition of the first capture $1 to see it in action:
my = 0;sub show-captures( Match ) ~~ / (.+)(SQL) (.+) $1 /;The output will be much more verbose and will show several iterations, with the last one being the winning. The following is an excerpt of the output:
=== Iteration 1 === Capture 0 = PostgreSQL is an Capture 1 = SQL Capture 2 = database! [PostgreSQL is an ][SQL][ database!] === Iteration 2 === Capture 0 = PostgreSQL is an Capture 1 = SQL Capture 2 = database [PostgreSQL is an ][SQL][ database] ... === Iteration 24 === Capture 0 = Postgre Capture 1 = SQL Capture 2 = is an [Postgre][SQL][ is an ]
In the first iteration the SQL part of PostgreSQL is kept within the word: that is not what the regular expression asks for, so there's the need for another iteration. The second iteration will move back, in particular one character back (removing thus the final !) and try to match again, resulting in a fail since again the SQL is still kept within PostgreSQL. After several iterations, the final result is match.
It is worth noting that the final iteration is number 24, and that such number is exactly the distance, in number of chars, from the end of the string to the first SQL occurrence:
say .chars - .index: 'SQL'; # OUTPUT: «23» Since there are 23 chars from the very end of the string to the very first S of SQL the backtracking engine will need 23 "useless" matches to find the right one, that is, it will need 24 steps to get the final result.
Backtracking is a costly machinery, therefore it is possible to disable it in those cases where the matching can be found forward only.
With regards to the above example, disabling backtracking means the regular expression will not have any chance to match:
say ~~ /(.+)(SQL) (.+) $1/; # OUTPUT: «｢PostgreSQL is an SQL｣» say ~~ / :r (.+)(SQL) (.+) $1/; # OUTPUT: «Nil» The fact is that, as shown in the iteration 1 output, the first match of the regular expression engine will be PostgreSQL is an , SQL, database that does not leave out any room for matching another occurrence of the word SQL (as $1 in the regular expression). Since the engine is not able to get backward and change the path to match, the regular expression fails.
It is worth noting that disabling backtracking will not prevent the engine to try several ways to match the regular expression. Consider the following slightly changed example:
my = 'PostgreSQL is an SQL database!';say ~~ / (SQL) (.+) $1 /; # OUTPUT: «Nil» Since there is no specification for a character before the word SQL, the engine will match against the rightmost word SQL and go forward from there. Since there is no repetition of SQL remaining, the match fails. It is possible, again, to inspect what the engine performs introducing a dumping piece of code within the regular expression:
my = 0;sub show-captures( Match ) ~~ / (SQL) (.+) $1 /;that produces a rather simple output:
=== Iteration 1 === Capture 0 = SQL Capture 1 = is an SQL database! [SQL][ is an SQL database!] === Iteration 2 === Capture 0 = SQL Capture 1 = database! [SQL][ database!]
Even using the :r adverb to prevent backtracking will not change things:
my = 0;sub show-captures( Match ) ~~ / :r (SQL) (.+) $1 /;and the output will remain the same:
=== Iteration 1 === Capture 0 = SQL Capture 1 = is an SQL database! [SQL][ is an SQL database!] === Iteration 2 === Capture 0 = SQL Capture 1 = database! [SQL][ database!]
This demonstrates that disabling backtracking does not mean disabling possible multiple iterations of the matching engine, but rather disabling the backward matching tuning.
$/ changes each time a regular expression is matched
§
It is worth noting that each time a regular expression is used, the Match object returned (i.e., $/) is reset. In other words, $/ always refers to the very last regular expression matched:
my = 'a lot of Stuff';say 'Hit a capital letter!' if ~~ / /;say $/; # OUTPUT: «｢S｣» say 'hit an x!' if ~~ / x /;say $/; # OUTPUT: «Nil» The reset of $/ applies independently from the scope where the regular expression is matched:
my = 'a lot of Stuff';if ~~ / / say $/; # OUTPUT: «｢S｣» if True say $/; # OUTPUT: «Nil» The very same concept applies to named captures:
my = 'a lot of Stuff';if ~~ / = / say $/<capital>; # OUTPUT: «｢S｣» say 'hit an x!' if ~~ / =x /;say $/<x>; # OUTPUT: «Nil» say $/<capital>; # OUTPUT: «Nil» Best practices and gotchas §
The Regexes: Best practices and gotchas provides useful information on how to avoid common pitfalls when writing regexes and grammars.