context-free grammar


Also found in: Acronyms, Wikipedia.

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.
References in periodicals archive ?
Proof: This comes as a nice consequence of our Theorem 3: all the families of planar maps of [BFSS01] cannot be generated by an unambiguous context-free grammar, because of their critical exponent 3/2.
In Section 2, we give a few definitions, mostly illustrating the link between context-free grammars, solutions of positive algebraic systems and N-algebraic functions.
2 Definitions: N-algebraic functions, context-free grammars and pushdown automata
For instance, students recognize that Backus-Naur diagrams, commonly used to define the syntax of PASCAL statements, are equivalent to context-free grammars (type 2 in Chomsky hierarchy).
Context-Free grammars are also linked to the role of Syntactic Analyzer in a compiler.
The context-free grammars come very close to describing all structure of all languages, says Pullum.

Full browser ?