SRL-CPP
Regex builder
A C++11 library for constructing regular expressions with ease and flexibility.
SRL-CPP is a Simple Regex Language builder library written in C++11 that provides an easy to use interface for constructing both simple and complex regex expressions.
0 stars
1 watching
1 forks
Language: C++
last commit: about 3 years ago
Linked from 1 awesome list
Related projects:
Repository | Description | Stars |
---|---|---|
verbalexpressions/cppverbalexpressions | A C++ library for constructing complex regular expressions with a simple and intuitive API. | 382 |
srackham/pcre2 | A library for processing regular expressions using the PCRE2 library | 5 |
verbalexpressions/csharpverbalexpressions | A C# library for constructing regular expressions with a more readable and intuitive syntax. | 1,173 |
zimprojects/srell | A header-only C++ template library for working with regular expressions in ECMAScript-compatible way | 11 |
nasciiboy/recursiveregexpraptor-4 | A C-language regular expression engine designed for speed and simplicity. | 10 |
hedhyw/rex | A flexible regular expression builder for Go. | 196 |
boostorg/regex | A comprehensive C++ regular expression library with advanced features and compiler defect workarounds. | 84 |
drup/tyre | A system for building type-safe regular expressions with automatic extraction and modification of matched groups | 171 |
fsprojects/fsharp.text.regexprovider | A type provider for regular expressions. | 74 |
telekons/one-more-re-nightmare | A fast and efficient regular expression compiler written in Common Lisp | 139 |
verbalexpressions/rubyverbalexpressions | A Ruby library that helps to construct complex regular expressions | 144 |
pcre2project/pcre2 | A set of C functions for regular expression pattern matching using a syntax similar to Perl 5. | 914 |
ocaml/ocaml-re | A library for compiling and executing regular expressions in OCaml. | 232 |
yandex/pire | High-performance text matching library with limited functionality. | 330 |
maxart2501/re-build | A tool to help build and understand regular expressions by breaking them down into natural language | 477 |