Discussion
Assertion (A): A compiler for a statically scoped language can resolve every name at compile time.
Reason (R): Visibility depends only on the nesting of blocks in the program text, which the compiler can see in full.
Answer: C
Both are true and the reason gives the mechanism, and it explains why static scoping is universal. A dynamically scoped language would have to search a chain of bindings at run time, costing both speed and predictability.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development