Tokens, patterns, and lexemes in Compiler Design - Time & Space Complexity

Time Complexity: Tokens, patterns, and lexemes

O(n)

Understanding Time Complexity

When analyzing tokens, patterns, and lexemes, we want to understand how the time to recognize these elements grows as the input size increases.

We ask: How does the work of scanning text for tokens change when the input gets longer?

Scenario Under Consideration

Analyze the time complexity of the following lexical analysis snippet.

for each character in input:
    if character matches pattern:
        form lexeme
        create token
    else:
        move to next character
    

This code scans each character of the input to find lexemes matching token patterns.

Identify Repeating Operations

Look for repeated actions in the code.

• Primary operation: Checking each character against token patterns.
• How many times: Once for every character in the input.

How Execution Grows With Input

As the input text gets longer, the number of characters to check grows directly with its length.

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

Pattern observation: The work grows in a straight line with input size.

Final Time Complexity

Time Complexity: O(n)

This means the time to process tokens grows directly in proportion to the input length.

Common Mistake

[X] Wrong: "Checking tokens takes the same time no matter how long the input is."

[OK] Correct: Each character must be examined, so longer inputs always take more time.

Interview Connect

Understanding how scanning input grows with size helps you explain how compilers handle code efficiently.

Self-Check

What if the code used nested loops to check multiple patterns for each character? How would the time complexity change?

Practice

1. What is a token in compiler design?

easy

A. The exact sequence of characters in the source code

B. A category or label for a group of characters

C. A rule describing valid sequences of characters

D. A syntax error found during compilation

Solution

1. Step 1: Understand the role of tokens

   Tokens act like words in a sentence, grouping characters into meaningful categories.

2. Step 2: Differentiate tokens from lexemes and patterns

   Lexemes are the actual text, patterns are rules, tokens are the labels for those texts.

3. Final Answer:

   A category or label for a group of characters -> Option B

4. Quick Check:

   Token = label/category [OK]

Hint: Tokens are like word types, not the words themselves [OK]

Common Mistakes:

• Confusing tokens with lexemes
• Thinking tokens are the exact text
• Mixing tokens with syntax errors

2. Which of the following correctly describes a pattern in lexical analysis?

easy

A. The exact characters matched in the source code

B. A syntax error detected during compilation

C. The output of the parser after syntax analysis

D. A rule or regular expression defining valid tokens

Solution

1. Step 1: Define what a pattern is

   Patterns describe the rules or formats that valid tokens must follow, often using regular expressions.

2. Step 2: Eliminate incorrect options

   Exact characters are lexemes, parser output is unrelated, syntax errors are not patterns.

3. Final Answer:

   A rule or regular expression defining valid tokens -> Option D

4. Quick Check:

   Pattern = rule for tokens [OK]

Hint: Patterns are rules, not actual text [OK]

Common Mistakes:

• Confusing patterns with lexemes
• Thinking patterns are output of parsing
• Mixing patterns with errors

3. Given the source code snippet: int count = 10; Which of the following is a correct lexeme for the token identifier?

medium

A. count

B. =

C. 10

D. int

Solution

1. Step 1: Identify the token 'identifier'

   An identifier token represents names like variables or functions.

2. Step 2: Match lexemes to token types

   In the snippet, 'count' is the variable name, so it is the lexeme for the identifier token.

3. Final Answer:

   count -> Option A

4. Quick Check:

   Identifier lexeme = count [OK]

Hint: Identifiers are names, not keywords or symbols [OK]

Common Mistakes:

• Choosing keywords like 'int' as identifiers
• Selecting numbers or operators as identifiers
• Confusing lexemes with token types

4. Identify the error in this tokenization process for the input var_1 = 25;: Tokens identified are var (identifier), _1 (identifier), = (assignment), 25 (number), ; (semicolon).

medium

A. The underscore and digit should be part of the same identifier token

B. The assignment operator should be tokenized as two separate tokens

C. The number 25 should be split into two tokens '2' and '5'

D. The semicolon should not be a token

Solution

1. Step 1: Understand identifier token rules

   Identifiers can include letters, digits, and underscores as one token, not split.

2. Step 2: Analyze the given tokenization

   Splitting 'var_1' into 'var' and '_1' is incorrect; it should be one identifier token.

3. Final Answer:

   The underscore and digit should be part of the same identifier token -> Option A

4. Quick Check:

   Identifier tokens include underscores and digits [OK]

Hint: Keep underscores and digits inside one identifier token [OK]

Common Mistakes:

• Splitting identifiers incorrectly
• Misinterpreting assignment operator tokenization
• Ignoring semicolon as a token

5. You want to design a lexical analyzer that recognizes tokens for integers and identifiers. Which pattern correctly matches an identifier but not an integer?

hard

A. [a-zA-Z0-9]+

B. [0-9]+

C. [a-zA-Z_][a-zA-Z0-9_]*

D. [0-9]*[a-zA-Z]+

Solution

1. Step 1: Understand identifier and integer patterns

   Identifiers start with a letter or underscore, followed by letters, digits, or underscores. Integers are digits only.

2. Step 2: Eliminate incorrect options

   A matches integers like '123'; B matches only integers; D fails to match identifiers ending in digits like 'var1'.

3. Final Answer:

   [a-zA-Z_][a-zA-Z0-9_]* -> Option C

4. Quick Check:

   Identifier pattern starts with letter/underscore [OK]

Hint: Identifiers start with letter/underscore, not digit [OK]

Common Mistakes:

• Allowing digits as first character in identifiers
• Confusing integer patterns with identifiers
• Using patterns that match both integers and identifiers