One platform to build, fine-tune, and deploy ML models. No MLOps team required.
Access Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
Try Free
Our Free Plans just got better! | Auth0
With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
The LALR parser generator (LPG) is a tool for developing scanners and parsers written in Java, C++ or C. Input is specified by BNF rules. LPG supports backtracking (to resolve ambiguity), automatic AST generation and grammar inheritance.
Lapg is the combined lexical analyzer and parser generator, which converts a description for a context-free LALR grammar into source file to parse the grammar. Generates code for Java, Javascript, C, C++ and C#.
A simple way to create a syntax highlighting editor for a custom language/grammar and/or create custom grammar parsers. This is a .NET project written in C#. See details here: http://acct001.com/wordpress/?p=190
Nyu is a PEG based parser generator in which an appropriate AST type and a parser which populates this AST can be created from a single grammar description.
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
The Chilon Library is a C++0x utility library. The most advanced parts are a command-line argument parser and a parser generator library based on parsing expression grammars with built in AST generation abilities.
loon is a GLR parser generator that takes EBNF grammars as specifications. Tokens are specified in the grammar file, and it generates a parse tree instead of executing actions. A single grammar can output a parser in any supported language.
Extension of the CUP parser generator for working with abstract syntax trees (ast). Implements support for class hierarchy generation and automatic tree building from CUP grammar specification files. Version 10k of CUP is used.
Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.
Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
Lemon++ is clone of the Lemon LALR parser generator, written by Dr. Richard Hipp ( http://www.hwaci.com/sw/lemon/ ). It adds support for C++, for example user is not limited to POD types.
QPG is a lexer and parser generator tailored for modern C++. The syntax of its grammer is designed to be more flexible and easily read than those of traditional tools like flex and bison. It's build on Qt4 but can produce output independent of it.
A parser generator based on parsing expression grammar rules. It generates code and accepts actions in LLVM Assembly rather than C like its predecessor, PEG, did.
Parse software messages and transform them into actions. LazyBat has a command line utility which can transform input data, and also a parser generator for C/C++. LazyBat doesn't support recursive parsing, but rather focuses on common parsing jobs.
A universal parsing tool and source code generator for generative programming. It extracts useful information by parsing (BNF parser generator) and generates source code by several techniques, by interpreting a scripting language for flexibility.
Generate a parser at runtime from a collection of C++ objects. Concisely state a parser specification in ordinary C++ code. Learn from a parser generator with an object-oriented design.
A backtracking (non-packrat) parser generator for parsing expression grammars. The parsers are generated at run-time using the LLVM JIT compilation engine.
lightJacc is a small but strong grammar parser generator. It adopts a parsing strategy of its own: dynamic concurrent parsing -- which made it much stronger than LR or LL family CCs (YACC, ANTLR, etc), but still keep good performance.
ParGeL is an LALR(k) parser generator, which allows creation of inheritable parsers in runtime and compile time environments. ParGeL is written 100% in Java.
Complete LALR(1) parser generator and engine in PHP.
Complete LALR(1) parser generator and engine (like BISON or YACC) but it's all done in PHP, and the input grammar is easier and more maintainable. Write your actions in PHP. Generate PHP output code. Drive your parser with PHP. Wanna make a language?
OFD.NET is a project to create an Open Flash Debugger in C#, plus other tools targeting flash technology and especially actionScript. There are plans for a swf parser/generator, an AS3 compiler, a decompiler, etc.
Annotation based lexer and parser generator suitable for processing wide range of languages, from small domain specific languages to big ones like Java. Actions may be written directly as annotated java methods. Examples of expression language and Java5.