edited by
1,605 views
2 votes
2 votes
S->AB/0,

A->BC/1,

B->CD/2,

C->AD/0,

D->1

Convert it into GNF.
edited by

Please log in or register to answer this question.

Related questions

5 votes
5 votes
1 answer
1
3 votes
3 votes
1 answer
2
Mk Utkarsh asked Mar 25, 2018
2,687 views
Convert the given CFG to GNF.$S \rightarrow MN$$M\rightarrow aMb|\epsilon $$N\rightarrow aNb|\epsilon $
0 votes
0 votes
1 answer
3
gateexplore asked Jun 23, 2023
319 views
Find a Greibach normal form grammar equivalent to the following CFG.S →ASB/ ABA→ aB → b
2 votes
2 votes
1 answer
4
hustlerrr asked Nov 17, 2021
4,522 views
Convert the following grammar into Greibach Normal Form.E- E + T | TT- T*F | FF->(E) | a I am unable to process this type of grammer into GNF, Can someone please provide ...