CSY/reowolf Files · testdata/parser/counterexamples/out_of_order_assignment.pdl

Files @ 3ffeb97c88a7

Branch filter:

Location: CSY/reowolf/testdata/parser/counterexamples/out_of_order_assignment.pdl

3ffeb97c88a7 201 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.

// It fails, so that is nice, but it fails due to the wrong reasons
// My bad: C-ism of declarations on top
bool some_function() {
    result_c = false;
    bool result_c = true;
    return result_c;
}