Assignment from Compiler Construction

8. Demonstrate a bottom up parse of the string boaba for the grammar of problem 4 shown above. Show your parse stack at each step in your parse. (You don't need to make an LR parse table. I suggest you figure out a parse tree for the string, and then let that guide you as you decide which reductions to make as you manipulate the parsing stack.) 8. Demonstrate a bottom up parse of the string boaba for the grammar of problem 4 shown above. Show your parse stack at each step in your parse. (You don't need to make an LR parse table. I suggest you figure out a parse tree for the string, and then let that guide you as you decide which reductions to make as you manipulate the parsing stack.)