In formal language theory, a context-free language (CFL), also called a Chomsky type-2 language, is a language generated by a context-free grammar (CFG)...

In formal language theory, a context-free grammar (CFG) is a formal grammar whose production rules can be applied to a nonterminal symbol regardless of...

formal language theory, deterministic context-free languages (DCFL) are a proper subset of context-free languages. They are context-free languages that...

In computer science, in particular in formal language theory, the pumping lemma for context-free languages, also known as the Bar-Hillel lemma, is a lemma...

In formal language theory, a context-sensitive language is a language that can be defined by a context-sensitive grammar (and equivalently by a noncontracting...

Synchronous context-free grammar Context-free language Deterministic context-free language All pages with titles containing Context-free Context (disambiguation)...

admits ambiguous grammars is called an inherently ambiguous language. Deterministic context-free grammars are always unambiguous, and are an important subclass...

Context-free language reachability is an algorithmic problem with applications in static program analysis. Given a graph with edge labels from some alphabet...

deterministic pushdown automata, and they generate the deterministic context-free languages. DCFGs are always unambiguous, and are an important subclass of...

or b {\displaystyle b} as we please. That same language can alternatively be generated by a context-free, nonambiguous grammar; for instance, the regular...

positioned between context-free and unrestricted grammars in the Chomsky hierarchy. A formal language that can be described by a context-sensitive grammar...

Generalized context-free grammar (GCFG) is a grammar formalism that expands on context-free grammars by adding potentially non-context-free composition...

recognize all deterministic context-free languages while nondeterministic ones can recognize all context-free languages, with the former often used in...

linguistics and computational linguistics, probabilistic context free grammars (PCFGs) extend context-free grammars, similar to how hidden Markov models extend...

In practice, there are many languages that can be described by rules, such as regular languages or context-free languages. The notion of a formal grammar...

theory of formal languages; the paper "The algebraic theory of context free languages" describes the modern hierarchy, including context-free grammars. Independently...

In formal language theory, an LL grammar is a context-free grammar that can be parsed by an LL parser, which parses the input from Left to right, and constructs...

Chomsky Type 2 grammar, also termed a context-free grammar.) Context-free languages are a category of languages (sometimes termed Chomsky Type 2) which...

(context-free languages)". He called these grammars mildly context-sensitive grammars and the associated languages mildly context-sensitive languages....

language, specified in the lexical grammar, which is a Type-3 grammar, generally given as regular expressions. Phrases are in a context-free language...

grammar is a context-free grammar that has at most one nonterminal in the right-hand side of each of its productions. A linear language is a language generated...

parser is an algorithm for parsing strings that belong to a given context-free language, though (depending on the variant) it may suffer problems with certain...

pushdown automata accepts the deterministic context-free languages, a proper subset of context-free languages. Machine transitions are based on the current...

theory of formal languages, Ogden's lemma (named after William F. Ogden) is a generalization of the pumping lemma for context-free languages. Despite Ogden's...

whether a context-free grammar produces a finite or infinite language. Nederhof, Mark-Jan; Satta, Giorgio (2002), "Parsing Non-recursive Context-free Grammars"...

known as type-0 languages in the Chomsky hierarchy of formal languages. All regular, context-free, context-sensitive and recursive languages are recursively...

the syntactic structure of natural language; languages containing an arbitrary number of them are non-context-free. By this fact, Dutch and Swiss-German...

exist context-free languages that cannot be recognized by a PEG, but this is not yet proven. PEGs are well-suited to parsing computer languages (and artificial...

simplification of their pumping lemma for context-free languages. Let L {\displaystyle L} be a regular language. Then there exists an integer p ≥ 1 {\displaystyle...

particular by the families of regular languages, context-free languages and the recursively enumerable languages. The concept of a cone is a more abstract...