Linked from

The 12 pages that link to Formal grammar, each with the reason it gives.

• Formal languageRelated: Grammars specify languages by deriving their member strings.

• Programming languageBroader topic: Grammars provide a precise way to specify a language's syntax.

• Regular expressionRelated: Grammars offer a generative perspective on languages also described by expressions.

• Context-free grammarNarrower topic: Context-free grammars are one precisely defined kind of formal grammar.

• PāṇiniRelated: Pāṇini’s rule-based description is often compared with later formal approaches to language.

• ParsingNarrower topic: Parsing tests strings against the rules that define a formal language.

• Formal linguisticsBroader topic: It makes the structural rules of a language explicit and testable.

• John BackusNarrower topic: Backus–Naur form expresses programming-language syntax as production rules.

• Chomsky hierarchyNarrower topic: Each class in the hierarchy is defined by restrictions on grammar rules.

• ParserNarrower topic: A parser uses grammar rules to decide how tokens may be grouped.

• Computational linguisticsRelated: Grammars provide explicit representations of syntactic structure for computational analysis.

• MetasyntaxNarrower topic: Metasyntaxes encode formal grammars as readable or machine-processable notation.