COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The production of the form A
|
|
Unit production
|
|
|
Null production
|
|
|
Greibach Normal Forn
|
|
|
Chomsky Normal Form
|
Explanation:
Detailed explanation-1: -Any production rule in the form A → B where A, B ∈ Non-terminal is called unit production..
Detailed explanation-2: -The production of form non-terminal-> is called: Sigma Production.
Detailed explanation-3: -Normal Forms A grammar is in a normal form if its production rules have a special structure: Chomsky Normal Form: Productions are of the form A → BC or A → a, where A, B, C are variables and a is a terminal symbol.
Detailed explanation-4: -For example: G1 = S → AB, S → c, A → a, B → b G2 = S → aA, A → a, B → c
There is 1 question to complete.