Index

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

Overview lectures

Memory management

Parsing Algorithms

Course syllabus:

Building an Interpreter from scratch

– or –

Available coupons:

Course syllabus:

Garbage Collection Algorithms

– or –

Available coupons:

Course syllabus and previews:

Automata: building a RegExp machine

– or –

Available coupons:

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

Parsing

ECMA-262-3 in detail

ECMA-262-5 in detail

Notes

Misc