An LALR(1) parser generator for C or C++
-
Updated
Aug 6, 2014 - C
A grammar describes the syntax of a programming language, and might be defined in Backus-Naur form (BNF). A lexer performs lexical analysis, turning text into tokens. A parser takes tokens and builds a data structure like an abstract syntax tree (AST). The parser is concerned with context: does the sequence of tokens fit the grammar? A compiler is a combined lexer and parser, built for a specific grammar.
An LALR(1) parser generator for C or C++
Yacc implementing the algorithms in Dragon Book, including efficiently constructing LALR(1) DFA
Lambda calculus expression simplifier repl
Modified version of Lemon parser with Windows specific features.
PackCC is a packrat parser generator for C.
Bitstream editor empowered with FLAVOR interpreter
Implementation of Packrat Parser Generator algorithm
Just another high-level language implementation
A small parser generator that generates recursive decent parsers
Lemon PureBasic Parser Generator
kmyacc is an LALR(1) parser generator, hopefully compatible with AT&T yacc.
The Lemon parser generator and sibling projects.
Context-free grammar parsing library