Lecture

Compiling Expressions

In course

Minim irure amet cillum fugiat ea commodo. Velit id voluptate ex ipsum irure tempor in ex quis aliqua enim ipsum. Cupidatat dolore reprehenderit amet Lorem elit nulla nisi mollit. Amet excepteur exercitation ex excepteur veniam fugiat laboris sit tempor veniam incididunt.

Description

This lecture covers the conversion of expressions from infix to prefix and postfix notations, the evaluation of expressions using stack-based virtual machines, and the compilation of expressions for stack machines. It also discusses the use of prefix notation in LISP and postfix notation in PostScript, along with the corresponding bytecode generation for expressions.

Instructor

Dolore sit eiusmod qui dolor dolore reprehenderit minim voluptate esse esse proident quis aliqua do. Duis irure Lorem aute sunt pariatur voluptate qui magna nulla. Consectetur velit nulla Lorem proident.

Official source

https://mediaspace.epfl.ch/media/0_33e91bye

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (27)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.