z-logo
Premium
Hashing as a compaction technique for parser tables
Author(s) -
Horspool R. N.,
Cormack G. V.
Publication year - 1987
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380170606
Subject(s) - computer science , table (database) , hash table , parsing , compiler , compaction , hash function , linear hashing , programming language , database , perfect hash function , geology , geotechnical engineering
Authors of papers on LR parser table compaction and authors of books on compiler construction appear to have either overlooked or discounted the possibility of using hashing. In fact, hashing is easy to implement as a compaction technique and gives reasonable performance. It produces tables that are as compact as some of the other techniques reported in the literature while permitting efficient table lookups.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here