Easy Computer Engineering

Theory of computation : NFA to DFA conversion by Direct Method | TOC | Lect 19

Difference in synthesized Attributes and Inherited Attributes

Theory of computation : What is Moore Machine? detailed explanation with examples | TOC | Lect27

S- attribute definition and L- attribute definition

Theory of computation : Mealy and Moore machine accepts strings ends in 00 and 11| TOC | Lect32

Chomsky Normal Form of a Grammar: Example1 # Theory of Computation|TOC | Lect 56

Intermediate code generation using Lex and Yacc for control flow While Loop Statement

Design Pushdown Automata for language anbm, n smaller than m # PDA5 Example3# PDA5 | TOC | Lect 63

Syntax Directed Translation (SDT) for Assignment Statements Part1

Syntax Directed Translation (SDT) for Boolean Expression Part2

Synthesized and Inherited Attributes in Syntax directed definition(SDD) in compiler design

Design Pushdown Automata for language anbm, n bigger than m # PDA4 Example2# PDA4 | TOC | Lect 62

What is proof of Arden's Theorem in Theory of Computation? | TOC | Lect42

Theory of computation : How to Write Regular Expression for following languages?| TOC | Lect37

Two Pass Assembler explanation with example in detail Part2 Example1

Basics of Loader and Compile and Go Loader: Part1

Design Pushdown Automata for equal number of 'a' and 'b' # PDA Example4# PDA6 | TOC | Lect 64

Introduction of Context Free Grammar and Languages: # Theory of Computation|TOC | Lect48

Formal Definition of PDA and Operations on stack in PDA# PDA 2# Theory of Computation |TOC | Lect 60

Elimination of Epsilon Production Part2 : Simplification or reduction of CFG |TOC | Lect 53

Design Pushdown Automata for anb2n # PDA Example5# PDA7 | TOC | Lect 65

Elimination of Unit Production| Part 3| Simplification of Context Free Grammar(CFG) |TOC | Lect 54

Theory of computation :Defintion of Epsilon NFA and epsilon closure | TOC | Lect 21

Theory of computation : How to Design Mealy and Moore Machine example2 |TOC |Lect29

Two Pass Assembler of system programming basics Part1

How to Find FIRST & FOLLOW in Grammar | Compiler Design | Parsing Techniques

Intermediate Code Formats with Examples | Compiler Design | Part 2

Writing Grammar for a Language | Context-Free Grammar (CFG) Examples | TOC | Lecture 50

How to Convert Epsilon-NFA to DFA Using Subset Method | Example 2 | TOC | Lecture 24

Elimination of Useless Symbols, Non-Reachable & Non-Generating Symbols | Part 1 | TOC | Lecture 52

CLR(1) Parser Explained with Example 1 | Canonical LR(1) Parsing | Bottom-Up Parsing | Part 2

How to Convert Epsilon-NFA to DFA Using Subset Method | Example 1 | TOC | Lecture 23

Table-Driven Predictive Parser | LL(1) Parser | Top-Down Parsing | Compiler Design | Type 3

Theory of computation :How to Convert Mealy Machine to Moore Machine | Example 1 | TOC | Lecture 31

Intermediate Code Formats | Quadruples, Triples & DAG | Compiler Design | Part 1

Find Regular Expression (R.E.) for FA Using Arden's Theorem | University Example | TOC | Lecture 44

Macro Definition Within Macro Definition | Nested Macros Explained | System Programming | Part 3

Greibach Normal Form (GNF) Explained with Example | Theory of Computation | TOC Lecture 58

NFA to DFA Conversion by Direct Method | Step-by-Step Explanation | TOC | Lecture 19

Macro Call within Macro Definition | Stack Organization & Example | System Programming | Part 4

Two-Pass Assembler Explained with Example 2 | System Programming

RE to DFA by Direct Method (Compiler Design) | Example 2

Macro Processor Basics | System Programming | Part 1 | Features & Parameter Types

RE to DFA by Direct Method | Example 1 | Comiler Design

Finite Automata in 5 Hours | Complete Finite Automata in Theory of Computation | TOC

Basics of Pushdown Automata | PDA 1 | Theory of Computation | TOC | Lecture 59

How to Solve Using Pumping Lemma | Example 3 | Theory of Computation | Part 3 | TOC | Lecture 47

Removing Left Recursion & Left Factoring from Grammar | Compiler Design | Ambiguity Removal

How to Solve Using Pumping Lemma|Palindrome Example|Theory of Computation |Part 2 | TOC | Lecture 46

Scientific Calculator Using LEX and YACC | Compiler Design | Part 1 | Basics & Implementation

Difference Between Single Pass and Two Pass Assembler | System Programming