0
1.8kviews
Explain algorithm for the conversion of a Context Free Grammar(CFG) to Chomsky Normal Form(CNF) and use it to convert the following CFG to CNF:
written 6.3 years ago by | • modified 2.2 years ago |
Mumbai University > Informatica Technology > Sem 4 > Automata Theory
Marks: 10M
S => bA|aB
A => bAA|aS|a
B =>aBB|bS|b
ADD COMMENT
EDIT
1 Answer