Question: what is gnf in theory of computation?
Answer: 1 Greibach Normal Form (GNF) A CFG G = (V,T,R,S) is said to be in GNF if every production is of the form A → aα, where a ∈ T and α ∈ V ∗, i.e., α is a string of zero or more variables. Definition: A production U ∈ R is said to be in the form left recursion, if U : A → Aα for some A ∈ V .