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

Discussion

A symbol table for a language with very long identifiers usually

  • A.refuses to compile programs containing long names
  • B.stores each name in full within every entry that mentions it
  • C.stores the names in a separate string area and points into it
  • D.truncates every name to a fixed number of characters

Answer: C

Correct answer: stores the names in a separate string area and points into it

A fixed-size name field must be large enough for the longest identifier, which wastes space in every entry. Keeping the characters in a contiguous string area and holding an offset and a length in the entry makes the entries uniform and small while placing no limit on name length.

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

Post your comment

Please log in or register to post a comment.