The Program below is written in V language to check for errors, evaluate and print out P and R

$.$

$$

START

INTEGER M

$,$

$$N

$,$

$$K

$,$

$$P

$,$

$$R

$,$

$$H

$,$

$|$

$,$

$$g

$,$

$$k

$,$

$$m

READ M

$,$

$$N

$,$

$$K

ASSIGN N

$=$

$$M

$-$

$/$

$$K

READ g

$,$

$$H

$,$

$|$

$,$

$$m

P

$=$

$$g

$/$

H

$-$

l

$+$

m

$*$

N

$/$

k

R

$=$

$$M

$+$

N

$/$

K

WRITE P

STOP

The Grammar and Production rules:

EE Rule

$1$

$($

R

$1$

$)$

$$

E

$>$

$|$

E

$+$

E

$|$

E

$/$

E

$|$

E

$*$

E

$|$

E

$+$

E

$|$

$$R

$2$

$$E

$>$

$|$

E

$1$

$]$

E

$2$

$/$

E

$3$

$]$

$.$

$.$

$.$

$|$

E

$2$

$6$

$|$

$$R

$3$

$[$

E

$1$

$|$

E

$2$

$|$

E

$3$

$|$

$.$

$.$

$.$

$|$

E

$2$

$6$

$]$

J

$>$

$\{$

JA

$|$

B

$|$

C

$|$

$.$

$.$

$.$

$]$

Z

$|$

alb

$]$

c

$]$

$.$

$.$

$.$

$|$

z

$]$

$\}$

$$R

$4$

$$

Note the following additional conditions in the above program:

e Words in capital letters are Keywords

e Words in small letters are Identifiers. Words in single letters from A

$$

$$Z and a to z are also Identifiers

e

$+$

$,$

$-$

$,$

$/$

$,$

$*$

$$are Operators

e Equals

$=$

$,$

$$and semi colon ; are Symbols

e Any string

$/$

line must contain: Keywords, Identifiers, Operators, or Symbols

e Symbols such as:

$\%$

$,$

$

$,$

$$&

$,$

$<$

$,$

$>$

$,$

; not allowed and would give Semantic error

e Two operators must not be combined such as:

$+$

$*$

$$not allowed and would give Syntax error,

same with other operators that are combined, for example

$-$

$/$

$,$

$*$

$/$

$,$

$*$

$+$

$$

e Semi colon ; at the end of a line not allowed and would give Syntax error

e Numbers

$0$

$,$

$1$

$$to

$9$

$$are not allowed and would give Syntax error

e The acceptable keywords are: INTEGER, ASSIGN, READ, WRITE, START, STOP.

e Misspelling in the keywords such as: WRITEE not allowed and would give Lexical error

e Any other character on the keyboard different from all the above will give Syntax error.

e Note that text with yellow background in the above program have errors

$($

$1$

$)$

$$Write a Java program that will go through the following stages of compiler to translate the

above program

$($

iteratively

$)$

$-$

$$line by line.

$($

$2$

$)$

$$Write a Java program that will go through the following stages of compiler to translate the

above program

$($

iteratively

$)$

$$

$$all at once.

Note: Only lines

$6$

$$and

$7$

$$should go through all the seven

$($

$7$

$)$

$$stages of compiler:

P

$=$

g

$/$

H

$-$

ltm

$*$

N

$/$

k

$$

$$and R

$=$

$$M

$+$

N

$/$

K

The other lines should just check for errors and report the error

$($

if any

$)$

OUR SEVEN STAGES OF COMPILER

$1$

$)$

$$Lexical Analysis

$($

Scanner

$)$

$$

$2$

$)$

$$Syntax Analysis

$($

Parser

$)$

$$

$3$

$)$

$$Semantic Analysis

$($

Syntactic Analysis

$)$

$$

$4$

$)$

$$Intermediate Code Representation

$($

ICR

$)$

$$

$5$

$)$

$$Code Generation

$($

CG

$)$

$$

$6$

$)$

$$Code Optimization

$($

CO

$)$

$$

$7$

$)$

