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/
一个微型的 LL/LR/LALR 语法解析器 | A micro compiler project to provide LL/LR/LALR syntax parser
Generating LR parser for a given grammar.
A compiler-compiler for lexers, LL and LALR grammars, written in python
This is a python program implementation for the shift-reduce parsing algorithm.
Several implementations in Python language of some of the parsing techniques such as LL(1) parsing, SLR(1) parsing ,LR(0) parsing and LR(1) parsing.
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.
《编译原理》课程设计，基于 LR (1) 分析的类 C 语言语法分析器
Custom language - including lexer, LR tables, parser
🖨️ Formal Languages and Compiler Design Uni Laboratory tasks