search
Log In
1 vote
1.8k views

Convert the following context free grammar into Chomsky Normal Form:

$S \rightarrow ASA | aB$

$A \rightarrow B | S$

$B \rightarrow b |  \epsilon$

Does the appearance of starting symbol S at RHS impacts the conversion from CFG to CNF?

in Theory of Computation 1.8k views
0
grammer in CNF will be,

S-->AS/ SA/ AS'/ A'B/ a

A-->AS'/ A'B/ AS/ SA/ a/ b

S'-->SA

A'-->a

B-->b
0
Nitish, Typo! second line productions are for A, not for A'.

secondly A->b is missing, added due to null- productions removal.
0
yes, sorry.......accidently!!
0
@nitish my doubt was if starting variable S appears at RHS in the original Grammar, do we need to add a temp variable? such as
S0->S
+
Original Productions

and the we start conversion from cfg to cnf?
0
@manu00x

no need for that..
0

@nitis

see the following screenshot taken from the book "Introduction to theory of computation" by Michael Sipser.

Please log in or register to answer this question.

Related questions

1 vote
0 answers
2
1k views
As the null string belongs to the language generated by the grammar, answer of the following questions should be "none of these"?
asked Oct 29, 2017 in Theory of Computation Manu Thakur 1k views
2 votes
0 answers
3
862 views
Consider the following context free grammar: $S \rightarrow ASA | aB$ $A \rightarrow B | S$ $B \rightarrow b | \epsilon$ How many productions will be there in the modified grammar if we remove null-productions and unit-productions from this grammar? My Solution: Step 1: Remove ... $B \rightarrow b$ I am getting 12 productions. can someone please confirm if it's correct?
asked Oct 13, 2017 in Theory of Computation Manu Thakur 862 views
2 votes
1 answer
4
...