freebsd-dev/lib/libregex/tests/gnuext.in

# BRE Quantifiers
ab\?c	b	abc	abc
ab\+c	b	abc	abc
# BRE Branching
abc\|de	b	abc	abc
a\|b\|c	b	abc	a
\(ab\|bc\)	b	abcd	ab
# ERE Backrefs
(ab)\1	-	ab
(ab)\1	-	abab	abab
\1(ab)	C	ESUBREG
(a)(b)(c)(d)(e)(f)(g)(h)(i)\9	-	abcdefghii	abcdefghii
# \w, \W, \s, \S (alnum, ^alnum, space, ^space)
\w+	-	-%@a0X-	a0X
\w\+	b	-%@a0X-	a0X
\s+	-	aSNTb	SNT
\s\+	b	aSNTb	SNT
# Word boundaries (\b, \B, \<, \>, \`, \')
# (is/not boundary, start/end word, start/end subject string)
\babc\b	&	<abc>	abc
\<abc\> &	<abc>	abc
\Babc\B	&	abc
\B[abc]\B	&	<abc>	b
\B[abc]+	-	<abc>	bc
\B[abc]\+	b	<abc>	bc
\`abc	&	abc	abc
abc\'	&	abc	abc
\`abc\'	&	abc	abc
\`.+\'	-	abNc	abNc
\`.\+\'	b	abNc	abNc
(\`a)	-	Na
(a\`)	-	aN
(a\')	-	aN
(\'a)	-	Na
Add libregex, connect it to the build libregex is a regex(3) implementation intended to feature GNU extensions and any other non-POSIX compliant extensions that are deemed worthy. These extensions are separated out into a separate library for the sake of not cluttering up libc further with them as well as not deteriorating the speed (or lack thereof) of the libc implementation. libregex is implemented as a build of the libc implementation with LIBREGEX defined to distinguish this from a libc build. The reasons for implementation like this are two-fold: 1.) Maintenance- This reduces the overhead induced by adding yet another regex implementation to base. 2.) Ease of use- Flipping on GNU extensions will be as simple as linking against libregex, and POSIX-compliant compilations can be guaranteed with a REG_POSIX cflag that should be ignored by libc/regex and disables extensions in libregex. It is also easier to keep REG_POSIX sane and POSIX pure when implemented in this fashion. Tests are added for future functionality, but left disconnected for the time being while other testing is done. Reviewed by: cem (previous version) Differential Revision: https://reviews.freebsd.org/D12934 2018-01-22 02:44:41 +00:00			`# BRE Quantifiers`
			`ab\?c b abc abc`
			`ab\+c b abc abc`
			`# BRE Branching`
			`abc\\|de b abc abc`
			`a\\|b\\|c b abc a`
			`\(ab\\|bc\) b abcd ab`
			`# ERE Backrefs`
			`(ab)\1 - ab`
			`(ab)\1 - abab abab`
			`\1(ab) C ESUBREG`
			`(a)(b)(c)(d)(e)(f)(g)(h)(i)\9 - abcdefghii abcdefghii`
			`# \w, \W, \s, \S (alnum, ^alnum, space, ^space)`
			`\w+ - -%@a0X- a0X`
			`\w\+ b -%@a0X- a0X`
			`\s+ - aSNTb SNT`
			`\s\+ b aSNTb SNT`
			# Word boundaries (\b, \B, \<, \>, \`, \')
			`# (is/not boundary, start/end word, start/end subject string)`
libregex: implement \b and \B (word boundary, not word boundary) This is the last of the needed GNU expressions before we can unleash bsdgrep by default. \b is effectively an agnostic equivalent of \< and \>, while \B will match every space that isn't making a transition from nonchar -> char or char -> nonchar. 2020-12-05 03:16:05 +00:00			`\babc\b & <abc> abc`
Add libregex, connect it to the build libregex is a regex(3) implementation intended to feature GNU extensions and any other non-POSIX compliant extensions that are deemed worthy. These extensions are separated out into a separate library for the sake of not cluttering up libc further with them as well as not deteriorating the speed (or lack thereof) of the libc implementation. libregex is implemented as a build of the libc implementation with LIBREGEX defined to distinguish this from a libc build. The reasons for implementation like this are two-fold: 1.) Maintenance- This reduces the overhead induced by adding yet another regex implementation to base. 2.) Ease of use- Flipping on GNU extensions will be as simple as linking against libregex, and POSIX-compliant compilations can be guaranteed with a REG_POSIX cflag that should be ignored by libc/regex and disables extensions in libregex. It is also easier to keep REG_POSIX sane and POSIX pure when implemented in this fashion. Tests are added for future functionality, but left disconnected for the time being while other testing is done. Reviewed by: cem (previous version) Differential Revision: https://reviews.freebsd.org/D12934 2018-01-22 02:44:41 +00:00			`\<abc\> & <abc> abc`
libregex: implement \b and \B (word boundary, not word boundary) This is the last of the needed GNU expressions before we can unleash bsdgrep by default. \b is effectively an agnostic equivalent of \< and \>, while \B will match every space that isn't making a transition from nonchar -> char or char -> nonchar. 2020-12-05 03:16:05 +00:00			`\Babc\B & abc`
			`\B[abc]\B & <abc> b`
			`\B[abc]+ - <abc> bc`
			`\B[abc]\+ b <abc> bc`
libregex: implement \` and \' (begin-of-subj, end-of-subj) These are GNU extensions, generally equivalent to ^ and $ except that the new syntax will not match beginning of line after the first in a multi-line expression or the end of line before absolute last in a multi-line expression. 2020-12-05 03:13:47 +00:00			\`abc & abc abc
			`abc\' & abc abc`
			\`abc\' & abc abc
			\`.+\' - abNc abNc
			\`.\+\' b abNc abNc
			(\`a) - Na
			(a\`) - aN
			`(a\') - aN`
			`(\'a) - Na`