Straight-line programs: A practical test (extended abstract)

We present two algorithms that construct a context-free grammar for a given text. The first one is an improvement of Rytter's algorithm that constructs grammars using AVL trees. The second one follows a new approach and constructs grammars using Cartesian trees. Also we compare both algorithms and Rytter's algorithm on various data sets and provide a comparative analysis of the compression ratio achieved by these algorithms and by the LZ77 and LZW algorithms. Bibliography: 15 titles. © 2013 Springer Science+Business Media New York