CSY/reowolf Files · testdata/parser/negative/13.pdl · Centrum Wiskunde & Informatica (CWI)

Files @ 3ffeb97c88a7

Branch filter:

Location: CSY/reowolf/testdata/parser/negative/13.pdl

3ffeb97c88a7 276 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

// function statement must return
int myfun(int x) {
	if (x > 0) {
		while (x > 0) {
			x--;
			if (x == 0) skip; // illegal!
			else return x;
		}
	} else {
		int y = 0;
label:  if (y >= 0) {
			goto label;
		} else {
			y = 5;
			return myfun(x + 1);
		}
	}
}