Developing a standard schema at the abstract syntax tree level for C/C++ to be used by reverse engineering and reengineering tools is a complex and difficult problem. In this paper, we present a catalogue of issues that need to be considered in order to design a solution. Three categories of issues are discussed. Lexical structure is the first category and pertains to characteristics of the sou...

A limitation in the design of the interface of C++ standard priority queues is addressed. The use of priority queues in Dijkstra’s shortest path search algorithm is used as an example. Priority queues are often implemented using heaps. There is a problem, as it may be necessary to change the priority of an element while it is in the queue, but finding the element from within a heap is costly. T...

The Lambda Library (LL) adds a form of lambda functions to C++, which are common in functional programming languages. The LL is implemented as a template library using standard C++; thus no language extensions or preprocessing is required. The LL consists of a rich set of tools for defining unnamed functions. Particularly, these unnamed functions work seamlessly with the generic algorithms in t...

The Lambda Library (LL) adds a form of lambda abstraction to C++. The LL is implemented as a template library using standard C++; thus no language extensions or preprocessing is required. The LL consists of a rich set of tools for defining unnamed functions. Particularly, these unnamed functions work seamlessly with the STL algorithms. The LL offers significant improvements, in terms of general...

IV Proposed Text for the Standard 7 26.6 Interval numbers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 26.6.1 Header synopsis . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 26.6.2 interval class template . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 26.6.3 interval numeric specializations . . . . . . . . . . . . . . . . ...

According to a folk theorem, every program can be transformed into a program that produces the same output and only has one loop. We generalize this to a form where the resulting program has one loop and no other branches than the one associated with the loop control. For this branch, branch prediction is easy even for a static branch predictor. If the original program is of length κ, measured ...

In 2003, the C++ committee accepted for TR-1 a proposal [Bro03a] to substantially enhance the mathematical facilities of the standard C++ library. Several discussions on the committee mail reflector and several follow-up documents [Pla03, Bro03b, Bro03c, Pla04] further addressed this issue. While the substantive content of the proposal has not been changed, nor have substantive changes been pro...

This paper presents Sglib, a C library freely inspired by the Standard Template Library (STL). In opposition to C++, the C language lacks any support for generic programming. Our library results from the idea to create a generic library of reusable algorithms through the C preprocessor.