GATE 1991
March 17, 2025GATE 1991
March 17, 2025GATE 1991
| Question 29 |
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:
Indicate all the true statements from the following:
| Recursive descent parsing cannot be used for grammar with left recursion. | |
| The intermediate form the representing expressions which is best suited for code optimization is the post fix form. | |
| A programming language not supporting either recursion or pointer type does not need the support of dynamic memory allocation. | |
| Although C does not support call by name parameter passing, the effect can be correctly simulated in C.
| |
| No feature of Pascal violates strong typing in Pascal. | |
| A and D |
Question 29 Explanation:
(A) It is true. Left recursive grammar if used directly in recursive descent parsing causes an infinite loop. So, left recursion must be removed before giving to a recursive descent parser.
(B) False.
(C) It is false. The language can have dynamic data types which required dynamically growing memory when data type size increases.
(D) Is true and using macro we can do this.
(E) Out of syllabus now.
(B) False.
(C) It is false. The language can have dynamic data types which required dynamically growing memory when data type size increases.
(D) Is true and using macro we can do this.
(E) Out of syllabus now.
Correct Answer: F
Question 29 Explanation:
(A) It is true. Left recursive grammar if used directly in recursive descent parsing causes an infinite loop. So, left recursion must be removed before giving to a recursive descent parser.
(B) False.
(C) It is false. The language can have dynamic data types which required dynamically growing memory when data type size increases.
(D) Is true and using macro we can do this.
(E) Out of syllabus now.
(B) False.
(C) It is false. The language can have dynamic data types which required dynamically growing memory when data type size increases.
(D) Is true and using macro we can do this.
(E) Out of syllabus now.