These are the various assignments that were done as a part of the Compiler Design Laboratory
-
Updated
May 18, 2018 - C
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.
These are the various assignments that were done as a part of the Compiler Design Laboratory
CSN-362 Compiler Lab Submissions
Compiler Design Lab Programs
Implementation of parsers
A C language parser built from the scratch, without using compiler generator.
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.
Yet another CLR compiler compiler.