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

Lecture

Interpreters and Virtual Machines

In course

CS-420: Advanced compiler construction

Students learn several implementation techniques for modern functional and object-oriented programming languages. They put some of them into practice by developing key parts of a compiler and run time system for a simple functional programming language. ...

Description

This lecture covers the concepts of interpreters and virtual machines, explaining how interpreters execute programs represented as raw text or abstract syntax trees, and how virtual machines simulate real processors to manage memory and input/output. It discusses the advantages of interpreters, the differences between text-based and tree-based interpreters, and the reasons for using virtual machines. The lecture also delves into the implementation of virtual machines, the types of virtual machines, and optimization techniques such as threaded code and top-of-stack caching.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Michel Schinz

Official source

Related concepts (32)

Threaded code

In computer science, threaded code is a programming technique where the code has a form that essentially consists entirely of calls to subroutines. It is often used in compilers, which may generate code in that form or be implemented in that form themselves. The code may be processed by an interpreter or it may simply be a sequence of machine code call instructions. Threaded code has better density than code generated by alternative generation techniques and by alternative calling conventions.

Stack machine

In computer science, computer engineering and programming language implementations, a stack machine is a computer processor or a virtual machine in which the primary interaction is moving short-lived temporary values to and from a push down stack. In the case of a hardware processor, a hardware stack is used. The use of a stack significantly reduces the required number of processor registers. Stack machines extend push-down automata with additional load/store operations or multiple stacks and hence are Turing-complete.

Abstract syntax tree

In computer science, an abstract syntax tree (AST), or just syntax tree, is a tree representation of the abstract syntactic structure of text (often source code) written in a formal language. Each node of the tree denotes a construct occurring in the text. The syntax is "abstract" in the sense that it does not represent every detail appearing in the real syntax, but rather just the structural or content-related details. For instance, grouping parentheses are implicit in the tree structure, so these do not have to be represented as separate nodes.

Memory management

Memory management is a form of resource management applied to computer memory. The essential requirement of memory management is to provide ways to dynamically allocate portions of memory to programs at their request, and free it for reuse when no longer needed. This is critical to any advanced computer system where more than a single process might be underway at any time. Several methods have been devised that increase the effectiveness of memory management.

Stack (abstract data type)

In computer science, a stack is an abstract data type that serves as a collection of elements, with two main operations: Push, which adds an element to the collection, and Pop, which removes the most recently added element that was not yet removed. Additionally, a peek operation can, without modifying the stack, return the value of the last element added. Calling this structure a stack is by analogy to a set of physical items stacked one atop another, such as a stack of plates.

Related lectures (37)

MIPS Functions and Stack

Explains MIPS functions, stack usage, calling convention, and register management.

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

Code Generation Lab

Covers generating code for a compiler, translating an Amy program to WebAssembly, including memory management and pattern matching compilation.

Computer Architecture: Algorithms to Programs (Compilation)

Explores the transition from algorithms to programs through compilation, emphasizing constraints and machine-understandable coding practices.

Advanced Spark: Partitioning and Optimization