History

Zher Huei Lee d0ddf150d9 updated the RegEx library nrex to v0.1 After implementing unit testing to nrex I caught and fixed some errors so it should behave more like Python's RegEx In addition, I've added version numbering so it should be able to tell if the library needs updating. Here are a list of changes: - Fixed zero count quantifiers failing. - Fixed infinite recursion if quantifying zero length token. - Fixed `$` (as a string pattern on its own) not matching. - Fixed look behind rewinding beyond the start of the string. - Added support for alternative back reference format `\g{1}` similar to Python. This allows digits to be used immediately after back references. - Number of capture groups are still limited to 9 by default but can now be manually set, with option for no limit at all. (Python has no limit) - Curly bracket quantifiers `{0}` no longer interpreted as a literal string if previous token is not quantifiable. (Python behaviour)		2015-12-04 21:18:41 +00:00
..
nrex.cpp	updated the RegEx library nrex to v0.1	2015-12-04 21:18:41 +00:00
nrex.hpp	updated the RegEx library nrex to v0.1	2015-12-04 21:18:41 +00:00
nrex_config.h	Regex library Nrex initial port	2015-07-24 01:18:46 +01:00
README.md	updated the RegEx library nrex to v0.1	2015-12-04 21:18:41 +00:00
regex.cpp	updated the RegEx library nrex to v0.1	2015-12-04 21:18:41 +00:00
regex.h	updated the RegEx library nrex to v0.1	2015-12-04 21:18:41 +00:00
SCsub	Cosmetic fixes to SCons buildsystem	2015-11-01 20:53:26 +01:00

README.md

NREX: Node RegEx

Version 0.1

Small node-based regular expression library. It only does text pattern matchhing, not replacement. To use add the files nrex.hpp, nrex.cpp and nrex_config.h to your project and follow the example:

nrex regex;
regex.compile("^(fo+)bar$");

nrex_result captures[regex.capture_size()];
if (regex.match("foobar", captures))
{
	std::cout << captures[0].start << std::endl;
	std::cout << captures[0].length << std::endl;
}

More details about its use is documented in nrex.hpp

Currently supported features:

Capturing () and non-capturing (?:) groups
Any character . (includes newlines)
Shorthand caracter classes \w\W\s\S\d\D
POSIX character classes such as [[:alnum:]]
Bracket expressions such as [A-Za-z]
Simple quantifiers ?, * and +
Range quantifiers {0,1}
Lazy (non-greedy) quantifiers *?
Begining ^ and end $ anchors
Word boundaries \b
Alternation |
ASCII \xFF code points
Unicode \uFFFF code points
Positive (?=) and negative (?!) lookahead
Positive (?<=) and negative (?<!) lookbehind (fixed length and no alternations)
Backreferences \1 and \g{1} (limited by default to 9 - can be unlimited)

License

This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software.

Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions:

The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
This notice may not be removed or altered from any source distribution.