Search Results for "lexer"

...Unlike any other such tool, re2c focuses on generating high efficient code for regular expression matching. As a result this allows a much broader range of use than any traditional lexer.

A C++ high-performance regex library and Flex-compatible lexical analyzer generator with full Unicode support, new indentation anchors, lazy quantifiers, and many other modern features. Accepts Flex lexer specification syntax and is compatible with Bison/Yacc parsers. Generates reusable source code that is easy to understand. Supports fast scanning of UTF-8/16/32 files, strings, and streams. The reflex scanner generator generates clean C++ lexer class code that is thread-safe. Generates Graphviz files to visualize state machine DFAs. ...

...Recognizes particularities of several Pascal dialects: Turbo/Borland/Delphi (mostly), CodeWarrior, ISO, ISO Extended (a bit). Includes a full ayacc / aflex parser & lexer for Ada 95+ with sources. Mirror: https://github.com/zertovitch/pascal-to-ada

This project has moved to GitHub ! The version here at SourceForge will remain for historic purpose. Koopa is a parser generator, made for COBOL. It can handle source files in isolation (no preprocessing required) and doesn't mind the presence of CICS/SQL fragments. The grammar is easily extensible in a way which minimizes the impact on the overall code.

JFlex is a flex-like lexer generator for Java with emphasis on speed and full Unicode support. It has some not so usual features like negation in regexps and nested input streams. Also reads JLex specifications unchanged.

Coco/S is a compiler generator that takes plain EBNF grammar files and features a SAX style call back API. It is written in Java and produces a Java Scanner (Lexer) and Parser for the language described by the input grammar. Coco/S is a branch of the 2010/11 release of Coco/R for Java. While Coco/R takes an attributed grammar file, Coco/S has a callback API. This has the advantage of a clean separation between grammar (EBNF) and Compiler/Interpreter.

...Their state machines are precompiled and serialized, so run time initialization is fast no matter how large the rule set. JPlex is not a parser generator; it only generates an interface for its parsers, and it does not build a parse tree. When the lexer identifies a token that has a named event associated with it, it passes the token to the parser method associated with that event. A lexer can dispatch token events to any number of parsers. JPlex is steadily being improved, and the Subversion repo will almost always be newer and better than the binary download.

QPG is a lexer and parser generator tailored for modern C++. The syntax of its grammer is designed to be more flexible and easily read than those of traditional tools like flex and bison. It's build on Qt4 but can produce output independent of it.

CSP Canonical LR(1) Parser Generator. Includes lexer and parser generator. Supports all OS. Produces code as standard ANSI C++ w/ minimal STL and usable in commercial or non-commercial purposes.

A portable and retargetable lexer/parser generator.

YooParse stands for Yet-another Object-Oriented Parser code generator. It is the complement of YooLex, a lexer code generator. The purpose of YooParse is to generate a parser that integrates tightly with the scanner generated by YooLex.