Two-level grammars as a technique for formalizing programming schemes

Authors:
M. Saacks;J. Hassell
Affiliations:
Computer Science Department, Tulane University, New Orleans, LA;Computer Science Department, Tulane University, New Orleans, LA
Venue:
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Year:
1989

Citing 4
Cited 0

Fundamentals of data structures in PASCAL

Fundamentals of data structures in PASCAL
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Fundamentals of Computer Alori

Fundamentals of Computer Alori
Report on the algorithmic language ALGOL 68

Report on the algorithmic language ALGOL 68

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the issue of formalizing programming schemes (or programming plans). Research in problem solving and in programming has shown a hierarchical organization of program solutions. This organization suggests that a hierarchical formal definition can be used to eliminate the ambiguity inherent in previous natural language definitions. This paper uses the hierarchy implicit in two-level grammars to define programming schemes. It gives examples to illustrate how the definition can be used for a particular scheme.