Linked from

The 13 pages that link to Context-free grammar, each with the reason it gives.

• Regular expressionCompared with: Context-free grammars can describe nested structures beyond regular languages.

• Abstract syntax treeRelated: Grammar rules define which AST structures a parser may construct.

• Formal grammarBroader topic: This widely used grammar class has more expressive power than regular grammars.

• ParsingRelated: Its production rules describe structures that many parsers recognize.

• Pushdown automatonRelated: Its derivations describe the same languages recognized by nondeterministic pushdown automata.

• DerivationRelated: Its production sequences derive particular strings from a start symbol.

• Chomsky hierarchyBroader topic: Its single-nonterminal left sides define the hierarchy’s third class.

• Context-free languageRelated: A context-free language is generated by at least one such grammar.

• Backus–Naur formNarrower topic: Backus–Naur form is a notation for expressing this kind of grammar.

• ParserRelated: Its production rules specify which token sequences the parser accepts.

• Pumping lemma for context-free languagesNarrower topic: The lemma applies to languages generated by these grammars.

• Ogden's lemmaNarrower topic: The lemma applies to languages generated by these grammars.

• MetasyntaxRelated: Many metasyntaxes specify context-free grammars, whose rules permit nested structures.