Back to batch
Videos & Materials
Basics Of Theory Of Computation - Part I
Basics Of Theory Of Computation - Part II
Regular Expressions - Part I
Regular Expressions - Part II
Regular Expressions - Part III
Finite Automata - Part II
Finite Automata Part - III
Finite Automata - Part IV
Finite Automata - Part VI
Finite Automata - Part VII
Regular & Non-Regular Languages - Part I
Regular & Non-Regular Languages - Part II
Closure Properties - Part I
Closure Properties - Part II
Closure Properties - Part III
Pumping Lemma & Myhill Nerode Theorem
Context Free Grammar - Part I
Context Free Grammar - Part II
Context Free Grammar - Part III
Push Down Automata - Part I
Push Down Automata - Part II
Push Down Automata - Part III
Closure Properties - Part I
Closure Properties - Part II
Turing Machine - Part III
D, SDUD, Not RE, SD, and UD
Decision Properties Table - Part I
Decision Properties Table - Part II
Decidable & Undecidable Languages - Part I
Decidable & Undecidable Languages - Part II
Complete Revision On TOC - Part I
Complete Revision On TOC - Part II
Introduction To Compiler Design
Lexical Analysis - Part I
Lexical Analysis - Part II
Syntax Analysis - Basics Of CFG
Syntax Analysis - Basics Of Parsers
Syntax Analysis - Computation Of First And Follow Sets
Syntax Analysis - Top Down Parser
Syntax Analysis - LR(0) Parser
Syntax Analysis - LR Parsers
Syntax Analysis - LR Parsing Tables
Syntax Analysis - LR Parsing Algorithm
Syntax Analysis - Operator Precedence Parsing
Practice On Syntax Analysis - GATE PYQs
SDTs - Attributes And Definitions
SDTs - Evaluation Techniques - Part I
SDTs - Evaluation Techniques - Part II
Intermediate Code Representations - Part I
Intermediate Code Representations - Part II
Code Optimization - Part I
Code Optimization - Part II
Code Optimization - Part III
Practice On Compiler Design
