This paper concentrates on the primary theme of LAZY EVALUATION CAN DO WORSE THAN GREEDY PARSING. CONSIDER AN LZSS-TYPE SCHEME WHERE OFFSETS ARE… in which you have to explain and evaluate its intricate aspects in detail. In addition to this, this paper has been reviewed and purchased by most of the students hence; it has been rated 4.8 points on the scale of 5 points. Besides, the price of this paper starts from £ 40. For more details and full access to the paper, please refer to the site.
Lazy evaluation can do worse than greedy parsing. Consider an LZSS-type scheme where offsets are represented in 12 bits and lengths are represented in 4 bits with match lengths from 2–17. The use of a control bit means that an (offset,length)-pair requires 17 bits and a literal requires 9 bits. Suppose the current window contains
Show that greedy parsing leads to 34 bits output, while lazy evaluation results in 43 bits.