Question: Question#2 a) Top-down and bottom-up parsers build syntax trees in different orders. Write a pair of programs, TopDown and BottomUp, that take a syntax tree

Question#2 a) Top-down and bottom-up parsers build syntax trees in different orders. Write a pair of programs, TopDown and BottomUp, that take a syntax tree and print out the nodes in order of construction. TopDown should display the order for a top-down parser, while BottomUp should show the order for a bottom-up parser. b) Consider the following grammar: Start + S S Aa BC LBCf 1 1 1 a. Construct the canonical collection of sets of LR(I) items for this grammar. b. Derive the action and Go to tables. c. Is the grammar LR(1)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
