Bottom-Up Parsing/Example 3: SLR(1)

Problem

Initial symbol: S

Terminals: { k, w, x, y, z }

Input: xwxkyy

S → x A y | x B y | x A z
B → k
A → w S | k

Is this an SLR(1) grammar?

Derive the SLR(1) parser for this grammar. Compact the parse table. Describe the processing of the input string by the compacted parser.