Search Results for "regular expression parser"
Sort By:
Showing 16 open source projects for "regular expression parser"
View related business solutions-
Go From Idea to Deployed AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
Cut Your Data Warehouse Bill by 54%BigQuery delivers 54% lower TCO with serverless scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
1
TISP
A simple, LISP-like programming language.
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. -
2
Waxeye is a parser generator based on parsing expression grammars (PEGs). It supports C, Java, Javascript, Python, Ruby and Scheme.
-
3
Dapar
Parsing for everybody.
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. -
4
orca is yet another script language which supports OO & distribute processing & functional programming aspects. And It's useful in string processing with decode statements & regular expression in it.
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
5
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
-
6
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
-
7
A collection of Metasyntaxes like EBNF for .Net including a definition file parser and an expression tree.
-
8
-
9
-
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
10
-
11
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.
-
12
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.
-
13
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 ...)
-
14
Java arbitrary-precision calculator and expression parser. "Compiles" text equations into functors to be executed using the Java BigDecimal class.
-
15
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.
-
16
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
- Previous
- You're on page 1
- Next
