Comparative efficiency of general and residual parsers

  • Authors:
  • Frank G. Pagan

  • Affiliations:
  • California State University, Fullerton, CA

  • Venue:
  • ACM SIGPLAN Notices
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

Some fundamentals of the partial computation concept are concisely reviewed, including its relevance to the relationship between table-driven, general syntactic analyzers and source-language-specific, residual syntactic analyzers. A manual methodology for converting general parsers into generators of residual parsers is explained, using an LL(1) parser as a detailed example. The results of several experiments are reported, comparing the time and space efficiencies of different general parsers with corresponding, automatically generated, residual parsers. The latter parsers are usually several times faster than the former ones.