Home / Expert Answers / Computer Science / in-a-greibach-normal-form-grammar-with-variables-mathrm-x-mathrm-y-mathrm-z-and-te-pa938

(Solved): In a Greibach Normal Form grammar with variables \( (\mathrm{X}, \mathrm{Y}, \mathrm{Z}) \) and te ...



In a Greibach Normal Form grammar with variables \( (\mathrm{X}, \mathrm{Y}, \mathrm{Z}) \) and terminal symbols \( \mathrm{b

In a Greibach Normal Form grammar with variables \( (\mathrm{X}, \mathrm{Y}, \mathrm{Z}) \) and terminal symbols \( \mathrm{b} \) and \( \mathrm{c} \). Which productions follow the rules of Greibach NF: \[ \begin{array}{l} X \rightarrow Y X Z c \\ X \rightarrow Y b \\ Y \rightarrow b \\ Z \rightarrow c \\ X \rightarrow X Y Z \\ X \rightarrow b \\ Y \rightarrow X b \\ Z \rightarrow c \\ X \rightarrow b Z X Z \\ X \rightarrow b Y \\ Y \rightarrow b \\ Z \rightarrow c \end{array} \] None of the listed grammars are in Greibach Normal form


We have an Answer from Expert

View Expert Answer

Expert Answer


A context-free grammar (CFG) is Greibach normal form (GNF) if and only if all of its production rules satisfy one of the following criteria: A termina
We have an Answer from Expert

Buy This Answer $5

Place Order

We Provide Services Across The Globe