PLEASE answer accurately . This is a compiler construction related question.

State Irue/False against each of the following statements. Cutting and/or overwriting will not be considered for grading. 1. For top down parsers, grammar should not have left recursion and should be free from common prefix problem. [T/F] 2. Recursive descent parser is a type of bottom up parser. [T / F] 3. A predictive parser is free from backtracking and is a type of top down parsers. [T/F] 4. LL(1) is a type of predictive parser. [T/F] 5. A Non-LL(1) grammar is one that contains left recursion as well as common prefix problem. [T/F] 6. Shift Reduce parser is a type of top down parser. [T/F] 7. An operator precedence parser is a bottom-up parser. [T/F] 8. Consider these two productions: ABC and AEDC. None of these two productions can appear in an operator grammar. [T/F] 9. LR(0),SLR(1),CLR(1) and LALR(1) are all types of LR parsers. [T/F] 10. In any programming language a construct is what we build from alphabet symbols. [T/F] 11. Semantic Analyzer determines meanings of a program instruction. [T / F] 12. In an SDD/SDT, attributes are associated with tokens while rules/actions are associated with strings comprising of tokens. [T/F] 13. SDD is a CFG with attributes and rules. [T/F] 14. Synthesized attributes take values from siblings while inherited attributes take values from parents. [T/ 15. An S-attributed SDD used synthesized attributes only and these attributes are evaluated in bottom up manner. [T / F ]