YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS
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
B | |
B1 | |
Both B1 and B | |
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) Source program, tokens | |
b) Token, source program | |
c) Either A and B | |
d) None of the mentioned |
Question 23 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
The most basic circuitry-level computer language is .....
C++ | |
Java | |
High-Level Language | |
Machine Language |
Question 24 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Three address code invloves
a) exactly 3 address | |
b) at the most 3 address | |
c) no unary operators | |
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'
Both will have shift-reduce conflict | |
Only 'a' will have shift-reduce conflict | |
Only 'b' will have shift-reduce conflict | |
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
Pattern | |
Token | |
Lexeme | |
DFA |
Question 27 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Why were high-level languages developed?
Low-level language was too easy | |
They were created by accident | |
Low-level languages are hard to remember and use | |
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.
Assembler | |
Compiler | |
Linker | |
Loader |
Question 29 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Difficult to write in (but easier than Machine code)
Interpreter | |
Translator | |
Compiler | |
Assembly Langauge |
Question 30 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Number of states require to accept string ends with 10.
3 | |
2 | |
1 | |
can't be represented. |
There are 30 questions to complete.