DCA 3141 COMPILER DESIGN (ELEC) SEPTEMBER 2025

Description

SESSION	SEPTEMBER 2025
PROGRAM	BACHELOR OF COMPUTER APPLICATIONS (BCA)
SEMESTER	V
COURSE CODE & NAME	DCA 3141 COMPILER DESIGN (ELEC)

 

 

Set-I

 

Q1. Explain different phases of Compiler. 10       

Ans 1.

Phases of a Compiler

Compiler Phases

A compiler is a software system that converts high-level source code into machine-level executable code. This translation process is not performed in a single step but is divided into multiple structured phases, each responsible for a particular transformation. These phases work sequentially to ensure that the program written by the user is syntactically correct, semantically meaningful, optimized, and efficiently converted into executable form. Although implementations differ across languages and platforms, the classical structure of compiler phases remains relatively consistent.

Lexical Analysis Phase

The first phase of the compiler is lexical analysis, also known as scanning. It reads the raw

MUJ

Its Half solved only

Buy Complete assignment from us

Price – 190/  assignment

MUJ Manipal University Complete SolvedAssignments  JULY-AUGUST  2025

buy cheap assignment help online from us easily

we are here to help you with the best and cheap help

Contact No – 8791514139 (WhatsApp)

OR

Mail us-  [email protected]

Our website – https://muj.assignmentsupport.in/

 

 

Q2.  Differentiate between Compiler and Interpreter.  10           

Ans 2.

Difference Between Compiler and Interpreter

A compiler and an interpreter are two types of language processors used to execute high-level programming languages. Although both perform translation from human-readable code to machine-understandable instructions, they differ significantly in the manner, timing, and execution methodology. Understanding their differences helps students choose appropriate tools and languages for specific applications.

Nature of Translation

A compiler translates the entire source program into machine code in one go. It reads the

 

Q3. Write a program to add two numbers in C Language. Create its Token Table in lexical Analysis phase.   2+8     

Ans 3.

C Program and Token Table

Part A: C Program to Add Two Numbers

A simple C program to add two numbers demonstrates the fundamental structure of a compiled language and becomes useful when illustrating the lexical analysis phase. The program below accepts two integers, calculates their sum, and displays the result. This program is minimal yet sufficient to show how tokens are generated during lexical scanning.

#include<stdio.h>

int main() {

int a, b, sum;

a = 10;

 

 

Set-II

Q4. Differentiate between Top Down and Bottom-Up Parsing.  10        

Ans 4.

Difference Between Top-Down and Bottom-Up Parsing

Parsing Approaches

Parsing is a fundamental stage in the syntax analysis phase of a compiler, where the structure of the source code is analyzed based on the grammar rules of the programming language. The two most widely used parsing approaches are Top-Down Parsing and Bottom-Up Parsing. Although both aim to derive a valid parse tree from a given input string, they differ significantly in strategy, direction of construction, complexity, and the type of grammars they accept.

 

 

Q5. Explain 3 Address code generator with an example. 10

Ans 5.

Three-Address Code Generator with Example

Three-Address Code

Three-Address Code (TAC) is an intermediate representation widely used in compilers to simplify complex expressions into a sequence of simple operations. Each TAC instruction typically contains at most three operands, making it easy for subsequent optimization and machine code generation. TAC provides a structured and uniform way to represent computation, and because of its simple syntax, it becomes a bridge between high-level language constructs and

 

 

Q6. Explain different techniques of Code optimization in compiler design. 10  

Ans 6.

Techniques of Code Optimization in Compiler Design

Code Optimization

Code optimization is one of the most important phases in compiler design, aimed at improving the efficiency of the generated code without altering its behavior. Optimization focuses on reducing execution time, minimizing memory usage, improving cache performance, and enhancing overall program quality. Although optimization strategies vary depending on the compiler and the target architecture, several classical techniques remain foundational.

Peephole Optimization

Peephole optimization is a localized technique that examines small sets of instructions, known as