Construct an SLR parsing table for the grammar in Exercise 4.3.
Exercise 4.3 Consider the grammar
![](https://test.transtutors.com/qimg/681c86e4-e2e8-4d5f-9d33-42a61c791e94.png)
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?