A graphical abstract programming language

Authors:
Miren Begona Albizuri-Romero
Affiliations:
University of Sussex, Falmer, Brighton BN1 9QT, Sussex, England
Venue:
ACM SIGPLAN Notices
Year:
1984

Citing 3
Cited 2

On the criteria to be used in decomposing systems into modules

Communications of the ACM
Computer-drawn flowcharts

Communications of the ACM
A Structured Programming Approach to Data

A Structured Programming Approach to Data

GRASE: a graphical syntax-directed editor for structured programming

ACM SIGPLAN Notices
Internal representation of programs in GRASE

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

The current goals of programming are acheived through modularity and abstraction. Structured programs, which embody these two methodologies, have a natural representation through a graphical abstract programming language (GAL) which has been devised for this purpose. GAL represents language structures instead of strings of characters. The Graphical Abstract Language attempts to be closer to languages amenable to structured programming and design. Each template represents a structure and a program is constructed by the union of structures, and each of these is a structure of arbitrary complexity. The process template is the minimum, indivisible unit. As a result of the recursive nesting of structures the final product, i.e. a program, is a hierarchical structure.