Channel Avatar

Shreyas Nisal @UCC6h00ZhODFCUQAT1BVEKHg@youtube.com

1.6K subscribers - no pronouns :c

I’m currently pursuing a Master of Interactive Technology in


07:11
Research Internship at MIT Media Lab
10:16
Twilio Internship Experience
26:39
Parsing using Bison
10:46
Twilio Interview Experience
08:16
Brick Breaker in Unity: Collisions
08:20
How I Landed my Thesis at Monash University
09:20
Brick Breaker in Unity: Ball and Paddle Movement
11:06
Brick Breaker in Unity: Tile Generator Script
10:24
Brick Breaker in Unity: Assets and Project Setup
10:27
Playing around with Unity
04:49
The Difference between Apps and Games
03:56
Quiz with Voice
03:32
Coding with Voice
17:13
Lexical Analysis using Flex
03:48
#11: Left Recursion in Recursive Descent Parsing
04:57
#10: Recursive Descent Parsing
06:02
#9: Removing Ambiguities in Grammars
06:07
#8: Derivations and Ambiguous Grammars
05:57
#7: Parsing Overview
09:12
Compilers #6: Ambiguities in Lexical Analysis
06:35
Compilers #5: Lexical Analysis Algorithm
04:45
Compilers #4: Challenges in Lexical Analysis
04:40
Compilers #3: Lexical Analysis Overview
04:46
Compilers #2: Compiler vs Interpreter
02:42
Compilers #1: Introduction
08:11
Setting up MySQL with Sublime Text
10:11
Theory of Computation #49: Turing Machine Example
10:30
Theory of Computation #48: Turing Machine Example
04:38
Theory of Computation #47: Turing Machine Definition
06:49
Theory of Computation #46: Turing Machine Intuition
02:43
Theory of Computation #45: Context-Sensitive and Recursively Enumerable Languages
04:21
Theory of Computation #44: Limitations of CFGs
07:23
Theory of Computation #43: CFG to PDA Example
13:04
Theory of Computation #42: Converting CFG to PDA
07:53
Theory of Computation #41: Deterministic Pushdown Automata
10:14
Theory of Computation #40: Pushdown Automaton Example
07:50
Theory of Computation #39: Pushdown Automata Formal Definition
05:49
Theory of Computation #38: Pushdown Automata Intuition
05:20
Theory of Computation #37: Greibach Normal Form
06:01
Theory of Computation #36: Eliminating Left Recursion
05:27
Theory of Computation #35: Recursive Grammars
04:01
Theory of Computation #34: Leftmost and Rightmost Derivations
04:14
Theory of Computation #33: Parse Trees
04:23
Theory of Computation #32: Converting CFG to CNF | Example
03:38
Theory of Computation #31: Converting a CFG to CNF
03:32
Theory of Computation #30: Chomsky Normal Form Overview
07:43
Theory of Computation #29: Simplifying CFGs | Unit Productions
05:06
Theory of Computation #28: Simplifying CFGs | Null Productions
04:02
Theory of Computation #27: Simplifying CFGs | Useless Productions
04:17
#17: Final Touches | 2048 Game React Native Windows
05:37
#16: Starting with Random Tiles | 2048 Game React Native Windows
03:26
#15: Restarting the Game | 2048 Game React Native Windows
05:10
#14: Lose Check | 2048 Game React Native Windows
10:41
#13: Win Condition | 2048 Game React Native Windows
06:05
#12: Scoring System | 2048 Game React Native Windows
14:26
Theory of Computation #26: Finding Minimum Pumping Length
10:50
#11: Right, Up, Down Moves | 2048 Game React Native Windows
07:16
Theory of Computation #25: Pumping Lemma (Context-free Languages)
11:31
Row vs Column-wise Access of 2D Arrays
12:37
Theory of Computation #24: Pumping Lemma Example