The concepts of heredity and polymorphism need a comprehensive explanation.

In the Theory of automata, what is the relationship between the Chomsky hierarchy and Turing thesis with the corresponding automata types such as DFA, NFA, Regular Grammar, Context-Free grammar, and Pushdown automata? # explain in detail using diagrams, please!

In general, there are two types of grammars for programming languages, regular and context-free, what is the difference, what is the scope (where are they applied), and how can the use of these grammars produce a higher level of program reliability. Does this higher level of reliability encourage complexity?

There are two restrictions on the type of grammars that can be used with a recursive descent parser. The first is that the grammar cannot have any left recursive productions. Give an example of a left recursive production and explain why such productions would be a problem. The second restriction is that the grammar must not require more than one token look ahead. Give an example of a production that does not have this property. Explain why this restriction is necessary for recursive descent parsing. Rubrics