Lex/Flex tool overview in Compiler Design - Time & Space Complexity

Time Complexity: Lex/Flex tool overview

O(n)

Understanding Time Complexity

When using Lex or Flex to create a lexical analyzer, it's important to understand how the tool's processing time grows as the input size increases.

We want to know how the scanning work changes when the input text gets longer.

Scenario Under Consideration

Analyze the time complexity of this simplified Lex/Flex scanning process.

%{
#include <stdio.h>
%}
%%
[a-zA-Z]+    { /* match words */ }
[0-9]+       { /* match numbers */ }
.            { /* match any single char */ }
%%
int main() {
  yylex();
  return 0;
}
    

This code defines patterns to match words, numbers, and any character, then scans input text token by token.

Identify Repeating Operations

Look at what repeats during scanning.

• Primary operation: The scanner reads each character from the input one by one.
• How many times: Once for every character in the input text.

How Execution Grows With Input

As the input text grows, the scanner processes more characters.

Input Size (n)	Approx. Operations
10	About 10 character checks
100	About 100 character checks
1000	About 1000 character checks

Pattern observation: The work grows directly with the number of characters; double the input, double the work.

Final Time Complexity

Time Complexity: O(n)

This means the scanning time increases in a straight line as the input size grows.

Common Mistake

[X] Wrong: "Lex/Flex scanning time grows faster than input size because of complex patterns."

[OK] Correct: The scanner checks each character once, so time grows linearly, not faster, even with multiple patterns.

Interview Connect

Understanding how lexical analyzers scale helps you explain how compilers handle large programs efficiently.

Self-Check

What if the scanner used backtracking for patterns? How would the time complexity change?

Practice

1. What is the primary purpose of the Lex/Flex tool in compiler design?

easy

A. To optimize the compiled program

B. To generate machine code from source code

C. To break input text into meaningful tokens

D. To manage memory allocation during execution

Solution

1. Step 1: Understand Lex/Flex role

   Lex/Flex is a tool used to scan input text and split it into tokens based on patterns.

2. Step 2: Differentiate from other compiler parts

   Generating machine code and optimization are done by other compiler stages, not Lex/Flex.

3. Final Answer:

   To break input text into meaningful tokens -> Option C

4. Quick Check:

   Lex/Flex = Tokenizer [OK]

Hint: Lex/Flex splits text into tokens, not code generation [OK]

Common Mistakes:

• Confusing Lex/Flex with code generator
• Thinking Lex/Flex optimizes code
• Assuming Lex/Flex manages memory

2. Which of the following is the correct way to define a pattern in a Lex/Flex file?

easy

A. action { pattern }

B. action : pattern

C. pattern -> action

D. pattern { action }

Solution

1. Step 1: Recall Lex/Flex syntax

   In Lex/Flex, patterns are written first, followed by actions enclosed in braces.

2. Step 2: Verify option formats

   Only pattern { action } matches the correct syntax: pattern { action }

3. Final Answer:

   pattern { action } -> Option D

4. Quick Check:

   Pattern before action with braces [OK]

Hint: Pattern comes first, then action in braces [OK]

Common Mistakes:

• Reversing pattern and action order
• Using colons or arrows incorrectly
• Placing action outside braces

3. Given the Lex/Flex rule:
[0-9]+ { printf("Number: %s\n", yytext); }
What will be printed when the input is 123abc?

medium

A. Number: 123abc

B. Number: 123

C. Number: abc

D. No output

Solution

1. Step 1: Understand the pattern

   The pattern [0-9]+ matches one or more digits only, so it matches '123' at the start.

2. Step 2: Analyze input processing

   Lex/Flex matches '123' and executes the action printing 'Number: 123'. The 'abc' part does not match this pattern.

3. Final Answer:

   Number: 123 -> Option B

4. Quick Check:

   Digits matched only = Number: 123 [OK]

Hint: Pattern matches digits only, stops before letters [OK]

Common Mistakes:

• Assuming whole input matches pattern
• Including letters in digit pattern
• Expecting no output for partial matches

4. Identify the error in this Lex/Flex rule:
[a-z]+ printf("Word: %s\n", yytext);

medium

A. Missing braces around the action

B. Pattern syntax is incorrect

C. Missing semicolon after pattern

D. yytext is undefined

Solution

1. Step 1: Check rule syntax

   Lex/Flex requires actions to be enclosed in braces { } after the pattern.

2. Step 2: Identify missing braces

   The given rule lacks braces around the printf action, causing a syntax error.

3. Final Answer:

   Missing braces around the action -> Option A

4. Quick Check:

   Actions need braces { } [OK]

Hint: Always put actions inside braces { } [OK]

Common Mistakes:

• Omitting braces for single actions
• Confusing pattern syntax with action syntax
• Assuming semicolon needed after pattern

5. How can you modify a Lex/Flex rule to ignore whitespace characters (spaces, tabs) while scanning input?

hard

A. [ \t\n]+ { /* do nothing to skip whitespace */ }

B. [ \t\n]+ { printf("Whitespace found\n"); }

C. [a-z]+ { /* skip whitespace here */ }

D. Whitespace cannot be ignored in Lex/Flex

Solution

1. Step 1: Understand whitespace handling

   To ignore whitespace, define a pattern matching spaces, tabs, newlines with an empty action.

2. Step 2: Check options for correct ignoring

   [ \t\n]+ { /* do nothing to skip whitespace */ } matches whitespace characters and has an empty action, effectively skipping them.

3. Final Answer:

   [ \t\n]+ { /* do nothing to skip whitespace */ } -> Option A

4. Quick Check:

   Empty action skips matched whitespace [OK]

Hint: Use empty action for whitespace pattern to skip [OK]

Common Mistakes:

• Printing message instead of skipping
• Using wrong pattern for whitespace
• Believing whitespace cannot be ignored