SLAW (abstract only): a language free environment—future directions and research

  • Authors:
  • Michael V. Doran;Steven W. Sheasby;Victor J. Law

  • Affiliations:
  • Tulane University, Department of Computer Science;Tulane University, Department of Computer Science;Tulane University, Department of Computer Science

  • Venue:
  • CSC '87 Proceedings of the 15th annual conference on Computer Science
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

SLAW is a language free environment based on structure chart techniques presented in the Tulane University Department of Computer Science introductory classes [LAW83] [LAW86]. SLAW is currently in its third generation. The first two generations were implemented on a DECSYSTEM-2060 and a VAX 11/780, respectively, by Cook [C0083]. The current implementation, which is the most advanced, is written for the IBM-PC in Turbo Pascal [DOR86a] [DOR86b].A structure chart can be translated into different programming languages due in part to the dictionary of variables [DOR85]. Because SLAW is a language free environment, variable types are not easily discernible. With the dictionary of variables, it becomes easier to declare variables correctly in the target translation language and to allow for code generation. Currently, the SLAW environment allows for translation into PASCAL, FORTRAN, and BASIC.A structure chart is represented as a forest of trees. The main program is one such tree. Subroutines and functions are the siblings of the main program, themselves forming trees. Since they have a dictionary of variables, including variables passed as parameters, subroutines and functions are as easily codable as the main program. This representation also allows for recursion. In the main program, subroutines and functions are called by a certain type of node: the CALL box.