Year: 1984
Type: article
Abstract: Six methods for parser table compression are compared.The investigations are focused on four methods that allow the access of table entries with a constant number of index operations.The advantage of these methods is that the access to the compressed tables can be programmed efficiently in portable high-level languages like Pascal or FORTRAN.The results are related to two simple methods based on list searching.Experimental results on eleven different grammars show that, on the average, a method based on graph coloring turns out best.
DOI: 10.1145/1780.1802
Authors: Peter Dencker, Karl Dürre, Johannes Heuft
Institution: Karlsruhe Institute of Technology
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1989482425
