Anita R

Theory of Computation: Basic Definitions in Automata Theory

Theory of Computation: Conversion of CFG to PDA

Compiler Design: Boolean Expression (Control Flow Translation)

Theory of Computation: Construction of CFG - Examples

Theory of Computation: Conversion of PDA to CFG

Theory of Computation: PDA Example (a^n b^2n)

Theory of Computation: Derivations and Parse Tree - Example

Theory of Computation: NFA to DFA conversion Example

Compiler Design: Runtime Storage Management

Theory of Computation: Turing Machine Problem - Substring

Theory of Computation: Minimized DFA

Theory of Computation: MPCP to PCP Conversion

Theory of Computation: Conversion of DFA to RE- State Elimination Method- Example3

Theory of Computation: Extended Transition Function for DFA with an Example

Theory of Computation: Conversion of DFA to RE - State Elimination Method: Example1

Theory of Computation: Pumping Lemma for Regular Languages

Compiler Design: SDT to produce Three Address Code

Compiler Design: A Simple Code Generator

Compiler Design: Basic Blocks and Flow Graphs

Theory of Computation: Pumping Lemma-Example2

Theory of Computation: Pumping Lemma for CFL - Example2 (a^k b^j c^k d^j)

Theory of Computation: Pumping Lemma- Example3

Theory of Computation: Example for DFA (Divisible by 3)

Theory of Computation: Conversion of RE to Epsilon-NFA

Compiler Design: Principal Sources of Optimization

Compiler Design: DAG Representation of Basic Blocks

Theory of Computation: Undecidability - Introduction

Theory of Computation: Turing Machine Problem-a^n b^n c^n

Compiler Design: Leading and Trailing in Operator Precedence Parsing

Compiler Design: Parameter Passing

Theory of Computation: Types of Grammar

Theory of Computation: NPDA Example (w w^r)

Theory of Computation: Pumping Lemma for CFL - Example3 (0^2^i)

Compiler Design: Not LL(1) Grammar

Theory of Computation: Ambiguous Grammar - Example

Compiler Design: Introduction to Global Data Flow Analysis

Theory of Computation: Regular Expression

Compiler Design: S-Attributed and L-Attributed Definition

Compiler Design: Optimization of Basic Blocks/ Transformations of Basic Blocks

Compiler Design: SLR Parsing

Compiler Design: Predictive Parsing-LL(1)

Theory of Computation: Conversion of Epsilon-NFA to NFA

Theory of Computation: Turing Machine Problem - Concatenation

Theory of Computation: Conversion of Epsilon-NFA to DFA

Compiler Design: LALR Parsing

Theory of Computation: Modified Post Correspondence Problem (MPCP)

Theory of Computation: Turing Machine to MPCP Conversion

Theory of Computation: PDA Introduction with Example (0^n 1^n)

Theory of Computation: Post’s Correspondence Problem (PCP)

Theory of Computation: Turing Machine Problem - Palindrome

Theory of Computation: PDA Example (a^n b^m c^n)