1. Consider the following grammar G=(V,T,P,S), V={S,X}, T={a,b} and productions P are S-> aSb | aX X->Xa|Sa|a Convert this grammer in Greibach Normal Form (GNF).

3.2kviews

written 8.7 years ago by

teamques10 ★ 70k

• modified 3.8 years ago

Mumbai University > Computer Engineering > Sem 4 > Theoretical Computer Science

Marks: 10M

Year: May 2016

theory of computation

ADD COMMENT EDIT

1 Answer

100views

written 8.7 years ago by

teamques10 ★ 70k

Here, S->aSb|aX

X->Xa|Sa|a

Put S->aX

X->Xa|aXa|a

Let A->a and X->x

X->xA|axA|A

Which is in G.N.F

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.