Which failure mode becomes likely when applying a recursive descent parsing algorithm to a grammar with left recursion in a computational linguistics system?

💡 Explanation

Left recursion can cause a recursive descent parser to infinitely call the same rule, because the parser will attempt to expand the leftmost non-terminal without consuming any input. Therefore, an infinite loop is a likely failure mode, rather than stack overflow due to excessive backtracking, which can occur with other parsing strategies.

• Why does real-time machine translation of legal discourse often misinterpret formulaic phrases?
• Why does semantic satiation induce temporary speech errors in repetitive naming tasks?
• Why does a sentiment analysis system relying solely on a single, topically-narrow corpus often yield inaccurate results when applied to general social media data?
• An experimental AI narrative generator produces branching storylines; if a key dependency node fails to execute due to computational overload, which consequence follows?
• Why does a syntax error in a compiler's parsing phase cause cascading errors during code execution?
• An engineer adjusts the noise shaping filter within a digital audio workstation (DAW). Which consequence follows?