17:36

5 4 05 04 Ambiguity 17m35s

11:56

4 5 04 05 Implementing Finite Automata 11m56s

13:03

6 1 06 01 Error Handling 13m03s

5:32

5 1 05 01 Introduction to Parsing 5m31s

6:35

6 3 06 03 Recursive Descent Parsing 6m35s

13:29

6 4 06 04 Recursive Descent Algorithm 13m28s

14:03

7 2 07 02 First Sets 14m02s

9:11

6 5 06 05 Left Recursion 9m11s

19:38

7 1 07 01 Predictive Parsing 19m37s

3:50

6 2 06 02 Abstract Syntax Trees 3m50s

17:06

7 3 07 03 Follow Sets 17m05s

14:41

7 4 07 04 LL1 Parsing Tables 14m41s

7:37

7 6 07 06 Shift Reduce Parsing 7m37s

13:13

8 2 08 02 Recognizing Handles 13m12s

6:49

8 1 08 01 Handles 6m48s

14:57

8 3 08 03 Recognizing Viable Prefixes 14m57s

11:49

8 7 08 07 SLR Improvements 11m49s

7:26

7 5 07 05 Bottom Up Parsing 7m25s

3:31

8 4 08 04 Valid Items 3m31s

14:17

8 5 08 05 SLR Parsing 14m16s

12:48

8 8 08 08 SLR Examples 12m47s

6:42

8 6 08 06 SLR Parsing Example 6m42s

11:22

9 4 09 04 Types 11m22s

6:58

9 9 09 09 Implementing Type Checking 6m57s

8:10

9 2 09 02 Scope 8m09s

8:43

9 5 09 05 Type Checking 8m43s

3:43

9 1 09 01 Introduction to Semantic Analysis 3m42s

7:36

10 2 10 02 Self Type 7m36s

11:06

9 3 09 03 Symbol Tables 11m06s

11:44

9 6 09 06 Type Environments 11m43s

11:36

9 7 09 07 Subtyping 11m35s

8:12

9 8 09 08 Typing Methods 8m12s

12:12

10 3 10 03 Self Type Operations 12m12s

7:15

10 1 10 01 Static vs Dynamic Typing 7m14s

6:30

10 4 10 04 Self Type Usage 6m29s

10:01

10 5 10 05 Self Type Checking 10m00s

13:51

11 2 11 02 Activations 13m50s

17:27

12 2 12 02 Code Generation I 17m26s

13:12

11 3 11 03 Activation Records 13m11s

7:08

10 6 10 06 Error Recovery 7m07s

6:44

11 1 11 01 Runtime Organization 6m44s

16:23

11 6 11 06 Stack Machines 16m23s

18:09

12 3 12 03 Code Generation II 18m08s

6:04

11 5 11 05 Alignment 6m04s

6:56

11 4 11 04 Globals and Heap 6m56s

23:56

12 6 12 06 Object Layout 23m56s

26:14

13 4 13 04 Cool Semantics II 26m13s

7:58

12 1 12 01 Introduction to Code Generation 7m57s

16:15

12 5 12 05 Temporaries 16m14s

13:17

12 4 12 04 Code Generation Example 13m17s

12:21

13 2 13 02 Operational Semantics 12m20s

21:10

13 3 13 03 Cool Semantics I 21m10s

7:06

13 1 13 01 Semantics Overview 7m06s

25:35

14 3 14 03 Local Optimization 25m35s

13:38

14 2 14 02 Optimization Overview 13m37s

9:04

14 1 14 01 Intermediate Code 9m03s

21:11

15 2 15 02 Constant Propagation 21m11s

7:23

15 3 15 03 Analysis of Loops 7m22s

8:03

15 1 15 01 Dataflow Analysis 8m02s

14:54

17 1 17 01 Automatic Memory Management 14m53s

13:39

15 5 15 05 Liveness Analysis 13m39s

4:30

14 4 14 04 Peephole Optimization 4m29s

19:03

17 3 17 03 Stop and Copy 19m03s

9:56

16 1 16 01 Register Allocation 9m56s

6:34

15 4 15 04 Orderings 6m34s

14:50

16 3 16 03 Spilling 14m50s

12:07

16 2 16 02 Graph Coloring 12m07s

10:37

16 4 16 04 Managing Caches 10m37s

13:06

17 2 17 02 Mark and Sweep 13m05s

7:21

18 1 18 01 Java 7m21s

15:24

17 5 17 05 Reference Counting 15m23s

14:09

18 3 18 03 Java Exceptions 14m09s

14:28

18 7 18 07 Other Topics 14m28s

3:31

17 4 17 04 Conservative Collection 3m31s

8:15

18 2 18 02 Java Arrays 8m15s

8:39

18 4 18 04 Java Interfaces 8m38s

7:52

18 5 18 05 Java Coercions 7m51s

51:39

CS1101S NUS Scheme Class - Last Lecture

1:10:10

Ravi Zacharias - Can Man Live Without God

1:49:23

CS2104 Programming Languages Lecture 9

1:42:49

CS2104 Programming Languages Lecture 8

1:43:08

CS2104 Programming Languages Lecture 7

1:11:11

CS2104 Programming Languages Lecture 6

1:48:37

CS2104 Programming Languages Lecture 4 part 1

1:47:07

CS2104 Programming Languages Lecture 5

37:00

CS2104 Programming Languages Lecture 5 Python Supplement

1:48:22

CS2104 Programming Languages Lecture 3

25:43

CS2104 Programming Languages Lecture 4 part 2

26:49

CS2104 Programming Languages Lecture 2 part 2

1:30:59

NUS CS2104 Programming Languages Lecture 2 part 1 C and Assembly Languages

1:03:12

NUS CS2104 Programming Languages Lecture 1 part 1

37:53

NUS CS2104 Programming Languages Lecture 1 part 2 C and Assembly Languages

24:27

SageNB newui

48:38

NUS CS1101S Scheme Class Lecture 1

55:23

NUS CS1101S Scheme Class Lecture 3

1:11:00

Lec 15 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005

2:52

The Village Running Man Edition

2:54

gg - to do manager

5:15

mercurial collaboration screencast

2:55

scripted testing screencast