Toc CFG

Question

The production rules for a given context-free grammar are $S \rightarrow aA, A \rightarrow bB, A \rightarrow aB$ and $B \rightarrow a$ in

• A. Chomsky normal form
• B. Greibach normal form
• C. Simple form
• D. None of the above

Answer 1

Answer : Greibach Normal Form

A/c to GNF
If all the production are of the form A ===> a∝  where ∝= V* then it is called GNF

Answer 2

Answer is B).

A CFG G = (V,T,R,S) is said to be in GNF if every production is of the form A → aα, where a ∈ T and α ∈ V∗, i.e., α is a string of zero or more variables.

S--> aABCD where a being a terminal is neccessary 

And among the variables, ABCD, none or more variables can be present.