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
Fully Managed MySQL, PostgreSQL, and SQL Server
Automatic backups, patching, replication, and failover. Focus on your app, not your database.
Cloud SQL handles your database ops end to end, so you can focus on your app.
Java-based Dialect of the Unicon Programming Language
Junicon is a Java-based implementation of Unicon, a very high level object-oriented goal-directed programming language that lives at Unicon.org. Junicon features seamless Java object access, interactive interpretation, and numerous cleanups and enhancements while retaining Unicon's core expression-evaluation semantics.
Please see the Junicon Project Web Site for publications about Junicon.
orca is yet another script language which supports OO & distribute processing & functional programming aspects. And It's useful in string processing with decode statements & regularexpression in it.
DFA library is a regularexpression 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
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.
Implements the C++ parser class usable for finding the matches in the input using regularexpression. The regularexpression pattern is a parameter in parsers constructor. Also allows to retrieve subexpressions matches in few steps. Supports wide chars.
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.
RegularExpression Library - provides a very fast DFA (Deterministic Finite Automaton) based matching algorithm, and full compliance with POSIX.2 except for internationalization features