Bazsites.com Lexer And Parser Generators
Directory Topics
On the Web
- Toy Parser Generator for Python - TPG is a parser generator for Python. Given a simple attributed grammar, TPG produces a Python Recursive Descent Parser. It is simple and useful for small parsers for everyday use.
- iburg, A Tree Parser Generator - Generates fast tree parsers for cost-augmented tree grammars. A variant of iburg is used in the code generators for lcc.
- The LEMON Parser Generator - Very simple LALR(1) open-source parser generator. Outputs C, claims to produce faster parsers than yacc/bison.
- Coco/R compiler generator - Coco/R combines the functionality of the well-known UNIX tools lex and yacc, to form an extremely easy to use compiler generator that generates recursive descent parsers, their associated scanners, and (in some versions) a driver program, from attributed grammars (written using EBNF syntax with attributes and semantic actions) which conform to the restrictions imposed by LL(1) parsing (rather than LALR parsing, as allowed by yacc).
- re2c lexer generator - re2c is a tool for writing fast and flexible lexers. A re2c generated scanner is usually 2-3 times faster than a flex based scanner, and its input model is much more flexible.
- GOLD Parser - A free parser generator. Unlike common compiler-compilers, the GOLD Parser does not require you to embed your grammar directly into your source code. Instead, the Builder analyzes the grammar description and saves the parse tables to a separate file. This file can be subsequently loaded by the actual parser engine and used. Currently the GOLD Parser Engine is available in Java, .NET and ActiveX. [Open Source]
- 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.
- The RDP parser generator - A parser generator which compiles attributed LL(1) grammars decorated with C semantic actions into recursive descent compilers.
- 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]
- LLOOP - LLOOP generates C++ LL(1) parsers from EBNF grammars and allows a tight integration with object-oriented applications, based on a symbol/class mapping. The generated code can also perform the reverse operation (expanding), whereby the original input can be re-constituted or modified.
Wikipedia Articles
- List of C Sharp lexer generators - The following is a list of lexer or scanner generators written for the language C#.
- List of parser generators - This is a list of notable parsing systems.
- Simple LR parser - In computer science, a Simple LR parser or SLR parser is an LR parser for which the parsing tables are generated as for an LR(0) parser except that it only performs a reduction with a grammar rule A → w if the next symbol on the input stream is in the follow set of A (see ...
- LALR parser - In computer science, a lookahead LR parser or LALR parser is a specialized form of LR parser that can deal with more context-free grammars than Simple LR (SLR) parsers. It is a very popular type of parser because it gives a good trade-off between the number of grammars it can deal with and the size ...
- GLR parser - [computer science], a GLR parser ("Generalized Left-to-right Rightmost derivation parser") is an extension of an [[LR parser algorithm to handle nondeterministic and ambiguous grammars. First described in a 1986 paper by Masaru Tomita, it has also been referred to as a "parallel parser".