- ALGOL 68
- Raspberry Pi
- Raspberry Pi 3
- Raspberry Pi Zero W
- X windows
- Networking with SIMH (or QEMU) on Debian (buster)
- Drawing graphs using SVG
- Installing lighttpd with support for Python CGI scripts
- Using the serial console device on a Raspberry Pi
- Accessing serial devices using Python
- Configuring the Pi Zero USB port as a serial device
- Using Algol 68 to print the Fibonacci series
- Determine MTU size using ping
- Implementing 'cat' in Python (reading a file character by character)
- Setting the network MTU size
- GNOME 3 Customizing the login screen
- Prompting for a Yes/No response (BASH)
- Booting in Text Mode with GRUB2
- Set Linux Console Height and Width
- Creating a seperate home partition (Raspberry Pi)
- Minimal GNOME 3 Install on Debian (jessie)
- Compairing version numbers
- 687,165 hits
Tag Archives: ALGOL 68
Three different solutions to the same problem illustrating some of the features of Algol 68.
Yes – I know this is another obscure ALGOL68 post, but I just can’t help liking this archaic language for all it’s strangeness, and it can get pretty strange!
Last time I looked at updating my original post I got a little side tracked and ended up rewriting the original code rather than adding a routine to convert an integer to roman numerals.
This is an update of an older post describing a short program written in ALGOL 68 to convert strings of roman numbers to decimal integer values.
Another code example that I’ve dug out of my archives is one that shows how to create a binary tree structure and print out the results using in ALGOL 68.
Various recursive routines to manipulate linked lists written (a long time ago) using ALGOL 68, classic stuff!
A classic example of a recursive algorithm implemented using ALGOL 68 to solve the Towers of Hanoi problem for one, two, three, four and five discs.
Another short ALGOL 68 program that I wrote last year while trying to get to grips with the language again, and as before this was based on a existing PASCAL program that I’d written previously.
I was just messing about earlier and having found a short PASCAL program to find e using Taylor’s expansion series, I wondered how long it would take me to rewrite it in ALGOL 68.