• Corpus ID: 20558380

Control structures for programming languages

  title={Control structures for programming languages},
  author={David A. Fisher},
. The research reported here is the result of an investigation of several aspects of the control structure of programming languages. By control structures we mean _ • programming environments or operations which specify the sequencing and interpretation rules for programs or parts of programs. This dissertation attempts to demonstrate the thesis: complexity diminishes and clarity increases to a marked degree if algorithms are described in a language in which appropriate control structures are… 

Figures from this paper

A survey of control structures in programming languages

The control structure of programming languages and their development are examined, including activities, broadcast control, conditionals, constraint expressions, coroutines, critical sections, distributive operators, dynamic instruction modification, expressions and generators.

Control Separation in programming languages

A case study is examined through a case study, the Coroutine PASCAL system, which has been useful as an expository tool, as a vehicle for control structure experimentation, and as a facility for empirical studies on run-time storage management strategies.

Requirements for advanced programming systems for list processing

This paper presents an overview of a number of system features which the author feels are important to improve the productivity of programmers working in such domains.

CCAL: an interpreted language for experimentation in concurrent control

This paper describes the control abstraction facilities offered by the CCAL interpreter, its use, and implementation strategies in the distributed environment.

Programmer-defined Evaluation Regimes*

Most programming languages have a fixed set of control operations, and very few languages allow programmers to define new operations; while many new control operations can be constructed, they are generally combinations or modifications of a very small set of basic control operations.

High level operations in automatic programming

  • J. Earley
  • Computer Science
    SIGPLAN Symposium on Very High Level Languages
  • 1974
A set of operations embedded in a programming language VERS2 are presented which represent a higher level of description than currently exists and include iterators, pattern matching facilities, implicitly specified data structures, and the ability to place constraints on data structures.

The role of instruction sequencing in structured microprogramming

A dynamically microprogrammed processor is described and several examples of problem-oriented programming in which the performance of the microcode was much better than that of assembly language code (System/360, normalized technology).

Behavioral semantics of nonrecursive control structures

The PLANNER Project is constructing a Programming Apprentice to make it easier for expert programmers to do knowledge based programming.

A Coroutine Approach to Parsing

  • H. Samet
  • Computer Science
    ACM Trans. Program. Lang. Syst.
  • 1980
The usefulness of the model is demonstrated by showing how a production language parsing method is extended to handle multiple syntax specifications and its adaptation to a recursive descent parser.

Graph grammars and global program data flow analysis

If a given graph is generated by the grammar, repeated application of the reductions will result in a single node regardless of the order in which they are applied, which gives rise to an algorithm that parses a given program flow graph in time linear in the size of the graph.



Procedure-oriented language statements to facilitate parallel processing

Two statements are suggested which allow a programmer writing in a procedure-oriented language to indicate sections of program which are to be executed in parallel, and should be particularly effective for use with computing devices capable of attaining some degree of compute-compute overlap.

The next 700 programming languages

A family of unimplemented computing languages is described that is intended to span differences of application area by a unified framework. This framework dictates the rules about the uses of

A programming language

  • K. Iverson
  • Computer Science
    AIEE-IRE '62 (Spring)
  • 1962
The paper describes a succinct problem-oriented programming language that relies heavily on a systematic extension of a small set of basic operations to vectors, matrices, and trees, and on a family of flexible selection operations controlled by logical vectors.

SOLߞA Symbolic Language for General-Purpose Systems Simulation

This paper illustrates the use of SOL, a general-purpose algorithmic language useful for describing and simulating complex systems. Such a system is described as a number of individual processes

Recursive functions of symbolic expressions and their computation by machine, Part I

A programming system called LISP (for LISt Processor) has been developed for the IBM 704 computer by the Artificial Intelligence group at M.I.T. The system was designed to facilitate experiments with

On multiprogramming, machine coding, and computer organization

A programming scheme is presented which avoids the concept of the interrupt and permits the specification of concurrent (or pseudoconcurrent) activities in a supposedly more perspicuous manner.

A Data Definition Facility for Programming Languages

  • T. Standish
  • Computer Science
    Outstanding Dissertations in the Computer Sciences
  • 1967
This dissertation presents a descriptive notation for data structures which is embedded in a programming language in such a way that the resulting language behaves as a synthetic tool for describing

The FORTRAN automatic coding system

The FORTRAN project was begun in the summer of 1954 to enable the programmer to specify a numerical procedure using a concise language like that of mathematics and obtain automatically from this specification an efficient 704 program to carry out the procedure.

The Main Features of CPL

The paper provides an informal account of CPL, a new programming language currently being implemented for the Titan at Cambridge and the Atlas at London University. CPL is based on, and contains the

A proposal for definitions in ALGOL

An extension to ALGOL is proposed for adding new data types and operators to the language and examples of definition sets are given for real and complex matrices, complex numbers 9 file processing 9 and list manipulation.