Why lexical analysis tokenizes source code in Compiler Design - Performance Analysis

Time Complexity: Why lexical analysis tokenizes source code

O(n)

Understanding Time Complexity

We want to understand how the work done by lexical analysis grows as the source code gets bigger.

Specifically, how does tokenizing many characters affect the time it takes?

Scenario Under Consideration

Analyze the time complexity of the following lexical analysis process.

function tokenize(source) {
  let tokens = []
  let i = 0
  while (i < source.length) {
    let token = extractNextToken(source, i)
    tokens.push(token)
    i += token.length
  }
  return tokens
}
    

This code reads the source code string and breaks it into tokens one by one until done.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: The while loop that moves through the source code character by character.
• How many times: It runs once for each token, covering all characters in the source.

How Execution Grows With Input

As the source code length grows, the number of tokens grows roughly in proportion.

Input Size (n characters)	Approx. Operations (tokens extracted)
10	About 10 tokens or fewer
100	About 100 tokens or fewer
1000	About 1000 tokens or fewer

Pattern observation: The work grows roughly in direct proportion to the source size.

Final Time Complexity

Time Complexity: O(n)

This means the time to tokenize grows linearly with the size of the source code.

Common Mistake

[X] Wrong: "Tokenizing takes much longer than reading characters one by one because tokens are complex."

[OK] Correct: Each character is processed once, and tokens are formed by grouping characters, so the total work still grows linearly with input size.

Interview Connect

Understanding how lexical analysis scales helps you explain compiler steps clearly and shows you can reason about program efficiency.

Self-Check

"What if extractNextToken sometimes looks ahead multiple characters? How would that affect the time complexity?"

Practice

1. Why does lexical analysis break source code into tokens?

easy

A. To simplify the code into meaningful parts for easier processing

B. To execute the code directly on the computer

C. To convert the code into machine language immediately

D. To remove all comments and whitespace only

Solution

1. Step 1: Understand the role of lexical analysis

   Lexical analysis breaks the source code into tokens, which are meaningful units like keywords, identifiers, and symbols.

2. Step 2: Identify the purpose of tokenization

   This tokenization simplifies the code structure, making it easier for later stages like parsing to understand the code.

3. Final Answer:

   To simplify the code into meaningful parts for easier processing -> Option A

4. Quick Check:

   Tokenization = Simplify code parts [OK]

Hint: Tokens break code into parts for easier understanding [OK]

Common Mistakes:

• Thinking lexical analysis executes code
• Confusing tokenization with compilation
• Believing it only removes comments and spaces

2. Which of the following is a correct description of a token in lexical analysis?

easy

A. A single character like a space or tab

B. A meaningful sequence of characters like a keyword or identifier

C. The entire source code file

D. A comment or whitespace ignored by the compiler

Solution

1. Step 1: Define what a token is

   A token is a meaningful sequence of characters such as keywords, identifiers, operators, or literals.

2. Step 2: Differentiate tokens from other elements

   Spaces, tabs, and comments are usually ignored or treated separately, not as tokens themselves.

3. Final Answer:

   A meaningful sequence of characters like a keyword or identifier -> Option B

4. Quick Check:

   Token = meaningful character sequence [OK]

Hint: Tokens are meaningful words or symbols, not spaces [OK]

Common Mistakes:

• Confusing tokens with whitespace or comments
• Thinking tokens are single characters only
• Assuming tokens include entire code

3. Given the code snippet int x = 10;, which of the following lists shows the correct tokens produced by lexical analysis?

medium

A. ["int", "x", "=10", ";"]

B. ["int x", "= 10", ";"]

C. ["int", "x=10", ";"]

D. ["int", "x", "=", "10", ";"]

Solution

1. Step 1: Break the code into smallest meaningful parts

   The code int x = 10; is split into tokens: the keyword "int", the identifier "x", the assignment operator "=", the number "10", and the semicolon ";".

2. Step 2: Verify token correctness

   Each token is a separate meaningful unit; combining tokens like "x=10" is incorrect.

3. Final Answer:

   ["int", "x", "=", "10", ";"] -> Option D

4. Quick Check:

   Tokens = separate meaningful parts [OK]

Hint: Tokens split code into smallest meaningful units [OK]

Common Mistakes:

• Combining multiple tokens into one
• Ignoring operators as separate tokens
• Treating spaces as tokens

4. A lexical analyzer incorrectly treats the code float value=3.14; as tokens: ["float", "value=3.14", ";"]. What is the error in this tokenization?

medium

A. The semicolon should be part of the previous token

B. The keyword "float" is not a valid token

C. The token "value=3.14" should be split into separate tokens

D. The number 3.14 should be ignored

Solution

1. Step 1: Analyze correct token boundaries

   The assignment operator "=" and the number "3.14" should be separate tokens, not combined with the identifier "value".

2. Step 2: Identify the tokenization mistake

   Combining "value=3.14" as one token is incorrect because each meaningful part must be separate for parsing.

3. Final Answer:

   The token "value=3.14" should be split into separate tokens -> Option C

4. Quick Check:

   Tokens must be separate meaningful units [OK]

Hint: Operators and values must be separate tokens [OK]

Common Mistakes:

• Merging identifiers with operators and literals
• Ignoring token boundaries
• Misclassifying keywords

5. In a compiler, why is tokenizing source code during lexical analysis essential before parsing?

hard

A. Because tokens provide a clear structure that parsing can analyze efficiently

B. Because tokenizing executes the program to check for errors

C. Because tokenizing converts code directly into machine instructions

D. Because tokenizing removes all syntax errors automatically

Solution

1. Step 1: Understand the relationship between lexical analysis and parsing

   Lexical analysis breaks code into tokens, which are easier for the parser to handle than raw characters.

2. Step 2: Explain why tokens help parsing

   Tokens provide a clear, simplified structure that parsing uses to check grammar and build syntax trees efficiently.

3. Final Answer:

   Because tokens provide a clear structure that parsing can analyze efficiently -> Option A

4. Quick Check:

   Tokens simplify parsing structure [OK]

Hint: Tokens simplify code structure for parsing [OK]

Common Mistakes:

• Thinking tokenizing runs or compiles code
• Believing tokenizing fixes syntax errors
• Confusing tokenizing with machine code generation