Which of the following statements is/are true?
A) Graph coloring is a systematic technique for allocating registers and managing register spills.
B) Stack allocation would not be feasible if procedure calls, or activations of procedures, did not nest in time.
C) A SLR and LALR parsers will not make even a single reduction before announcing an error but A canonical LR parser may make several reduction before announcing an error.
D) A shift/reduce conflict is resolved in favour of shift. This rule resolves the shift/reduce conflict arising from the dangling-else ambiguity correctly.
