Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Algebraic Approach To Compiler Design, An, PDF eBook

Algebraic Approach To Compiler Design, An PDF

Part of the Amast Series In Computing series

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

This book investigates the design of compilers for procedural languages, based on the algebraic laws which these languages satisfy.

The particular strategy adopted is to reduce an arbitrary source program to a general normal form, capable of representing an arbitrary target machine.

This is achieved by a series of normal form reduction theorems which are proved algebraically from the more basic laws.

The normal form and the related reduction theorems can then be instantiated to design compilers for distinct target machines.

This constitutes the main novelty of the author's approach to compilation, together with the fact that the entire process is formalised within a single and uniform semantic framework of a procedural language and its algberaic laws.

Furthermore, by mechanising the approach using the OBJ3 term rewriting system it is shown that a prototype compiler is developed as a byproduct of its own proof of correctness.

Information

Information