Computer Construction

Answers are to be submitted via Blackboard by March 2nd. Please submit your answer as an archive username.tar.gz containing a PDF file with answers to theoretical questions, and a code directory like the provided one, containing all files required to build your solution.

Use any resources you can, the recitation lecture slides, asking each other, and Piazza. Start early, and when the deadline approaches, submit what you have got, no matter how finished. Remember to cite your sources and collaboration partners wherever they have influenced your work.

1 Bottom/up parsing tables

Consider the following grammar:

E → E + T |T

T → T ∗ F |F

F → x

1.1 Augment the grammar, and construct its LR(0) automaton.

1.2 Identify any states with shift/reduce conflicts in your automaton.

1.3 Is the grammar SLR parseable?

Justify your answer by constructing the SLR parsing table.