×
Blog Create CV Courses Certificates Online Courses Communities

Login

Sign up
MindLuster Logo
Categories
Popular

Join Our Telegram Channel Now to Get Any New Free Courses : Click Here

Lexical analysis in compiler design with exam

Track :

Programming

Lessons no : 39

For Free Certificate After Complete The Course

To Register in Course you have to watch at least 30 Second of any lesson

Join The Course Go To Community

How to Get The Certificate

  • You must have an account Register
  • Watch All Lessons
  • Watch at least 50% of Lesson Duration
  • you can follow your course progress From Your Profile
  • You can Register With Any Course For Free
  • The Certificate is free !
Lessons | 39
Lec 1 Compiler Design Syllabus Discussion for Competitive College University Exams
00:06:24

Lec 1 Compiler Design Syllabus Discussion for Competitive College University Exams
Lec 2 Phases of Compiler with examples Compiler Design
00:14:33

Lec 2 Phases of Compiler with examples Compiler Design
Lec 3 Lexical Analysis in Compiler Design with Examples
00:09:10

Lec 3 Lexical Analysis in Compiler Design with Examples
Lec 4 Token Count using Lexical Analysis Questions on Lexical Analysis Imp Questions
00:08:47

Lec 4 Token Count using Lexical Analysis Questions on Lexical Analysis Imp Questions
Lec 5 Find First in Compiler Design First Follow Compiler Design
00:10:37

Lec 5 Find First in Compiler Design First Follow Compiler Design
Lec 6 Find FOLLOW in Compiler Design Learn First Follow in Easiest way
00:09:27

Lec 6 Find FOLLOW in Compiler Design Learn First Follow in Easiest way
Lec 7 What is Parsing Types of Parsers Syntax Analysis
00:09:38

Lec 7 What is Parsing Types of Parsers Syntax Analysis
Lec 8 LL 1 Parsing Table Check Whether a Grammar is LL 1 or Not
00:10:57

Lec 8 LL 1 Parsing Table Check Whether a Grammar is LL 1 or Not
Lec 9 How to Check a Grammar is LL 1 or Not Short Trick
00:09:12

Lec 9 How to Check a Grammar is LL 1 or Not Short Trick
Lec 10 What is LL 1 Parser How it Works Full Concept
00:09:27

Lec 10 What is LL 1 Parser How it Works Full Concept
Lec 11 LR 0 Parsing Table Check Whether a Grammar is LR 0 or not Bottom Up Parser
00:16:46

Lec 11 LR 0 Parsing Table Check Whether a Grammar is LR 0 or not Bottom Up Parser
Lec 12 SLR 1 Parsing Table Check Whether a Grammar is SLR 1 or Not Bottom Up Parser
00:07:46

Lec 12 SLR 1 Parsing Table Check Whether a Grammar is SLR 1 or Not Bottom Up Parser
Lec 13 CLR Parsing Table LR 1 Canonical Items
00:11:50

Lec 13 CLR Parsing Table LR 1 Canonical Items
Lec 14 LALR Parsing Table LALR vs CLR Compiler Design
00:13:06

Lec 14 LALR Parsing Table LALR vs CLR Compiler Design
Lec 15 Difference between LALR CLR parsing table Imp Example Compiler Design
00:17:13

Lec 15 Difference between LALR CLR parsing table Imp Example Compiler Design
Lec 16 Difference between LR 0 SLR 1 LALR 1 CLR 1 using Same example
00:08:34

Lec 16 Difference between LR 0 SLR 1 LALR 1 CLR 1 using Same example
Lec 17 What is SDT Syntax Directed Translation its Applications Semantic Analysis
00:06:31

Lec 17 What is SDT Syntax Directed Translation its Applications Semantic Analysis
Lec 18 How to Parse SDT Top Down vs Bottom Up Parsing Syntax Directed Translation
00:09:06

Lec 18 How to Parse SDT Top Down vs Bottom Up Parsing Syntax Directed Translation
Lec 19 How to Evaluate Arithmetic Expression using SDT Syntax Directed Translation Example
00:09:34

Lec 19 How to Evaluate Arithmetic Expression using SDT Syntax Directed Translation Example
Lec 20 S Attributed vs L Attributed SDT Types of SDT
00:10:11

Lec 20 S Attributed vs L Attributed SDT Types of SDT
Lec 21 Gate Question on S Attributed and L Attributed SDT Compiler Design
00:04:48

Lec 21 Gate Question on S Attributed and L Attributed SDT Compiler Design
Lec 22 Intermediate Code Generation with example
00:08:12

Lec 22 Intermediate Code Generation with example
Lec 23 What is 3 Address Code in Compiler
00:05:17

Lec 23 What is 3 Address Code in Compiler
Lec 24 Peephole Optimization in Compiler Dead code elimination Strength reduction
00:10:19

