Subject: Compiler Analysis

Build the SLR (1) parsing table for the following grammar whose finite-state machine is shown, 05 S ->A A -> A+B | x B -> y