context-free grammar

(redirected from Context free grammar)

context-free grammar

[′kän‚tekst ‚frē ′gram·ər]
(computer science)
A grammar in which any occurrence of a metavariable may be replaced by one of its alternatives.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive ?
The system is mainly based on a BNF context free grammar representing the overall structure of the baseline fuzzy rule learners.
Some results on CFLs can be found in ([2, 3]): A context free language or CFL is a language generated by o context free grammar or accepted by a NPDA.
Computer scientists and engineers who are working on the project discuss such aspects as machine learning approaches for Bangla statistical machine translation, parsing Bangla grammar using context free grammar, the perception of vowels and dental consonants in Bangla speech processing, and the search and study of lexical richness in the Bengali literary collection of Rabindranath Tagore.
NLDBI this system used Probabilistic Context Free Grammar to parse the given queries.
Probabilistic context free grammar (PCFG) inherits most Advantages of CFG, and it is the easiest arithmetical representation to examine natural language.
The second is our approach we used HLQP for temporal data using Probabilistic Context Free Grammar by which it can accesses more than one table as well the Temporal data.
Let us consider the question: "Show the symptoms and medicines for cold", then it will undergo all the analysis one by one and finally comes for Probabilistic Context Free Grammar and returns the following representation
The background knowledge was given in the form of a context free grammar. These analyses resulted in highly accurate equation-based models of the outcrossing, modeled as a function of the distance between the fields, the wind influence, time lag and the area of the fields.
Moore and Crutchfield [24] defined quantum version of pushdown automata and regular and context free grammars. He showed that the corresponding languages generated by quantum grammars and recognized by quantum automata have satisfactory properties in analogy to their classical counterparts.
LR(k)-parsers can be constructed to recognize virtually all programming-language constructs for which context free grammars can be written (Aho et al., 2006).
Conventional syntax representation models like Context Free Grammars (CFG) only have very limited scope in Sindhi syntax representation.

Full browser ?