Please Login To Continue
Lexical Analysis Phase- RE to DFA using Tree representation Method
Lesson 9 of 11 • 0 upvotes • 14:58mins
Bhumika Keyur Shah
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 [Compiler] 2.0
11 lessons • 2h 24m
1
Lexical Analysis Phase-Introduction
2:45mins
2
Lexical Analysis Phase- Basic Terminologies
11:34mins
3
Lexical Analysis Phase- Buffering Approach
14:46mins
4
Lexical Analysis Phase- Regular Expression
14:31mins
5
Lexical Analysis Phase-Regular Expressions Examples
14:37mins
6
Lexical Analysis Phase-NFA generation from RE
12:23mins
7
Lexical Analysis Phase- NFA to DFA conversion using Subset construction method
14:40mins
8
Lexical Analysis Phase-NFA to DFA examples
14:57mins
9
Lexical Analysis Phase- RE to DFA using Tree representation Method
14:58mins
10
Lexical Analysis Phase- RE to DFA using Tree Representation Method- examples
14:45mins
11
Lexical Analysis Phase- Optimising DFA
14:33mins
Crack GATE - Iconic Pro with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
