Context-free grammar
A context-free grammar is a set of production rules, each replacing one nonterminal with a sequence of terminals and nonterminals. It generates a language by repeated rule application.
Linked from 13 pages
Abstract syntax treeRelated: Grammar rules define which AST structures a parser may construct.
DerivationRelated: Its production sequences derive particular strings from a start symbol.
Ogden's lemmaNarrower topic: The lemma applies to languages generated by these grammars.
Context-free languageRelated: A context-free language is generated by at least one such grammar.
ParserRelated: Its production rules specify which token sequences the parser accepts.