Compilers:

Prove or disprove that Hints: is SLR(1). Start ? StmtList $ the following grammar Draw the L R(0) computation. Follow(Start) 0 Follow(StmtList) s) Follow(Stmt) 3( semi, $ } Construct the parse table Check whether there is any conflict. If yes, you proved it. If no, you disproved it. StmtList ? Stmt semi StmtList l Stmt Stmt S