Formal grammar is the mathematical engine that defines the structure of languages without meaning.

Cultures · Published 30 September 2026 Swipe more like this →

In short: A formal grammar is a set of symbols and production rules that generate strings. While it ignores the meaning of language, it provides the essential framework for theoretical computer science and linguistics. By rewriting strings from a start symbol, these systems determine what is grammatically correct and what is not.

At its core, a formal grammar acts as a language generator. It consists of a set of production rules that transform strings by replacing specific symbols with others. These systems distinguish between terminal symbols, which make up the final strings, and nonterminal symbols, which act as placeholders during the rewriting process. Every grammar begins with a designated start symbol, and the language it generates is the set of all strings composed entirely of terminal symbols that can be derived from that start symbol through repeated rule applications.

The utility of these grammars extends far beyond simple generation. In computing, they serve as the foundation for parsers, which check whether a given string conforms to a language's rules. This process often involves breaking a string into its analyzed form, known as a parse tree in computer science or deep structure in generative grammar. This structural analysis is a prerequisite for compositional semantics, where the meaning of a string is derived from the meanings of its individual parts.

Formal language theory, a discipline within applied mathematics, provides the tools to study these systems. It uses automata theory to describe the capabilities of parsers, revealing that for certain languages, it is mathematically impossible to design a recognizer. Grammars can be classified based on their rules; for instance, context-free grammars are restricted to single nonterminals on the left-hand side of production rules. If a grammar allows multiple ways to generate the same string, it is considered ambiguous, a property that can complicate both parsing and semantic interpretation.

The formalization of these systems gained significant traction in the 1950s through the work of Noam Chomsky. A formal grammar is defined as a tuple, often referred to as a phrase structure grammar or a rewriting system. Whether used to model natural language or to define the syntax of programming languages, these mathematical constructs remain the primary method for defining the formal structure of symbolic systems.

General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.

Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?

Related

• A notation for describing machines, drafted in 1907, anticipated programming languages
• Can a mathematical hierarchy explain the structure of human language and computer code?
• Why your code might be grammatically perfect yet completely impossible to run
• The notation that defines the rules of the digital world
• What is language, really? Theoretical linguistics explores the hidden mental architecture of human speech.
• Why a Quebec stop sign says ARRÊT while France uses STOP
• Is fluency a measure of knowledge, or simply the speed of your delivery?
• How a regional dialect from Paris became the official language of an entire nation.
• The lost botanical records of the Pacific's most diverse orchid islands
• The French Sign Language was not invented by the man who made it famous.
• Why the shortest stories in history are finally having their moment in the sun
• The humble full stop is a linguistic chameleon that shapes our digital and physical worlds.

More in Language · More in Cultures · Latest · A–Z · All topics