Search Results for "regular"
Sort By:
11 projects for "regular" with 2 filters applied:
-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
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
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++.
-
4
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
-
Our Free Plans just got better! | Auth0You 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.
-
5
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. -
6
-
7
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.
-
8
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.
-
9
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.
-
$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.
-
10
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.
-
11
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
