A case for while-until

Authors:
Daniel P. Friedman;Stuart C. Shapiro
Affiliations:
Indiana University, Bloomington, Indiana;Indiana University, Bloomington, Indiana
Venue:
ACM SIGPLAN Notices
Year:
1974

Citing 5
Cited 6

On the capabilities of while, repeat, and exit statements

Communications of the ACM
BLISS: a language for systems programming

Communications of the ACM
Flowchart techniques for structured programming

ACM SIGPLAN Notices
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual
Report on the algorithmic language ALGOL 68

Report on the algorithmic language ALGOL 68

High-level data flow analysis

Communications of the ACM
A genealogy of control structures

Communications of the ACM
Applications of a graph grammar for program control flow analysis

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A place for assembler in structured programming

SIGCSE '77 Proceedings of the seventh SIGCSE technical symposium on Computer science education
Connector functions: another view of the GOTO ?

ACM SIGPLAN Notices
The roots of structured programming

SIGCSE '78 Papers of the SIGCSE/CSA technical symposium on Computer science education

Quantified Score

Hi-index	0.03

Visualization

Abstract

A new control structure construct, the while-until, is introduced as a syntactic combination of the while and the until. Examples are shown indicating that use of the while-until can lead to structured programs that are conceptually more manageable than those attainable without it. The while-until statement is then extended to a valuereturning expression which is shown to be more powerful than either the while or the until.