Back to the index. Or to the chambers

This article has 19 links. View as Cloud or List.

Collection Generating Set Of A Group Necessary And Sufficient Set Finite Class Language Operations On Relations Relation Theory Ideal Generated By A Set Sentence Alphabet Planet Math Countably Infinite Cone Chomsky Hierarchy Context Sensitive Language Recursively Enumerable Semi Thue System

Loading ...

Planetmath Browser (2008—2009)

BSD licence | A django site

All articles taken from PlanetMath.org snapshot under CC-BY-SA licence.

→ The original article on PlanetMath.org

Other Formats: LaTeX

New! You can click on formulas to copy the LaTeX source to your clipboard. | Math Videos

Formal Grammar

Introduction

A grammar, loosely speaking, is a set of rules that can be applied to words to generate sentences in a language. For example, with the grammar of the English language, one can form syntactically correct sentences such as “The elephant drove his bicycle to the moon,” regardless whether the sentence is meaningful or not.

The mathematical abstraction of a grammar is known as a formal grammar. Instead of generating sentences from words, a formal grammar generates words from symbols and other words. The following basic ingredients are necessary in a formal grammar:

a collection of symbols called an alphabet,
a collection of rules, called rewriting rules, specifying how one can generate new words from existing ones, and
a collection of initial words that serve to initialize the generation of new words.

To see how these rewriting rules work, let us look at an example. Let $\lbrace a,b\rbrace$ be the alphabet as well as the set of initial words. With the rewriting rules given by: from a word

we can form the word

, as well as the word

, we would be able to generate words like

$\displaystyle aa, \quad aaa, \quad ab, \quad baa$

However, words such as

$\displaystyle bb, \quad baba, \quad baaab$

can not be produced.

Note that by adding an extra symbol $\sigma$ to the above alphabet, and two additional rewriting rules given by “from $\sigma$ form ” and “from $\sigma$ form ”, it is not hard to see that any word that can be generated by the first grammar can be generated by this new grammar.

Definition

Formalizing what we have discussed above, we say that a formal grammar is a quadruple $(\Sigma,N,P,\sigma)$ , where

$(\Sigma,P)$ is a rewriting system;
is a subset of $\Sigma$ whose elements are called non-terminals, and $T:=\Sigma-N$ the set of terminals;
an element $\sigma\in N$ called the starting symbol.

Instead of writing $G=(\Sigma,N,P,\sigma)$ , the quadruple $(T,N,P,\sigma)$ is another way of representing

(as long as the conditions $\Sigma=T\cup N$ and $T\cap N=\varnothing$ are satisfied).

A formal grammar is variously known as a phrase-structure grammar, an unrestricted grammar, or simply a grammar. A formal grammar is sometimes also called a rewriting system in the literature, although the two notions are distinct on PlanetMath.

Given a formal grammar , the formal language generated by is the set

$\displaystyle L(G):=\lbrace w\in T^*\mid \sigma \stackrel{*}{\Rightarrow}w\rbrace,$

where $\stackrel{*}{\Rightarrow}$ is the derivability relation in the rewriting system $(\Sigma,P)$ . A formal language is also known as a phrase-structure language.

A language over an alphabet is said to be generable by a formal grammar if there is a formal grammar such that $L=L(G)\cap A^*$ .

Example. Continuing from the example in the previous section, we can put $T=\lbrace a,b\rbrace$ and $N=\lbrace \sigma\rbrace$ . For the set of productions, we have four

$\sigma \to \sigma a$
$\sigma \to a\sigma$
$\sigma \to a$
$\sigma \to b$

Then $G=(\Sigma,N,P,\sigma)$ is a formal grammar. It is not hard to see that $\sigma \stackrel{*}{\Rightarrow}baa$ , as $\sigma \to \sigma a \to \sigma aa \to baa$ . In fact,

consists of all words such that

occurs at least once and

occurs at most once.

Remarks.

Not every language can be generated by a formal grammar. Given a finite alphabet $\Sigma$ , $\Sigma^*$ is countably infinite, and therefore there are uncountably many languages over $\Sigma$ . However, there are only a countably infinitely many languages that can be generated by formal grammars.
Every language generated by a formal grammar is recursively enumerable.
Every context-sensitive grammar is equivalent to a formal grammar, and under the Chomsky hierarchy, the class of formal languages is of class 0.

Bibliography

1: H.R. Lewis, C.H. Papadimitriou Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs, New Jersey (1981).

1	Collection
1	Operations On Relations
1	Class
1	Finite
1	Set
1	Relation Theory
1	Language
1	Necessary And Sufficient
1	Generating Set Of A Group
2	Ideal Generated By A Set
2	Alphabet
2	Sentence
3	Planet Math
3	Countably Infinite
5	Cone
6	Semi Thue System
9	Context Sensitive Language
9	Recursively Enumerable
10	Chomsky Hierarchy