Question: If possible can you explain how this is solved 11. Suppose that you are writing an assembler for a machine that has only program-counter relative

If possible can you explain how this is solved

If possible can you explain how this is solved 11. Suppose that

11. Suppose that you are writing an assembler for a machine that has only program-counter relative addressing. (That is, there are no di- rect-addressing instruction formats and no base relative addressing.) Suppose that you wish to assemble an instruction whose operand is an absolute address in memory--for example, LDA 100 to load register A from address (hexadecimal) 100 in memory. How might such an instruction be assembled in a relocatable program? What relocation operations would be required? 11. Suppose that you are writing an assembler for a machine that has only program-counter relative addressing. (That is, there are no di- rect-addressing instruction formats and no base relative addressing.) Suppose that you wish to assemble an instruction whose operand is an absolute address in memory--for example, LDA 100 to load register A from address (hexadecimal) 100 in memory. How might such an instruction be assembled in a relocatable program? What relocation operations would be required

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!