Interpreter

Start of Interpreter for program P2.tri at Sun Sep 28 14:06:58 2003
Program
# F:=1
I:=0
M1: I:=(I+1)
IF (I>5) THEN GOTO M2
F:=(F*I)
GOTO M1
M2: F:=F#
Parsing tree
root
:=
F 1
:=
I 0
label
M1
:=
I +
I 1
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
label
M2
:=
F F
Table of constants
c1=1 c2=0 c3=5
Table of identifiers
i1=F i2=I i3=M1 i4=M2

label 'M1' is address of the operator {omistamine} (00481A70)
label 'M2' is address of the operator {omistamine} (00481890)
Modified tree
root
:=
F 1
:=
I 0
:=
I +
I 1
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

Stack id F=0

Stack id F=0 const=1
interpreting the operator F:=1
:=
F 1
:=
I 0
:=
I +
I 1
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

F:=1

Stack

Stack id I=0

Stack id I=0 const=0
interpreting the operator I:=0
:=
I 0
:=
I +
I 1
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

I:=0

Stack
M1:
Stack id I=0

Stack id I=0 id I=0

Stack id I=0 id I=0 const=1
interpreting the operator (I+1)
+
I 1

1 = 0 + 1

Stack id I=0 tm=1
interpreting the operator I:=(I+1)
:=
I +
I 1
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

I:=1

Stack

Stack id I=1

Stack id I=1 const=5
interpreting the operator (I>5)
>
I 5

1 > 5 ?

Stack tm=0
interpreting the operator IF (I>5) THEN
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

Stack id F=1

Stack id F=1 id F=1

Stack id F=1 id F=1 id I=1
interpreting the operator (F*I)
*
F I

1 = 1 * 1

Stack id F=1 tm=1
interpreting the operator F:=(F*I)
:=
F *
F I
GOTO
label
M1
:=
F F

F:=1

Stack

Stack M1:
interpreting the operator M1:
label
M1

Stack M1:
interpreting the operator GOTO M1
GOTO
label
M1
:=
F F
goto M1
M1:
Stack id I=1

Stack id I=1 id I=1

Stack id I=1 id I=1 const=1
interpreting the operator (I+1)
+
I 1

2 = 1 + 1

Stack id I=1 tm=2
interpreting the operator I:=(I+1)
:=
I +
I 1
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

I:=2

Stack

Stack id I=2

Stack id I=2 const=5
interpreting the operator (I>5)
>
I 5

2 > 5 ?

Stack tm=0
interpreting the operator IF (I>5) THEN
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

Stack id F=1

Stack id F=1 id F=1

Stack id F=1 id F=1 id I=2
interpreting the operator (F*I)
*
F I

2 = 1 * 2

Stack id F=1 tm=2
interpreting the operator F:=(F*I)
:=
F *
F I
GOTO
label
M1
:=
F F

F:=2

Stack

Stack M1:
interpreting the operator M1:
label
M1

Stack M1:
interpreting the operator GOTO M1
GOTO
label
M1
:=
F F
goto M1
M1:
Stack id I=2

Stack id I=2 id I=2

Stack id I=2 id I=2 const=1
interpreting the operator (I+1)
+
I 1

3 = 2 + 1

Stack id I=2 tm=3
interpreting the operator I:=(I+1)
:=
I +
I 1
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

I:=3

Stack

Stack id I=3

Stack id I=3 const=5
interpreting the operator (I>5)
>
I 5

3 > 5 ?

Stack tm=0
interpreting the operator IF (I>5) THEN
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

Stack id F=2

Stack id F=2 id F=2

Stack id F=2 id F=2 id I=3
interpreting the operator (F*I)
*
F I

6 = 2 * 3

Stack id F=2 tm=6
interpreting the operator F:=(F*I)
:=
F *
F I
GOTO
label
M1
:=
F F

F:=6

Stack

Stack M1:
interpreting the operator M1:
label
M1

Stack M1:
interpreting the operator GOTO M1
GOTO
label
M1
:=
F F
goto M1
M1:
Stack id I=3

Stack id I=3 id I=3

Stack id I=3 id I=3 const=1
interpreting the operator (I+1)
+
I 1

4 = 3 + 1

Stack id I=3 tm=4
interpreting the operator I:=(I+1)
:=
I +
I 1
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

I:=4

Stack

Stack id I=4

Stack id I=4 const=5
interpreting the operator (I>5)
>
I 5

4 > 5 ?

Stack tm=0
interpreting the operator IF (I>5) THEN
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

Stack id F=6

Stack id F=6 id F=6

Stack id F=6 id F=6 id I=4
interpreting the operator (F*I)
*
F I

24 = 6 * 4

Stack id F=6 tm=24
interpreting the operator F:=(F*I)
:=
F *
F I
GOTO
label
M1
:=
F F

F:=24

Stack

Stack M1:
interpreting the operator M1:
label
M1

Stack M1:
interpreting the operator GOTO M1
GOTO
label
M1
:=
F F
goto M1
M1:
Stack id I=4

Stack id I=4 id I=4

Stack id I=4 id I=4 const=1
interpreting the operator (I+1)
+
I 1

5 = 4 + 1

Stack id I=4 tm=5
interpreting the operator I:=(I+1)
:=
I +
I 1
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

I:=5

Stack

Stack id I=5

Stack id I=5 const=5
interpreting the operator (I>5)
>
I 5

5 > 5 ?

Stack tm=0
interpreting the operator IF (I>5) THEN
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

Stack id F=24

Stack id F=24 id F=24

Stack id F=24 id F=24 id I=5
interpreting the operator (F*I)
*
F I

120 = 24 * 5

Stack id F=24 tm=120
interpreting the operator F:=(F*I)
:=
F *
F I
GOTO
label
M1
:=
F F

F:=120

Stack

Stack M1:
interpreting the operator M1:
label
M1

Stack M1:
interpreting the operator GOTO M1
GOTO
label
M1
:=
F F
goto M1
M1:
Stack id I=5

Stack id I=5 id I=5

Stack id I=5 id I=5 const=1
interpreting the operator (I+1)
+
I 1

6 = 5 + 1

Stack id I=5 tm=6
interpreting the operator I:=(I+1)
:=
I +
I 1
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

I:=6

Stack

Stack id I=6

Stack id I=6 const=5
interpreting the operator (I>5)
>
I 5

6 > 5 ?

Stack tm=1
interpreting the operator IF (I>5) THEN
IF
>
I 5
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F

Stack

Stack M2:
interpreting the operator M2:
label
M2

Stack M2:
interpreting the operator GOTO M2
GOTO
label
M2
:=
F *
F I
GOTO
label
M1
:=
F F
goto M2
M2:
Stack id F=120

Stack id F=120 id F=120
interpreting the operator F:=F
:=
F F

F:=120

Stack
program P2.tri is completed
THE VARIABLES:
F=120
I=6
Interpreter ended at Sun Sep 28 14:06:58 2003