summaryrefslogtreecommitdiffstats
path: root/lib/libc/regex/regex.3
diff options
context:
space:
mode:
Diffstat (limited to 'lib/libc/regex/regex.3')
-rw-r--r--lib/libc/regex/regex.36
1 files changed, 3 insertions, 3 deletions
diff --git a/lib/libc/regex/regex.3 b/lib/libc/regex/regex.3
index fe81eff0779..3262a9e4b16 100644
--- a/lib/libc/regex/regex.3
+++ b/lib/libc/regex/regex.3
@@ -1,4 +1,4 @@
-.\" $OpenBSD: regex.3,v 1.10 1999/07/04 18:59:43 aaron Exp $
+.\" $OpenBSD: regex.3,v 1.11 1999/07/09 13:35:22 aaron Exp $
.\"
.\" Copyright (c) 1997, Phillip F Knaack. All rights reserved.
.\"
@@ -550,7 +550,7 @@ REs are anchors, not ordinary characters.
.Xr grep 1 ,
.Xr re_format 7
.Pp
-POSIX 1003.2, sections 2.8 (Regular Expression Notation)
+POSIX 1003.2, sections 2.8 (Regular Expression Notation)
and
B.5 (C Binding for Regular Expression Matching).
.Sh DIAGNOSTICS
@@ -620,7 +620,7 @@ exceeding 0 is expensive;
.Fa nmatch
exceeding 1 is worse.
.Fn regexec
-is largely insensitive to RE complexity
+is largely insensitive to RE complexity
.Em except
that back references are massively expensive.
RE length does matter; in particular, there is a strong speed bonus