A pure Python LR/GLR parser - http://www.igordejanovic.net/parglare/
-
Updated
Jun 7, 2024 - Python
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/
Custom language - including lexer, LR tables, parser
This is a python program implementation for the shift-reduce parsing algorithm.
一个微型的 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
🖨️ Formal Languages and Compiler Design Uni Laboratory tasks
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.