The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - May (1983 vol.9)
pp: 267-279
N.S. Prywes , Department of Computer and Information Science, Moore School, University of Pennsylvania
ABSTRACT
The paper describes the compilation of a program specification, written in the very high level nonprocedural MODEL language, into an object, PL/1 or Cobol, procedural language program. Nonprocedural programming languages are descriptive and devoid of procedural controls. They are therefore easier to use and require less programming skills than procedural languages. The MODEL language is briefly presented and illustrated followed by a description of the compilation process. An important early phase in the compilation is the representation of the specification by a dependency graph, denoted as array graph, which expresses the data flow interdependencies between statements. Two classes of algorithms which utilize this graph are next described. The first class checks various completeness, nonambiguity, and consistency aspects of the specification. Upon detecting any problems, the system attempts some automatic correcting measures which are reported to the user, or alternately, when no corrections appear as reasonable, it reports the error and solicits a modification from the user. The second class of algorithms produces an intermediate design of an object program in a language independent form. Finally, PL/1 or Cobol code is generated.
INDEX TERMS
very high level languages, Automatic program generation, compilers and generators, dataflow languages, nonprocedural languages, program specifications
CITATION
N.S. Prywes, A. Pnueli, "Compilation of Nonprocedural Specifications into Computer Programs", IEEE Transactions on Software Engineering, vol.9, no. 3, pp. 267-279, May 1983, doi:10.1109/TSE.1983.236736
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool