Feelin' My Age (part 3): UCSD P-System Pascal

 From the mid 1980s to early 90s I was proud to be a mature undergraduate student of the UK's remarkable Open University†, majoring in pure Maths.

I took a subsidiary computer science module as part of of the degree. Pascal was one of the languages that was taught (Prolog being another). At the time they taught Pascal using the P-system and UCSD Pascal.

UCSD Pascal in use - source Wikipedia, Public Domain

UCSD Pascal Handbook - source http://www.kdbarto.org/UCSD_Pascal.html

So why does that make me feel my age? Well the Wikipedia Pascal Programming page discusses UCSD Pascal under the "Early Pascal Compilers" section! And the last release was in the mid eighties.

Now I did pass that course (with distinction I might add!) and I'd love to show you some of the code I wrote, but sadly it's on 5.25" floppies! Strangely enough, I don't have a suitable drive handy.

Which brings me on to another reason this makes me feel all dinosaur-like. To take the course I needed to get my hands on an IBM PC XT clone with CGA graphics, all of 512KB of RAM and a pair of 5.25" floppy drives. No hard drive in mine - too expensive! Such beasts were the current PCs at the time.

Image displayed in CGA 160×100 16 color mode(4-bit) - source Wikipedia, Public Domain.

BTW, I resented buying that hateful piece of crap. I was happily using an upgraded Sinclair QL at the time (as was Linus Torvalds, apparently), and I thought, and still think, it was superior to that PC. Multitasking vs TSRs? SuperBASIC vs MS Basic? I know which I'd take. But more on that in another post.

Those were the days. Someone please bring me my pipe and slippers.

Trivia corner: What does the "P" in P-System mean

Many people, myself included until today, believe that the "P" stands for "Pascal", because the P-System is so closely associated with UCSD Pascal.

But, apparently, the P System is an implementation of a p code [virtual] machine where the "p" stands for "portable".

Beg to differ? That's what the comments are for.

† The OU was set up to allow UK citizens to take a degree while living a normal life: working, bringing up kids etc. Like other UK universities at that time, the honours degree was the equivalent of four years full time, but OU students are permitted to spread the time out to suit their home circumstances. I had very poor health at the time, so this was a perfect arrangement for me.

Comments

Post a Comment

Comments are very welcome, but please don't comment here if:

1) You have a query about, or a bug report for, one of my programs or libraries. Most of my posts contain a link to the relevant repository where there will be an issue tracker you can use.

2) You have a query about any 3rd party programs I feature, please address them to the developer(s) - there will be a link in the post.

3) You're one of the tiny, tiny minority who are aggressive or abusive - in the bin you go and reported you will be!

Thanks

Popular posts from this blog

Deleting elements from a dynamic array

In my blog " Initialising Dynamic Arrays " I mentioned I have been writing some unit tests that needed numerous repetative array initialisation operations. Well, one of the other common operations I found myself writing was the deletion of items from dynamic arrays. So I decided to find a generic way of doing this. Assuming we know the index of the item to be deleted we need the equivalent of Delphi's built-in Delete procedure for strings. If you read the previous post you won't be surprised to learn that I decided to further extend the Generics.Collections.TArray class by adding to the TArrayEx class I introduced there. My first attempt emulates Delphi's Delete procedure by deleting the array element in-place: i.e. it updates the array passed as a parameter. Unsurprisingly the method is called DeleteInPlace . Here's how it goes: type TArrayEx = class ( TArray ) public .. . class procedure DeleteInPlace < T > ( var A :
Read more

Initialising dynamic arrays

When writing some unit tests a while ago I found myself needing to initialise some dynamic arrays with test data. It would be nice if we could do something like this: var A : array of Integer ; begin A := ( 1 , 2 , 3 , 4 ) ; // !! WRONG end ; but we can't. So I decided to write some functions to initialise dynamic arrays to the contents of another array, be it a constant, a literal or another dynamic array. The result was a set of overloaded routines, one for each data type I needed to handle, for example for Integer and string arrays I had: function CloneArray ( const A : array of Integer ) : TIntegerDynArray ; overload ; var Idx : Integer ; begin SetLength ( Result , Length ( A ) ) ; for Idx := Low ( A ) to High ( A ) do Result [ Idx - Low ( A ) ] := A [ Idx ] ; end ; function CloneArray ( const A : array of string ) : TStringDynArray ; overload ; var Idx : Integer ; begin SetLength ( Result , Len
Read more

New String Property Editor Planned For RAD Studio 12 Yukon 🤞

Image
This blog post is based on a pre-release version of the RAD Studio software and it has been written with specific permission by Embarcadero. No feature is committed until the product GA release. It seems I'm getting very excited about multi-line strings of late. My previous post was about multi-line string literals for Delphi  and this time I'm talking about the new multi-line string property editor being slated for the RAD Studio 12 IDE. For more years than I care to remember, I've been frustrated by the inability to enter multi-line strings in the Delphi IDE object inspector. That meant having to resort to code to initialise some multi-line labels. So frustrated was I that I wrote a little property editor of my own ( stringpe ), way back in 2004. It's still around and on GitHub. Here's what it (sometimes) looks like: Yeah, I know this is Vista - I used an old screenshot Sometimes? Well it looked like that until it got installed on DPI aware Delphis, and then it sh
Read more