Files @ 3ffeb97c88a7
Branch filter:

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

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.
1
2
3
4
5
6
// Import succeeds due to bad parsing (checking for characters, not numbers,
// should expect whitespace, then a single number

#version123 456

composite main() {}