Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Course

CS-320: Computer language processing

Lectures in this course (73)

Introduces compiler theory, language processing, and the essential concepts behind building compilers.

Provides an overview of grammars and parsers in computer language processing.

Covers the semantics of programming languages, focusing on the Add language and the role of rewriting rules and CK machines in understanding meaning.

Covers the architecture of virtual machines, focusing on memory management, control flow, and the CEK machine's semantics.

Explores Viktor Kuncak's research in formal verification, program synthesis, and teaching activities at EPFL.

Explores the conversion of regular expressions to automata for efficient character classification.

Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.

Introduces automata, regular languages limitations, context-free grammars, and balanced parentheses grammars.

Explains syntax trees, parse vs AST, while language syntax, AST classes, and grammar ambiguities.

Covers LL(1) parsing, formalization, automation, constraints, and parsing tables.

Covers the basics of building Parser[A] using Scallion, LL(1) conflicts, and left factoring.

Introduces the CYK parsing algorithm for context-free grammars, explaining its handling of ambiguity and importance in parsing general grammars.

Explores parsing general grammars using the CYK algorithm and Chomsky Normal Form.

Explains the steps to convert a grammar into Chomsky Normal Form.

Covers the conversion to Chomsky Normal Form by removing unproductive and unreachable symbols.

Covers computer language processing, compilers, skills learned, and application examples.

Explains compiler phases, name analysis, symbol tables, and scoping rules in the context of error detection and resolution.

Explores compiler phases and symbol tables' role in mapping variables to declarations.

Discusses the importance of types, unsound type systems, and inductively defined relations for a small language's type system.

Explores operational semantics and inductively defined relations in the Amyli language.

Page 2 of 4