In: Computer Science
Anwser questions :
1. Complexity of instruction selection depends upon
Select one:
a. Level of the IR
b. Desired quality of the generated code
c. Nature of the ISA
d. All of them
2.
Which is NOT part of a language runtime system?
Select one:
a. process scheduling
b. Multi-threading support
c. Exception handling
d. Memory allocation
3. What is the grammar G for the following language?
L (G) = { 0n 1n | n>=1 }
1. Answer--- option D
Complexity of instruction selection depends upon, Level of the IR , Desired quality of the generated code , Nature of the ISA.
Explanation-----------
These all factors are depends upon, complexity of instruction selection.
2. Answer----- option A
process scheduling.
Explanation------------------
so, Process scheduling is not the part of process scheduling. so, answer is option A.
Q.3 Answer---
the language L (G) = { 0n 1n | n>=1 }. here both the 0 and 1 accept grammer upto n.
now consider, n=0 then our grammer is 0^1 and 1^1= 01
if n=2 then we get 0011.
so, grammer L(G) = {01,0011,000111,00001111.......................}.
If you have any problem concern with this, then please feel free to ask in comment section. I will always there for you in any time. and dont forget to hit the like button. Thumbs up guys...