Discussion
Assertion (A): LL(k) parsers for k greater than one are rare in practice.
Reason (R): The size of the parsing table grows sharply with the number of lookahead tokens.
Answer: B
Both are true and the reason gives the mechanism, and there is a further consideration. Most language constructs can be brought within one token of lookahead by modest grammar changes, so the extra machinery earns little.
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