Bit Foundry / Fortran

Fortran.

Compilation and Fibonacci simulations.

FORTRAN · 01

The compiler’s path

01 / 02 · TAP A BOX TO INSPECT IT
Show the object program as
Punched cards
Tape · drum · disk
Printed for inspection
STEP 1 · INPUT

The source program

FORTRAN source code is human-readable. The compiler translates it into instructions the computer can execute.

FORTRAN · 02

Find the first term over 1,000

02 / 02 · STEP THROUGH THE LOOP
Fibonacci terms Ready at the starting values.
TRUE
FALSE
READY · START

Two values begin the sequence

Start with NEXT = 0 and LATEST = 1. Add the pair; if SUM ≤ 1,000, shift the values and repeat.

NEXT = 0LATEST = 1SUM = —STEP = 0