goto-less programming


Also found in: Dictionary.

GOTO-less programming

[¦gō·tü‚les ′prō‚gram·iŋ]
(computer science)
The writing of computer programs without the use of GOTO statements.

goto-less programming

Writing a program without using goto instructions, an important rule in structured programming. A goto instruction points to a different part of the program without a guarantee of returning. Instead of using goto's, structures called "subroutines" or "functions" are used, which automatically return to the next instruction after the calling instruction when completed.
Mentioned in ?
References in periodicals archive ?
Such differences aside, I do not see how Dijkstra's sample program shows that GOTO-less programming is any simpler or more readable.
Even GOTO-less programming can lead to bad practices; as witness, the recent graduate from a respectable school who tried to justify to me the use of the (basic) expressions true = 1 "begin loop" .
Like Rubin, i believe it is time to part from the dogma of GOTO-less programming.