Q1. List the Standard Grammar Categories in Programming Languages with suitable example of each using any High Level Programming Languages. Ans: Q2. Translate the below general statement into predicate calculus' and Horns cause' statement. 1. Computing ancestors: A parent is an ancestor. If A is an ancestor of B, and B is an ancestor of C, then A is an ancestor of C. (a typical relation: called ??) A mother is a parent. A father is a parent. Bill is the father of Jill. Jill is the mother of Sam. Bob is the father of Sam. 2. Computing the factorial function: The factorial of O is 1. Ifm is the factorial of n - 1, then nm is the factorial of n. Ans: Q3. How do you apply the new grammar rule to resolving the ambiguity for simple integer arithmetic expressions addition & multiplication in context to precedence issue and associativity issue? Ans: Q4. Describe how to express the selection statement (if.else y' in context to below given programming Language principles. a. In the form of BNF and EBNF b. Using Parse Tree and Abstract Syntax Tree c. Using Syntax Diagrams