MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Accounting Database

Consider the ...

Question

Consider the following statements:
I. Symbol table is accessed only during lexical analysis and syntax analysis.
II. Compilers for programming languages that support recursion necessarily need heap storage for memory allocation in the run-time environment.
III. Errors violating the condition 'any variable must be declared before its use' are detected during syntax analysis.

Whch of the above statements is/are TRUR?

A

None of I, II and III

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

I and III only

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

I only

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

I only

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A None of I, II and III
None of the given statements are correct.

Suggest Corrections

thumbs-up

0

Similar questions

Q. Consider the following statements :
1. Three address code is a linearized representation of syntax tree.
2. Type checking is done during all the phases especially in syntax analysis phase.
3. Target code generation phase is machine independent code generation.
4. Symbol table is accessed during lexical, syntax and semantic analysis phase.
The number of the correct statements is /are ______.

Q. In compilers, the syntax analysis is done by

Q. Consider the following statements :

S_{1}

: While program in execution, access to heap memory is slower as compared to accessing variables allocated on stack.

S_{2}

: While program in execution, in a multithread situation, each thread has its own stack and share a common heap memory.

S_{3}

: During a program execution, heap is stored in main memory and stack is present in secondary memory.
Which of the above is incorrect ?

Q. Syntax analysis is

Q. Which of the following statements are CORRECT?

(1) Static allocation of all data areas by a compiler makes it impossible to implement recursion

(2) Automatic garbage collection is essential to implement recursion.

(3) Dynamic allocation of activation record is essential to implement recursion

(4) Both heap and stack are essential to implement recursion.

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Database Structuring

ACCOUNTANCY

Watch in App

explore_more_icon

Explore more

Accounting Database

Standard XI Accountancy

Join BYJU'S Learning Program

CrossIcon