# UGCNET-Dec2014-II: 33

1.9k views

In a two-pass assembler, symbol table is

1. Generated in first pass
2. Generated in second pass
3. Not generated at all
4. Generated and used only in second pass

recategorized

In first pass it does following things

It allocates space for the literals.

It computes the total length of the program.

It builds the symbol table for the symbols and their values.

Reference : Two-pass assembler

selected
0

## Related questions

1 vote
1
1.3k views
Which of the following is true ? Canonical $LR$ parser is $LR (1)$ parser with single look ahead terminal All $LR(K)$ parsers with $K > 1$ can be transformed into $LR(1)$ parsers. Both $(A)$ and $(B)$ None of the above
Shift-Reduce parsers perform the following : Shift step that advances in the input stream by $K(K > 1)$ symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. Shift step ... . Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.