Global optimization techniques in Compiler Design - Time & Space Complexity

Time Complexity: Global optimization techniques

O(n * m * p)

Understanding Time Complexity

Global optimization techniques improve the whole program's performance by analyzing all parts together.

We want to know how the time to optimize grows as the program size increases.

Scenario Under Consideration

Analyze the time complexity of the following global optimization process.

repeat until no changes:
  for each function in program:
    build control flow graph
    for each basic block in function:
      analyze data flow
      apply optimizations

This code shows a global optimizer scanning all functions and blocks repeatedly to improve the program.

Identify Repeating Operations

Look for loops and repeated analysis steps.

• Primary operation: Iterating over all functions and their blocks to analyze and optimize.
• How many times: Multiple passes until no further changes happen, which depends on program size and complexity.

How Execution Grows With Input

As the program grows, the number of functions and blocks grows, increasing work each pass.

Input Size (n)	Approx. Operations
10 functions	Few hundred operations
100 functions	Thousands of operations
1000 functions	Hundreds of thousands of operations

Pattern observation: Work grows roughly with the number of functions times blocks, multiplied by the number of passes.

Final Time Complexity

Time Complexity: O(n * m * p)

This means the time grows with the number of functions (n), blocks per function (m), and passes needed (p).

Common Mistake

[X] Wrong: "Global optimization always takes the same time regardless of program size."

[OK] Correct: Larger programs have more functions and blocks, so the optimizer must do more work, increasing time.

Interview Connect

Understanding how optimization time grows helps you explain compiler performance and trade-offs clearly in interviews.

Self-Check

What if the optimizer only made one pass instead of repeating until no changes? How would the time complexity change?

Practice

1. What is the main goal of global optimization techniques in compiler design?

easy

A. To fix syntax errors in the code

B. To translate code into machine language

C. To improve the performance of the entire program

D. To check for logical errors during runtime

Solution

1. Step 1: Understand the purpose of global optimization

   Global optimization aims to improve the whole program's efficiency, not just parts of it.

2. Step 2: Differentiate from other compiler tasks

   Fixing syntax or translating code are separate compiler phases, not optimization.

3. Final Answer:

   To improve the performance of the entire program -> Option C

4. Quick Check:

   Global optimization = whole program improvement [OK]

Hint: Global optimization means improving the entire program [OK]

Common Mistakes:

• Confusing optimization with syntax checking
• Thinking optimization only fixes errors
• Mixing code translation with optimization

2. Which of the following is a valid example of a global optimization technique?

easy

A. Register allocation

B. Loop-invariant code motion

C. Lexical analysis

D. Syntax parsing

Solution

1. Step 1: Identify global optimization techniques

   Loop-invariant code motion moves calculations out of loops to avoid repeated work.

2. Step 2: Exclude non-optimization tasks

   Syntax parsing and lexical analysis are earlier compiler phases; register allocation is a resource management step.

3. Final Answer:

   Loop-invariant code motion -> Option B

4. Quick Check:

   Moving code out of loops = loop-invariant code motion [OK]

Hint: Look for techniques that reduce repeated work in code [OK]

Common Mistakes:

• Confusing parsing with optimization
• Thinking register allocation is optimization
• Mixing compiler phases

3. Consider this code snippet before optimization:

for (int i = 0; i < n; i++) {
  int x = 5 * 10;
  sum += x;
}

Which global optimization technique can improve this code?

medium

A. Inline expansion

B. Dead code elimination

C. Constant folding

D. Loop-invariant code motion

Solution

1. Step 1: Identify repeated calculation inside the loop

   The expression 5 * 10 does not depend on i and is recalculated every iteration.

2. Step 2: Apply loop-invariant code motion

   Move int x = 5 * 10; outside the loop to avoid repeated calculation.

3. Final Answer:

   Loop-invariant code motion -> Option D

4. Quick Check:

   Move constant calculation out of loop = loop-invariant code motion [OK]

Hint: Move calculations that don't change out of loops [OK]

Common Mistakes:

• Choosing constant folding (done once, but not moving code)
• Confusing dead code elimination with removing unused code
• Thinking inline expansion applies here

4. Identify the error in this global optimization attempt:

int sum = 0;
for (int i = 0; i < n; i++) {
  int x = i * 2;
}
sum += x;

medium

A. Variable x is used outside its scope

B. Loop condition is incorrect

C. Sum variable is not initialized

D. No optimization applied

Solution

1. Step 1: Check variable scope of x

   The variable x is declared inside the loop and cannot be accessed outside it.

2. Step 2: Analyze usage of x after the loop

   Using x after the loop causes a scope error, preventing optimization.

3. Final Answer:

   Variable x is used outside its scope -> Option A

4. Quick Check:

   Variable scope error = using inside variable outside loop [OK]

Hint: Check if variables are used only where declared [OK]

Common Mistakes:

• Ignoring variable scope rules
• Assuming sum is uninitialized
• Thinking loop condition is wrong

5. Given a program with multiple repeated calculations and unused variables scattered across functions, which combination of global optimization techniques would best improve performance?

hard

A. Dead code elimination and loop-invariant code motion

B. Constant folding and syntax checking

C. Register allocation and lexical analysis

D. Inlining and parsing

Solution

1. Step 1: Identify techniques for removing unused code and repeated calculations

   Dead code elimination removes unused variables; loop-invariant code motion moves repeated calculations out of loops.

2. Step 2: Exclude unrelated compiler tasks

   Syntax checking, lexical analysis, parsing, and register allocation are not global optimizations for code improvement.

3. Final Answer:

   Dead code elimination and loop-invariant code motion -> Option A

4. Quick Check:

   Remove unused + move repeated = dead code elimination + loop-invariant motion [OK]

Hint: Combine removing unused code and moving repeated code out [OK]

Common Mistakes:

• Confusing compiler phases with optimization
• Choosing unrelated techniques like parsing
• Ignoring the need for multiple optimizations