Construct an SLR parsing table for the grammar in Exercise 4.3.
Exercise 4.3 Consider the grammar
a) Construct a parse tree for the sentence not (true or false).
b) Show that this grammar generates all boolean expressions.
c) Is this grammar ambiguous? Why?