article · 2007
Debugging Ada
Bernd Bruegge
Cited by 0Abstract and details only
Abstract
The complexity of the Ada language poses several problems for the builder of a debugger. The Ada language constructs that cause these problems are identified and solutions are proposed that can be incorporated in a debugger based on Pascal. This involves changes in the symbol table of the compiler as well as the introduction of constructs outside the language, based on the argument that having to obey the language rules is an obstacle when debugging programs. In particular, we propose the use of dynamic abstractions to manipulate names from several name spaces that are not necessarily visible at the same time in the Ada program if Ada's scope rules are observed. Several of the proposed solutions have been implemented in an Ada compiler and a debugger called KRAUT as part of of the SPICE project currently being developed at Carnegie-Mellon University. 1. Introduction After the Ada language definition was introduced, it was tempting to "upgrade" existing Pascal compilers and convert th...
Cite this paper
Bruegge, B. (2007). Debugging Ada.
Bruegge, Bernd. “Debugging Ada.” 2007.
Bruegge, Bernd. 2007. “Debugging Ada.”
Bruegge, B. (2007) ‘Debugging Ada’.
@article{bruegge2007debugging,
title = {{Debugging Ada}},
author = {Bruegge, Bernd},
year = {2007}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.