Discussion
State whether the following is true or false.
Left factoring and left recursion elimination together guarantee that a grammar becomes LL(1).
Answer: A
Correct answer: False
The two transformations remove two specific obstacles, but a grammar can fail the LL(1) conditions for other reasons - overlapping FIRST sets that no factoring reveals, or an inherent ambiguity. Some languages have no LL(1) grammar at all, so no sequence of transformations could produce one.
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