Many tools designed to help programmers view and manipulate source code exploit the formal structure of the programming language. Language-based tools use information derived via linguistic analysis to offer services that are impractical for purely text-based tools. In order to be effective, however, language-based tools must be designed to account properly for the documentary structure of source code: a structure that is largely orthogonal to the linguistic but no less important. Documentary structure includes, in addition to the language text, all extra-lingual information added by programmers for the sole purpose of aiding the human reader: comments, white space, and choice of names. Largely ignored in the research literature, documentary structure occupies a central role in the practice of programming. An examination of the documentary structure of programs leads to a better understanding of requirements for tool architectures.

Introduction During the translation of programs written in other languages into Ada, it becomes necessary to translate foreign identifiers into Ada identifiers. For a small program, an ad hoc approach will work, but for larger programs some automatic method must be used, or else the translator will run the risk of inadvertent name collisions. An automatic method has the additional advantage that the translator need no longer be imaginative, and translation productivity will therefore be enhanced. If the translation into Ada is being performed by an automatic tool, it is essential that its algorithm for identifier translations produce names which do not collide with each other, with Ada reserved words, or with usual Ada names. Although there have been several papers about translators of other languages into Ada [Albrecht80] [Wallis85] [Kaelbling86a,b], there has been little discussion of the particular problem of identifier translation. One must presume that t

this paper is to illustrate this general understanding of high-level language conversion using an account of the design and implementation of one particular converter as an example. The converter in question performs conversion from Pascal-SC (an augmented version of Pascal supporting Karlsruhe arithmetic, the accurate scientific computation of Kulisch 2 ) to Ada; it was produced as a contribution to Esprit Project 1072 DIAMOND (Development and Integration of Accurate Mathematical Operations for Numerical Data Processing), in which the * Present address: Computer Sciences Company Ltd, Defence Systems Division, Computer Sciences House, Brunei Way, Slough, Berks SL1 lXL, U.K

Parallel programming is known to be notoriously difficult! Be it hardware or compiler limitations that dictate what a parallel programming language supports or the fact that different applications benefit from different types of parallelism, no programming paradigm has emerged a clear winner in the parallel arena. In this work we start building a bridge between two programming approaches, XMTC and Cilk, by providing an efficient source-to-source translation from XMTC to Cilk. 1

The paper considers the problems and the solutions that are concerned with the extension of Java with Higher Order (HO) mechanisms. These mechanisms are typical of functional languages and include higher order abstraction, that makes a Java method parametric with respect to other methods that can be passed as parameters, and code as first class value, that can be assigned to variables, passed as parameter, returned by method invocations,