The central part of dictionary type data compression is the process of parsing the input string into phrases that are to be replaced with the corresponding dictionary indexes. In this article, we study the longest fragment first (LFF) parsing strategy for static dictionary compression. We present an on-line algorithm for LFF parsing that requires lookahead of length O(L 2 ), where L is the maximum length of the dictionary entries.
