Pravas Tutorial

Semantic Analysis | Semantic Error (C48)

Context Free Grammar | Ambiguous Grammar I Unambiguous Grammar (C51)

Conversion from Context Free Grammar to Push Down Automata Part 1 | CFG | PDA (C66)

Peephole Optimization | Machine Dependent Code Optimization | Code Optimization (C70)

Conversion from Push Down Automata to Context Free Grammar | CFG | PDA (C68)

Syntax Analysis | Syntax Error (C5)

Uncountable sets using Diagonalization Method | Countable Sets | Uncountable Sets (C93)

Conversion from Finite Automata to Regular Expression using State Elimination Method (C101)

Conversion from Finite Automata to Regular Expression using Arden's Theorem (C97)

Conversion from Finite Automata to Regular Expression using State Elimination Method (C103)

Examples of Countable Sets | Countable Sets | Uncountable Sets (C92)

Properties of Countable Sets and Uncountable Sets | Countable Sets | Uncountable Sets (C94)

Pumping Lemma of Context Free Language (C72)

Examples of Countable Sets | Countable Sets | Uncountable Sets (C89)

Conversion from Finite Automata to Regular Expression | Arden's Theorem (C95)

Code Generation (C74)

Rice Theorem for Undecidability | Part 5 (C110)

Conversion from Finite Automata to Regular Expression using Arden's Theorem (C99)

Rice Theorem for Undecidability | Part 2 (C107)

Turing Machine for Addition | Turing Machine as Output Generator (C111)

Rice Theorem for Undecidability | Part 4 (C109)

Conversion from Finite Automata to Regular Expression using Arden's Theorem (C100)

Conversion from Finite Automata to Regular Expression using State Elimination Method (C102)

Examples of Countable Sets | Countable Sets | Uncountable Sets (C91)

Conversion from Finite Automata to Regular Expression using Arden's Theorem (C96)

Syntax Directed Translation | Semantic Analysis | Part 1 (C49)

Three Address Code of If Else and For Statement | TAC | Intermediate Code Generation | Part 2 (C61)

Conversion from Finite Automata to Regular Expression using Arden's Theorem (C98)

Identification of Context Free Language | CFL (C69)

Semantic Analysis | Semantic Error (C48)

Three Address Code of 2D and 3D Array | TAC | Intermediate Code Generation | ICG Part 5 (C64)

S-Attribute and L-Attribute Definition | Semantic Analysis | Part 1 (C54)

Examples of Countable Sets | Countable Sets | Uncountable Sets (C90)

Rice Theorem for Undecidability | Part 3 (C108)

Two Stack Push Down Automata | Part 2 (C105)

Two Stack Push Down Automata | Part 1 (C104)

Rice Theorem for Undecidability | Part 1 (C106)

S-Attribute and L-Attribute Definition | Semantic Analysis | Part 2 (C55)

Three Address Code of If Else and Switch Case Statement | Intermediate Code Generation Part 3 (C62)

Syntax Directed Translation | Semantic Analysis | Part 5 (C53)

Regular Language (C37)