3 – 34 Programming
The modified program now looks like this:
10 REM SAMPLE 2
15 WIDTH “LPT1:”,255
20 NDOTS = 256
25 REM MAXIMUM POSSIBLE COMBINATIONS
30 LPRINT CHR$(27);CHR$(65);CHR$(8)
35 LPRINT CHR$(27);CHR$(50)
40 FOR J = 1 TO 4
45 LPRINT CHR$(27);CHR$(75);CHR$(NDOTS MOD 256);
CHR$(FIX (NDOTS/256));
50 REM START GRAPHICS 256 COLUMNS
55 FOR I=0 TO NDOTS-1
60 LPRINT CHR$(I);
65 NEXT I
70 LPRINT : REM LINE FEED
75 NEXT J
The result looks like this:
To Next Page
Loading...
