Search Results for "regular expressions"

...The slg tool takes a .lexer file that contains the description of a lexical analyzer as input and produces C++ source code for a lexical analyzer as output. The produced lexical analyzer is a finite state machine that recognizes patterns described as regular expressions and return corresponding token identifiers to the parser. The spg tool takes .parser files that contain descriptions of parsers as input and produces C++ source code for parser classes as output. The parser generator produces a recursive descent top-down backtracking parser that use the lexical analyzer generated by slg to tokenize the input.

...The flex program reads user-specified input files, or its standard input if no file names are given, for a description of a scanner to generate. The description is in the form of pairs of regular expressions and C code, called rules. Flex generates a C source file named, "lex.yy.c", which defines the function yylex(). The file "lex.yy.c" can be compiled and linked to produce an executable. When the executable is run, it analyzes its input for occurrences of text matching the regular expressions for each rule. Whenever it finds a match, it executes the corresponding C code.

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.

...Its modular design allows the use of different syntax modules through a unified interface. It comes with a default syntax module that interprets customizable syntax files using regular expressions.

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

PET is a C++ library that implements generic regular path expressions. It provides a set of classes and overloaded operators that allow the programmer to define regular path expressions over user-defined data structures using solely the GCC compiler

Regular expressions editor for Python. It is intended for Python programmers that use regular expressions. It has syntax highlighting, brace matching, results coloring, text zooming, RE insertions and more.

RExASTor is a code generator for tree like structures. The user gives it a set of expressions that look a lot like regular expression but for trees and the tool generates Java data-structures for the described trees.

CSR is a program to identify, modify and replace code in automatic generated source code. A configuration file controls the behavior and actions of CSR. The configuration file usually contains regular expressions to search and replace the code.

YRX: easily use regular expressions in C. Useful for creating lexers (lexical scanners)and other text processing software.

A flexible XML based PHP code generator, generates: 1) fully functional HTML forms that update and insert on multiple tables, 2) validation methods using regular expressions 3) HTML table generation from database using separate HTML layout files.

Translate C code in a pipe to a form usable as regular expressions in sed or grep.