Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing
{{output}}
Grammar compression is, next to Lempel-Ziv (LZ77) and run-length Burrows-Wheeler transform (RLBWT), one of the most flexible approaches to representing and processing highly compressible strings. The main idea is to represent a text as a context-free grammar w... ...