formal grammar
Sign in to savestructure of a formal language
In the Vinony graph
Within Vinony's link graph, formal grammar is referenced by 874 other articles, and connects out to parsing, terminal and nonterminal symbols and semantic theory of truth.
It sits within the topics Automata (computation), Formal languages and Grammar.
Its subject is documented across 35 Wikipedia language editions.
Wikidata facts
- Subclass of
- mathematical model
- Part of
- formal language
Show 2 more facts
- different from
- grammar
- Stack Exchange tag
- math.stackexchange.com/tags/formal-grammar
via Wikidata · CC0
~20 min read
Encyclopedic overview
Example of a simple formal grammar (left) with parsed sentence "the dog ate the bone" (right). Formal grammars consist of a set of non-terminal symbols, terminal symbols, production rules, and a designated start symbol.
A formal grammar is a set of symbols and the production rules for rewriting some of them into every possible string of a formal language over an alphabet. A grammar does not describe the meaning of the strings—only their form.
Excerpted from Wikipedia’s “formal grammar” article, available under the CC BY-SA 4.0 licence.