10 '***************MATCHMEM*******************
15 '            By Tony Stevens.
20 PRINT CHR$(26)
30 DEFINT A-Z
40 INPUT "INPUT HEX NUMBER TO BE FOUND IN MEMORY    ",C$
50 B$="&H"
60 C=VAL(B$+C$)
70 IF C>&HFF THEN PRINT CHR$(26):PRINT "VALUE MUST NOT EXCEED FF(HEX)":PRINT:PRINT:GOTO 40
80 PRINT CHR$(26)
90 PRINT "                    AREA OF MEMORY TO BE SEARCHED"
100 PRINT
110 INPUT "       MINIMUM LOCATION (HEX)    ",MIN$
120 MIN=VAL(B$+MIN$)
130 PRINT
140 INPUT "       MAXIMUM LOCATION (HEX)    ",MAX$
150 MAX=VAL(B$+MAX$)
160 PRINT CHR$(26)
170 PRINT"MEMORY ADDRESSES BETWEEN ";MIN$;" AND ";MAX$;" CONTAINING THE HEX VALUE ";C$
180 PRINT
190 N=MIN
200 M=PEEK (N)
210 IF M=C THEN PRINT HEX$(N),
220 N=N+1
230 IF N=MAX THEN END
240 GOTO 200