Search Results for "regular expressions"

Melody is a language that compiles to regular expressions and aims to be more easily readable and maintainable. All quantifiers can be preceded by lazy to match the least amount of characters rather than the most characters (greedy).

...DParser is a scannerless GLR parser generator based on the Tomita algorithm. It is self-hosted and very easy to use. Grammars are written in a natural style of EBNF and regular expressions and support both speculative and final actions.

Filtrex is a simple and safe JavaScript expression compiler designed for end-user input. It lets users write spreadsheet-like filter expressions without giving them access to raw JavaScript execution. Instead of using eval, Filtrex compiles expressions into JavaScript functions while keeping data access and callable functions under developer control. It supports common use cases such as filtering items, searching across fields, colorizing records, plotting charts, and building browser-based spreadsheet behavior. ...

qtFlexC++ is a tool for generating scanners: programs which recognized lexical patterns in text. qtFlexC++ reads the given input files for a description of a scanner to generate. The description is in the form of pairs of regular expressions and C++ code, called rules. qtFlexC++ generates as output a C++ source and include file, `lexyy.cpp` and `lexyy.h`, which defines a class `lexyy'. This file is compiled with your code to produce an executable. When the executable is run, it analyzes its input for occurrences of the regular expressions. Whenever it finds one, it executes the corresponding C++ code.

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

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.