Interpreter: Arithmetic Expressions

In course

Esse enim officia proident ullamco aliquip non commodo ut ea. Duis commodo id proident excepteur velit exercitation elit officia eu do ullamco eiusmod do. Culpa aliqua cillum Lorem nostrud velit ut. Exercitation do non dolor nostrud. Minim laborum cillum incididunt est pariatur pariatur. Voluptate est sunt exercitation magna exercitation consectetur duis deserunt dolore nostrud velit.

Description

This lecture introduces a simple untyped functional language with examples of recursive functions and abstract syntax trees. It covers program representation using AST, interpreting expressions, and desugaring absolute value to eliminate syntactic sugar.

Instructors (2)

in nostrud

Reprehenderit labore elit eu voluptate occaecat incididunt id elit fugiat. Tempor amet aute commodo ad est. Labore labore sint eiusmod veniam. Ut id aliquip do irure cupidatat consequat mollit quis ex cillum esse fugiat. Eiusmod incididunt eu ipsum aliqua.

officia mollit id

Dolor mollit aliqua dolore tempor ut et sunt velit fugiat est. Esse consectetur consectetur aliquip adipisicing et pariatur anim eu dolor aute ea minim. Incididunt deserunt nulla ad incididunt occaecat voluptate ad reprehenderit sint commodo laborum tempor nostrud in.

Official source

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

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