Discussion
Programming language syntax needs a context free grammar rather than a regular expression because
Answer: B
Balanced parentheses and nested blocks demand counting to an unbounded depth. A finite automaton has no such memory, whereas the stack of a pushdown automaton supplies exactly that. This is the single clearest reason the two phases use different formalisms.
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