A vector encoding technique applicable to tabular parsing methods

  • Authors:

  • Ralph D. Jeffords;David B. Benson

  • Affiliations:

  • University of Mississippi;Washington State University

  • Venue:
  • ACM-SE 15 Proceedings of the 15th annual Southeast regional conference
  • Year:
  • 1977

Quantified Score

Hi-index 0.00

Visualization

Abstract

Practical table-driven parsers require substantial storage for the tables, so that ordinarily the tables are packed several entries per word. However, access to the individual bits of a word is a time-consuming unpacking procedure on many computers. The paper gives a general method for encoding tables so that no unpacking is required. The method is exemplified by the encoding of precedence tables for precedence parsers and the encoding of parsing action tables for LR(k) parsers. The storage required for this encoding is slightly larger than the storage required for the usual packed representation. The technique is applicable to the representation of any fixed table over a small value set.