State stack	INPUT	PRODUCTION
	real p,q,r
real	p,q,r
T	p,q,r	T real
Tp	,q,r
TL	,q,r	L id
TL,	q,r
TL,q	,r
TL	,r	L L,id
TL,	r
TL,r	-
TL	-	L L,id
D	-	D TL

Every time a string is reduced to L, T.val is just below it on the stack

Ignoring the actions in the translation scheme given in the previous slide, the sequence of the moves made by the parser on the given input have been given here.