Regular expressions for token patterns in Compiler Design - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a regular expression in the context of token patterns?

A regular expression is a sequence of characters that defines a search pattern used to identify tokens in text, such as keywords, identifiers, or symbols in programming languages.

beginner

How do regular expressions help in lexical analysis?

They provide a formal way to describe the patterns of tokens, allowing the lexer to recognize and extract meaningful units from the source code efficiently.

intermediate

What does the regular expression [a-zA-Z_][a-zA-Z0-9_]* represent?

It represents an identifier token pattern: it starts with a letter or underscore, followed by zero or more letters, digits, or underscores.

beginner

Explain the difference between * and + in regular expressions.

* means zero or more repetitions of the preceding element, while + means one or more repetitions.

intermediate

Why are regular expressions not suitable for parsing nested structures?

Because regular expressions cannot handle recursive or nested patterns, which require more powerful tools like context-free grammars.

Which regular expression matches a decimal number with optional fractional part?

A \d+(\.\d+)?

B [a-zA-Z]+

C \w+

D \d*

Option A matches one or more digits followed optionally by a dot and one or more digits, representing a decimal number.

What does the regular expression if|else|while represent?

A Any identifier

B Keywords 'if', 'else', or 'while'

C Numbers

D Whitespace characters

The expression matches exactly the keywords 'if', 'else', or 'while'.

In regular expressions, what does the symbol \w typically represent?

A Any whitespace character

B Any digit

C Any special character

D Any word character (letters, digits, underscore)

\w matches letters, digits, and underscore characters.

Which of the following is NOT a valid use of regular expressions in token patterns?

A Matching nested parentheses

B Matching identifiers

C Matching numeric literals

D Matching keywords

Regular expressions cannot match nested structures like parentheses because they lack memory for recursion.

What does the regular expression [0-9]+ match?

A Any letter

B Zero or more digits

C One or more digits

D Whitespace

The expression matches sequences of one or more digits.

Describe how regular expressions are used to define token patterns in lexical analysis.

Think about how a lexer uses patterns to find meaningful pieces in code.

Explain the limitations of regular expressions when used for parsing programming languages.

Consider what kinds of language features are too complex for regex.