Все публикации

0:24:17

Turing Machine for Unary Multiplication | Theory of Computation

0:18:42

Turing Machine to Copy String over {a,b}* | Theory of Computation

0:25:53

Turing Machine for Input #W# & generate Output #W#W | Theory of Computation

0:06:14

Turing Machine for String Containing Even No. of 0's over {0,1} | Theory of Computation

0:20:47

Turing Machine for L= { a^nb^nc^n/n is greater than 0} | Theory of Computation

0:10:30

Turing Machine to compute 2's Complement of Binary Number | Theory of Computation

0:10:55

Turing Machine for Addition of Unary Number | Theory of Computation

0:15:25

NPDA for L={WWr / W is string of a's & b's} | Theory of Computation

0:14:43

CFG to PDA Conversion & Acceptance/Rejection of 'aaabaaaaa' | Theory of Computation

0:04:53

CFG to PDA Conversion Example 2 | Theory of Computation

0:04:39

CFG to PDA Conversion Example 1 | Theory of Computation

0:13:27

PDA for L={ a^2n b^n/n is greater than 0} | Theory of Computation

0:15:13

PDA for L={ a^nb^mc^md^n | n,m greater than = 1} | Theory of Computation

0:14:07

PDA for L= { WcW^R / W consist of any no. of a's & b's, W^R is reverse of W } | Theory of Com

0:10:33

PDA for L={w | w belongs to (a,b)* and no of a in w = no. of b in w} | Theory of Computation

0:09:25

PDA for matching Parenthesis '(( ) ( ( ) ) ) ' | Theory of Computation

0:13:41

PDA for L={a^nb^n } | Theory of Computation

0:29:23

LALR Parser Example 1 | Compiler Design

0:20:54

Construction of LR(1)/CLR parser Ex.1 | Compiler Design

0:36:03

LR(0) parser & parsing of string 'ccccb' Ex. 1 | Compiler Design

0:29:56

LL(1) Parser & Parsing of string 'id+id*id' Ex. 2 | Compiler Design

0:30:46

LL(1) Parser & Parsing of string '(dc)ac' Ex. 1 | Compiler Design

0:51:18

Code Generation using Labelling Algorithm | Optimal Code Generation | Compiler Design

0:11:47

Peephole Optimization | Compiler Design