Code360 powered by Coding Ninjas X Code360 powered by Coding Ninjas X
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.
Lexical Analysis in Compiler Design HARD
The first phase of the compilation is the lexical analysis. It uses the code and breaks it into tokens by removing the comments and extra white spaces used in the code.
Regular Expressions
In this blog, we will study the entire concept regarding regular expressions in compiler design.
Lex in Compiler Design EASY
Lex in compiler design is a program used to generate scanners or lexical analyzers, also called tokenizers.
Nondeterministic Finite Automata
This article will briefly introduce Nondeterministic finite automata(NFA) along with their examples and the conversion of regular expressions to NFA.
Deterministic Finite Automata (DFA)
Learn about Deterministic Finite Automata (DFA), a computational model in automata theory, essential for understanding algorithms and formal language processing.
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.