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

Files @ 3ffeb97c88a7

Branch filter:

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

3ffeb97c88a7 330 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 1
// My bad: C-ism of declarations on top

int call_me(int later) {
    return later;
}

int function() {
    int a = 2;
    int b = 3;

    int d = call_me(b); // succeeds, because of assignment
    call_me(b); // bare function call seems to work, unless we perform assignment afterwards

    int d = 5;

    return 2;
}