Search Results for "regular"

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.

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

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.

RockScript is the world's smallest Java-based JavaScript interpreter, runs smoothly in any J2ME phones. The binary size of core engine including native objects/methods is less than 25K (obfuscated & JAR'ed). It can be integrated into any J2ME apps.

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++.

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

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.

A java regular expression processor using finate statemachines.

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.

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.

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.

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.

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.

Regular Expression Library - provides a very fast DFA (Deterministic Finite Automaton) based matching algorithm, and full compliance with POSIX.2 except for internationalization features