上下文无关语言 meaning in Chinese

cfl context free language
context-free speech
kontextfreie sprache context-free language

Moreover , we present an intermediate representation for parsing tree of cfl sentence that can be easily implemented and needs less space occupancy
此外，为上下文无关语言句子的分析树设计了一种简单表示形式，这种表示形式可以提高空间效率，并且易于实现。
Lfc is yet another functional programming language which has many characteristics , such as good mathematics basis , reference transparency , no side effect , pattern matching , etc . in theory , an algorithm of enumerating sentences of cfg is presented
本文工作主要是研究形式规约语言lfc的实现和应用，另外还包括一个上下文无关语言句子枚举算法。在理论方面，提出了一个上下文无关语言句子枚举算法。
First , the minimal and maximal sentences of cfg are calculated . then the character strings are scanned one by one from the minimal sentence in certain order till the maximal sentence . the scanned character strings are printed or skipped according to a rule
该枚举算法首先计算上下文无关语言的最小序句子和最大序句子，然后从最小序句子开始按照一定的顺序扫描字符串，直至扫描到最大序句子为止，对被扫描的字符串进行判断取舍。