Search Results for "regular 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.

A light-weight Regular Expression (regex) C library, using double-recursion. (command prompt tester included)

Dieser Parser, soll arithmetische Ausdrücke, die als String vorliegen, ausrechnen, bzw. diverse Funktionen darauf anwenden können. Bis jetzt kann er nur Audrücke wie "4^(5+2)-23*4/cos(3)" ausrechnen. er unterstützt auch vergleichsoperatoren

Fastest string utility is java library (JAR ) for string operation . This library is very easy to use, very fast and very efficient in string operations such as split, toUpperCase, toLowerCase, replace, delete, regular expression and others.

A cron expression parser.

Multi-platform regular expression (regex) creation. Highlights regex matches, and regex groups for quick regular expression creation. Save/load regular expression sessions. Create robust regex patterns on any major platform. Supports PCRE and wxRegEx.

wxPCRE is a cross-platform PCRE C++ wrapper that is built for use with wxWidgets. It was engineered to be a direct 'drop-in' replacement for wxRegEx (the native regular expression library). This is a pcre wrapper implementation wxWidgets style.

JFEP is a Java fast mathematical expression parser and evaluator. It is designed to avoid inefficiency and to support multiple evaluations without overhead.

The treexpr library is a Free Software library that applies regular expression concepts to tree structures. It it written in C and has a JNI binding to Java.