retagged by
425 views
4 votes
4 votes

Consider the following statements :

$S1$:  Automatic garbage collection is not essential to implement recursion.

$S2$:  Operator precedence parser falls under the category of top down parsers.

$S3$:  To evaluate a postfix expression, an operator stack is required.

 

Which of the above statements are NOT true ?

  1. $S1$ & $S3$
  2. $S1$ & $S2$
  3. $S2$ & $S3$
  4. $S1$ & $S4$
retagged by

1 Answer

Best answer
4 votes
4 votes
Operator precedence parser falls under the category of top-down parsers. This is false because it comes under the category of the Bottom up Parsers.

To evaluate a postfix expression, an operator stack is required; this is also false, Only operand stack is required, no other data structure.

It is not necessary to have automatic garbage collection to implement recursion. This is true.

Garbage Collection $(GC)$ is a mechanism that provides automatic memory reclamation for unused memory blocks.

option $C$
edited by
Answer:

Related questions

5 votes
5 votes
1 answer
4
Bikram asked May 14, 2017
559 views
Consider the $C$ program given below:#include <stdio.h main () { printf("This is GO mock exam\n" ); }The total number of tokens generated when this program is passed to l...