Explain elements of language Grammer.
As proposed through Noam Chomsky, a grammar G contains the following elements:
a. A finite set N of non terminal symbols.
b. A finite set Σ of terminal symbols which is disjoint from N.
c. A finite set P of production rules, all rules of the form
Here * is the Kleene star operator and indicates set union. Which is, each production rule maps from one string of symbols to the other, here the first string contains at least one non terminal symbol. A distinguished symbol is the start symbol.