=> analyzing "a+b*c" against the following grammar:

	e -> t e'
	e'-> + t e' | $ 
	t -> f t' 
	t'-> * f t' | $
	f -> (e) | id 

Input		step#	production		Stack (top is left)
==============	=====	=================	===================
a+b*c$		1	init			[e, $]
a+b*c$		2	PROD_EXPRESSION		[t, e', $]
a+b*c$		3	PROD_TERM		[f, t', e', $]
a+b*c$		4	PROD_FACTOR		[id, t', e', $]
+b*c$		5	accept			[t', e', $]
+b*c$		6	PROD_FACTOR		[eps, e', $]
+b*c$		7	PROD_EPSILON		[e', $]
+b*c$		8	PROD_EXPRESSION_P	[+, t, e', $]
b*c$		9	accept			[t, e', $]
b*c$		10	PROD_TERM		[f, t', e', $]
b*c$		11	PROD_FACTOR		[id, t', e', $]
*c$		12	accept			[t', e', $]
*c$		13	PROD_TERM_P		[*, f, t', e', $]
c$		14	accept			[f, t', e', $]
c$		15	PROD_FACTOR		[id, t', e', $]
$		16	accept			[t', e', $]
$		17	PROD_FACTOR		[eps, e', $]
$		18	PROD_EPSILON		[e', $]
$		19	PROD_FACTOR		[eps, $]
$		20	PROD_EPSILON		[$]

=> No errors found when parsing `a+b*c' against the given grammar