Note: explore more courses in [ dmitrysoshnikov.education ] school.

Overview lectures

Memory management

Online course devoted to the semantics of programming languages, where we build an interpreter for a language similar to Python or JavaScript from scratch.Read more →

Course syllabus:

Online course devoted to the theory and techniques of syntactic analysis, where we build an parser for a programming language from scratch.Read more →

Course syllabus:

Online course devoted to the Automatic memory management used in computer programs, know as the Garbage Collection. Read more →

Course syllabus and previews:

Online course devoted to state machines, formal grammars, and regular expressions implementation, where we build a RegExp processor based on NFA and DFA. Read more →

Course syllabus and previews:

Lecture 1: RegExp history

Lecture 2: Regular grammars

Lecture 3: Finite Automata

Lecture 4: Character and Epsilon NFA

Lecture 5: Concatenation pattern: AB

Lecture 6: Union pattern: A | B

Lecture 7: Kleene closure: A*

Lecture 8: Complex machines

Lecture 9: Syntactic sugar

Lecture 10: NFA optimizations

Lecture 11: NFA acceptor

Lecture 12: NFA table

Lecture 13: RegExp-Tree tool

Lecture 14: DFA table

Lecture 15: DFA minimization

Lecture 16: RegExp match

Written lectures for Finite Automata and RegExp class:

Parsing

ECMA-262-3 in detail

ECMA-262-5 in detail

Notes

Misc