An engineer designs a compiler for a formal language. Which consequence follows if the language requires unbounded lookahead during parsing?

💡 Explanation

Unbounded lookahead in parsing means the compiler must potentially examine an unlimited amount of future input to determine the correct parse tree; this necessitates Turing-complete computation to handle the unbounded search space, because pushdown automata are insufficient. Therefore, a Turing-complete machine is needed, rather than a simpler machine, under this condition.

• A computationally limited sensor transmits encrypted data alongside a zero-knowledge proof to a central server. Which outcome indicates a secure and valid data transmission?
• A cryptographic hash function maps input data to a fixed-size output. If a weak hash function's output length is a prime number, what outcome directly compromises its security?
• An engineer designs a secure communication system. Which outcome occurs when a cryptographic hash function's collision resistance weakens?
• What happens to the computation of unique paths in a grid when a single cell is doubly counted?
• In a transportation planning system, what outcome occurs when cyclical voter preferences violate transitivity?
• In a simulation of the Towers of Hanoi with 'n' disks, what happens to the number of moves required as the simulation hits the base case (n=1)?