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

Files @ 3ffeb97c88a7

Branch filter:

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

3ffeb97c88a7 184 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() {
	int x = 5;
	if (x >= 5) { // true
	    int y = 2;
	    x -= --y; // --y is 1, so x -= 1 results in 4
	}
	x++; // becomes 5
	return x;
}