Files @ 3ffeb97c88a7
Branch filter:

Location: CSY/reowolf/testdata/parser/negative/27.pdl - annotation

MH
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

int main(int a) {
	while (a >= 2) {
		a -= 2;
dupl:	while (a < 10) {
			a++;
			if (a % 5 == 0)
				break dupl;
		}
	}
	skip;
dupl:
	while (true) goto dupl;
}