Discussion
Match each grammar defect with the transformation that addresses it.
List I
A. left recursion
B. common prefix in alternatives
C. two parse trees for one sentence
D. nonterminal deriving no terminal string
List II
1. rewriting to remove ambiguity
2. recursion elimination
3. removal of useless symbols
4. left factoring
Answer: D
Each defect blocks a different aspect of parsing. Recognising which transformation applies is the routine first step in preparing any grammar for a parser generator. Most generators report the defect precisely enough to identify the offending rule.
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