Implement TV algorithm for validating equivalence of the programs of target grammar of Lab1.
Input would be two programs and result should be 
  true - programs are equal
  false - programs are not equal
  failed - TV can't handle the given input
Following sample examples are given for which the implementation can be tested.

Assume that precondition is that the machine-states are same in begining. The programs are equal 
if register r0 contains same values on both sides (ignore other registers).

1.
mov r1 0;
L1: add r1 1;
cmp r1 r2;
jl L1;
mov r0 r1;
-------
mov r1 0;
L1: add r1 1;
cmp r1 r2;
jl L1;
mov r0 r1;

2.
mov r0 0;
L1: add r0 1;
cmp r0 r2;
jl L1;
-------
mov r1 0;
L1: add r1 1;
cmp r1 r2;
jl L1;
mov r0 r1;

3.
mov r1 0;
L0: cmp r1 r2;
jl L1;
jmp L2;
L1: add r1 1;
jmp L0;
L2: mov r0 r1;
-------
mov r1 0;
L0: cmp r1 r2;
jl L1;
jmp L2;
L1: add r1 1;
jmp L0;
L2: mov r0 r1;

4.
mov r0 0;
L1: add r0 1;
cmp r0 r2;
jl L1;
-------
mov r0 0;
L1: add r0 20000;
add r0 -19999;
cmp r0 r2;
jl L1;

5.
mov r0 0;
L1: add r0 1;
cmp r0 r2;
jl L1;
L2: add r0 2;
cmp r0 r3;
jl L2;
-------
mov r0 0;
L1: add r0 1;
cmp r0 r2;
jl L1;
L2: add r0 2;
cmp r0 r3;
jl L2;

6.
mov r0 0;
L1: add r0 1;
cmp r0 r2;
jl L1;
-------
mov r1 0;
L1: add r1 1;
cmp r1 r2;
jl L1;

7.
mov r1 0;
L1: add r1 1;
cmp r1 r2;
jl L1;
-------
mov r1 0;
L1: add r1 2;
cmp r1 r2;
jl L1;

8.
mov r0 0;
L1: add r0 1;
cmp r0 r2;
jl L1;
-------
mov r1 0;
L1: add r1 1;
cmp r1 r3;
jl L1;


9.
cmp r1 r2;
jl L1;
L1: mov r3 100;
jmp L2;
mov r3 200;
L2: mov r0 r3;
------
cmp r1 r2;
jl L1;
L1: mov r3 0;
jmp L2;
mov r3 100;
L2: mov r0 r3;
add r0 100;

10.
cmp r1 r2;
jl L1;
L1: mov r3 100;
jmp L2;
mov r3 100;
L2: mov r0 r3;
-----
mov r0 100;

11.

mov r0 0;
L1: add r0 1;
cmp r0 r2;
jl L1;
L2: add r0 2;
cmp r0 r2;
jl L2;
-------
mov r0 0;
L1: add r0 2;
cmp r0 r2;
jl L1;
L2: add r0 1;
cmp r0 r2;
jl L2;