连接文法在并行环境下的语法分析和识别

A Recognition and Parsing Algorithm for Conjunctive Grammars Under Parallel Environment

连接文法是上下文无关文法的扩展,是在形式规则中加入集合的交运算.连接文法比上下文无关文法具有更强的生成能力.通过对连接文法深入的分析,提出了一种在并行环境下的语法分析和识别算法,算法事实是以上下文无关文法并行识别算法为基础提出的.最后以实例详细描述了算法并行处理过程并验证其算法的可行性.

Conjunctive grammars are an explicit set intersection operation added to the greater generative power than the context-free extension of the context-free grammars with an formalism of rules. Coniunctive grammars have grammars. This family of grammars is deeply analyzed and a Recognition and Parsing algorithm under parallel environment is presented,which is based on the algorithm of parallel context-free recognition and parsing. The algorithm is described in detail with an example and its feasibility is verified finally.