Which of the following symbol table implementations is best suited if access time is to be minimum?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. Hash Table
Explanation
A hash table gives near O(1) insertion and lookup, the fastest of these implementations.
More Theory of Computation and Compilers questions
- The sum of minimum and maximum number of final states for a Deterministic Finite Automata (DFA) having ' P ' state is equal to :
- Three address codes can be represented in special structures known as : (A) Quadruples (B) Triples (C) Patterns (D) Indirect Triples
- Which of the statement is/are CORRECT ? (A) Moore and Mealy machines are finite state machines with output capabilities. (B) Any given Moor…
- Match List - I with List - II according to input to the compiler phase that process it :
- Arrange the following phases of a compiler as per their order of execution (start to end) (a) Target code generation (b) Syntax Analysis (c…
- Consider the following finite automata F1 that accepts a language L Let F2 be a finite automata which is obtained by reversal of F1. Then w…