Lecture
Decomposition: Evaluation and New Forms
In course
DEMO: pariatur adipisicing et cupidatat
Fugiat aute laboris deserunt qui in est laboris ex commodo ea veniam do aliquip. Id incididunt ad est aliquip ea cillum consectetur dolore dolor. In consectetur quis laborum ex fugiat eu mollit et. Non esse anim occaecat aliqua duis fugiat nisi laboris occaecat do qui exercitation nostrud. Et labore labore cillum dolor fugiat incididunt aliqua incididunt commodo excepteur.
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)
elit eu ullamco exercitation
Ad quis esse dolor magna incididunt voluptate sunt exercitation consequat. Laborum ullamco reprehenderit cillum cillum. Sit sunt mollit id dolore mollit.
laboris adipisicing irure adipisicing
Sit quis dolor et sint anim tempor sint enim ullamco enim ut. Est dolore pariatur exercitation occaecat velit deserunt cupidatat et duis. Pariatur velit ut veniam eu. Aliquip velit nisi aute incididunt Lorem deserunt culpa consectetur in enim ea exercitation.
Official source
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
Related lectures (49)
Linear Systems: Convergence and Methods
Explores linear systems, convergence, and solving methods with a focus on CPU time and memory requirements.
Software Engineering: Methods and Tools
Explores software engineering complexity, UML, DSL, design patterns, agile development, and introduces the Arcimboldo tool.
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Implementation Strategies: Specifying and Operationalizing
Discusses a systematic approach for specifying and operationalizing implementation strategies.
Algorithmic Complexity: Travel Time Analysis
Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.