It is fitting to wrap up the foregoing developments by summarizing the notion of a formal grammar which appeared to evolve in the analysis of cactus languages. For the sake of future reference and further application it is useful to extract a scheme of formalization potentially holding for arbitrary formal languages.
The following presentation is adapted with minor modifications from the treatment in Denning, Dennis, and Qualitz (1978), Machines, Languages, and Computation, Prentice–Hall, Englewood Cliffs, NJ, (pp. 60–61).
Formal Grammar • Definition
A formal grammar is defined by a four‑tuple
of the following form.
is the initial, special, start, or sentence symbol. The letter
plays that role solely in a special setting, so its employment as such creates no conflict with its possible use as a string variable or a sentence variable.
is a finite set of intermediate symbols, all distinct from
is a finite set of terminal symbols, also known as the alphabet of
all distinct from
and disjoint from
Depending on the particular conception of the language
covered, generated, governed, or ruled by the grammar
that is, whether
is conceived to be a set of words, sentences, paragraphs, or more extended structures of discourse, it is usual to describe
as the alphabet, lexicon, vocabulary, liturgy, or phrase book of both the grammar
and the language
it regulates.
is a finite set of characterizations. Depending on how they come into play, the elements of
may be described as covering rules, formations, productions, rewrite rules, subsumptions, transformations, or typing rules.
Resources
cc: Academia.edu • BlueSky • Laws of Form • Mathstodon • Research Gate
cc: Conceptual Graphs • Cybernetics • Structural Modeling • Systems Science
Pingback: Survey of Animated Logical Graphs • 8 | Inquiry Into Inquiry
Pingback: Survey of Animated Logical Graphs • 8 | Systems Community of Inquiry