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:

	{	}	[	]	$
S	1		1		1
F	2	4	3	4	4

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 as explained in lecture notes. The top of the stack is to the left. I recommend creating a three column table in Canvas with stack, input, and prediction/match as column headers (although not required).

[stack] [input] [prediction/match]