Question

Q2:- Explain briefly the working of the above mentioned techniques with a simple and short CFG

Answer 1

Answer:

In formal language theory, a context-free grammar (CFG) is a formal grammar whose production rules are of the form

{\display style A\ \to \ \alpha }

with {\displaystyle A}A a single nonterminal symbol, and {\displaystyle \alpha }\alpha  a string of terminals and/or nonterminals ({\displaystyle \alpha }\alpha  can be empty). A formal grammar is "context free" if its production rules can be applied regardless of the context of a nonterminal. No matter which symbols surround it, the single nonterminal on the left hand side can always be replaced by the right hand side. This is what distinguishes it from a context-sensitive grammar.