recategorized by
1,018 views

2 Answers

1 votes
1 votes
D.linker

The linker also takes care of arranging the objects in a program's address space. This may involve relocating code that assumes a specific base address to another base. Since a compiler seldom knows where an object will reside, it often assumes a fixed base location (for example, zero).

Relocating machine code may involve re-targeting of absolute jumps, loads and stores. The executable output by the linker may need another relocation pass when it is finally loaded into memory (just before execution). This pass is usually omitted on hardware offering virtual memory: every program is put into its own address space, so there is no conflict even if all programs load at the same base address. This pass may also be omitted if the executable is a position independent executable.

 

 

https://en.m.wikipedia.org/wiki/Linker_(computing)
0 votes
0 votes
The question is asking about the source or origin of the relocation bits that are used by a relocating loader.

A relocating loader is a program that loads a compiled program or object code into memory for execution. It is responsible for adjusting the memory addresses within the loaded program to reflect the actual memory location where the program is loaded.

The relocation bits indicate the portions of the program that need to be adjusted during the loading process. These bits specify the memory addresses that need to be modified to reflect the correct locations in memory.

inker: A linker is a program that combines multiple object files or modules to create an executable or a library. It resolves references between different modules and performs symbol relocation. The linker can generate the relocation bits based on the information it gathers during the linking process.
Answer:

Related questions

0 votes
0 votes
2 answers
1
admin asked Apr 2, 2020
874 views
Which of the following can be accessed by transfer vector approach of linking?External data segmentsExternal subroutinesData located in other procedureAll of these
1 votes
1 votes
1 answer
2
admin asked Apr 2, 2020
1,688 views
The most powerful parser is$\text{SLR}$$\text{LALR}$Canonical $\text{LR}$Operator-precedence
1 votes
1 votes
1 answer
3
admin asked Apr 2, 2020
1,300 views
$\text{YACC}$ builds up$\text{SLR}$ parsing tableCanonical $\text{LR}$ parsing table$\text{LALR}$ parsing tableNone of these
0 votes
0 votes
6 answers
4
admin asked Apr 2, 2020
6,081 views
Context-free grammar can be recognized by finite state automation$2$- way linear bounded automatapush down automataboth (B) and (C)