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.
A pure Python LR/GLR parser - http://www.igordejanovic.net/parglare/
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.
LR Parser (LR(0), SLR(1), CLR(1) and LALR(1))
Compiler Design Lab Programs
These are the various assignments that were done as a part of the Compiler Design Laboratory
A C language parser built from the scratch, without using compiler generator.
This is a python program implementation for the shift-reduce parsing algorithm.
Generating LR parser for a given grammar.
CSN-362 Compiler Lab Submissions
一个微型的 LL/LR/LALR 语法解析器 | A micro compiler project to provide LL/LR/LALR syntax parser
Asparserations is an LR(1) and LALR(1) parser generator frontend. It outputs JSON representing the parse table.
This project contains C++ code for the creation of a unix shell. The shell will most likely be a subset of the BASH.
Yet another CLR compiler compiler.
Programming Languages @ Hanyang Univ.
Create LR(1) parsers in your browser and see how they work
Курсовой проект по дисциплине "Теория языков программирования"
A General Parser Compiler and Parser Test Lab
This project is a learning tool designed to help users understand and generate LR parsers, including LR(0), SLR(1), LALR(1), and LR(1). It provides interactive features such as grammar definition, parser construction, and input string testing, enabling users to explore the internal structures and functionality of LR parsers.