Compilers
- 81
- Hapy
- A runtime parser generator library. It generates parsers from BNF-like language grammars. Parsing scripting languages and communication protocol messages are typical use cases. [Public domain]
- 82
- IParse
- An interpreting parser, meaning that it accepts as input a grammar and a source file to be parsed according to that grammar, producing an abstract program tree. Very compact implementation.
- 83
- IronMeta
- IronMeta is an implementation of Alessandro Warth's OMeta metaprogramming system in C#. It provides a packrat parser generator that generates parsers for Parsing Expression Grammars that operate on arbitrary streams of objects.
- 84
- JB2CSharp
- A port of the Java-Bison/Flex software developed by the Serl project at the University of Colorado, Boulder. Parsers and lexers will be able to use C# actions. The open source .NET project Mono has requested the port, and here it is. [Open source, BSD License]
- 85
- LLgen parser generator
- A tool for generating an efficient recursive descent parser from an ELL(1) grammar. The grammar may be ambiguous or more general than ELL(1): there are both static and dynamic facilities to resolve the ambiguities.
- 86
- Lapg
- The combined lexical analyzer and parser generator, which converts a description for a context-free LALR grammar into source file to parse the grammar. [Open source, GPL]
- 89
- PCCTS Resources
- The primary source of maintenance releases for the PCCTS compiler construction tool set. PCCTS is an LL(k) recursive descent parser generator with semantic predicates and backtracking. It was developed by T.J. Parr.
- 90
- PRECC - A PREttier Compiler-Compiler
- An infinite-lookahead parser generator for context-dependent grammars which generates ANSI C code. Specification scripts are in very extended BNF with inherited and synthetic attributes allowed. Converter for yacc scripts is available as well as documentation and related papers.
- 91
- Pattern matching
- Pattern matching in syntax analysis as influenced by SNOBOL4. The library distributed under the GNU Library General Public License provides for recursive patterns, various iterators and user-defined patterns along with bindings for Ada, K and R C/ANSI C/C++.
- 92
- Ragel State Machine Compiler
- Compiles FSMs from regular languages into executable C, C++, Objective-C or D code. The GPL'ed software can be used to create a parser for any language that is regular. Examples include parsing Unix mailbox files and general lexing tasks.
- 93
- Rie compiler
- This compiler frontend generation system based on an ECLR-attributed grammar is open source, written in C and may be regarded as an extension of Yacc/Bison.
- 94
- SGLR: a Scannerless Generalized LR parser
- Interprets parse tables generated from an SDF2 syntax definition. Scannerless means that no scanner is used to tokenize the input stream; the parse table contains enough information for both the lexical and the context-free syntax. [Open source (LGPL)]
- 95
- TextTransformer
- A parsergenerator, a simple c++ interpreter and an interactive debugger combined to a visual development environment, which analyzes, evaluates, converts texts immediately.
- 96
- The LEMON Parser Generator
- Very simple LALR(1) open-source parser generator. Outputs C, claims to produce faster parsers than yacc/bison.
- 97
- The LEX & YACC Page
- All about Lex, Yacc, Flex, and Bison: Overview, Online Documentation, Papers, Tools, Pointers
- 98
- The RDP parser generator
- A parser generator which compiles attributed LL(1) grammars decorated with C semantic actions into recursive descent compilers.