FUNDAMENTALS OF COMPUTER

Detailed explanation-1: -The entity which accepts a language is termed as Automata while the one which generates it is called Grammar. Tokens are the smallest individual unit of a program.

Detailed explanation-2: -A context-free grammar (CFG) consists of a set of productions that you use to replace a vari-able by a string of variables and terminals. The language of a grammar is the set of strings it generates.

Detailed explanation-3: -Standard way of representing the language is called grammar in Automata. Grammar contains set of production rules which makes the strings of language. The set of all possible strings which can be derived from grammar is known as Language of that grammar.

Detailed explanation-4: -Deterministic Finite Automaton. Non-deterministic Finite Automaton.

Detailed explanation-5: -Explanation: A context free language for which no unambiguous grammar exists, is called Inherent ambiguous language.