Prefix, Infix, Postfix and Code Generation

In course

Do aliquip reprehenderit ut excepteur nostrud labore voluptate. Ea elit Lorem dolor irure cupidatat dolor laborum esse commodo. Aliqua nisi sit quis non id irure pariatur consectetur. Aliquip voluptate adipisicing exercitation dolor occaecat ut aliqua ea ut exercitation nisi tempor.

Description

This lecture covers the concepts of prefix, infix, and postfix notations in expressions, along with code generation using stack machines. It delves into the evaluation of expressions, compilation for stack machines, and the use of different notations in programming languages like LISP and PostScript.

Instructor

dolor dolor

Irure exercitation laborum occaecat esse nulla est eu anim occaecat dolor nulla. Consectetur proident eiusmod ut deserunt. Laborum cupidatat cupidatat exercitation non. In quis ex commodo sit consequat ullamco amet et officia occaecat.

Official source

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

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 (48)