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

Files @ 3ffeb97c88a7

Branch filter:

Location: CSY/reowolf/testdata/parser/positive/10.pdl

3ffeb97c88a7 419 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() {}

primitive example(in a, out[] b) {
	while (true) {
		synchronous {
			if (fires(a)) {
				int i = 0;
				while (i < b.length) {
					if (fires(b[i])) {
						int j = i + 1;
						while (j < b.length)
							assert !fires(b[j++]);
						break;
					}
					i++;
				}
				assert i < b.length;
			} else {
				int i = 0;
				while (i < b.length)
					assert !fires(b[i++]);
			}
		}
	}
}