1. General Knowledge What derivation does a bottom-up LR(1) parser construct? a. b. What derivation does a top-down LL(1) parser construct? Define ambiguity in a context-free grammar. Give an example of an ambiguous context- free grammar. c. d. Which is smaller: a parse tree or an abstract syntax tree? 2. Comparisons In each part of this question, you are given two terms. Briefly define each term, and then explain the distinction or difference between them. "Briefly" means a couple of sentences, not a couple of paragraphs. a. Deterministic finite automaton (DFA) versus non-deterministic finite automaton (NFA) Hopcroft's algorithm for DFA minimization versus Brzozowski's algorithm for DFA minimization b. c.Clean value versus dirty value in a local register allocator d. Regular expression versus context-free grammar