Multiple Choice 10.0 points possible (graded, results hidden) 0.5 = Earth $ 1. Earth = Tail Earth' Tail 2. Earth' =^ ( Tail Earth' ) 3. Earth' = E 4. Tail = Flag Tail' 5. Tail' = % Flag 6. Tail' = E 7. Flag = ( Earth ) 8. Flag = number Given the grammer answer the following questions: 1. Which statements are true? First( S ) = {(number} First( Tail') = { %, E } First Flag) = {( number} First( Earth') = {^, { } First( Earth ) = { num } None 2. Which statements are not false? Follow( Earth ) = { } Follow Tail) = { +.), S} Follow Tail') = { +, ), $} Follow( Flag ) = { number,^,), %, $} Follow( Earth') = { number,)} None 3. Which statements are false? The entry of the cell (S,^) of the constructed LL (1) pre-calculated parse table is rule 1 The entry of the cell (Earth', () of the constructed LL (1) pre-calculated parse table is rule 2 The entry of the cell (S, number) of the constructed LL (1) pre-calculated parse table is rule 0 Rule 3 has 3 entries in the constructed LL (1) pre-calculated parse table The entry of the cell (Flag, number ) of the constructed LL (1) pre-calculated parse table is Flag=> number % number None 4. If we prepare a parsing tree with the string "(number % number number ) number" from the above LL(1) table, total number of leaf nodes will be 10 7 12 none I 24 It is not acceptable string 5. If we prepare a parsing tree with the string "(number % number number ) number" from the above LL(1) table, total number of parent nodes will be 17 29 16 7 12 None 6. Which strings are acceptable for the grammer? number number (number) (number % number number) (number number) number ^ (number) number Do not forget to click on submit Submit You have used 0 of 2 attempts Save SLR(1) 10.0 points possible (graded, results hidden) Consider the following grammar, 0.S' S 1.S L=R 2.S R 3.L *R 4.Lid 5.R