Skip to content

Category Archives: Compiler Design

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
In this, we will cover the overview of Operator Precedence Parser and mainly focus on the role of Operator Precedence Parser. And will also cover… Read More
Introduction :The computer is an intelligent combination of software and hardware. Hardware is simply a piece of mechanical equipment and its functions are being compiled… Read More
1. Compiler :Compiler, as name suggests, is a process that is used to convert code into machine instructions. It simply translates source code from high-level… Read More
Regular grammar is a type of grammar that describes a regular language. A regular grammar is a mathematical object, G, which consists of four components,… Read More
Given a string S, the task is to design a Deterministic Finite Automata (DFA) for accepting the language L = C (A + B)+. If… Read More
Register allocation is an important method in the final phase of the compiler . Registers are faster to access than cache memory . Registers are… Read More
Target code generation is the final Phase of Compiler. Input : Optimized Intermediate Representation. Output : Target Code. Task Performed : Register allocation methods and… Read More
In this article, We are going to cover address binding with the help of an example and Its types like compile time, load time, and… Read More
In this article we will study the concept and uses of Parse Tree in Compiler Design. First, let us check out two terms : Parse… Read More
BNF stands for Backus Naur Form notation. It is a formal method for describing the syntax of programing language which is understood as Backus Naur… Read More