Compiler Design - Parsing

Task

Generate Lexeme Analysis and Syntax Analysis on the following items:

X := (a+b+c+d)+e

Lexical Analysis

Lexeme	Token
identifier	X
assignment	:=
grouping	(
identifier	a
operator	+
identifier	b
operator	+
identifier	c
operator	+
identifier	d
grouping	)
operator	+
identifier	e

Syntax Analysis

Y:= (a-b) + (c-d-e) + f

Lexical Analysis

Lexeme	Token
identifier	Y
assignment	:=
grouping	(
identifier	a
operator	-
identifier	b
grouping	)
operator	+
grouping	(
identifier	c
operator	-
identifier	d
operator	-
identifier	e
grouping	)
operator	+
identifier	f

Syntax Analysis

A := (x*y*z)*(c-d-e-f)*g*h

Lexical Analysis

Lexeme	Token
identifier	A
assignment	:=
grouping	(
identifier	x
operator	*
identifier	y
operator	*
identifier	z
grouping	)
operator	*
grouping	(
identifier	c
operator	-
identifier	d
operator	-
identifier	e
operator	-
identifier	f
grouping	)
operator	*
identifier	g
operator	*
identifier	h

Syntax Analysis

X := (a*(b-d-e)*f)+(h-i-j-k)

Lexical Analysis

Lexeme	Token
identifier	X
assignment	:=
grouping	(
identifier	a
operator	*
grouping	(
identifier	b
operator	-
identifier	d
operator	-
identifier	e
grouping	)
operator	*
identifier	f
grouping	)
operator	+
grouping	(
identifier	h
operator	-
identifier	i
operator	-
identifier	j
operator	-
identifier	k
grouping	)

Syntax Analysis

Y := a-b-c-d-e

Lexical Analysis

Lexeme	Token
identifier	Y
assignment	:=
identifier	a
operator	-
identifier	b
operator	-
identifier	c
operator	-
identifier	d
operator	-
identifier	e

Syntax Analysis