Spend up to 30 minutes on the following:

1) Run the LR parse algorithm on the input "x + + x" using the parse
   table from Figure 3.25 (which we used in class today for the input
   "x + x + x"). Remember that any table entries that are left blank
   are to be interpreted as "parse error", so you should _not_ get to
   the accept action for "x + + x".

   This corresponds to re-doing what was done in class, with a
   different input.

2) Table 3.33 gives a parse table for the ambiguous Grammar 3.5; some
   of the entries have _both_ a shift _and_ a reduce. Imagine that we
   choose to always use the reduce action in most cases except the
   four in the upper-right corner (those with table entries matching
   the regular expression "s1[24],r[56]"), where we use the shift
   action, thereby removing the conflicts (so state 9's action on "+"
   becomes "r5" instead of "s8,r5", and state 11's action on "*"
   becomes "s12" rather than "s12,r5").

   For the table that results from these choices, show the parsing
   actions for the inputs "3 + 4 * 5" and "3 * 4 + 5". You may find
   this easiest if you photocopy this page from the book and then
   cross out the actions that won't get used.