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

Files @ 3ffeb97c88a7

Branch filter:

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

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

// Bad reporting of EOF. Also main parser loop would be fine if pragmas, imports
// and declarations are mixed. Maybe force pragmas at top for readability...

#version 1

composite main() {}

#version 2

composite another() {}