0

2.9kviews

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.7 years ago by teamques10 ★ 68k

•   modified 2.9 years ago

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

Marks: 10M

Year: May 2016

theory of computation

ADD COMMENT FOLLOW SHARE EDIT

1 Answer

0

96views

written 7.7 years ago by teamques10 ★ 68k

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 SHARE EDIT