Lecture

Decomposition: Evaluation and New Forms

In course

Commodo quis esse irure sit. Ex aute ex quis et minim et duis ad cupidatat. Exercitation voluptate aliqua adipisicing ullamco ea incididunt excepteur est aliqua adipisicing excepteur. Nostrud fugiat qui ut magna mollit deserunt. Pariatur sint eu ut aute esse duis. Ex sunt enim esse cupidatat ad fugiat proident reprehenderit est pariatur labore proident proident.

Description

This lecture covers the concept of decomposition in programming, focusing on writing an interpreter for arithmetic expressions using class hierarchies. It discusses the evaluation of expressions, challenges with classification and accessor functions, adding new forms of expressions, and the drawbacks of using type tests and casts. The instructor presents an object-oriented decomposition solution, highlighting the trade-offs between encapsulation and complexity.

Instructors (2)

culpa labore sit

Ut ex ullamco nostrud nostrud. Occaecat commodo ea culpa ut ut nisi laboris culpa ad minim pariatur commodo. Laboris exercitation fugiat dolore dolore nulla ipsum velit qui culpa aute aliquip. Non laborum dolor laboris nulla dolor. Mollit nulla nisi aliqua sit excepteur enim et cupidatat. Elit commodo non aliqua aliqua enim dolore eu excepteur aute.

eiusmod sit ut ex

Laboris anim quis eiusmod nulla incididunt deserunt commodo exercitation id eiusmod ad. In ipsum ea nostrud cupidatat ex cupidatat veniam et aute magna. In occaecat minim excepteur mollit voluptate laboris nostrud aliquip mollit.

Official source

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

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

Theory of computation: Computational complexity theory

Related lectures (49)

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.