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: Boolean Expressions

Compiler Design: Left Factoring

Compiler Design: SDT to build Syntax Tree

Theory of Computation: Chomsky Normal Form-Simplifications

Theory of Computation: Pumping Lemma for CFL with Example (a^n b^n c^n)

Compiler Design: Elimination of Left Recursion

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

Compiler Design: Flow of Control Statements

Theory of Computation: Greibach Normal Form (GNF) with example

Theory of Computation: Basic Definitions in Automata Theory

Compiler Design: RE to DFA by Direct Method

Compiler Design: RE to DFA by Direct Method_Another Example

Compiler Design: Implementation of Three Address Statements

Theory of Computation: Turing Machine Introduction

Theory of Computation: CFG Introduction (Derivation, Parse Tree, Ambiguity)

Theory of Computation: DPDA Example (wcw^r)

Compiler Design: Operator Precedence Parsing

Theory of Computation: GNF Example

Compiler Design: Operator Precedence Relation Table

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)