Give an example of a grammar that captures right associativity for an exponentiation operator (e.g., ** in Fortran). Prove that the following grammar is LL(1):     (The final ID is meant to be a type...

Give an example of a grammar that captures right associativity for an exponentiation operator (e.g., ** in Fortran). Prove that the following grammar is LL(1):

(The final ID is meant to be a type name.)

Consider the following grammar:

a) Describe in English the language that the grammar generates. (b) Show a parse tree for the string abaa. (c) Is the grammar LL(1)? If so, show the parse table; if not, identify a prediction conflict.