Video2019
Parsing Explained
Computerphile
Separates tokenising from parsing and shows why a grammar, not a sequence of string checks, is what lets a compiler recognise nested structure at arbitrary depth.
link checked 17 Sept 2026FreeIntermediate
Computer Science · Compilers & Interpreters
Parsing
A topic within Compilers & Interpreters, itself one of 11 topics in that field and part of Computer Science.
Reading on Parsing
22 works
Paper1965
On the Translation of Languages from Left to Right
Donald E. Knuth
Defines LR(k) grammars and proves they can be parsed deterministically in linear time, giving parser theory the class that most real-world parsing algorithms are built to handle.
PaidAdvanced