In this paper, we propose a determinization method of inverted grammar programs by means of context-free expressions (CFEs, for short) which are straightforward extensions (so-called μ-regular expressions) of regular expressions to context-free languages. Grammar programs are context-free grammars that an inversion method proposed by Glück and Kawabe uses as intermediate results. We use deterministic conditional term rewrite systems (DCTRSs, for short) as source and target programs, and our method aims at transforming a given DCTRS into a non-overlapping DCTRS that is computationally equivalent to the given one. To this end, we first translate a grammar program into an equivalent context-free expression. Then, by using some equalities of expressions, we transform the expression to a desired form. Finally, we translate the resulting expression back into an equivalent grammar program that can be translated back into a non-overlapping DCTRS.

在本文中，我们提出了一种上下文无关表达式（简称CFE）的确定方法，该上下文无关表达式是直截了当的扩展（所谓的μ-正则表达式））正则表达式转换为上下文无关的语言。语法程序是与上下文无关的语法，Glück和Kawabe提出的反演方法将其用作中间结果。我们使用确定性条件术语重写系统（简称DCTRS）作为源程序和目标程序，我们的方法旨在将给定的DCTRS转换为与给定的DCTRS在计算上等效的非重叠DCTRS。为此，我们首先将语法程序转换为等效的上下文无关表达式。然后，通过使用表达式的一些相等性，我们将表达式转换为所需的形式。最后，我们将结果表达式转换回等效的语法程序，该程序可以转换回不重叠的DCTRS。