Skip to content
CampusPrep
AL-703 (A) · Compiler Design/Important Questions

Compiler Design (AL-703 (A)) - Important Questions

  1. Unit 47 Marks High Priority Asked: 2024, 2025

    Construct a Directed Acyclic Graph (DAG) for the arithmetic expression $$a + a\times\left(b-c\right) + \left(b-c\right)\times d$$ and derive optimized three-address code showing common-subexpression elimination.

    Core topic: DAG construction, common-subexpression elimination and generation of optimized three-address code; frequently asked in Unit 4.

  2. Unit 47 Marks High Priority Asked: 2024, 2025

    Explain intermediate code generation: three-address code, quadruples and triples. Illustrate with examples and show how backpatching is used for boolean expressions and control flow.

    Core intermediate-code topic: three-address code formats and backpatching are regularly examined in Unit 4.

  3. Unit 47 Marks Medium Priority Asked: 2024, 2025

    Discuss in detail the difference between stack allocation and heap allocation. Explain activation records and run-time storage organization with examples of parameter passing and procedure calls.

    Run-time storage and activation records: essential concept linking procedure calls, parameter passing and memory organization; appears in past papers.

  4. Unit 47 Marks Medium Priority Asked: 2025

    Give a detailed note on loop optimization techniques. Explain loop-invariant code motion, induction variable elimination, loop unrolling and loop fusion with examples.

    Loop optimizations are a key subset of code-optimization questions; specific loop techniques are directly asked in recent papers.

  5. Unit 47 Marks Medium Priority Asked: 2025

    Discuss the various characteristics of basic blocks. Explain how basic blocks are identified and used to build control-flow graphs and for local optimizations.

    Basic blocks form the unit of many local optimizations and code generation strategies; directly asked in Unit 4.

  6. Unit 47 Marks Medium Priority Asked: 2025

    Explain peephole optimization. Describe typical peephole optimization patterns, example transformations and limitations.

    Peephole optimization is a common short-local optimization technique; examined as a focused topic in recent papers.

  7. Unit 47 Marks High Priority Asked: 2024, 2025

    Explain code optimization techniques such as constant folding, common subexpression elimination, dead code elimination and strength reduction with illustrative examples.

    General code-optimization techniques (constant folding, CSE, dead code elimination, strength reduction) are repeatedly examined and form a high-value question set.

Go to where you left off?

Quick Add to Notes

Save questions, your own notes and screenshots into notes filed by unit. It takes a free account.

Create free account

Have an account? Log in