Skip to content

Category Archives: Compiler Design

Prerequisite :  Designing Finite Automata Introduction :In this article, we will discuss the DFA in LEX Code that accepts the string having even number’s of… Read More
Constant Propagation is one of the local code optimization technique  in Compiler Design. It can be defined as the process of replacing the constant value… Read More
In this article, we are going to explain Access Links and Control Links. Well, both are in the field of Activation Records. Activation Record : An… Read More
Overview :The purpose of this article is to tell you about an iterative algorithm for forward data-flow problem. Before starting, you should know some terminology… Read More
LR parsers :It is an efficient bottom up syntax analysis technique that can be used to parse large classes of  context-free grammar  is called LR(k)… Read More
LALR Parser :LALR Parser is lookahead LR parser. It is  the most powerful parser which can handle large classes of grammar. The size of CLR… Read More
A compiler is a software program that transforms a program or code written in a high-level programming language into a low-level machine-readable language. When we… Read More
Prerequisite : LR Parser. The LR parser is an efficient bottom up syntax analysis technique that can be used to large class of context-free grammar.This… Read More
Prerequisite : LR Parser LR parsers :It is an efficient bottom up syntax analysis technique that can be used to parse a large classes of… Read More
Directed Acyclic Graph :The Directed Acyclic Graph (DAG) is used to represent the structure of basic blocks, to visualize the flow of values between basic… Read More
Prerequisites : Context Free Grammars , Ambiguous Grammar, Difference between ambiguous and unambiguous grammar, Precedence and Associativity of operators, Recursive GrammarIn this article we are… Read More
Given a string S that represents an integer, the task is to check if the given string S represents an unsigned integer or not by… Read More
Prerequisite — construction of LL(1) parsing table.LL(1) parsing is a top-down parsing method in the syntax analysis phase of compiler design.  Required components for LL(1)… Read More
In this article, we will discuss LR parser, and it’s overview and then will discuss the algorithm. Also, we will discuss the parsing table and… Read More
Lex is a computer program that generates lexical analyzers. Lex reads an input stream specifying the lexical analyzer and outputs source code implementing the lexer… Read More