1.\" Copyright (c) 1992, 1993, 1994 Henry Spencer. 2.\" Copyright (c) 1992, 1993, 1994 3.\" The Regents of the University of California. All rights reserved. 4.\" 5.\" This code is derived from software contributed to Berkeley by 6.\" Henry Spencer. 7.\" 8.\" Redistribution and use in source and binary forms, with or without 9.\" modification, are permitted provided that the following conditions 10.\" are met: 11.\" 1. Redistributions of source code must retain the above copyright 12.\" notice, this list of conditions and the following disclaimer. 13.\" 2. Redistributions in binary form must reproduce the above copyright 14.\" notice, this list of conditions and the following disclaimer in the 15.\" documentation and/or other materials provided with the distribution. 16.\" 3. All advertising materials mentioning features or use of this software 17.\" must display the following acknowledgement: 18.\" This product includes software developed by the University of 19.\" California, Berkeley and its contributors. 20.\" 4. Neither the name of the University nor the names of its contributors 21.\" may be used to endorse or promote products derived from this software 22.\" without specific prior written permission. 23.\" 24.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34.\" SUCH DAMAGE. 35.\" 36.\" @(#)re_format.7 8.3 (Berkeley) 3/20/94 37.\" $FreeBSD$ 38.\" 39.Dd March 20, 1994 40.Dt RE_FORMAT 7 41.Os 42.Sh NAME 43.Nm re_format 44.Nd POSIX 1003.2 regular expressions 45.Sh DESCRIPTION 46Regular expressions 47.Pq Dq RE Ns s , 48as defined in 49.St -p1003.2 , 50come in two forms: 51modern REs (roughly those of 52.Xr egrep 1 ; 531003.2 calls these 54.Dq extended 55REs) 56and obsolete REs (roughly those of 57.Xr ed 1 ; 581003.2 59.Dq basic 60REs). 61Obsolete REs mostly exist for backward compatibility in some old programs; 62they will be discussed at the end. 63.St -p1003.2 64leaves some aspects of RE syntax and semantics open; 65`\(dd' marks decisions on these aspects that 66may not be fully portable to other 67.St -p1003.2 68implementations. 69.Pp 70A (modern) RE is one\(dd or more non-empty\(dd 71.Em branches , 72separated by 73.Ql \&| . 74It matches anything that matches one of the branches. 75.Pp 76A branch is one\(dd or more 77.Em pieces , 78concatenated. 79It matches a match for the first, followed by a match for the second, etc. 80.Pp 81A piece is an 82.Em atom 83possibly followed 84by a single\(dd 85.Ql \&* , 86.Ql \&+ , 87.Ql \&? , 88or 89.Em bound . 90An atom followed by 91.Ql \&* 92matches a sequence of 0 or more matches of the atom. 93An atom followed by 94.Ql \&+ 95matches a sequence of 1 or more matches of the atom. 96An atom followed by 97.Ql ?\& 98matches a sequence of 0 or 1 matches of the atom. 99.Pp 100A 101.Em bound 102is 103.Ql \&{ 104followed by an unsigned decimal integer, 105possibly followed by 106.Ql \&, 107possibly followed by another unsigned decimal integer, 108always followed by 109.Ql \&} . 110The integers must lie between 0 and 111.Dv RE_DUP_MAX 112(255\(dd) inclusive, 113and if there are two of them, the first may not exceed the second. 114An atom followed by a bound containing one integer 115.Em i 116and no comma matches 117a sequence of exactly 118.Em i 119matches of the atom. 120An atom followed by a bound 121containing one integer 122.Em i 123and a comma matches 124a sequence of 125.Em i 126or more matches of the atom. 127An atom followed by a bound 128containing two integers 129.Em i 130and 131.Em j 132matches 133a sequence of 134.Em i 135through 136.Em j 137(inclusive) matches of the atom. 138.Pp 139An atom is a regular expression enclosed in 140.Ql () 141(matching a match for the 142regular expression), 143an empty set of 144.Ql () 145(matching the null string)\(dd, 146a 147.Em bracket expression 148(see below), 149.Ql .\& 150(matching any single character), 151.Ql \&^ 152(matching the null string at the beginning of a line), 153.Ql \&$ 154(matching the null string at the end of a line), a 155.Ql \e 156followed by one of the characters 157.Ql ^.[$()|*+?{\e 158(matching that character taken as an ordinary character), 159a 160.Ql \e 161followed by any other character\(dd 162(matching that character taken as an ordinary character, 163as if the 164.Ql \e 165had not been present\(dd), 166or a single character with no other significance (matching that character). 167A 168.Ql \&{ 169followed by a character other than a digit is an ordinary 170character, not the beginning of a bound\(dd. 171It is illegal to end an RE with 172.Ql \e . 173.Pp 174A 175.Em bracket expression 176is a list of characters enclosed in 177.Ql [] . 178It normally matches any single character from the list (but see below). 179If the list begins with 180.Ql \&^ , 181it matches any single character 182(but see below) 183.Em not 184from the rest of the list. 185If two characters in the list are separated by 186.Ql \&- , 187this is shorthand 188for the full 189.Em range 190of characters between those two (inclusive) in the 191collating sequence, 192.No e.g. Ql [0-9] 193in ASCII matches any decimal digit. 194It is illegal\(dd for two ranges to share an 195endpoint, 196.No e.g. Ql a-c-e . 197Ranges are very collating-sequence-dependent, 198and portable programs should avoid relying on them. 199.Pp 200To include a literal 201.Ql \&] 202in the list, make it the first character 203(following a possible 204.Ql \&^ ) . 205To include a literal 206.Ql \&- , 207make it the first or last character, 208or the second endpoint of a range. 209To use a literal 210.Ql \&- 211as the first endpoint of a range, 212enclose it in 213.Ql [.\& 214and 215.Ql .]\& 216to make it a collating element (see below). 217With the exception of these and some combinations using 218.Ql \&[ 219(see next paragraphs), all other special characters, including 220.Ql \e , 221lose their special significance within a bracket expression. 222.Pp 223Within a bracket expression, a collating element (a character, 224a multi-character sequence that collates as if it were a single character, 225or a collating-sequence name for either) 226enclosed in 227.Ql [.\& 228and 229.Ql .]\& 230stands for the 231sequence of characters of that collating element. 232The sequence is a single element of the bracket expression's list. 233A bracket expression containing a multi-character collating element 234can thus match more than one character, 235e.g.\& if the collating sequence includes a 236.Ql ch 237collating element, 238then the RE 239.Ql [[.ch.]]*c 240matches the first five characters 241of 242.Ql chchcc . 243.Pp 244Within a bracket expression, a collating element enclosed in 245.Ql [= 246and 247.Ql =] 248is an equivalence class, standing for the sequences of characters 249of all collating elements equivalent to that one, including itself. 250(If there are no other equivalent collating elements, 251the treatment is as if the enclosing delimiters were 252.Ql [.\& 253and 254.Ql .] . ) 255For example, if 256.Ql x 257and 258.Ql y 259are the members of an equivalence class, 260then 261.Ql [[=x=]] , 262.Ql [[=y=]] , 263and 264.Ql [xy] 265are all synonymous. 266An equivalence class may not\(dd be an endpoint 267of a range. 268.Pp 269Within a bracket expression, the name of a 270.Em character class 271enclosed in 272.Ql [: 273and 274.Ql :] 275stands for the list of all characters belonging to that 276class. 277Standard character class names are: 278.Pp 279.Bl -column "alnum" "digit" "xdigit" -offset indent 280.It Em "alnum digit punct" 281.It Em "alpha graph space" 282.It Em "blank lower upper" 283.It Em "cntrl print xdigit" 284.El 285.Pp 286These stand for the character classes defined in 287.Xr ctype 3 . 288A locale may provide others. 289A character class may not be used as an endpoint of a range. 290.Pp 291A bracketed expression like 292.Ql [[:class:]] 293can be used to match a single character that belongs to a character 294class. 295The reverse, matching any character that does not belong to a specific 296class, the negation operator of bracket expressions may be used: 297.Ql [^[:class:]] . 298.Pp 299There are two special cases\(dd of bracket expressions: 300the bracket expressions 301.Ql [[:<:]] 302and 303.Ql [[:>:]] 304match the null string at the beginning and end of a word respectively. 305A word is defined as a sequence of word characters 306which is neither preceded nor followed by 307word characters. 308A word character is an 309.Em alnum 310character (as defined by 311.Xr ctype 3 ) 312or an underscore. 313This is an extension, 314compatible with but not specified by 315.St -p1003.2 , 316and should be used with 317caution in software intended to be portable to other systems. 318.Pp 319In the event that an RE could match more than one substring of a given 320string, 321the RE matches the one starting earliest in the string. 322If the RE could match more than one substring starting at that point, 323it matches the longest. 324Subexpressions also match the longest possible substrings, subject to 325the constraint that the whole match be as long as possible, 326with subexpressions starting earlier in the RE taking priority over 327ones starting later. 328Note that higher-level subexpressions thus take priority over 329their lower-level component subexpressions. 330.Pp 331Match lengths are measured in characters, not collating elements. 332A null string is considered longer than no match at all. 333For example, 334.Ql bb* 335matches the three middle characters of 336.Ql abbbc , 337.Ql (wee|week)(knights|nights) 338matches all ten characters of 339.Ql weeknights , 340when 341.Ql (.*).*\& 342is matched against 343.Ql abc 344the parenthesized subexpression 345matches all three characters, and 346when 347.Ql (a*)* 348is matched against 349.Ql bc 350both the whole RE and the parenthesized 351subexpression match the null string. 352.Pp 353If case-independent matching is specified, 354the effect is much as if all case distinctions had vanished from the 355alphabet. 356When an alphabetic that exists in multiple cases appears as an 357ordinary character outside a bracket expression, it is effectively 358transformed into a bracket expression containing both cases, 359.No e.g. Ql x 360becomes 361.Ql [xX] . 362When it appears inside a bracket expression, all case counterparts 363of it are added to the bracket expression, so that (e.g.) 364.Ql [x] 365becomes 366.Ql [xX] 367and 368.Ql [^x] 369becomes 370.Ql [^xX] . 371.Pp 372No particular limit is imposed on the length of REs\(dd. 373Programs intended to be portable should not employ REs longer 374than 256 bytes, 375as an implementation can refuse to accept such REs and remain 376POSIX-compliant. 377.Pp 378Obsolete 379.Pq Dq basic 380regular expressions differ in several respects. 381.Ql \&| 382is an ordinary character and there is no equivalent 383for its functionality. 384.Ql \&+ 385and 386.Ql ?\& 387are ordinary characters, and their functionality 388can be expressed using bounds 389.No ( Ql {1,} 390or 391.Ql {0,1} 392respectively). 393Also note that 394.Ql x+ 395in modern REs is equivalent to 396.Ql xx* . 397The delimiters for bounds are 398.Ql \e{ 399and 400.Ql \e} , 401with 402.Ql \&{ 403and 404.Ql \&} 405by themselves ordinary characters. 406The parentheses for nested subexpressions are 407.Ql \e( 408and 409.Ql \e) , 410with 411.Ql \&( 412and 413.Ql \&) 414by themselves ordinary characters. 415.Ql \&^ 416is an ordinary character except at the beginning of the 417RE or\(dd the beginning of a parenthesized subexpression, 418.Ql \&$ 419is an ordinary character except at the end of the 420RE or\(dd the end of a parenthesized subexpression, 421and 422.Ql \&* 423is an ordinary character if it appears at the beginning of the 424RE or the beginning of a parenthesized subexpression 425(after a possible leading 426.Ql \&^ ) . 427Finally, there is one new type of atom, a 428.Em back reference : 429.Ql \e 430followed by a non-zero decimal digit 431.Em d 432matches the same sequence of characters 433matched by the 434.Em d Ns th 435parenthesized subexpression 436(numbering subexpressions by the positions of their opening parentheses, 437left to right), 438so that (e.g.) 439.Ql \e([bc]\e)\e1 440matches 441.Ql bb 442or 443.Ql cc 444but not 445.Ql bc . 446.Sh SEE ALSO 447.Xr regex 3 448.Rs 449.%T Regular Expression Notation 450.%R IEEE Std 451.%N 1003.2 452.%P section 2.8 453.Re 454.Sh BUGS 455Having two kinds of REs is a botch. 456.Pp 457The current 458.St -p1003.2 459spec says that 460.Ql \&) 461is an ordinary character in 462the absence of an unmatched 463.Ql \&( ; 464this was an unintentional result of a wording error, 465and change is likely. 466Avoid relying on it. 467.Pp 468Back references are a dreadful botch, 469posing major problems for efficient implementations. 470They are also somewhat vaguely defined 471(does 472.Ql a\e(\e(b\e)*\e2\e)*d 473match 474.Ql abbbd ? ) . 475Avoid using them. 476.Pp 477.St -p1003.2 478specification of case-independent matching is vague. 479The 480.Dq one case implies all cases 481definition given above 482is current consensus among implementors as to the right interpretation. 483.Pp 484The syntax for word boundaries is incredibly ugly. 485