| Program execution |
|---|
| General concepts |
| Types of code |
| Compilation strategies |
| Notable runtimes |
|
| Notable compilers & toolchains |
|
In computer programming, a compile and go system; compile, load, and go system; assemble and go system; or load and go system[1][2][3] is a programming language processor in which the compilation, assembly, or link steps are not separated from program execution. The intermediate forms of the program are generally kept in primary memory, and not saved to the file system.[4][5][6][7][8][3][1][2]
Examples of compile-and-go systems are WATFOR, PL/C, and Dartmouth BASIC.[3] An example of load-and-go systems is the loader Anthony J. Barr wrote for the University Computing Corporation in 1968 that was replaced in the market by the IBM OS/360 loader in 1972. These OS/360 loaders performed many of the functions of the Linkage Editor but placed the linked program in memory rather than creating an executable on disk.[9] Compile and go systems differ from interpreters, which either directly execute source code or execute an intermediate representation.
- ^ a b Weik 2000a, p. 66.
- ^ a b Weik 2000b, p. 260.
- ^ a b c Dhotre & Puntambekar 2008, pp. 3–2.
- ^ Donovan 1972, pp. 150.
- ^ Janson 1985, pp. 184.
- ^ Morris 1992, pp. 477.
- ^ Isrd 2006, pp. 226.
- ^ Joseph 2007, pp. 130.
- ^ IBM Corporation (1972). IBM OS Linkage Editor and Loader (PDF).