This programming language may be used to instruct a computer to perform a task.
|Execution method:||Compiled (machine code)|
If you know MAD, please write code for some of the tasks not implemented in MAD.
MAD (the Michigan Algorithm Decoder) is a programming language developed in 1959 at the University of Michigan by Bernard Galler, Bruce Arden and Robert M. Graham. It was originally implemented on the IBM 704, and later ported to a variety of systems including the IBM System/370. It is notable for being the first language used under CTSS (the Compatible Time-Sharing System). Among the programs written in it was RUNOFF, the ancestor of today's nroff typesetting program. A transpiler existed that could translate Fortran-2 code into MAD.
The language is partially based on ALGOL-58, but does not resemble it syntactically. Similar to early versions of FORTRAN, it is a fixed-format language. The first 10 columns contain a statement label, column 11 may be marked
R to indicate a comment, and columns 12-72 contain the code.
Eric S. Raymond has written an implementation of MAD that runs on modern Linux, which can be found on Gitlab. This distribution also contains a transcription of the original MAD manual, as well as a couple of programs from its heyday.
"What, me worry?"
Pages in category "MAD"
The following 66 pages are in this category, out of 66 total.
- Sequence of non-squares
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Sieve of Eratosthenes
- Smallest square that begins with n
- Smith numbers
- Special Divisors
- Square but not cube
- Steady Squares
- Stern-Brocot sequence
- Strange numbers
- Sum of divisors
- Sum of first n cubes
- Sum of square and cube digits of an integer are primes
- Sum of the digits of n is substring of n