DCA 3141 COMPILER DESIGN (ELEC) JAN FEB 2026

Description

SESSION	JAN 2026
PROGRAM	BACHELOR OF COMPUTER APPLICATIONS (BCA)
SEMESTER	V
COURSE CODE & NAME	DCA3141 COMPILER DESIGN

 

 

Assignment Set – 1

 

Q.1. What is a compiler? Differentiate between different types of compilers. (3+7 = 10 Marks)

Ans 1.

Definition of Compiler

A compiler is a system program which converts code written in a high-level programming language such as C, C++, Java, or Fortran into the lower-level target language typically machine code or assembly language, that can be executed by a processor in a computer. The compiler process operates as a complete translation all the source code prior to any execution takes place, unlike an interpreter which translates and executes a single statement at a time. The compiler

MUJ

Its Half solved only

Buy Complete assignment from us

Price – 190/  assignment

MUJ Manipal University Complete SolvedAssignments  JAN- FEB  2026

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/

JAN-FEB 2026

 

 

Q.2. Explain different phases of a Compiler. (10 Marks)

Ans 2.

The process of compilation is arranged into well-defined stages, each of which performs a specific transformation on the program representation. These phases break down the complicated job of translating into manageable, well-understood steps. Two components supporting the compilation process such as the Symbol Table as well as the Error Handler — interact with all

 

Q.3. Calculate FIRST() of the following Grammar. (10 Marks)

Ans 3.

Theory: FIRST() Set

A FIRST() collection of a grammar symbol X is the set of all terminals (tokens) that may appear as the primary symbol in any string derivable from X. For a terminal a, FIRST(a) = a. For a non-terminal A with production A → α, FIRST(A) comprises every terminal in FIRST(a). If A is able to derive the blank string (e) from the empty string (e), then the string is included in FIRST(A).

 

Assignment Set – 2

 

Q.4. Calculate FOLLOW() of the following Grammar. (10 Marks)

Ans 4.

Theory: FOLLOW() Set

It is the FOLLOW() set for an A that is not terminalized is the complete set of terminal symbols (and perhaps $, which is the marker at the end of input) which can be displayed immediately to the right of A in any sense that is in the form of the start symbol. Guidelines for computing FOLLOW: (1) FOLLOW(Start Symbol) contains $ (end marker). (2) For production B → αAβ,

 

 

Q.5. Differentiate between Top-Down and Bottom-Up Parser. (10 Marks)

Ans 5.

Parsing is a second step of compilation. It analyzes the stream of tokens against grammatical rules of the programming language. This is followed by the creation of a parse tree. Two basic parsing strategiesBottom-Up and Top-Downtackle this job from opposing directions.

Top-Down Parsing

Top-down parsing constructs the tree of parse starting at beginning at the base node (representing

Q.6. Explain different Code Optimization Techniques. (10 Marks)

Ans 6.

The process of code optimisation is the part of code compilation that enhances the intermediate code or the target code in order so that programs can run quicker, require less memory, or utilize smaller computational resources, while not changing the output or semantics. Optimisations may be performed on intermediate code (machine-independent) or on target code (machine-dependent). The basic principle is that optimization ensures correctness of the program — the