LR parser
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.
Here are 10 public repositories matching this topic...
This is my labs from Compilers Design Course, being taught in BMSTU. Lab 1 - Constructing minimal DFA from regex in 3 phases (r => NFA => DFA => minimal DFA). Lab 2 = Grammar processing. (Removing cycles, left recursion, left factorizing, etc.) Lab 3 = LL(1), SLR(1) and LR(1) parser generator and lexer generator. Lexer based on minimal DFA. Each…
-
Updated
May 22, 2021 - Java
Java Software that contains building blocks for the construction of a compiler.
-
Updated
Jan 4, 2021 - Java
Hand made LR Compiler for OOP Language based on Java, Kotlin and C#.
-
Updated
Mar 6, 2021 - Java
LR Parser (LR(0), SLR(1), CLR(1) and LALR(1))
-
Updated
Jun 2, 2023 - Java