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
Host LLMs in Production With On-Demand GPUs
NVIDIA L4 GPUs. 5-second cold starts. Scale to zero when idle.
Deploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
Javatools that any Java project will find useful. Highlights are a Rogue Wave DBTools.h++ lookalike that makes RDBMS access easy. It includes an SQL parser and generator. An implementation of Cron and Crontab in java. File logging and assert classes.
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
QMathParser is a math expressionparser(evaluator) written in C++ that uses the fast muParser library. It's interface is powered by the cross-platform Qt toolkit.
JmxHist keeps monitoring history of your application's state, via JMX, and stores in a csv file. You can specify MBeans/Attributes to be stored. You can take certain action when an attribute meet a threshold. It shows charts of the data via web.
Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
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.
The fast, flexible, extensible, and easy to use C++ template class for creating your own customized math expressionparser for both built-in and user-defined numerical data types. The parsed tree perform fast and can be used in multi-threaded OpenMP apps
A backtracking (non-packrat) parser generator for parsing expression grammars. The parsers are generated at run-time using the LLVM JIT compilation engine.
Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.
Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
Expr4J aims to provide a general purpose expressionparser, which is also compatible with Microsoft Excel. It will provide an implementation of the built in functions in MS Excel as well as a calculation engine.
Fast and reliable C++ library designed to parse Board Bulletin Codes
bbcode is a C++ library that provides full support for Board Bulletin Codes (bbcode). bbcode library is designed to support C/C++ users and is the onlye stable xplatform GNU lib. Using bbcodelib would save a valuable time.
Unlike many many other regular expression libraries this is a real parser. It uses finite state machines (FSMs) and should produce fast and accurate results.
A collection of python scripts to create and handle an XML corpus (a large collection of text for linguistic purpose) from an original Wikipedia database backup dump. It includes a regular expression based parser for the MediaWiki markup language.
Ceme Evaluates Math Expressions. Ceme is a free math expressionparser library written in C# supporting various operators and functions. It also has the option of adding your own functions. A wrapper DLL is provided for non .NET applications.
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.
Currently, this project consists of a pure java math expressionparser optimized for repeated evaluation. Development of an interactive 3D math visualization application based on this parser is planned for the future.
CurveDraw is a software that aim to draw 2D curves (Cartesian,polaire).
The software is 100% Java.CurveDraw is based on JEP library (Java Math ExpressionParser) .
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.
JFEP is a Java fast mathematical expressionparser and evaluator. It is designed to avoid inefficiency and to support multiple evaluations without overhead.
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.
C++ template classes for declaring non-left recursive grammars (in BNF) directly in the code as set of compound classes. Includes implementation of regular expressionparser - regexp_parser. Supports wide char. See http://grammar2parser.sourceforge.net/
Expression4J (Math ExpressionParser) 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 ...)
Perl Entrez Gene Parser project provides Perl parsers for NCBI's Entrez Gene based on regular expression, Parse::RecDescent, Parse::Yapp and Perl-byacc. Some can parse human genome annotations in minutes. Documentation and user guides are provided.