OpenClassroom
Finite Automata: Lexical Specification
Compilers
Lecture 12 of 95
< Previous
Go to Video:
Introduction
(8 min)
Structure of a Compiler
(13 min)
The Economy of Programming Languages
(19 min)
Cool Overview
(19 min)
Cool Example II
(15 min)
Cool Example III
(18 min)
Lexical Analysis
(12 min)
Lexical Analysis Examples
(13 min)
Regular Languages
(12 min)
Formal Languages
(13 min)
Lexical Specifications
(16 min)
Lexical Specification
(14 min)
Finite Automata
(23 min)
Regular Expressions to NFAs
(9 min)
NFA to DFA
(15 min)
Implementing Finite Automata
(11 min)
Introduction to Parsing
(5 min)
Context-Free Grammars
(14 min)
Derivations
(7 min)
Ambiguity
(17 min)
Error Handling
(13 min)
Abstract Syntax Trees
(3 min)
Recursive Descent Parsing
(6 min)
Recursive Descent Algorithm
(13 min)
Left Recursion
(9 min)
Predictive Parsing
(19 min)
First Sets
(14 min)
Follow Sets
(17 min)
LL(1) Parsing Tables
(14 min)
Bottom-Up Parsing
(7 min)
Shift-Reduce Parsing
(7 min)
Handles
(6 min)
Recognizing Handles
(13 min)
Recognizing Viable Prefixes
(14 min)
Valid Items
(3 min)
SLR Parsing
(14 min)
SLR Parsing Example
(6 min)
SLR Improvements
(11 min)
SLR Examples
(12 min)
Introduction to Semantic Analysis
(3 min)
Scope
(8 min)
Symbol Tables
(11 min)
Types
(11 min)
Type Checking
(8 min)
Type Environments
(11 min)
Subtyping
(11 min)
Typing Methods
(8 min)
Implementing Type Checking
(6 min)
Static vs. Dynamic Typing
(7 min)
Self Type
(7 min)
Self Type Operations
(12 min)
Self Type Usage
(6 min)
Self Type Checking
(10 min)
Error Recovery
(7 min)
Runtime Organization
(6 min)
Activations
(13 min)
Activation Records
(13 min)
Globals & Heap
(6 min)
Alignment
(6 min)
Stack Machines
(16 min)
Introduction to Code Generation
(7 min)
Code Generation I
(17 min)
Code Generation II
(18 min)
Code Generation Example
(13 min)
Temporaries
(16 min)
Object Layout
(23 min)
Semantics Overview
(7 min)
Operational Semantics
(12 min)
Cool Semantics I
(21 min)
Cool Semantics II
(26 min)
Intermediate Code
(9 min)
Optimization Overview
(13 min)
Local Optimization
(25 min)
Peephole Optimization
(4 min)
Dataflow Analysis
(8 min)
Constant Propagation
(21 min)
Analysis of Loops
(7 min)
Orderings
(6 min)
Liveness Analysis
(13 min)
Register Allocation
(9 min)
Graph Coloring
(12 min)
Spilling
(14 min)
Managing Caches
(10 min)
Automatic Memory Management
(14 min)
Mark and Sweep
(13 min)
Stop and Copy
(19 min)
Conservative Collection
(3 min)
Reference Counting
(15 min)
Java
(7 min)
Java Arrays
(8 min)
Java Exceptions
(14 min)
Java Interfaces
(8 min)
Java Coercions
(7 min)
Java Threads
(18 min)
Other Topics
(14 min)
Next >