a) Top-down and bottom-up parsers build syntax trees in different orders. Write a pair of programs,...

 

Transcribed Image Text:

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 -> A a A -> BC BC f BC a. Construct the canonical collection of sets of LR(1) items for this grammar. b. Derive the Action and Goto tables. c. Is the grammar LR(1)? 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 -> A a A -> BC BC f BC a. Construct the canonical collection of sets of LR(1) items for this grammar. b. Derive the Action and Goto tables. c. Is the grammar LR(1)?