Grammars in Automata Theory Grammar can defined as 4 tuples, it means G={N,T,S,P} where, N- set of variables or non terminal symbol T- terminal symbol S- starting symbol, S ∊ N P- production rule for terminal or non-terminal (∝➝β) Example Grammar :- N ⇒ {S,A} T ⇒ {0,1} S ⇒ S P ⇒ { S➝A, A➝ 1A | 0A | 0 | 1 | ∊ } Derivation of sentences:- S ➝ A ➝ 1A ➝ 11A ➝ 110A ...