Consider the following grammar: terminals: and, or, (, ), true, false non-terminals: S start symbol: S production rules: S ! S and S j S or S j (S) j true j false (a) Draw two di erent parse trees for the string: true and true and true
(b) Modify the grammar to remove ambiguity.
(c) Draw the parse tree for the string true and true and true using the new grammar from previous step.
(d) Explain how your new grammar modi es the parse trees you drew in the rst step to remove ambiguity.