Lec 24 Peephole Optimization in Compiler Dead code elimination Strength reduction
Lec 25 What is Code Optimization Machine Dependent vs Machine Independent Techniques
00:07:25

Lec 25 What is Code Optimization Machine Dependent vs Machine Independent Techniques
Lec 26 Loop Optimization in Compiler
00:06:56

Lec 26 Loop Optimization in Compiler
Lec 27 Question on Code Optimization in Compiler
00:07:09

Lec 27 Question on Code Optimization in Compiler
Lec 28 What is Control Flow Graph Basic Blocks
00:10:09

Lec 28 What is Control Flow Graph Basic Blocks
Lec 29 What is Basic Block Flow Graph in Compiler Partition Algorithm in Basic Block
00:08:31

Lec 29 What is Basic Block Flow Graph in Compiler Partition Algorithm in Basic Block
Lec 30 Local vs Global Optimization Scope of Optimization
00:08:56

Lec 30 Local vs Global Optimization Scope of Optimization
Lec 31 Liveness Analysis in Code optimization Dataflow analysis
00:15:08

Lec 31 Liveness Analysis in Code optimization Dataflow analysis
Lec 32 Comparison of all Parsers in Compiler Design
00:05:27

Lec 32 Comparison of all Parsers in Compiler Design
Lec 33 Symbol Table in Compiler Design Attributes of Symbol Table in Hindi
00:08:10

Lec 33 Symbol Table in Compiler Design Attributes of Symbol Table in Hindi
Lec 34 Error Detection And Recovery Lexical Phase Error Compiler Design
00:06:38

Lec 34 Error Detection And Recovery Lexical Phase Error Compiler Design
Lec 35 Symbol Table Data Structure Implementation in Hindi
00:08:28

Lec 35 Symbol Table Data Structure Implementation in Hindi
Lec 36 Lexeme vs Tokens in Compiler Design
00:05:54

Lec 36 Lexeme vs Tokens in Compiler Design
Lec 65 Derivation Tree Parse Tree with example in TOC Compiler design
00:06:33

Lec 65 Derivation Tree Parse Tree with example in TOC Compiler design
Lec 66 Recursive vs Non Recursive CFG with examples Classification of CFG
00:05:44

Lec 66 Recursive vs Non Recursive CFG with examples Classification of CFG
Lec 67 Ambiguous vs Unambiguous Grammar with examples Conversion Ambiguous Unambiguous
00:09:30

Lec 67 Ambiguous vs Unambiguous Grammar with examples Conversion Ambiguous Unambiguous


We Appreciate Your Feedback

Be the First One Review This Course

Excellent
0 Reviews
Good
0 Reviews
medium
0 Reviews
Acceptable
0 Reviews
Not Good
0 Reviews
0
0 Reviews

Our New Certified Courses Will Reach You in Our Telegram Channel
Join Our Telegram Channels to Get Best Free Courses

Join Now

Related Courses

React Projects Workshops
33 Lessons

React Projects Workshops

Node js back end JavaScript
34 Lessons

Node js back end JavaScript

Python programming language
15 Lessons

Python programming language

Social Network Theme UI With Sass
4 Lessons

Social Network Theme UI With Sass

Full Stack React Django
7 Lessons

Full Stack React Django

Build a Node js App With Sequelize
3 Lessons

Build a Node js App With Sequelize

GraphQL With React Apollo
4 Lessons

GraphQL With React Apollo

Node js REST API With Restify Mongoose JWT
2 Lessons

Node js REST API With Restify Mongoose JWT

Full Stack Vue js Express MongoDB
3 Lessons

Full Stack Vue js Express MongoDB

Exploring Docker
3 Lessons

Exploring Docker

Responsive Portfolio Website
7 Lessons

Responsive Portfolio Website

The MERN Stack
12 Lessons

The MERN Stack

PHP REST API High level
3 Lessons

PHP REST API High level

Up unning With Symfony 4
3 Lessons

Up unning With Symfony 4

JavaScript Workshops
3 Lessons

JavaScript Workshops

PHP MySQL Stripe API Payment App
3 Lessons

PHP MySQL Stripe API Payment App

Lexical analysis in compiler design, in this course provides a comprehensive understanding of the first phase in the compilation process. In this course, you’ll explore how the compiler reads source code and breaks it into meaningful units called tokens, which represent keywords, identifiers, operators, literals, and more. You'll learn the role of the lexical analyzer in identifying tokens, ignoring whitespace and comments, and detecting errors such as invalid symbols. The course covers the construction of symbol tables, which store information about variables and their attributes. Through practical examples, you'll gain hands-on experience in implementing lexical analyzers using tools like Lex. This course is ideal for students and professionals looking to understand compiler internals and build foundational knowledge for syntax analysis and semantic analysis. By the end, you’ll be equipped with the skills to analyze and process source code efficiently, setting the stage for advanced compiler design concepts.