Subscribe to:
Post Comments
(
Atom
)
Consider the following grammar: S → ASB | ϵ A → aAS | a B → SbS | A | bb (i) Eliminate ϵ-productions; (ii) Eliminate any unit productions in the resulting grammar; (iii) Eliminate any useless symbols in the resulting grammar; (iv) Put the resulting grammar into Chomsky Normal Form (CNF)?
Write a regular expression for the set of string that consists of alternating 0’s and 1’s.
No comments
Dear Members, Thanks for Your Comments. We must be reply your comment answer as soon as possible. Please Stay with us.....