-
1 context free
Network technologies: CF -
2 context-free
-
3 Context-Free Grammar
Abbreviation: CFGУниверсальный русско-английский словарь > Context-Free Grammar
-
4 context-free language
Information technology: CFLУниверсальный русско-английский словарь > context-free language
-
5 context-free matrix language
Engineering: CFMLУниверсальный русско-английский словарь > context-free matrix language
-
6 context-free grammar
Англо-русский словарь промышленной и научной лексики > context-free grammar
-
7 Quasi Context Free
Computers: QCFУниверсальный русско-английский словарь > Quasi Context Free
-
8 metalinear context free grammar
Англо-русский словарь промышленной и научной лексики > metalinear context free grammar
-
9 nonterminal bounded context-free grammar
Англо-русский словарь промышленной и научной лексики > nonterminal bounded context-free grammar
-
10 reduced context-free grammar
Англо-русский словарь промышленной и научной лексики > reduced context-free grammar
-
11 бесконтекстный
-
12 бесконтекстный
Русско-английский словарь по машиностроению > бесконтекстный
-
13 контекстно-независимый
Русско-английский словарь по вычислительной технике и программированию > контекстно-независимый
-
14 контекстно-свободный
Русско-английский словарь по вычислительной технике и программированию > контекстно-свободный
-
15 контекстно-свободный
-
16 контекстно-независимый
Новый большой русско-английский словарь > контекстно-независимый
-
17 бесконтекстный
-
18 контекстно-свободный
-
19 бесконтекстный
Русско-английский новый политехнический словарь > бесконтекстный
-
20 контекстно-свободный
Русско-английский новый политехнический словарь > контекстно-свободный
См. также в других словарях:
Context free — may refer to: Concepts context free grammar deterministic context free grammar stochastic context free grammar weighted context free grammar context free language Software Context Free, a computer language for context free grammars … Wikipedia
context-free — adjective a) (Of a grammar) which generates sentences in stages, in such a way that at any intermediate stage, any piece of the sentence is enough to determine the corresponding piece at the next stage; that is, the stagewise transformation at a… … Wiktionary
Context-free grammar generation algorithms — are algorithms which generate a context free grammar or grammars from given symbol sequence or sequences.Applications for such algorithms include lossless data compression and data mining. A list of algorithms * Sequitur * Lempel Ziv Welch… … Wikipedia
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
Context-free language — In formal language theory, a context free language is a language generated by some context free grammar. The set of all context free languages is identical to the set of languages accepted by pushdown automata. Contents 1 Examples 2 Closure… … Wikipedia
context-free — adjective Date: 1964 of, relating to, or being a grammar or language based on rules that describe a change in a string without reference to elements outside of the string; also being such a rule … New Collegiate Dictionary
context-free — ˈ ̷ ̷ ˌ ̷ ̷ ¦ ̷ ̷ adjective : of, relating to, or being a grammar or language based on rules that describe a change in a string without reference to elements outside of the string ; also : being such a rule … Useful english dictionary
Pumping lemma for context-free languages — The pumping lemma for context free languages, also known as the Bar Hillel lemma, is a lemma that gives a property that all context free languages have. Its primary use is to prove a language is not context free.The pumping lemma for context free … Wikipedia
Deterministic context-free language — A deterministic context free language is a formal language which is defined by a deterministic context free grammar.[1] The set of deterministic context free languages is called DCFL[2] and is identical to the set of languages accepted by a… … Wikipedia
Deterministic context-free grammar — In formal grammar theory, the deterministic context free grammars (DCFGs) are a proper subset of the context free grammars. The deterministic context free grammars are those a deterministic pushdown automaton can recognize. A DCFG is the finite… … Wikipedia
Stochastic context-free grammar — A stochastic context free grammar (SCFG; also probabilistic context free grammar, PCFG) is a context free grammar in which each production is augmented with a probability. The probability of a derivation (parse) is then the product of the… … Wikipedia