Solution

The correct answer is A - III, B - I, C - IV, D - II

Key Points

• A. Back Tracking
  • Back Tracking is a method used in solving constraint satisfaction problems, puzzles, and other recursive algorithmic scenarios.
  • Correct match: III. Predictive Parser
• B. Infinite languages with matching numbers
  • This pertains to languages that can have an infinite number of strings, often dealt with in automata theory.
  • Correct match: I. Automata
• C. Canonical LR Parser
  • A Canonical LR parser is an efficient bottom-up parser that can handle large and complex grammars but generates a large number of states in its parsing table.
  • Correct match: IV. Large number of states
• D. Post Correspondence Problem
  • The Post Correspondence Problem is a well-known undecidable problem in computer science.
  • Correct match: II. Undecidable Problem

Therefore, the correct answer is: A - III, B - I, C - IV, D - II