Solve Q3

Q3. Create a LR-0 parsing table for following grammar. And create a parsing tree (can create directly without stack operations) for input "if expr then if expr then S else S " SM I U M - If expr then M elae M U if expr then S I if expr then M else U Note: if, expr, then and else are terminals