Search Results for "regular expression parser"
Sort By:
15 projects for "regular expression parser" with 2 filters applied:
-
Cut Cloud Costs with Google Compute EngineSave on compute costs with Compute Engine. Reduce your batch jobs and workload bill 60-91% with Spot VMs. Compute Engine's committed use offers customers up to 70% savings through sustained use discounts. Plus, you get one free e2-micro VM monthly and $300 credit to start.
-
Catch Bugs Before Your Customers DoMove from alert to fix before users notice. AppSignal monitors errors, performance bottlenecks, host health, and uptime—all from one dashboard. Instant notifications on deployments, anomaly triggers for memory spikes or error surges, and seamless log management. Works out of the box with Rails, Django, Express, Phoenix, Next.js, and dozens more. Starts at $23/month with no hidden fees.
-
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
DFA library is a regular expression library capable of the classic RE syntax (i.e. - without any perl extension). Unlike many other libraries with similar functionality, a deterministic finite automata (DFA) is used. DFA was formerly called npcre, wh
-
$300 in Free Credit Across 150+ Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale with Google Cloud.
-
5
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
-
6
bdbbasic
Multi-User Database Interpreted BASIC Environment
This is an Open Sourced BASIC interpreter environment using PostgreSQL. It is focused on (1) Simple to program, (2) Powerful database statements, (3) UNIX shell friendly, (4) Business focused, (5) "Function" over "speed". This is *not* another VB implementation. Extensive language documentation is available. -
7
A collection of Metasyntaxes like EBNF for .Net including a definition file parser and an expression tree.
-
8
-
9
-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI Studio. Switch between models without switching platforms.
-
10
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.
-
11
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 ...)
-
12
RefLisp is a small Lisp interpreter written in C++. It has: an built-in web server, Wiki, LISP server pages, SQL Databases, XML parser, MD5 hashing, regular expressions, reference counting and mark-sweep garbage collection, GPL.
-
13
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.
-
14
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
-
15
Regular Expression Library - provides a very fast DFA (Deterministic Finite Automaton) based matching algorithm, and full compliance with POSIX.2 except for internationalization features
- Previous
- You're on page 1
- Next
