context-free

With F rule and FP rule the languages accepted are exactly the context-free languages, while with B rule and FP rule, context-free languages is included as a proper subset.

使用F规则和FP规则时，接受的语言恰好是上下文无关语言.使用口规则和FP规则时，接受的语言包含上下文无关语言为其真子集。

Expanded Algorithms of Parallel Context-free Recognition and Parsing on a PRAM Model

基于PRAM模型的CFGs并行识别与语法分析的扩充算法

Recursive functions on context-free languages ( CFRF) are a kind of new recursive functions proposed especially for describing non-numerical algorithms used on computers.

上下文无关语言上递归函数（recursive functions on context-free languages，简称CFRF）是为描述计算机上用的非数值算法而提出的一种新型递归函数。