Context-free grammars in Compiler Design - Time & Space Complexity

Time Complexity: Context-free grammars

O(2^n)

Understanding Time Complexity

We want to understand how the time to process a context-free grammar grows as the input size increases.

Specifically, how does parsing or generating strings from the grammar scale with input length?

Scenario Under Consideration

Analyze the time complexity of a simple top-down parser for a context-free grammar.

function parse(symbol, input) {
  if (symbol is terminal) {
    return input starts with symbol
  } else {
    for each production of symbol {
      if (parse all parts of production matches input) {
        return true
      }
    }
    return false
  }
}
    

This code tries to match input strings by recursively expanding grammar symbols.

Identify Repeating Operations

Look for repeated parsing calls and expansions.

• Primary operation: Recursive calls to parse each grammar symbol and its productions.
• How many times: Potentially many times for each substring of input, depending on grammar rules.

How Execution Grows With Input

As input length grows, the parser tries more ways to match parts of the input with grammar rules.

Input Size (n)	Approx. Operations
10	Hundreds to thousands of recursive checks
100	Thousands to millions of checks
1000	Millions to billions of checks

Pattern observation: The number of operations grows very quickly, often more than just doubling as input size increases.

Final Time Complexity

Time Complexity: O(2^n)

This means the time can grow exponentially with input length, making parsing slow for large inputs without optimization.

Common Mistake

[X] Wrong: "Parsing a context-free grammar always takes linear time because it just reads the input once."

[OK] Correct: Recursive parsing can try many combinations of rules and substrings, causing exponential growth in work.

Interview Connect

Understanding how parsing time grows helps you explain why some grammars are harder to parse and why efficient algorithms matter.

Self-Check

"What if we added memoization to remember previous parse results? How would the time complexity change?"

Practice

1. What is a context-free grammar primarily used for in compiler design?

easy

A. To optimize machine code

B. To execute programs

C. To manage memory allocation

D. To define the syntax rules of programming languages

Solution

1. Step 1: Understand the role of context-free grammar

   Context-free grammars describe the structure and syntax of languages, especially programming languages.

2. Step 2: Relate to compiler design

   Compilers use these grammars to parse and check if code follows language rules.

3. Final Answer:

   To define the syntax rules of programming languages -> Option D

4. Quick Check:

   Context-free grammar = syntax rules [OK]

Hint: Context-free grammar defines language syntax, not execution [OK]

Common Mistakes:

• Confusing grammar with code execution
• Thinking grammar manages memory
• Mixing syntax rules with optimization

2. Which of the following is the correct way to write a production rule in a context-free grammar?

easy

A. S -> aSb | ε

B. S = aSb | ε

C. S := aSb + ε

D. S => aSb & ε

Solution

1. Step 1: Identify standard notation for production rules

   Context-free grammar production rules use '->' to show how a symbol can be replaced.

2. Step 2: Check each option

   S -> aSb | ε uses '->' correctly; others use incorrect symbols like '=', ':=', '=>' or '&'.

3. Final Answer:

   S -> aSb | ε -> Option A

4. Quick Check:

   Production rule uses '->' [OK]

Hint: Look for '->' symbol in production rules [OK]

Common Mistakes:

• Using '=' instead of '->'
• Confusing ':=' with grammar syntax
• Using symbols like '&' or '+' incorrectly

3. Given the grammar with rules:
S -> aSb | ε
What is the language generated by this grammar?

medium

A. All strings with only 'a's

B. All strings with any number of 'a's and 'b's in any order

C. All strings with equal number of 'a's followed by 'b's

D. All strings with only 'b's

Solution

1. Step 1: Analyze the production rule

   The rule S -> aSb | ε means S can be empty or 'a' followed by S followed by 'b'.

2. Step 2: Understand generated strings

   This produces strings with matching 'a's at the start and 'b's at the end, equal in number.

3. Final Answer:

   All strings with equal number of 'a's followed by 'b's -> Option C

4. Quick Check:

   Grammar generates balanced 'a's and 'b's [OK]

Hint: Match 'a' and 'b' pairs from outside in [OK]

Common Mistakes:

• Assuming any order of 'a' and 'b'
• Ignoring the empty string ε
• Thinking only 'a's or only 'b's are generated

4. Identify the error in the following grammar rule:
A -> aA | bB
B -> bB | c
C -> cC | a

medium

A. Terminal symbols are incorrectly capitalized

B. Non-terminal C is never used in any production

C. Production rules use wrong arrow symbol

D. Grammar contains left recursion

Solution

1. Step 1: Check usage of non-terminals

   Non-terminal C is defined but never appears on the right side of any rule, so it is unreachable.

2. Step 2: Verify other options

   Arrows are correct (->), terminals are lowercase (a,b,c), no left recursion (all rules start with terminals).

3. Final Answer:

   Non-terminal C is never used in any production -> Option B

4. Quick Check:

   Unused non-terminal = error [OK]

Hint: Check if all non-terminals appear on right side somewhere [OK]

Common Mistakes:

• Confusing terminals and non-terminals capitalization
• Thinking left recursion is always an error
• Ignoring unreachable rules

5. Consider the grammar:
S -> AB | BC
A -> aA | a
B -> bB | b
C -> cC | c
Which of the following strings can be generated by this grammar?

hard

A. "aabbb"

B. "abcc"

C. "abbc"

D. "acb"

Solution

1. Step 1: Understand the grammar rules

   S can produce AB or BC. A produces one or more 'a's, B produces one or more 'b's, C produces one or more 'c's.

2. Step 2: Check each string

   "abbc" can: S -> AB, A -> a, B -> bB -> bC? No, B cannot produce 'c'. But let's check carefully.
   "abcc" cannot: starts with 'a' so AB, but 'bcc' not all 'b's; BC starts with 'b'.
   "aabbb" cannot: S -> AB, A -> aA -> 'aa', B -> bB -> 'bbb' but string is 'aabbb' which matches.
   "acb" cannot: 'c' misplaced, no matching AB or BC.

3. Final Answer:

   "aabbb" -> Option A

4. Quick Check:

   Check string matches AB or BC pattern [OK]

Hint: Match string parts to A, B, C sequences in order [OK]

Common Mistakes:

• Ignoring that B and C produce only their own letters
• Assuming mixed letters in one non-terminal
• Not checking both AB and BC options