Compilation Methods SS 2009 - Slide 304
Objectives:
Understand implementation variant
In the lecture:
Aspects of this implementation variant are explained:
- allocation by need,
- non-orthogonal arrays,
- additional storage for pointers,
- costly indirect access
Assignments:
Allocate an array in Java that has the shape of a pyramid.
How many pointer and data cells are needed?
©2009 Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 30.03.2009