Further Reading
If the concepts we discussed in this chapter are not familiar to you, consider refreshing your knowledge of C [KR88]. Theoretical arguments regarding the implementation of recursive data structures without the explicit use of pointers are advanced in Hoare [Hoa73]. The use of pointers in C is concisely presented in Sethi and Stone [SS96], while a number of pitfalls regarding the use of pointers are discussed in Koenig[Koe88, pp. 27�46]. One reference [CWZ90] contains an analysis of pointers and structures. There are a number of interesting articles regarding the manipulation of pointer-based data structures and exploitation of pointer properties [FH82, Suz82, LH86]. A description of how virtual functions are typically realized in C++ implementations (and, as we described, also in C programs) can be found in Ellis and Stroustrup [ES90, pp. 217�237]. Algorithms behind dynamic storage allocation are discussed in Knuth [Knu97, pp. 435�452] and their practical implications in two other sources [Bru82, DDZ94]. The concept of reference-counted garbage collection is discussed in Christopher [Chr84], while the implementation of a conservative garbage collector is outlined in Boehm [Boe88].
|
No comments:
Post a Comment