CS-320: Computer language processing

Lectures in this course (73)

Covers the Compiler Extension Lab, focusing on adding new functionality to a simple functional language compiler.

Covers the efficient translation of control flow structures using branch destination parameters and the compilation of switch statements with breaks.

Covers translating program fragments, switch statements, and break statements in programming languages.

Covers the efficiency of register machines over stack machines, memory organization, and mapping instructions.

Explores memory management, safety, automated techniques, garbage collection, dynamic dispatch, and first-class functions.

Covers register allocation using graph coloring to minimize memory access in programs.

Covers program optimizations, abstract interpretation, algebraic transformations, and interval analyses.

Explores efficiently implementing a new programming language in GraalVM using partial evaluation and memory access profiling.

Explores compiler correctness, examples of verified compilers, formal verification, and the challenges of certifying compilers.

Explores the correctness of compilers, emphasizing expression evaluation, bytecode compilation, and stack operations.

Introduces AST-based analysis and its benefits over testing, covering its applications, rule implementations, and limitations.

Explores static analysis techniques like AST-based analysis and taint analysis applied to the Amy language.

Covers implementing a parser for transforming tokens into an Abstract Syntax Tree.

Page 4 of 4