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.

ThyLordRoot's Interpreted S-expression Parser (TISP) is a LISP-like programming language developed for the benefit of ThyLordRoot's viewers on Twitch.tv. This heritage was chosen for its simplicity and affordance of rapid prototyping. Although it is a toy language, it is intended to be Turing complete, and bootstrapping TISP is a major goal.

Waxeye is a parser generator based on parsing expression grammars (PEGs). It supports C, Java, Javascript, Python, Ruby and Scheme.

Dapar is a universal parsing library written in C. It will interpret any grammar you give it in a BNF-like format, and constructs a matching expression tree for any given input. This makes developing a new parser for any language simple and reliable. Includes an ABNF parser, EBNF parser, XML parser and algebraic math parser.

Lightweight XML processor; XML-POJO mapping via Java5 annotations or DTD; Preprocessing of XML documents using expression language; Binary XML; RMI friendly XML; JSON format support; XML marshall/unmarshall; HTML as XML parser; Swing XML Viewer

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 collection of Metasyntaxes like EBNF for .Net including a definition file parser and an expression tree.

Initially a simple C# EBNF file parser that construct the expression tree.

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.

Linear time, dynamic API for lexical analysis and parser generation. Allows for a text-based specification of formal languages with the well-known regular-expressions approach, and using Parsing Expression Grammars as the underlying engine.

Expression4J (Math Expression Parser) is a java framework used to manage mathematic expression stored in String object like "f(x,b)=2*x-cos(b)" or "g(x,y)=f(y,x)*-2". Expression gramar can be define by user (add new operator or type ...)

Java arbitrary-precision calculator and expression parser. "Compiles" text equations into functors to be executed using the Java BigDecimal class.

JEPLite is a light-weighted (re)implementation of the Java Expression Parser (jep.sourceforge.net). The intention is to strip some of its not-so-often-used features, and thus speeding the rest. Includes expression optimizer.

XPath Parser is a library consisting of parser for XPath-expressions and a set of classes which are used to represent their structure. Parser creates class-based structure of an XPath expression which may be manipulated as required. This small library ma