📚An educational purpose LR, LL, SLR parser generator
-
Updated
May 20, 2024 - Rust
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.
📚An educational purpose LR, LL, SLR parser generator
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.
Yet another CLR compiler compiler.
Compiler Design - Fall 2023 - Sharif University of Technology
Create LR(1) parsers in your browser and see how they work
A pure Python LR/GLR parser - http://www.igordejanovic.net/parglare/
Compiler Design IIT BHU Viva
Custom language - including lexer, LR tables, parser
LR(1) parser generator with a user-friendly formalism for specifying grammars, written in TypeScript.
Compiler for the alpha language, includes all the essential phases, starting from lexical analysis, followed by syntax analysis, semantic analysis, intermediate code generation, and ultimately the production of machine code.
As of 23.08.2023 this project continues elsewhere.____File Format Description Library
LR Parser (LR(0), SLR(1), CLR(1) and LALR(1))
Proyecto de la materia de Compiladores
A C language parser built from the scratch, without using compiler generator.
Asparserations is an LR(1) and LALR(1) parser generator frontend. It outputs JSON representing the parse table.
Perform certain analysis on a specific grammar.