- #1
- 8,917
- 672
An extremely simple and old (1960's) programming language based on an imaginary machine. The machine has two peripherals, at paper tape reader, and a paper tape punch. The character set only includes two characters, Asterisk and Hypen. The CPU has 20 memory locations, which hold instructions, but only the first 10 locations, 0 through 9 are addressable via the branch instruction.
There are only 13 instructions, and 4 basic types of instruction:
T - Read a character from the tape reader. If the character read is a hyphen, execute next instruction. If the character read is an asterisk, skip the next instruction, and execute the instruction following the next instruction. If no character is read because the paper tape is past the end, then the machine will stop.
H - Punch a hypen, then execute next instruction.
A - Punch an asterisk, then execute next instruction.
0 - branch to location 0 and continue execution there.
1 - branch to location 1 and continue execution there.
2 - branch to location 2 and continue execution there.
...
9 - branch to location 9 and continue execution there.
Instruction execution can continue past memory location 9, but these memory locations can't be the target of a branch instruction.
Programming tasks:
1. Write a program to duplicate the paper tape in the reader using the paper tape punch.
2. Write a program to read the paper tape until 3 asterisks in a row are read, then start duplicating the paper tape as in program 1.
3. Write a program to read the paper tape until 3 asterisks in a row are read, then start duplicating the paper tape, but stop all I/O once 3 asterisks in a row are punched during the copy process.
Note that since there are only 13 instructions, trial and error will be good enough to write any of these programs.
To avoid spoilers, please white out your repsonse, or merely indicate that you've solved how to create programs 1, 2, and/or 3.
Sample program:
This program will punch a hyphen and asterisk for every hyphen read, and puch an asterisk for every asterisk read. It's a broken copy program that you'll fix with program assignment 1.
There are only 13 instructions, and 4 basic types of instruction:
T - Read a character from the tape reader. If the character read is a hyphen, execute next instruction. If the character read is an asterisk, skip the next instruction, and execute the instruction following the next instruction. If no character is read because the paper tape is past the end, then the machine will stop.
H - Punch a hypen, then execute next instruction.
A - Punch an asterisk, then execute next instruction.
0 - branch to location 0 and continue execution there.
1 - branch to location 1 and continue execution there.
2 - branch to location 2 and continue execution there.
...
9 - branch to location 9 and continue execution there.
Instruction execution can continue past memory location 9, but these memory locations can't be the target of a branch instruction.
Programming tasks:
1. Write a program to duplicate the paper tape in the reader using the paper tape punch.
2. Write a program to read the paper tape until 3 asterisks in a row are read, then start duplicating the paper tape as in program 1.
3. Write a program to read the paper tape until 3 asterisks in a row are read, then start duplicating the paper tape, but stop all I/O once 3 asterisks in a row are punched during the copy process.
Note that since there are only 13 instructions, trial and error will be good enough to write any of these programs.
To avoid spoilers, please white out your repsonse, or merely indicate that you've solved how to create programs 1, 2, and/or 3.
Sample program:
Code:
0 1 2 3 4 5 6 7 8 9 X X X X X X X X X X
T H A 0This program will punch a hyphen and asterisk for every hyphen read, and puch an asterisk for every asterisk read. It's a broken copy program that you'll fix with program assignment 1.
Last edited:
