Answer Happy

Posted: **Mon Jun 06, 2022 6:42 pm**

: 4 Let The Generative Grammar G Be G S A Z U S P With Production Rules P S Aa A X Ass S Y Sas 1 (25.41 KiB) Viewed 20 times

: 4 Let The Generative Grammar G Be G S A Z U S P With Production Rules P S Aa A X Ass S Y Sas 2 (16.81 KiB) Viewed 20 times

4.) Let the generative grammar G be G = ({S, A}, {z,u}, S, P), with production rules P = { S → AA, A →x, ASS S→Y, SAS }. A.) The generative grammar G is in Chomsky normal form, and it is not in Regular normal form. B.) The generative grammar G is in Regular normal form, and it is not in Chomsky normal form. C.) The generative grammar G is in Chomsky normal form and in Regular normal form in the same time. D.) The generative grammar G is not in Regular normal form nor in Chomsky normal form.

6.) Connect the equivalent grammars and automata. unrestricted grammar context-sensitive grammar context-free grammar regular grammar Turing machine finite automaton linear bounded automaton pushdown automaton