Name: ____________________________________________________ Alpha: _____________________

Describe help received: _________________________________________________________________

Problem 1

Download the file hw.ypp onto your VM and run the command 
bison -r state hw.ypp
You can also give the commands 
bison -g hw.ypp
dot -Tpdf hw.dot	  
evince hw.pdf
... to see a graphical depiction of the machine. The diamond shapes give the numbers of the rules you are supposed to reduce by.
This will generate the file hw.output, which contains a textual description of the CFSM bison would use for LALR(1) parsing this language. Refering to the file draw the sequence of stacks produced while parsing 
VAR OR NOT VAR AND VAR STOP
Recall: stacks in SLR (and the LALR, which bison uses) parsing contain both state numbers and symbols.