An Algebraic Approach To Compiler Design
Augusto Sampaio
Apr 1997 · Amast Series In Computing Buku 4 · World Scientific
e-Buku
204
Halaman
family_home
Layak
info
reportRating dan ulasan tidak disahkan Ketahui Lebih Lanjut
Perihal e-buku ini
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.
Berikan rating untuk e-Buku ini
Beritahu kami pendapat anda.
Maklumat pembacaan
Telefon pintar dan tablet
Pasang apl Google Play Books untuk Android dan iPad/iPhone. Apl ini menyegerak secara automatik dengan akaun anda dan membenarkan anda membaca di dalam atau luar talian, walau di mana jua anda berada.
Komputer riba dan komputer
Anda boleh mendengar buku audio yang dibeli di Google Play menggunakan penyemak imbas web komputer anda.
eReader dan peranti lain
Untuk membaca pada peranti e-dakwat seperti Kobo eReaders, anda perlu memuat turun fail dan memindahkan fail itu ke peranti anda. Sila ikut arahan Pusat Bantuan yang terperinci untuk memindahkan fail ke e-Pembaca yang disokong.
