Search Results for "regular"
Sort By:
Showing 13 open source projects for "regular"
View related business solutions-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
$300 Free Credits for Your Google Cloud ProjectsLaunch 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.
-
1
Saxon XSLT and XQuery Processor
The Saxon XSLT and XQuery processor, developed by Saxonica
The home page for the Saxon XSLT 3.0, XQuery 3.1, and XPath 3.1 processor has moved to http://www.saxonica.com/. Information on this site is no longer kept up to date. Sourceforge was the home for open-source versions of the Saxon XSLT 3.0, XQuery 3.1, and XPath 3.1, processor from 1999 until 2022. From version 12.0 in January 2023, you need to visit the Saxonica site at http://www.saxonica.com/ for the latest information and releases. -
2
newLISP for BSDs, LINUX, MacOS X, SunOS and Win32: small, fast 350+ functions, a -C-, MySQL, PostgreSQL, SQLite, ODBC, TCP/IP, UDP, XML, Java interface, string processing, regular expressions , math, financial, statistical functions, Win32 DLL
-
3
orca is yet another script language which supports OO & distribute processing & functional programming aspects. And It's useful in string processing with decode statements & regular expression in it.
-
4
Generate parsers with ease, using a graphical user interface, or console. Design your parsers graphically or by using standard regular expressions and BNF syntax similar to lex/yacc. Generated parsers can be in C or C++.
-
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
5
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
-
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
-
8
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.
-
9
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.
-
AI Agents That Actually Do the WorkClickUp's Super Agents run 24/7 inside your workspace: triaging bugs, drafting content, updating statuses, and routing tasks without being told twice. Connect them to 500+ tools and let them execute, not just suggest. Build custom agents in minutes that understand your workflows and act on them autonomously.
-
10
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.
-
11
A run-time configurable character stream tokenizer that allows the user to define token classes via regular expressions. The developer is not limited to predefined notions of whitespace, commenting, or word modalities.
-
12
STack Oriented Interactive Compiler Adapted to Linux. POSIX threads, regular expressions, sockets, associative arrays (hashes), dynamic memory/GC, floating point math, types, and more. An RPN language, inspired by STOIC and Forth.
-
13
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
