广义上下文无关文法和它的语法分析

GENERALIZED CONTEXT-FREE GRAMMARS AND THEIR PARSERS

本文介绍了广义上下文无关文法,这种文法允许正则表达式出现在产生式的右部。然后,我们定义了相应的LR(κ)文法。紧接着我们给出了一种分析算法,它是由正规的LR型分析算法扩充而得的。在这个方法中我们强调节省状态,并在此条件下使分析算法尽可能地简单。

In this paper we introduce generalized context-free grammars which allow regular expressions to appear in the right hand side of productions, and define the corresponding LR(k) grammars. Successively, we give a parsing algorithm which is extended from the canonical LR parsers. In this method we emphasize to save states, and make the parsing algorithm as simple as possible.