Given the following grammar, determine the FIRST sets of each of the RHSs of each of the productions. Assume that upper case letters are nonterminals and lower case letters are terminal symbols. A -> xyB | xzB | B B -> a | bB Apply the pairwise disjointness test to show that the grammar is not LL(1).
Modify the grammar in the previous problem so that it is LL(1).
Explain why failing the pairwise disjointness test is an indication that the grammar will be problematic for top-down parsing by only looking ahead by one token.
Generate the intermediate code for the following expression assuming the usual rules concerning parentheses, precedence and associativity.
Be sure to reuse temporaries as soon as possible: a - (b + 5) / 4 * c
Generate the intermediate code for the following statements.
Assume that the logical operators short circuit.
Indicate when backpatching occurs: total = 0; if (a > 1 || b <= 5) { j = 1; while (j <= b) { total = total + j; j = j + 1; } } c = 0;