Using the Top Down LL$(1)$ Parsing algorithm, parse the following input string:

$\{[[]]\{\}\}$ $

Using the following grammar:

$S-F$

$F-\{F\}F$

$F-[F]F$

$F-$

and the following Parse Table:

Show the stack and input buffers for all stages. Show transitions where applicable.

Recall that rule $4,F-,$ removes $F$ from the stack without making any changes to the input.

Use the following format

$[$stack$][$input$][$prediction$/$match$]$