Formal Language

Structure description of sentences in Computer is Formal Language. Mathematical model for defining computer language.

Definition of Grammar:-

Some Rules:- 1) Reverse substitution is not allowed. S AB is production then we can replace S by AB but we can not replace AB by S. 2) No Inversion operation is allowed. S AB is production then it is not necessary that AB S is a production.

Derivation and the Language Generated by a Grammar:- Q1

Q2. Q3.

Q4.

Q5.

Q6.

Chomsky classification of Language:- Type 0 :- Example:-

Type 1:- Example:-

Type 2:- Type 3:-

Example Q.:-

Language and Their Relation:-

Recursive and Recursively Enumerable Sets:-

Example

Operations on Language:-

Language and Automata:-