Search Results for "regular expressions"

...In POSIX mode, RE2 accepts standard POSIX (egrep) syntax regular expressions. In Perl mode, RE2 accepts most Perl operators. The only excluded ones are those that require backtracking (and its potential for exponential runtime) to implement. These include backreferences (submatching is still okay) and generalized assertions. The Syntax page documents the supported Perl-mode syntax in detail.

...The slg tool takes a .lexer file that contains the description of a lexical analyzer as input and produces C++ source code for a lexical analyzer as output. The produced lexical analyzer is a finite state machine that recognizes patterns described as regular expressions and return corresponding token identifiers to the parser. The spg tool takes .parser files that contain descriptions of parsers as input and produces C++ source code for parser classes as output. The parser generator produces a recursive descent top-down backtracking parser that use the lexical analyzer generated by slg to tokenize the input.

This library is supposed to be used in your C++ programs for managing simple Unix configuration files like /etc/hosts. The library allows to create default configuration, read the configuration file, validate each found option or value with C++ std::regex, automatically remove incorrect options and even merge several configurations with predefined priorities for each option. So it may be useful in programs which use several configuration files. For an extra example of the library usage see...

PET is a C++ library that implements generic regular path expressions. It provides a set of classes and overloaded operators that allow the programmer to define regular path expressions over user-defined data structures using solely the GCC compiler