Professor in Computer Engineering. 17 years of experience. Literature lover. Teaching and reading keeps me alive. 

Bhumika Keyur Shah

This course focuses on explaining Lexical Analysis Phase in detail. It covers Basic Terminologies, REs, buffering approach, NFA,DFA and generation of token in details.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE & ESE

English

Lexical Analysis Phase [Compiler] 2.0

Compiler

Compiler Design

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This lesson Covers introduction of instructor and course. It discusses objective, target audience and topics to be covered in detail.

Lexical Analysis Phase-Introduction

Lexical Analysis Phase- Basic Terminologies

This lesson discusses about buffering approach in lexical analysis phase. It covers single buffer, two buffer and two buffer with sentinel character approaches in detail with algorithm and illustration.

Lexical Analysis Phase- Buffering Approach

This lesson explains what is regular expression and how regular expressions can be written.

Lexical Analysis Phase- Regular Expression

This lesson covers basic notation summary for writing regular expression. It also discusses required number of examples to understand all notations. Also it explains how one can write regular expressions from a given statement.

Lexical Analysis Phase-Regular Expressions Examples

This lesson discusses NFA generation. It explains Thompson’s  notation for drawing NFA in detail. It also discusses examples of same.

Lexical Analysis Phase-NFA generation from RE

This lesson explains NFA to DFA conversion using Subset Construction method. It discusses Epsilon-closer and move functions with examples. It also covers examples for NFA to DFA conversion.

Lexical Analysis Phase- NFA to DFA conversion using Subset construction method

This lesson explains detailed example of DFA construction from NFA using Subset Construction Method.

Lexical Analysis Phase-NFA to DFA examples

This lesson explains how DFA can be generated using tree representation method without drawing NFA. It discusses basic steps of algorithm and starts explaining how to draw tree(with examples) and how to calculate first() (with examples).

Lexical Analysis Phase- RE to DFA using Tree representation Method

This lesson covers algorithm and examples to calculate follow position() and also discusses RE to DFA algorithm which uses first() and follow position() functions with examples.

Lexical Analysis Phase- RE to DFA using Tree Representation Method- examples

This lesson explains optimisation of DFAs using a simple method. It also explains how we can check two regular expressions are same or not by optimising DFAs.

Lexical Analysis Phase- Optimising DFA

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

This is a course on Compiler Design. It includes Introduction to Compiler Design, Phases of compiler in detail, Introduction to Grammars, Conversion of ambiguous grammars to Unambiguous grammars, Elimination of left recursion in grammar, Explanation of Parsers etc

(Hindi)) Fundamentals of Compiler Design

This course will cover Lexical Analysis - the 1st phase of Compiler in detail. It will also cover some PYQs that has been asked in GATE Exam.

(Hindi) Lexical Analysis with PYQs for GATE(CS IT)

B. Tech Undergraduate @DTU/DCE. Unacademy for the love of computer science and teaching

Mahima Chugh

This course discusses compilation briefly and then proceeds towards first phase of compilation, that is, lexical analysis.

Introduction To Compilation And Lexical Analysis

Mayank 

Student able to learn:-the design of a compiler and the phases of program translation from source code to executable code and the files produced by these phases.

(Hindi) Compiler Design: GATE

This course introduces the subject of pattern recognition with fish classification example. It also discusses components of a Pattern Recognition system, decision boundaries, and concepts of overfitting and underfitting.

Introduction To Pattern Recognition

This course provides you complete knowledge about Operator Precedence Parsers with the help of two tables - Operator Precedence Table and Operator Function Table using Graph.

Lessons

11 lessons • 2h 24m

Invalid Date

NaN

Lexical Analysis Phase-Introduction

Invalid Date

NaN

Lexical Analysis Phase- Basic Terminologies

Invalid Date

NaN

Lexical Analysis Phase- Buffering Approach

Invalid Date

NaN

Lexical Analysis Phase- Regular Expression

Invalid Date

NaN

Lexical Analysis Phase-Regular Expressions Examples

Invalid Date

NaN

Lexical Analysis Phase-NFA generation from RE

Invalid Date

NaN

Lexical Analysis Phase- NFA to DFA conversion using Subset construction method

Invalid Date

NaN

Lexical Analysis Phase-NFA to DFA examples

Invalid Date

NaN

Lexical Analysis Phase- RE to DFA using Tree representation Method

Invalid Date

NaN

Lexical Analysis Phase- RE to DFA using Tree Representation Method- examples

+ See all lessons