David C W Brown

Yes, it would be nice to have the Oakwood modules with their normal names. The history here is that we have a set of ulm libraries, and they happen to...

Yes, there are two commonly used sets of sizes for SHORTINT/INTEGER/LONGINT and a few other variations too. Oakwood allows for this in 5.2 by giving e.g. MAX(SHORTINT) as 'at least'...

Thanks David, yes that helps. For the last month or so I have been adapting the compiler to allow compile time selection of integer and set sizes independent of address...

That's right, pos is the value you would pass to Oberon's Files.Set(VAR r: Rider; f: File; pos: INT32).

How about an array of pointers to array of char? I believe it would generate (slightly) simpler and smaller code than a CASE statement. Assuming the pointers

Oops, I meant to cancel my comment, looked for a cancel button, and misread 'close and comment' as what I wanted. Please ignore the above.

Well, this was interesting. I built the CASE version and had a look at the code. For a 32 bit build, each case costs the length of the string plus...

Many thanks for the details of POINTER [1] - I've noticed that in passing, I should have looked into it before, very useful to know. Weird syntax. What were the...

Er, looking at OfrontErrors.Text I don't see an obvious big issue?. Mind you I think my implementation is slightly simpler - take a look at https://github.com/vishaps/voc/blob/ErrorsExperiment/src/compiler/errors.Mod and https://github.com/vishaps/voc/blob/ErrorsExperiment/VishapOberonErrors.txt. I rather...

Well, this is quite interesting. The specs from the original Oberon, Oberon 2 and Oberon 07+ all define DIV and MOD behaviour _only for positive divisors_. Here they are: From...