Subject is theory od automata explain it amd give examples also

Question 01: Why CFG is called a Former Grammar? In which phase of a Compiler CFG is used? What are Applications of CFG? Question 02: How Context-Free Grammar is different from Context-Sensitive Grammar? Can Context Free Grammars be computationally tractable? If yes, then justify. What are the components of context free grammar? Is the Grammar G= ({S}, {a, b}, {P}, {S}) with productions below is Context Free & How? SaSa SbSb S Question 03: Differentiate between Normal Form & Chomsky Normal Form? G1 = {S AB,Sc,Aa,Bb} G2 = {SaA,Aa,Bc} Which Grammar (G1 or G2) is in Chomsky Normal Form? Question 04: Write the steps to convert CFG to CNF. Convert the following Context Free Grammar to Chomskys Normal Form (CNF) S -> ASA S -> aB A -> B A -> S A -> B -> b B -> Question 05: Why lexical analyzer cant check the syntax of a given sentence? Justify. How Syntax Analyzers works? Depict with the help of a diagram? How is a Parse Tree used in derivation? Explain with an example.

This is the theory of automata subject of computer science answer these all queation with details and example also