A is what we use to designate the “ null string ” (one that does not contain any symbols);

[sujonkumar6300]

We said that we can define languages ​​using grammars , which are quadruplets of the form:

〈T, N, S 0 , R 〉 where

T is the set of terminal symbols of the language (hereinafter “ Terminals ”); they are ultimately the constituent elements of the sequences of symbols in a language chain;



N is the set of non-terminal symbols of the language (hereinafter “ non-Terminals ”); they do not necessarily singapore email list constitute final strings, since they are defined in terms of a combination of Terminals and non-Terminals.

Note: In these definitions, it must be true that T ∩ N = {} ;

R is the subset of the Cartesian product ( T ∪ N ) * × ( T ∪ N ) * that defines the mathematical relation denoting the language's rewriting rules (hereinafter “ Rules ”);

S 0 is the distinctive element of non-Terminals called “ Start Symbol ”, which is the one that starts the “processing” of R .