(A) study on programming methodologies

Abstract

This thesis is concerned about programming methodologies which is related to programming language. The major part of this thesis is Dijkstra``s approach and its application and implementation for practical execution. At the biginning it briefly introduces three basic ideas (1) flow-diagram and programming, (2) structured programming, and (3) axiomatic approach. Specially Dijkstra``s mini programming language and his ideas of predicate transformer are studied. DPL (an abbreviation of Dijkstra``s Programming Language) is used in describing an algorithm of deletion of any node in threaded binary tree structure. An implementation of translator of DPL to ALGOL by syntax-directed translation is performed at NOVA computer installed in K.A.I.S. The basic purpose of this thesis is to progress the programming by means of thinking the program correctness when a programmer writes the program. At the end of ABSTRACT, I wish to introduce Dijkstra``s impressive world, that is, " One of the most important aspects of any computing tool is its influence on the thinking habits of those who try to use it." (ref. (1))