CSY/reowolf Files · testdata/eval/positive/9.pdl · Centrum Wiskunde & Informatica (CWI)

Files @ 3ffeb97c88a7

Branch filter:

Location: CSY/reowolf/testdata/eval/positive/9.pdl

3ffeb97c88a7 215 B text/plain Show Annotation Show as Raw Download as Raw

Add docs for implementing infinite types in a value based language.

Since we are a value based language and do not have the concept of
pointers, then if we want to lay out the memory of datatypes we run
into a problem when the types represent recursive datastructures:
these are infinite in size. So we have an algorithm for turning
some types into pointer-like things, such that we can lay everything
out in memory.

#version 100

composite main() {}

int test() {
	msg[] x = {create(4)};
	x[0][0] = 0;
	x[x[0][0]][1] = 1;
	x[x[0][0]][x[0][1]+x[0][1]] = 2;
	x[x[0][0]][3] = 3;
	return x.length + x[0].length + x[x[0][0]][x[0][3]];
}