Principles of Compiler Design

YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

CLICK HERE TO DOWNLOAD

Principles of Compiler Design

Question 21 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
In the rule B $\rightarrow$ B1 or MB2, the nonterminal M is used to remember the start address of

A
B
B
B1
C
Both B1 and B
D
None of the other options
Question 22 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The lexical analyzer takes ..... as input and produces a stream of ..... as output.

A
a) Source program, tokens
B
b) Token, source program
C
c) Either A and B
D
d) None of the mentioned
Question 23 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The most basic circuitry-level computer language is .....

A
C++
B
Java
C
High-Level Language
D
Machine Language
Question 24 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Three address code invloves

A
a) exactly 3 address
B
b) at the most 3 address
C
c) no unary operators
D
d) none of these
Question 25 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
In SLR parsing for the grammar E'...>E , E...> aEbE|bEaE|$\epsilon$, In state 0, for inputs 'a' and 'b'

A
Both will have shift-reduce conflict
B
Only 'a' will have shift-reduce conflict
C
Only 'b' will have shift-reduce conflict
D
Neither of the other option
Question 26 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
..... is considered as a sequence of characters in a token

A
Pattern
B
Token
C
Lexeme
D
DFA
Question 27 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Why were high-level languages developed?

A
Low-level language was too easy
B
They were created by accident
C
Low-level languages are hard to remember and use
D
Computers were getting too advanced
Question 28 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
It is a computer program that links and merges various object files together in order to make an executable file.

A
Assembler
B
Compiler
C
Linker
D
Loader
Question 29 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Difficult to write in (but easier than Machine code)
A
Interpreter
B
Translator
C
Compiler
D
Assembly Langauge
Question 30 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Number of states require to accept string ends with 10.

A
3
B
2
C
1
D
can't be represented.
There are 30 questions to complete.