As discussed in section 55 a grammar is in greibach normal


As discussed in Section 5.5, a grammar is in Greibach Normal Form (GNF) if all productions are of the form A→aα, where a is a terminal symbol and α is a string of zero or more grammar (i.e., terminal or nonterminal) symbols. Let be a grammar that does not generate λ. Design an algorithm to transforminto GNF.

Request for Solution File

Ask an Expert for Answer!!
Basic Statistics: As discussed in section 55 a grammar is in greibach normal
Reference No:- TGS01474316

Expected delivery within 24 Hours