Ask
Login
0
2.7kviews
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).
written 7.1 years ago by gravatar for teamques10 teamques10 ★ 64k •   modified 2.2 years ago

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

Marks: 10M

Year: May 2016
theory of computation
ADD COMMENT EDIT
1 Answer
0
82views
written 7.1 years ago by gravatar for teamques10 teamques10 ★ 64k

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
ADD COMMENT EDIT
Please log in to add an answer.