Keyword Recognition and Symbol Table Quiz

What is the main purpose of a symbol table in a compiler?

• To generate intermediate code

• To store the source code

• To perform keyword recognition

• To associate identifiers with their attributes

Which of the following is NOT a method for efficient keyword recognition?

• Storing keywords in length order

• Using a perfect hashing function

• Using a linear search on all keywords

• Using a binary search on an alphabetically ordered table

What is a characteristic of a perfect hashing function?

• It results in a unique value for each keyword

• It is complex and time-consuming to compute

• It requires a large amount of memory

• It allows for multiple entries for the same keyword

Which data structure is simplest to implement for a symbol table?

• Hash table

• Binary search tree

• Linear list

• AVL tree

What happens when a new name is added to a linear list symbol table?

• It is added at the beginning of the list

• It is added at the end of the list

• It replaces the first entry

• It is added randomly

In a hash table, what does the hash function do?

• It checks for duplicate entries

• It sorts the entries alphabetically

• It maps strings to integer values

• It deletes entries from the table

What is the main drawback of using a linear list for a symbol table?

• It cannot handle dynamic entries

• It requires a lot of memory

• It has poor performance with large n and e

• It is difficult to implement

How can scope issues be handled in a symbol table?

• By using a single global symbol table

• By avoiding the use of nested blocks

• By stacking values in the same symbol table

• By using only linear lists

What is a characteristic of scoped symbol tables?

• They are always implemented as hash tables

• They do not allow dynamic growth

• They can have multiple scopes

• They only allow global variables

What is the primary advantage of using a binary search tree over a linear list for a symbol table?

• Less memory usage

• Faster search times

• Ease of implementation

• Ability to store duplicate entries