167 resultados para parallelizing compilers
Resumo:
Preface signed by the compilers: Nathan Banks, A. N. Caudell.
Resumo:
Mode of access: Internet.
Resumo:
Words only.
Resumo:
Preface signed: The compilers.
Resumo:
List of compilers. Vol.1-11, Lewis Hertslet. Vol.12-16, Edward Hertslet. Vol.17-19, Edward Hertslet and Cecil Hertslet. Vol.20, Augustus H.Oakes and F.H.T. Streatfield. Vol.21-23, Augustus H. Oakes and Richard W.Brant. Vol.24-25, Richard W.Brant and G.E.P. Hertslet. Vol.26, G.E.P. Hertslet and Edward Parkes. Vol.27, Edward Parkes and W.L. Berrow. Vol.28, C.S. Nicoll and W.L. Berrow and J.W. Field. Vol.29-30, C.S. Nicoll and W.L. Berrow.
Resumo:
Compilers: 190 Editoral staff of the American reporter.--1912- B.O. Hough.
Resumo:
Also issued under Spanish and Portuguese titles.
Resumo:
Preface signed: L.W. Renick, M.D. Fullerton and M.P. Nipgen [compilers]
Resumo:
Compilers and publishers: [1853]-1859, J.P. Campbell.--18 L.P.Williams & co.
Resumo:
"This ... collection ... was formed by Mr. John Jones ... and passed to the Nation upon his death in 1882."--Preface signed: Cecil H. Smith.
Resumo:
Compilers: 1964-1980, V. Haviland (with L. B. Watt, 1964-<1974>)
Resumo:
Compilers: 1892-1907, T. McFarlane; 1908- Ch. Gray.
Resumo:
Compilers: William Farr, 1862, 1872.--William Ogle, 1882.--John Tatham, 1892.
Resumo:
Previous work on formally modelling and analysing program compilation has shown the need for a simple and expressive semantics for assembler level programs. Assembler programs contain unstructured jumps and previous formalisms have modelled these by using continuations, or by embedding the program in an explicit emulator. We propose a simpler approach, which uses techniques from compiler theory in a formal setting. This approach is based on an interpretation of programs as collections of program paths, each of which has a weakest liberal precondition semantics. We then demonstrate, by example, how we can use this formalism to justify the compilation of block-structured high-level language programs into assembler.
Resumo:
Since the advent of High Level Programming languages (HLPLs) in the early 1950s researchers have sought ways to automate the construction of HLPL compilers. To this end a variety of Translator Writing Tools (TWTs) have been developed in the last three decades. However, only a very few of these tools have gained significant commercial acceptance. This thesis re-examines traditional compiler construction techniques, along with a number of previous TWTs, and proposes a new improved tool for automated compiler construction called the Aston Compiler Constructor (ACC). This new tool allows the specification of complete compilation systems using a high level compiler oriented specification notation called the Compiler Construction Language (CCL). This specification notation is based on a modern variant of Backus Naur Form (BNF) and an extended variant of Attribute Grammars (AGs). The implementation and processing of the CCL is discussed along with an extensive CCL example. The CCL is shown to have an extensive expressive power, to be convenient in use, and highly readable, and thus a superior alternative to earlier TWTs, and to traditional compiler construction techniques. The execution performance of CCL specifications is evaluated and shown to be acceptable. A number of related areas are also addressed, including tools for the rapid construction of individual compiler components, and tools for the construction of compilation systems for multiprocessor operating systems and hardware. This latter area is expected to become of particular interest in future years due to the anticipated increased use of multiprocessor architectures.