search
Log In
14 votes
1.8k views
Match the pairs in the following questions:$$\begin{array}{ll|ll}\hline (a) & \text{Pointer data type} & (p) & \text{Type conversion} \\\hline  (b) & \text{Activation record} & (q) & \text{Dynamic data structure} \\\hline   (c) & \text{Repeat-until} & (r)  & \text{Recursion} \\\hline (d) & \text{Coercion} & (s)  & \text{ Nondeterministic loop }  \\\hline \end{array}$$
in Compiler Design
edited by
1.8k views
7

Many programming languages support the conversion of a value into another of a different data type. This kind of type conversions can be implicitly or explicitly made. Implicit conversion, which is also called coercion, is automatically done. And the explicit conversion is known as Casting.

4 Answers

22 votes
 
Best answer
$$\begin{array}{|ll|ll|}\hline (a) & \text{Pointer data type} & (q) & \text{Dynamic data structure} \\\hline  (b) & \text{Activation record} & (r) & \text{Recursion} \\\hline   (c) & \text{Repeat-until} & (s)  & \text{Nondeterministic loop} \\\hline (d) & \text{Coercion} & (p)  & \text{Type conversion}  \\\hline \end{array}$$

edited by
1
How repeat until is a non-deterministic loop?
1
Repeat until can be a non deterministic loop if we pass the situation which is not supposed to happen.
1
repeat until {no condition}

Is it just like the one below?
 

while (TRUE) {
 //some statements
}

 

0

In most languages, the word coercion is used to denote an implicit conversion, either during compilation or during run time.

Source: Wiki

0

@Digvijay Pandey

@Radha mohan

pointer is used for dynamic allocation of memory but how it is related to Dynamic data structure.

0

@rohith1001

thanks :)

7 votes
coercion means changing an entity : so Type conversion d-p.

repeat untill - non deterministic loop c-s.

activation record means part of stack  :so recursion.

pointer data type :type conversion
1
how pointer data type :type conversion..???
0
Pointer data type is related to Dynamic data structure, I think that he might typed mistakenly.
1 vote
d-p

b-r

a-q

c-s
0 votes
QRSP

Related questions

9 votes
2 answers
1
1.8k views
State whether the following statements are TRUE or FALSE with reason: The Link-load-and-go loading scheme required less storage space than the link-and-go loading scheme.
asked Nov 24, 2016 in Compiler Design makhdoom ghaya 1.8k views
23 votes
3 answers
2
4.7k views
Match the pairs in the following questions:$\begin{array}{ll|ll} (a) & \text{Lexical analysis} & (p) & \text{DAG's} \\\hline (b) & \text{Code optimization} & (q) & \text{Syntax trees} \\\hline (c) & \text{Code generation} & (r) & \text{Push down automaton} \\\hline (d) & \text{Abelian groups} & (s) & \text{Finite automaton} \\ \end{array}$
asked Nov 19, 2016 in Compiler Design makhdoom ghaya 4.7k views
0 votes
2 answers
3
466 views
What does the following program output? program module (input, output); var a:array [1...5] of integer; i, j: integer; procedure unknown (var b: integer, var c: integer); var i:integer; begin for i := 1 to 5 do a[i] := i; b:= 0; c := 0 for i := 1 to 5 do write (a[i]); writeln(); a[3]:=11; ... (c,b); b := 5; c := 6; end; begin i:=1; j:=3; unknown (a[i], a[j]); for i:=1 to 5 do write (a[i]); end;
asked Nov 25, 2016 in Compiler Design makhdoom ghaya 466 views
11 votes
2 answers
4
971 views
Match the pairs in the following questions:$\begin{array}{|ll|ll|}\hline (a) & \text{Groups} & (p) & \text{Associativity} \\\hline (b) & \text{Semigroups} & (q) & \text{Identity} \\\hline (c) & \text{Monoids} & (r) & \text{Commutativity} \\\hline (d) & \text{Abelian groups} & (s) & \text{Left inverse} \\\hline \end{array}$
asked Nov 19, 2016 in Set Theory & Algebra makhdoom ghaya 971 views
...