In computer science, LR parsers are a type of bottom-up parser that analyse deterministic context-free languages in linear time.[1] There are several variants of LR parsers: SLR parsers, LALR parsers, Canonical LR(1) parsers, Minimal LR(1) parsers, and GLR parsers. LR parsers can be generated by a parser generator from a formal grammar defining the syntax of the language to be parsed. They are widely used for the processing of computer languages.
Lightweight C++03 lexer/parser generator in a single header + source; outputs DFA code and LR(0)/LR(1) parse tables, and includes built-in table-driven lexing/parsing runtimes
Yet Another Parser Generator takes a grammar specification for an LR(1) grammar as input and generates a C++ header file containing tables and helper structs for parsing the LR(1) grammar.
Compile Time Parser Generator is a C++ single header library which takes a language description as a C++ code and turns it into a LR1 table parser with a deterministic finite automaton lexical analyzer, all in compile time.
A minimal implementation of a C-compiler focusing on the while loop also a full sic assembler
Implementation of Programming Languages Lab
Compiler Design IIT BHU Viva
As of 23.08.2023 this project continues elsewhere.____File Format Description Library
Asparserations is an LR(1) and LALR(1) parser generator frontend. It outputs JSON representing the parse table.
İTÜ BLG 447 - Compiler Design (Derleyici Tasarımı)
This project contains C++ code for the creation of a unix shell. The shell will most likely be a subset of the BASH.
Programming Languages @ Hanyang Univ.