Choosing a tag‐list algorithm for a compiler with special application to the ALEPH compiler
Dick Grune · Software Practice and Experience · 1979
Abstract Requirements are formulated for a tag‐list algorithm, i.e. the algorithm used in a compiler for handling the symbol table or identifier list. Starting from a very general tag‐list algorithm, 18 practical versions are developed and their merits judged. Although the final choice (binary search in a diluted table) depends on the details of the application, the main part of this article is not devoted to that final choice itself but rather to ways of reaching it.