Journal Article10.1002/SPE.4380100105
Debugging methods in recursive structured FORTRAN
Makoto Arisawa,Minoru Iuchi +1 more
3
TL;DR: It is claimed that execution profiles are strong debugging aids, and it is demonstrated how to debug a STAR program at source language level with the clue in the profiles plus assertion statements.
read more
Abstract: A version of structured FORTRAN named STAR is introduced. STAR allows recursive subroutines. Implementation problems such as parameter passing by value and local variable stacking are discussed. The major difficulty in the preprocessor approach is debugging. We claim that execution profiles are strong debugging aids, and demonstrate how to debug a STAR program at source language level with the clue in the profiles plus assertion statements. We make use of a quicksort program as an example.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Bibliography of Publications about the Fortran Programming Language: Part 1: 1956{1980
Nelson H. F. Beebe
- 01 Jan 2015
TL;DR: In this paper, the authors proposed a method to solve the problem: see [Cas89a] and http://www.s/0098-3500/116814.html
A poor man's realization of recursive structured Fortran
TL;DR: A simple method for converting Recursive Structured Fortran Programs into Fortran programs is presented, which deals with recursion simultaneously with "structuring" of Fortran.
1
References
Structured Programming with go to Statements
TL;DR: For serious students of structured programming, and also for language designers, Knuth's "Structured Programming with go to Statements" is probably the paper to read.
•Book
Structured programming with go to statements
Donald E. Knuth
- 01 Jan 1979
TL;DR: For instance, Knuth's "Structured Programming with Go-To Statements" as discussed by the authors is probably the most complete description of structured programming of all the selections in this book, and it can be used as a good starting point for a discussion of the role of gotos in structured programming.
631
Notes on recursion elimination
TL;DR: Recursion removal procedures with this general form arise in connection with tree traversal and sorting algorithms, and the solutions are compared on the basis of their running time.
34
A compatible "structured" extension to Fortran
TL;DR: The new c0nvert5 t0 th15 d15c1p11ne und0u6ted1y 1nc1ude a 1ar9e num6er 0f per50n5 wh0 have n0 rea1 ch01ce 6ut t0 c0nt1nue the1r day-t0-day pr09ramm1n~ ta5k5 u51n9 the F0rtran 1an~ua~
13
Structured Fortran—An Evolution of Standard Fortran
A. Ralston,J.L. Wagener +1 more
TL;DR: Fortran is 21 years old; many would say that it has not reached adulthood but senility and its evolution through the standards process is very slow, too slow to give any hope that Fortran will ever in this way become a language in which structured programs can be easily and effectively written.
10
Related Papers (5)
Jun Li
- 01 Jan 2010
Eugene Albert,Joan D. Lukas,Guy L. Steele +2 more
- 08 Oct 1990
Xu Li,Laurie Hendren +1 more
- 27 Feb 2014