Building a Regex Engine From Scratch to Understand Backtracking
Learn how regular expression engines evaluate patterns. Compare catastrophic NFA backtracking against Thompson's NFA state machine construction.
8/6/202626 min read
3 articles tagged with Languages
Learn how regular expression engines evaluate patterns. Compare catastrophic NFA backtracking against Thompson's NFA state machine construction.
Learn memory management mechanics by building a Mark-and-Sweep Garbage Collector in TypeScript. Compare Reference Counting against Mark-and-Sweep.
Learn how programming languages work by building a complete tree-walk interpreter in TypeScript: Lexical Analysis, AST Parsing, and Environment Evaluation.