Search Results for "cron expression parser"

This library implements PEG (Parsing Expression Grammar) parsers, which can be embedded in a C++ program. The grammars are built and interpreted at run time, without an intermediate code generation stage. It tries to mimic as closely as possible the functionality and style of Ian Piumarta's LEG compiler. LEG grammars can be translated easily and almost mechanically. Actions and semantic predicates can be written directly in the grammar, using lambdas. C++11 or later is required.

The fast, flexible, extensible, and easy to use C++ template class for creating your own customized math expression parser for both built-in and user-defined numerical data types. The parsed tree perform fast and can be used in multi-threaded OpenMP apps

A C++ class for evaluating mathematical expressions written in infix notation

Implements the C++ parser class usable for finding the matches in the input using regular expression. The regular expression pattern is a parameter in parsers constructor. Also allows to retrieve subexpressions matches in few steps. Supports wide chars.