'Multiple Choice 10.0 points possible (graded, results hidden) O. S = Tail $ 1. Earth = Tail Earth' Tail 2. Earth' = ^ ( Tail Earth' ) 3. Earth' = E 4. Tail = Flag Tail' Earth 5. Tail' = % Flag 6. Tail' = E 7. Flag = ( Earth ) 8. Flag = number 9. Earth = A Given the grammer answer the following questions: 1. Which statements are not absolutely true? First(S) = { Tail } First( Tail') = { %} First( Flag ) = {( number} First( Earth') = {^} First( Earth ) = { ^, num } None 2. Which statements are completely/partially false? Follow( Earth ) = {), ( number, ^} Follow Tail ) = { ( number, ^,), $ } Follow Tail') = {), number} Follow( Flag) = { ( number, %, $ } Follow Earth') = { } None 3. Which statements are completely true? 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 nothing The entry of the cell (s, number) of the constructed LL (1) pre-calculated parse table is rule 1 Rule 6 has 2 entries in the constructed LL (1) pre-calculated parse table Rule 2 has 2 entries in the constructed LL (1) pre-calculated parse table None 4. If we prepare a parsing tree with the string "(^) number ^ number ^" from the above LL(1) table, total number of leaf nodes will be 14 11 10 24 None 5. If we prepare a parsing tree with the string "(^) number ^ number 4" from the above LL(1) table, total number of parent nodes will be 24 14 10 21 None 6. Which strings are not acceptable for the grammer? number ^ number (number ^ number ^)^ (number % number ^ number) (number ^ number ^)% number ^ number ( number % number) number ^