output.txt

lex files for given decription used as assignment in compiler design

	STACK		Input BUFFER		ACTION	
-----------------------------------------------
	$		(id+id)*id$		SHIFT	
	$(		id+id)*id$		SHIFT	
	$(i		d+id)*id$		SHIFT	
	$(id	+id)*id$		REDUCE	
	$(F		+id)*id$		REDUCE	
	$(T		+id)*id$		REDUCE	
	$(E		+id)*id$		SHIFT	
	$(E+	id)*id$			SHIFT	
	$(E+i	d)*id$			SHIFT	
	$(E+id	)*id$			REDUCE	
	$(E+F	)*id$			REDUCE	
	$(E+T	)*id$			REDUCE	
	$(E		)*id$			SHIFT	
	$(E)	*id$			REDUCE	
	$F		*id$			REDUCE	
	$T		*id$			SHIFT	
	$T*		id$			    SHIFT	
	$T*i	d$			    SHIFT	
	$T*id	$			    REDUCE	
	$T*F	$			    REDUCE	
	$T		$			    REDUCE	
	$E		$			    ACCEPT	


ACCEPTED