Consider the following grammar and input string.

The terminals in the grammar are enclosed in single quotes.

Follow parts a$-$d below to show the first four steps of a stack$-$based parser when reading the string using the grammar.

Grammar:

$ETA$

$A\text{'}+\text{'}TA|\text{'}-\text{'}TA|$ epsilon

$T\text{'}(\text{'}E\text{'})\text{'}|\text{'}2\text{'}|$

String:

$2+(2-2)$

The initial contents of the stack and the input are:

Stack: E# Input: $2+(2-2)$#

a$.$ Give the contents of the stack and the input after one parser step.

b$.$ Give the contents of the stack and the input after a second parser step.

c$.$ Give the contents of the stack and the input after a third parser step.

d$.$ Give the contents of the stack and the input after a fourth parser step.