edited by
3,822 views
5 votes
5 votes

In a two-pass assembler, resolution of subroutine calls and inclusion of labels in the symbol table is done during

  1. second pass
  2. first pass and second pass respectively
  3. second pass and first pass respectively
  4. first pass
edited by

4 Answers

4 votes
4 votes
$\underline{\textbf{Answer:}\Rightarrow}\;\mathbf{d.}$

The generation of symbol table in a two-pass assembler happens in the first pass but it requires two pass to scan the entire source file.
edited by
0 votes
0 votes

In a two-pass assembler, pass 2 only generates. Nothing else.

Precisely, the function of pass 2 is to generate the object code, to generate the data for literals, to print listings etc.

 

Rest is done by pass 1. Hence, Option D

0 votes
0 votes

Option C :

The resolution of sub routine is done in second pass and the inclusion of labels in symbol table is done in first pass.

So, option C is the Correct answer. Second pass and first pass respectively.

Answer:

Related questions

3 votes
3 votes
4 answers
1
Satbir asked Jan 13, 2020
8,959 views
A given grammar is called ambiguous iftwo or more productions have the same non-terminal on the left hand sidea derivation tree has more than one associated sentencethere...
3 votes
3 votes
3 answers
2
Satbir asked Jan 13, 2020
5,130 views
The number of tokens in the following C code segment isswitch(inputvalue) { case 1 : b =c*d; break; default : b =b++; break; }$27$$29$$26$$24$
3 votes
3 votes
3 answers
3
Satbir asked Jan 13, 2020
3,781 views
Given the grammar$s \rightarrow T ^{\ast} S\ \mid T$$T \rightarrow U+T\ \mid U$$U \rightarrow a \mid b$Which of the following statements is wrong?Grammar is not ambiguou...
1 votes
1 votes
3 answers
4
Satbir asked Jan 13, 2020
2,296 views
A grammar is defined as$A \rightarrow BC$$B \rightarrow x \mid Bx$$C \rightarrow B \mid D$$D \rightarrow y \mid Ey$$E \rightarrow z$The non terminal alphabet of the gram...