skip to main content
article

Optimal table lookup for reserved words in Ada

Published:01 April 2006Publication History
Skip Abstract Section

Abstract

Recently a colleague wanted to include a section on perfect hashing functions in the latest edition of a book [4], and after an on-line search brought up a reference of mine [8], he sent me an email asking if I could generate a minimal perfect hashing function (MPHF) for the set of reserved words in Ada 2005. This is a summary of the process that determined one.

References

  1. Brain and Tharp, Near-Perfect Hashing of Large Word Sets, Software Practice and Experience, Volume 19, #10, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Cichelli, Minimal Perfect Hashing Functions Made Simple, Communications of the ACM, Volume 23, #1, 1980. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Czech, Havas, and Majewski, An optimal algorithm for generating minimal perfect hash functions, Information Processing Letters, Volume 43, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Dale and McCormick, Ada 2005 Plus Data Structures: An Object-Oriented Approach, Jones and Bartlett, 2nd edition (not yet released - expected 2006). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Fox, Heath, Chen and Daoud, Practical Minimal Perfect Hash Functions for Large Databases, Communications of the ACM, Volume 35, #1, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Sebesta and Taylor, Fast Identification of Ada and Modula-2 Reserved Words, Journal of Pascal, Ada and Modula-2, March/April 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Trono, An Undergraduate Project to Compute Minimal Perfect Hashing Functions, SIGCSE Bulletin, Volume 24, #3, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Trono, A Comparison of Three Strategies for Computing Minimal Perfect Hashing Functions, SIGPLAN Notices, Volume 27, #11, 1992.Google ScholarGoogle Scholar

Index Terms

  1. Optimal table lookup for reserved words in Ada

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGAda Ada Letters
          ACM SIGAda Ada Letters  Volume XXVI, Issue 1
          April 2006
          48 pages
          ISSN:1094-3641
          DOI:10.1145/1131411
          Issue’s Table of Contents

          Copyright © 2006 Author

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 April 2006

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!