The following grammar is non-deterministic.

G[ Z ]

Z ::= VQ | QU

U ::= Q1 | 1

V ::= Q0 | 0

Q ::= Q0 | Q1 | 0 | 1

Our language translator team has determined the following deterministic equivalent. Do a bottom up parse using their deterministic equivalent parse table for 011011. If the parse fails, you must clearly state in terms of the operation of the finite state machine why it fails. Do not forget to include the parse (partial parse) tree.

Parse Table

		Next Token
Exposed Symbol		0	1
(State)	S	VQ	QU
	VQ	QVZ	QU
	QU	VQ	QUV
	QVZ	QVZ	QUZ
	QUZ	QVZ	QUZ

Hint Start String

S 01101101