Machine-translated by Google. Questions are authored in English.
Top

Discussion

A chained symbol table implementation searches

  • A.only the table for the block in which the use appears
  • B.the innermost table first and then each enclosing table in turn
  • C.every table in the program simultaneously and merges the results
  • D.the outermost table first and then works inward toward the use

Answer: B

Following the chain outward realises the most closely nested rule directly. A failed lookup at every level means the name is undeclared and an error is reported. A placeholder entry is then usually installed to suppress repeated messages.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.