$$Target Machine code

$($

TMC

$)$

$$in Binary

Give me the full code in java

The output should follow the same concept like the one below

STAGE $1$: COMPILER TECHNIQUES$-->$ LEXICAL ANALYSIS$-$Scanner

SYMBOL TABLE COMPRISING ATTRIBUTES AND TOKENS:

TOKEN#$1$ D identifier

TOKEN#$2/$ Operator

TOKEN#$3$ A identifier

TOKEN#$4*$ Operator

TOKEN#$5$ F identifier

TOKEN#$6-$ Operator

TOKEN#$7$ B identifier

TOKEN#$8+$ Operator

TOKEN#$9$ C identifier

Total number of Tokens: $9$

STAGE $2$: COMPILER TECHNIQUES$-->$ SYNTAX ANALYSIS$-$Parser

INPUT STRING: D$/$A$*$F$-$B$+$C D$=4,$ A$=1,$ F$=6,$ B$=2,$ C$=3$

$2$

INPUT STRING: D$/$A$*$F$-$B$+$C

The Grammar and Production rules:

E$$E Rule$1($R$1)$

E$|$E$+$E$|$E$/$E$|$E$*$E$|$E$-$E$|$ R$2$

E$|$E$1|$E$2|$E$3|...|$E$26|$ R$3$

$[$E$1|$E$2|$E$3|...|$E$26|]\{|$A$|$B$|$C$|...|$Z$|$a$|$b$|$c$|...|$z$|\}$ R$4$

HENCE THE DERIVATION $=$

E$$E R$1$

E$$E$/$E R$2$

E$$E$/$E$*$E R$2$

E$$E$/$E$*$E$-$E R$2$

E$$E$/$E$*$E$-$E$+$E R$2$

E$$E$4/$E$*$E$-$E$+$E R$3$

E$$E$4/$E$1*$E$-$E$+$E R$3$

E$$E$4/$E$1*$E$6-$E$+$E R$3$

E$$E$4/$E$1*$E$6-$E$2+$E R$3$

E$$E$4/$E$1*$E$6-$E$2+$E$3$ R$3$

E$$D$/$E$1*$E$6-$E$2+$E$3$ R$4$

E$$D$/$A$*$E$6-$E$2+$E$3$ R$4$

E$$D$/$A$*$F$-$E$2+$E$3$ R$4$

E$$D$/$A$*$F$-$B$+$E$3$ R$4$

E$$D$/$A$*$F$-$B$+$C R$4$ The final string

STAGE $3$: COMPILER TECHNIQUES$-->$ SEMANTIC ANALYSIS

CONCLUSION$-->$This expression: D$/$A$*$F$-$B$+$C is Syntactically and

Semantically correct.

STAGE $4$: INTERMEDIATE CODE REPRESENTATION $($ICR$)$

INPUT STRING: D$/$A$*$F$-$B$+$C

WE USE BEDMAS

TEMPORARY VARIABLES: WE USE: T$1,$ T$2,$ T$3,$ T$4,$ T$5$

T$1=$ D$/$A

T$2=$ T$1*$F

T$3=$ B$+$C

T$4=$ T$2-$T$3$

$3$

STAGE $5$: CODE GENERATION $($CG$)$ WE USE: LDA, MUL, ADD, SUB, STR$,$

INPUT STRING: D$/$A$*$F$-$B$+$C

LDA D

DIV A

STR T$1$

LDA T$1$

MUL F

STR T$2$

LDA B

ADD F

STR T$3$

LDA T$2$

SUB T$3$

STR T$4$

STAGE $6$: CODE OPTIMISATION $($CO$)$ WE USE: LDA, MUL, ADD, SUB, STR$,$

INPUT STRING: D$/$A$*$F$-$B$+$C

DIV T$1,$ A$,$ D

MUL T$2,$ T$1,$ F

ADD T$3,$ B$,$ C

SUB T$4,$ T$2,$ T$3$

STAGE $7$: TARGET MACHINE CODE IN BINARY

INPUT STRING: D$/$A$*$F$-$B$+$C