Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-01T15:03:17.350Z Has data issue: false hasContentIssue false

5 - Building an assembler for VeSPA

Published online by Cambridge University Press:  31 October 2009

David J. Lilja
Affiliation:
University of Minnesota
Sachin S. Sapatnekar
Affiliation:
University of Minnesota
Get access

Summary

In order to translate a sentence from English into French two things are necessary. First, we must understand thoroughly the English sentence. Second, we must be familiar with the forms of expression peculiar to the French language.

George Polya, How to Solve It, Princeton University Press, 1945.

Why assembly language?

The instructions that are actually executed by a processor are stored in memory as a sequence of binary numbers. When these numbers are fetched by the processor, they are executed by interpreting this machine language according to the steps specified in the instruction set architecture (ISA). It is possible to write programs directly in the binary 1s and 0s of a processor's machine language. However, it would be extremely tedious and error-prone since humans think in terms of symbols and higher-level languages. Consequently, we assign symbolic names to each of the instructions in the ISA, and to each of the registers and other memory elements that are accessible to a programmer. We then define a syntax which precisely describes how the various symbols can be composed into a complete program. These symbolic names and syntax define a complete programming language which is called an assembly language.

An assembler is a program that accepts as input a text file consisting of a sequence of alphanumeric characters that comprise a program written in a processor's assembly language. The output of the assembler is a machine language representation of the assembly language program that can be directly executed by the processor. The original textual format of the program is called the source code. The executable machine language is called the object code.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×