Skip to content
#

LR parser

Star

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...

Language: Java
Filter by language
All 10 Java 10 C++ 9 Python 9 C 7 C# 7 Common Lisp 2 Rust 2 CSS 1 Go 1 JavaScript 1

Osipo / CompilerCourse

Star 2

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…

algorithms lr-parser lexer-generator compiler-design algorithms-and-data-structures slr-parser ll1-parser lr1-parser
  • Updated May 22, 2021
  • Java
Followers
7 followers
Wikipedia
Wikipedia

Related Topics

ll-parser