Compiler Design 1 min read
Declarations
When we encounter declarations, we need to lay out storage for the declared variables. For every local name in a…
THE ARCHIVES
Author: Boomi Nathan.
J. BoomiNathan is a writer at SenseCentral who specializes in making tech easy to understand. He covers mobile apps, software, troubleshooting, and step-by-step tutorials designed for real people—not just experts. His articles blend clear explanations with practical tips so readers can solve problems faster and make smarter digital choices. He enjoys breaking down complicated tools into simple, usable steps.
Compiler Design 1 min read
YACC
YACC stands for Yet Another Compiler Compiler. YACC provides a tool to produce a parser for a given grammar. YACC is…
Compiler Design 3 min read
LALR (1) Parsing
LALR refers to the lookahead LR. To construct the LALR (1) parsing table, we use the canonical collection of LR…
Compiler Design 1 min read
Parse tree and Syntax tree
When you create a parse tree then it contains more details than actually needed. So, it is very difficult to…
Compiler Design 5 min read
Three-address code
Three-address code is a sequence of statements of the general form x : = y op z where x, y…
Compiler Design 4 min read
Intermediate Code Generation
A source code can directly be translated into its target machine code, then why at all we need to translate…
Compiler Design 2 min read
CONSTRUCTING SLR(1) PARSING TABLE
To perform SLR parsing, take grammar as input and do the following: 1. Find LR(0) items. 2. Completing the closure. 3. Compute goto(I,X),…
Compiler Design 3 min read
Error Recovery
A parser should be able to detect and report any error in the program. It is expected that when an…
Compiler Design 3 min read
LR PARSERS
An efficient bottom-up syntax analysis technique that can be used CFG is called LR(k) parsing. The ‘L’ is for left-to-right…
Compiler Design 5 min read
BOTTOM-UP PARSING
Constructing a parse tree for an input string beginning at the leaves and going towards the root is called bottom-up…
Compiler Design 6 min read
TOP-DOWN PARSING
It can be viewed as an attempt to find a left-most derivation for an input string or an attempt to…
Compiler Design 3 min read
WRITING A GRAMMAR
A grammar consists of a number of productions. Each production has an abstract symbol called a nonterminal as its left-hand side, and a sequence of one…