Control Structures for Programming Languages

نویسنده

  • 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 primitive or easily expressible. A number of •control structures extant in programming languages and systems are catalogued and then used as a guide to develop a programming language which has a control extension "_ facility. This language has not only the mechanical necessities for control extensions, but also has primitive control operations for sequential processing, parallel processing, alternative selection, monitoring, synchronization, ° and relative continuity. These operations are the source of the clarity of control descriptions because they span ou_ conceptual notion of control and because they can be easily composed to form other more specialized control structures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a Programming Language Ontology

We examine the role of semantic theory in determining the ontology of programming languages. We explore how different semantic perspectives result in different ontologies. In particular, we compare the ontological implications of set-theoretic versus type-theoretic semantics. 1 Programming Languages Programming languages (PLs) combine two, not always distinct, facilities: data structures (e.g.,...

متن کامل

Programming Language Constructs and Program Size

Intuitively, the richer the set of control structures provided by a programming language (language constructs), the better its expressibility. Equating the ease of expression of an algorithm with the succinctness (size) of the resultant program, we show that all commonly-used programming languages provide all implementable control structures. We also study the class of size functions witnessing...

متن کامل

A Semantic Difference Algorithm for Structured Visual Dataflow Programs

The diff utility is an important basic tool, providing a foundation for many of the fundamental practices of software development, such as source code management. While there are many file differencing tools for textual programming languages, including some that look at more than simple textual variations, there are few for visual programming languages. We present an algorithm for semantic comp...

متن کامل

Seamless Integration of Control Flow and Data Flow in a Visual Language

In the visual programming domain, the stress of research is laid on the use of visual formalism, which is considered to be more intuitive than the textual formalism, in the programming task. Some visual languages are based purely on data flow. With such languages, the execution order depends on the availability of data and it is therefore difficult to specify some programming constructs such as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1970