Let a text $T[1..n]$ be the only string generated by a context-free grammar with g (terminal and nonterminal) symbols, and of size G (measured as the sum of the lengths of the right-hand sides of the rules). Such a grammar, called a grammar-compressed representation of T, can be encoded using $G\lg G$ bits. We introduce the first grammar-compressed index that uses $O(G\lg n)$ bits (precisely, $G\lg n+(2+ϵ)G\lg g$ for any constant $ϵ>0$) and can find the occ occurrences of patterns $P[1..m]$ in time $O((m^2+occ)\lg G)$. We implement the index and demonstrate its practicality in comparison with the state of the art, on highly repetitive text collections.

让文字 $Ť[\mathrm{1个}。。ñ]$是由上下文无关的语法生成的唯一字符串，具有g（终止符和非终止符）符号，且大小为G（以规则右手边的长度之和来衡量）。这种语法，称为T的语法压缩表示形式，可以使用$G\lg G$位。我们引入第一语法压缩指数使用$Ø（G\lg ñ）$ 位（准确地说， $G\lg ñ+（2+ϵ）G\lg G$ 对于任何常数 $ϵ>0$）并可以找到模式的occ出现$P[\mathrm{1个}。。米]$ 及时 $Ø（（{米}^2+ØCC）\lg G）$。我们对高度重复的文本集实施索引，并与现有技术进行比较证明其实用性。