Accession Number:

ADA043380

Title:

A Family of H-Graph Models for SIMPL-T.

Descriptive Note:

Interim rept.,

Corporate Author:

MARYLAND UNIV COLLEGE PARK DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1977-07-01

Pagination or Media Count:

103.0

Abstract:

This paper illustrates the advantage of modeling in the design of a language. An h-graph model is constructed to reflect the basic version of SIMPL-T. As new features are added to the language, the model is extended accordingly. Several h-graph models are presented. The first describes the basic version of SIMPL-T which recognizes integer as its only data type. The model is then extended to reflect the addition of escape mechanisms to SIMPL-T. The EXIT and ABORT statements have been added, whereas the RETURN statement has been assigned an expanded role. Because modeling provides a rigorous definition of the language, the effects of changes made to the language can be detected in the model. New features can be added without sacrificing the reliability of the original language. The family of h-graphs presented in this paper supports these contentions.

Subject Categories:

  • Computer Programming and Software
  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE