Last updated: May 3, 2022

Lexical Analysis

Lexical Analysis is the very first phase in compiler designing. It helps you to convert a sequence of characters into a sequence of tokens. The lexical analyzer breaks this syntax into a series of tokens. It removes any extra space or comment written in the source code.
Introduction to Lexical Analysis HARD
The first phase of the compilation is the lexical analysis in compiler design. It uses the code and breaks it into tokens by removing the comments and extra white spaces used in the code.
Regular Expressions in Compiler Design EASY
In compiler design, regular expressions play a crucial role in defining the syntax and structure of programming languages, allowing compilers to efficiently recognize and categorize different tokens in source code.
Lex in Compiler Design EASY
Lex in compiler design is a program used to generate scanners or lexical analyzers, also called tokenizers.
Deterministic Finite Automata (DFA) EASY
A Deterministic Finite Automaton (DFA) is a type of finite state machine used in automata theory to recognize patterns or regular languages.
Lexer and Lexer Generators
This article discusses Lexer and Lexer Generators and their use. We will also understand the applications of Lexer and Lexer Generators in compiler design.
Closure Properties of a Regular language EASY
A regular language may be expressed using regular expressions, non- deterministic or deterministic finite automata, or state machines.