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++
👌 Generating Human-Friendly Functional Parsers for JavaScript
Parsing Expression Grammar Parsing Expression Generator (PEGPEG)
Antelope, the compiler compiler.
⚪ Pearley is a *shiny* new implementation of the Earley parsing algorithm in Javascript.
Re-implementation of the GoldParser builder
A parser generator, similar to BNFC, that takes a parsing expression grammar and outputs PEGTL C++ for it. (WIP)
Recursive descent LL(k) parser for .NET with Fluent API, BNF, EBNF and Gold Grammars
YACC for command-line options. Declaratively generate bulletproof command-line parsers.
Simple demo that shows the basic usage of ANTLR4 lexer, parser and listener
JS parser generator. As fast as yacc, but accepts any grammar!
Top Down, Bottom Up (CYK) Parser Generators in Scala
From the Bison 3.0.4 manual from https://www.gnu.org/software/bison/manual/bison.html
Parser module for TypeScript MAGE projects, used to extract user commands and messageStream messages.
High Performance Incremental Parser Engine
Script para generar analizadores léxicos, sintácticos o semánticos a partir de unos ficheros de especificación con JFlex y CUP, además de ejecutarlos si se desea.