Discussion
Which of the following applications may use a stack ?
Answer: D
The answer is All of the mentioned.
A parentheses-balancing program pushes each opening bracket and pops on each closing one; the expression is balanced if every pop matches and the stack ends empty. At run time, local variables live in activation records on the call stack, pushed on a function call and popped on return. A compiler's syntax analyser, such as an LR or LL parser, keeps grammar symbols and states on a parsing stack.
Since each of the three uses a stack, choosing any one alone would be incomplete.
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