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.
Try free now
Go From AI Idea to AI App Fast
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.
Styx is a scanner and parsergenerator designed to address some shortcomings of the traditional lex/yacc combination.
It has unique features like automatic derivation of depth grammar, production of the derivation tree including it's C interface which provides access to the abstract syntax tree, preservation of full source information and pretty printing to facilitate source-source translation, persistence to aid rapid interpreter writing.
JPlex is an unconventional lexical analyzer generator for Java. JPlex lexers are NIO-based, DFA-powered, push-driven, and fully decoupled and reusable. Their state machines are precompiled and serialized, so run time initialization is fast no matter how large the rule set.
JPlex is not a parsergenerator; it only generates an interface for its parsers, and it does not build a parse tree.
ANTLR is a well-known parsergenerator . It can generate parsers in several languages. This project provides the templates to produce D code and a D runtime library for running the created parser. It requires ANTLR tool. Use svn to get D target. One example is included.
This target works with ANTLR 3.4
Turn.Message is .NET parser / generator of the TURN (Traversal Using Relay NAT) messages written in C#. Compatible with [MS-TURN] extension and clients based on Microsoft UCCAPI SDK.
UML 2 Statemachine for C++ is a development framework with DSL support
UML 2 Statemachine Code Generator is a developer framework for an easy implementation of statemachine based applications. Here, with this framework only one Domain-specific language (DSL) specification is necessary to create executable codes for Linux, Mac OS X, and Microsoft Windows. With this framework you save a lot of time and effort during implementation; also you have an always valid - based on a well-defined C++ standard - generated code with high quality.
Developer tools for EXPRESS (ISO 10303-11), an information modeling language. The core of this project is a Java Express parser using the ANTLR parsergenerator. This project was initiated by the National Institute of Standards and Technology.
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 LALR parsergenerator (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 parsergenerator, 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 parsergenerator in which an appropriate AST type and a parser which populates this AST can be created from a single grammar description.
The Chilon Library is a C++0x utility library. The most advanced parts are a command-line argument parser and a parsergenerator library based on parsing expression grammars with built in AST generation abilities.
loon is a GLR parsergenerator 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 parsergenerator 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.
Lemon++ is clone of the Lemon LALR parsergenerator, 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 parsergenerator 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 parsergenerator based on parsing expression grammar rules. It generates code and accepts actions in LLVM Assembly rather than C like its predecessor, PEG, did.