/tsuiteyour.frt

https://bitbucket.org/avanderhorst/yourforth · Forth · 969 lines · 812 code · 155 blank · 2 comment · 1 complexity · 6bf692aebc742c222437fba78033cbaa MD5 · raw file

  1. 'NOOP 'OK 3 CELLS MOVE
  2. \ AH This is based on something from MHX.
  3. \ Modifications have to do with where Hayce moves the interpret
  4. \ pointer to the end or begin of the input buffer
  5. \ ciforth uses PP instead of >IN
  6. \ The jump out of a BEGIN loop, is refused with _SECURITY_( _yes )
  7. \ so NO-SECURITY is invoked.
  8. \ ==================================================================
  9. \ This is the ISO compatibility layer, to be phased out
  10. HEX
  11. "RDROP" (CREATE)
  12. 8D C, 6D C, 04 C, \ LEA EBP,[EBP+(CW*(1))]
  13. AD C, \ LODSD ; NEXT
  14. FF C, 20 C, \ JMP LONG[EAX]
  15. : LEAVE RDROP RDROP RDROP ;
  16. \ FIXME! This definition is terribly wrong, but it helps out.
  17. : D+ SDSWAP + >R + R> ;
  18. : ( PP@@ 2DROP &) PARSE 2DROP ; IMMEDIATE
  19. DECIMAL
  20. \ Reasonable additions.
  21. : TRUE -1 ;
  22. : SOURCE SRC 2@ SWAP OVER - ;
  23. \ Words used in the preambule of the Hayes test.
  24. \ Words actually used in the Hayes test.
  25. : >NUMBER
  26. 2DUP + >R 0 2DUP - IF
  27. DO
  28. DUP C@ DIGIT IF DROP LEAVE THEN
  29. SWAP >R SWAP BASE @ M* DROP SDSWAP BASE @ M* D+ R> 1+
  30. LOOP
  31. ELSE
  32. 2DROP
  33. THEN
  34. R> OVER - ;
  35. : 1- 1 - ;
  36. : 2/ DUP 0< 31 RSHIFT 31 LSHIFT SWAP 1 RSHIFT OR ;
  37. : S>D DUP 0< ;
  38. \ ==================================================================
  39. \ This is based on a testsuite of
  40. \ (C) 1993 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
  41. \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
  42. \ VERSION 1.0
  43. \ It has the test for words replaced by tests for
  44. \ the equivalent words in yourforth
  45. HEX
  46. \ SET THE FOLLOWING FLAG TO TRUE FOR MORE VERBOSE OUTPUT; THIS MAY
  47. \ ALLOW YOU TO TELL WHICH TEST CAUSED YOUR SYSTEM TO HANG.
  48. VARIABLE VERBOSE
  49. TRUE VERBOSE !
  50. \ FALSE VERBOSE !
  51. : EMPTY-STACK CLS ; \ ( ... -- ) EMPTY STACK.
  52. ' ERROR HIDDEN
  53. : ERROR \ ( C-ADDR U -- ) DISPLAY AN ERROR MESSAGE FOLLOWED BY
  54. \ THE LINE THAT HAD THE ERROR.
  55. TYPE ( SOURCE TYPE ) CR \ DISPLAY LINE CORRESPONDING TO ERROR
  56. EMPTY-STACK \ THROW AWAY EVERY THING ELSE
  57. ;
  58. VARIABLE ACTUAL-DEPTH \ STACK RECORD
  59. CREATE ACTUAL-RESULTS 20 CELLS ALLOT
  60. : { \ ( -- ) SYNTACTIC SUGAR.
  61. \ SOURCE TYPE CR \ DISPLAY LINE CORRESPONDING TO TEST
  62. \ PP @ SRC CELL+ @ OVER - 0A $/ TYPE CR 2DROP
  63. ( #LINES @ CR DEC. ) ; \ If your system has #LINES DEC.
  64. : -> \ ( ... -- ) RECORD DEPTH AND CONTENT OF STACK.
  65. DEPTH DUP ACTUAL-DEPTH ! \ RECORD DEPTH
  66. DUP IF \ IF THERE IS SOMETHING ON STACK
  67. 0 DO ACTUAL-RESULTS I CELLS + ! LOOP \ SAVE THEM
  68. ELSE DROP THEN ;
  69. : } \ ( ... -- ) COMPARE STACK (EXPECTED) CONTENTS WITH SAVED
  70. \ (ACTUAL) CONTENTS.
  71. DEPTH ACTUAL-DEPTH @ = IF \ IF DEPTHS MATCH
  72. DEPTH DUP IF \ IF THERE IS SOMETHING ON THE STACK
  73. 0 DO \ FOR EACH STACK ITEM
  74. ACTUAL-RESULTS I CELLS + @ \ COMPARE ACTUAL WITH EXPECTED
  75. <> IF "INCORRECT RESULT: " ERROR LEAVE THEN
  76. LOOP
  77. ELSE DROP THEN
  78. ELSE \ DEPTH MISMATCH
  79. "WRONG NUMBER OF RESULTS: " ERROR
  80. THEN ;
  81. : TESTING \ ( -- ) TALKING COMMENT.
  82. POSTPONE \
  83. VERBOSE @ IF SOURCE TYPE CR THEN
  84. ;
  85. \ (C) 1993 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
  86. \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
  87. \ VERSION 1.0
  88. \ THIS PROGRAM TESTS THE CORE WORDS OF AN ANS FORTH SYSTEM.
  89. \ THE PROGRAM ASSUMES A TWO'S COMPLEMENT IMPLEMENTATION WHERE
  90. \ THE RANGE OF SIGNED NUMBERS IS -2^(N-1) ... 2^(N-1)-1 AND
  91. \ THE RANGE OF UNSIGNED NUMBER IS 0 ... 2^(N)-1.
  92. \ I HAVEN'T FIGURED OUT HOW TO TEST KEY, QUIT, ABORT, OR ABORT"...
  93. \ I ALSO HAVEN'T THOUGHT OF A WAY TO TEST ENVIRONMENT?...
  94. TESTING CORE WORDS
  95. HEX
  96. \ ------------------------------------------------------------------------
  97. TESTING BOOLEANS: INVERT AND OR XOR
  98. { 0 0 AND -> 0 }
  99. { 0 1 AND -> 0 }
  100. { 1 0 AND -> 0 }
  101. { 1 1 AND -> 1 }
  102. { 0 INVERT 1 AND -> 1 }
  103. { 1 INVERT 1 AND -> 0 }
  104. 0 CONSTANT 0S
  105. 0 INVERT CONSTANT 1S
  106. { 0S INVERT -> 1S }
  107. { 1S INVERT -> 0S }
  108. { 0S 0S AND -> 0S }
  109. { 0S 1S AND -> 0S }
  110. { 1S 0S AND -> 0S }
  111. { 1S 1S AND -> 1S }
  112. { 0S 0S OR -> 0S }
  113. { 0S 1S OR -> 1S }
  114. { 1S 0S OR -> 1S }
  115. { 1S 1S OR -> 1S }
  116. { 0S 0S XOR -> 0S }
  117. { 0S 1S XOR -> 1S }
  118. { 1S 0S XOR -> 1S }
  119. { 1S 1S XOR -> 0S }
  120. \ ------------------------------------------------------------------------
  121. TESTING LSHIFT RSHIFT
  122. : FIND-MSB
  123. 1 BEGIN DUP 1 LSHIFT WHILE 1 LSHIFT REPEAT ;
  124. FIND-MSB CONSTANT MSB
  125. { 1 0 LSHIFT -> 1 }
  126. { 1 1 LSHIFT -> 2 }
  127. { 1 2 LSHIFT -> 4 }
  128. { 1 F LSHIFT -> 8000 } \ BIGGEST GUARANTEED SHIFT
  129. { 0 INVERT 1 LSHIFT 1 XOR -> 0 INVERT }
  130. { MSB 1 LSHIFT -> 0 }
  131. { 1 0 RSHIFT -> 1 }
  132. { 1 1 RSHIFT -> 0 }
  133. { 2 1 RSHIFT -> 1 }
  134. { 4 2 RSHIFT -> 1 }
  135. { 8000 F RSHIFT -> 1 } \ BIGGEST
  136. { MSB 1 RSHIFT MSB AND -> 0 } \ RSHIFT ZERO FILLS MSBS
  137. { MSB 1 RSHIFT 1 LSHIFT -> MSB }
  138. \ ------------------------------------------------------------------------
  139. TESTING COMPARISONS: 0= = 0< < > MIN MAX
  140. 0 INVERT CONSTANT MAX-UINT
  141. 0 INVERT 1 RSHIFT CONSTANT MAX-INT
  142. 0 INVERT 1 RSHIFT INVERT CONSTANT MIN-INT
  143. 0 INVERT 1 RSHIFT CONSTANT MID-UINT
  144. 0 INVERT 1 RSHIFT INVERT CONSTANT MID-UINT+1
  145. 0S CONSTANT <FALSE>
  146. 1S CONSTANT <TRUE>
  147. { -> } \ START WITH CLEAN SLATE
  148. { 0 0= -> <TRUE> }
  149. { 1 0= -> <FALSE> }
  150. { 2 0= -> <FALSE> }
  151. { -1 0= -> <FALSE> }
  152. { MAX-UINT 0= -> <FALSE> }
  153. { MIN-INT 0= -> <FALSE> }
  154. { MAX-INT 0= -> <FALSE> }
  155. { 0 0 = -> <TRUE> }
  156. { 1 1 = -> <TRUE> }
  157. { -1 -1 = -> <TRUE> }
  158. { 1 0 = -> <FALSE> }
  159. { -1 0 = -> <FALSE> }
  160. { 0 1 = -> <FALSE> }
  161. { 0 -1 = -> <FALSE> }
  162. { 0 0< -> <FALSE> }
  163. { -1 0< -> <TRUE> }
  164. { MIN-INT 0< -> <TRUE> }
  165. { 1 0< -> <FALSE> }
  166. { MAX-INT 0< -> <FALSE> }
  167. { 0 1 < -> <TRUE> }
  168. { 1 2 < -> <TRUE> }
  169. { -1 0 < -> <TRUE> }
  170. { -1 1 < -> <TRUE> }
  171. { MIN-INT 0 < -> <TRUE> }
  172. { MIN-INT MAX-INT < -> <TRUE> }
  173. { 0 MAX-INT < -> <TRUE> }
  174. { 0 0 < -> <FALSE> }
  175. { 1 1 < -> <FALSE> }
  176. { 1 0 < -> <FALSE> }
  177. { 2 1 < -> <FALSE> }
  178. { 0 -1 < -> <FALSE> }
  179. { 1 -1 < -> <FALSE> }
  180. { 0 MIN-INT < -> <FALSE> }
  181. { MAX-INT MIN-INT < -> <FALSE> }
  182. { MAX-INT 0 < -> <FALSE> }
  183. { 0 1 > -> <FALSE> }
  184. { 1 2 > -> <FALSE> }
  185. { -1 0 > -> <FALSE> }
  186. { -1 1 > -> <FALSE> }
  187. { MIN-INT 0 > -> <FALSE> }
  188. { MIN-INT MAX-INT > -> <FALSE> }
  189. { 0 MAX-INT > -> <FALSE> }
  190. { 0 0 > -> <FALSE> }
  191. { 1 1 > -> <FALSE> }
  192. { 1 0 > -> <TRUE> }
  193. { 2 1 > -> <TRUE> }
  194. { 0 -1 > -> <TRUE> }
  195. { 1 -1 > -> <TRUE> }
  196. { 0 MIN-INT > -> <TRUE> }
  197. { MAX-INT MIN-INT > -> <TRUE> }
  198. { MAX-INT 0 > -> <TRUE> }
  199. { 0 1 MIN -> 0 }
  200. { 1 2 MIN -> 1 }
  201. { -1 0 MIN -> -1 }
  202. { -1 1 MIN -> -1 }
  203. { MIN-INT 0 MIN -> MIN-INT }
  204. { MIN-INT MAX-INT MIN -> MIN-INT }
  205. { 0 MAX-INT MIN -> 0 }
  206. { 0 0 MIN -> 0 }
  207. { 1 1 MIN -> 1 }
  208. { 1 0 MIN -> 0 }
  209. { 2 1 MIN -> 1 }
  210. { 0 -1 MIN -> -1 }
  211. { 1 -1 MIN -> -1 }
  212. { 0 MIN-INT MIN -> MIN-INT }
  213. { MAX-INT MIN-INT MIN -> MIN-INT }
  214. { MAX-INT 0 MIN -> 0 }
  215. { 0 1 MAX -> 1 }
  216. { 1 2 MAX -> 2 }
  217. { -1 0 MAX -> 0 }
  218. { -1 1 MAX -> 1 }
  219. { MIN-INT 0 MAX -> 0 }
  220. { MIN-INT MAX-INT MAX -> MAX-INT }
  221. { 0 MAX-INT MAX -> MAX-INT }
  222. { 0 0 MAX -> 0 }
  223. { 1 1 MAX -> 1 }
  224. { 1 0 MAX -> 1 }
  225. { 2 1 MAX -> 2 }
  226. { 0 -1 MAX -> 0 }
  227. { 1 -1 MAX -> 1 }
  228. { 0 MIN-INT MAX -> 0 }
  229. { MAX-INT MIN-INT MAX -> MAX-INT }
  230. { MAX-INT 0 MAX -> MAX-INT }
  231. \ ------------------------------------------------------------------------
  232. TESTING STACK OPS: 2DROP 2DUP 2OVER 2SWAP DEPTH DROP DUP OVER SDSWAP SWAP
  233. { 1 2 2DROP -> }
  234. { 1 2 2DUP -> 1 2 1 2 }
  235. { 1 2 3 4 2OVER -> 1 2 3 4 1 2 }
  236. { 1 2 3 4 2SWAP -> 3 4 1 2 }
  237. { DEPTH -> 0 }
  238. { 0 DEPTH -> 0 1 }
  239. { 0 1 DEPTH -> 0 1 2 }
  240. { 0 DROP -> }
  241. { 1 2 DROP -> 1 }
  242. { 1 DUP -> 1 1 }
  243. { 1 2 OVER -> 1 2 1 }
  244. { 1 2 3 SDSWAP -> 2 3 1 }
  245. { 1 2 SWAP -> 2 1 }
  246. \ ------------------------------------------------------------------------
  247. TESTING >R R> R@
  248. { : GR1 >R R> ; -> }
  249. { : GR2 >R R@ R> DROP ; -> }
  250. { 123 GR1 -> 123 }
  251. { 123 GR2 -> 123 }
  252. \ ------------------------------------------------------------------------
  253. TESTING ADD/SUBTRACT: + - 1+ ABS NEGATE
  254. { 0 5 + -> 5 }
  255. { 5 0 + -> 5 }
  256. { 0 -5 + -> -5 }
  257. { -5 0 + -> -5 }
  258. { 1 2 + -> 3 }
  259. { 1 -2 + -> -1 }
  260. { -1 2 + -> 1 }
  261. { -1 -2 + -> -3 }
  262. { -1 1 + -> 0 }
  263. { MID-UINT 1 + -> MID-UINT+1 }
  264. { 0 5 - -> -5 }
  265. { 5 0 - -> 5 }
  266. { 0 -5 - -> 5 }
  267. { -5 0 - -> -5 }
  268. { 1 2 - -> -1 }
  269. { 1 -2 - -> 3 }
  270. { -1 2 - -> -3 }
  271. { -1 -2 - -> 1 }
  272. { 0 1 - -> -1 }
  273. { MID-UINT+1 1 - -> MID-UINT }
  274. { 0 1+ -> 1 }
  275. { -1 1+ -> 0 }
  276. { 1 1+ -> 2 }
  277. { MID-UINT 1+ -> MID-UINT+1 }
  278. { 0 NEGATE -> 0 }
  279. { 1 NEGATE -> -1 }
  280. { -1 NEGATE -> 1 }
  281. { 2 NEGATE -> -2 }
  282. { -2 NEGATE -> 2 }
  283. { 0 ABS -> 0 }
  284. { 1 ABS -> 1 }
  285. { -1 ABS -> 1 }
  286. { MIN-INT ABS -> MID-UINT+1 }
  287. \ ------------------------------------------------------------------------
  288. TESTING MULTIPLY: S>D * M*
  289. { 0 S>D -> 0 0 }
  290. { 1 S>D -> 1 0 }
  291. { 2 S>D -> 2 0 }
  292. { -1 S>D -> -1 -1 }
  293. { -2 S>D -> -2 -1 }
  294. { MIN-INT S>D -> MIN-INT -1 }
  295. { MAX-INT S>D -> MAX-INT 0 }
  296. { 0 0 M* -> 0 S>D }
  297. { 0 1 M* -> 0 S>D }
  298. { 1 0 M* -> 0 S>D }
  299. { 1 2 M* -> 2 S>D }
  300. { 2 1 M* -> 2 S>D }
  301. { 3 3 M* -> 9 S>D }
  302. { -3 3 M* -> -9 S>D }
  303. { 3 -3 M* -> -9 S>D }
  304. { -3 -3 M* -> 9 S>D }
  305. { 0 MIN-INT M* -> 0 S>D }
  306. { 1 MIN-INT M* -> MIN-INT S>D }
  307. { 2 MIN-INT M* -> 0 1S }
  308. { 0 MAX-INT M* -> 0 S>D }
  309. { 1 MAX-INT M* -> MAX-INT S>D }
  310. { 2 MAX-INT M* -> MAX-INT 1 LSHIFT 0 }
  311. { MIN-INT MIN-INT M* -> 0 MSB 1 RSHIFT }
  312. { MAX-INT MIN-INT M* -> MSB MSB 2/ }
  313. { MAX-INT MAX-INT M* -> 1 MSB 2/ INVERT }
  314. { 0 0 * -> 0 } \ TEST IDENTITIES
  315. { 0 1 * -> 0 }
  316. { 1 0 * -> 0 }
  317. { 1 2 * -> 2 }
  318. { 2 1 * -> 2 }
  319. { 3 3 * -> 9 }
  320. { -3 3 * -> -9 }
  321. { 3 -3 * -> -9 }
  322. { -3 -3 * -> 9 }
  323. { MID-UINT+1 1 RSHIFT 2 * -> MID-UINT+1 }
  324. { MID-UINT+1 2 RSHIFT 4 * -> MID-UINT+1 }
  325. { MID-UINT+1 1 RSHIFT MID-UINT+1 OR 2 * -> MID-UINT+1 }
  326. \ ------------------------------------------------------------------------
  327. TESTING DIVIDE: SM/REM */ */MOD / /MOD MOD
  328. { 0 S>D 1 SM/REM -> 0 0 }
  329. { 1 S>D 1 SM/REM -> 0 1 }
  330. { 2 S>D 1 SM/REM -> 0 2 }
  331. { -1 S>D 1 SM/REM -> 0 -1 }
  332. { -2 S>D 1 SM/REM -> 0 -2 }
  333. { 0 S>D -1 SM/REM -> 0 0 }
  334. { 1 S>D -1 SM/REM -> 0 -1 }
  335. { 2 S>D -1 SM/REM -> 0 -2 }
  336. { -1 S>D -1 SM/REM -> 0 1 }
  337. { -2 S>D -1 SM/REM -> 0 2 }
  338. { 2 S>D 2 SM/REM -> 0 1 }
  339. { -1 S>D -1 SM/REM -> 0 1 }
  340. { -2 S>D -2 SM/REM -> 0 1 }
  341. { 7 S>D 3 SM/REM -> 1 2 }
  342. { 7 S>D -3 SM/REM -> 1 -2 }
  343. { -7 S>D 3 SM/REM -> -1 -2 }
  344. { -7 S>D -3 SM/REM -> -1 2 }
  345. { MAX-INT S>D 1 SM/REM -> 0 MAX-INT }
  346. { MIN-INT S>D 1 SM/REM -> 0 MIN-INT }
  347. { MAX-INT S>D MAX-INT SM/REM -> 0 1 }
  348. { MIN-INT S>D MIN-INT SM/REM -> 0 1 }
  349. { 1S 1 4 SM/REM -> 3 MAX-INT }
  350. { 2 MIN-INT M* 2 SM/REM -> 0 MIN-INT }
  351. { 2 MIN-INT M* MIN-INT SM/REM -> 0 2 }
  352. { 2 MAX-INT M* 2 SM/REM -> 0 MAX-INT }
  353. { 2 MAX-INT M* MAX-INT SM/REM -> 0 2 }
  354. { MIN-INT MIN-INT M* MIN-INT SM/REM -> 0 MIN-INT }
  355. { MIN-INT MAX-INT M* MIN-INT SM/REM -> 0 MAX-INT }
  356. { MIN-INT MAX-INT M* MAX-INT SM/REM -> 0 MIN-INT }
  357. { MAX-INT MAX-INT M* MAX-INT SM/REM -> 0 MAX-INT }
  358. : IFSYM
  359. [ -3 2 / -1 = INVERT ] LITERAL IF POSTPONE \ THEN ;
  360. \ THE SYSTEM MIGHT DO EITHER FLOORED OR SYMMETRIC DIVISION.
  361. \ SINCE WE HAVE ALREADY TESTED M*, AND SM/REM WE CAN USE THEM IN TEST.
  362. IFSYM : T/MOD >R S>D R> SM/REM ;
  363. IFSYM : T/ T/MOD SWAP DROP ;
  364. IFSYM : TMOD T/MOD DROP ;
  365. IFSYM : T*/MOD >R M* R> SM/REM ;
  366. IFSYM : T*/ T*/MOD SWAP DROP ;
  367. { 0 1 /MOD -> 0 1 T/MOD }
  368. { 1 1 /MOD -> 1 1 T/MOD }
  369. { 2 1 /MOD -> 2 1 T/MOD }
  370. { -1 1 /MOD -> -1 1 T/MOD }
  371. { -2 1 /MOD -> -2 1 T/MOD }
  372. { 0 -1 /MOD -> 0 -1 T/MOD }
  373. { 1 -1 /MOD -> 1 -1 T/MOD }
  374. { 2 -1 /MOD -> 2 -1 T/MOD }
  375. { -1 -1 /MOD -> -1 -1 T/MOD }
  376. { -2 -1 /MOD -> -2 -1 T/MOD }
  377. { 2 2 /MOD -> 2 2 T/MOD }
  378. { -1 -1 /MOD -> -1 -1 T/MOD }
  379. { -2 -2 /MOD -> -2 -2 T/MOD }
  380. { 7 3 /MOD -> 7 3 T/MOD }
  381. { 7 -3 /MOD -> 7 -3 T/MOD }
  382. { -7 3 /MOD -> -7 3 T/MOD }
  383. { -7 -3 /MOD -> -7 -3 T/MOD }
  384. { MAX-INT 1 /MOD -> MAX-INT 1 T/MOD }
  385. { MIN-INT 1 /MOD -> MIN-INT 1 T/MOD }
  386. { MAX-INT MAX-INT /MOD -> MAX-INT MAX-INT T/MOD }
  387. { MIN-INT MIN-INT /MOD -> MIN-INT MIN-INT T/MOD }
  388. { 0 1 / -> 0 1 T/ }
  389. { 1 1 / -> 1 1 T/ }
  390. { 2 1 / -> 2 1 T/ }
  391. { -1 1 / -> -1 1 T/ }
  392. { -2 1 / -> -2 1 T/ }
  393. { 0 -1 / -> 0 -1 T/ }
  394. { 1 -1 / -> 1 -1 T/ }
  395. { 2 -1 / -> 2 -1 T/ }
  396. { -1 -1 / -> -1 -1 T/ }
  397. { -2 -1 / -> -2 -1 T/ }
  398. { 2 2 / -> 2 2 T/ }
  399. { -1 -1 / -> -1 -1 T/ }
  400. { -2 -2 / -> -2 -2 T/ }
  401. { 7 3 / -> 7 3 T/ }
  402. { 7 -3 / -> 7 -3 T/ }
  403. { -7 3 / -> -7 3 T/ }
  404. { -7 -3 / -> -7 -3 T/ }
  405. { MAX-INT 1 / -> MAX-INT 1 T/ }
  406. { MIN-INT 1 / -> MIN-INT 1 T/ }
  407. { MAX-INT MAX-INT / -> MAX-INT MAX-INT T/ }
  408. { MIN-INT MIN-INT / -> MIN-INT MIN-INT T/ }
  409. { 0 1 MOD -> 0 1 TMOD }
  410. { 1 1 MOD -> 1 1 TMOD }
  411. { 2 1 MOD -> 2 1 TMOD }
  412. { -1 1 MOD -> -1 1 TMOD }
  413. { -2 1 MOD -> -2 1 TMOD }
  414. { 0 -1 MOD -> 0 -1 TMOD }
  415. { 1 -1 MOD -> 1 -1 TMOD }
  416. { 2 -1 MOD -> 2 -1 TMOD }
  417. { -1 -1 MOD -> -1 -1 TMOD }
  418. { -2 -1 MOD -> -2 -1 TMOD }
  419. { 2 2 MOD -> 2 2 TMOD }
  420. { -1 -1 MOD -> -1 -1 TMOD }
  421. { -2 -2 MOD -> -2 -2 TMOD }
  422. { 7 3 MOD -> 7 3 TMOD }
  423. { 7 -3 MOD -> 7 -3 TMOD }
  424. { -7 3 MOD -> -7 3 TMOD }
  425. { -7 -3 MOD -> -7 -3 TMOD }
  426. { MAX-INT 1 MOD -> MAX-INT 1 TMOD }
  427. { MIN-INT 1 MOD -> MIN-INT 1 TMOD }
  428. { MAX-INT MAX-INT MOD -> MAX-INT MAX-INT TMOD }
  429. { MIN-INT MIN-INT MOD -> MIN-INT MIN-INT TMOD }
  430. { 0 2 1 */ -> 0 2 1 T*/ }
  431. { 1 2 1 */ -> 1 2 1 T*/ }
  432. { 2 2 1 */ -> 2 2 1 T*/ }
  433. { -1 2 1 */ -> -1 2 1 T*/ }
  434. { -2 2 1 */ -> -2 2 1 T*/ }
  435. { 0 2 -1 */ -> 0 2 -1 T*/ }
  436. { 1 2 -1 */ -> 1 2 -1 T*/ }
  437. { 2 2 -1 */ -> 2 2 -1 T*/ }
  438. { -1 2 -1 */ -> -1 2 -1 T*/ }
  439. { -2 2 -1 */ -> -2 2 -1 T*/ }
  440. { 2 2 2 */ -> 2 2 2 T*/ }
  441. { -1 2 -1 */ -> -1 2 -1 T*/ }
  442. { -2 2 -2 */ -> -2 2 -2 T*/ }
  443. { 7 2 3 */ -> 7 2 3 T*/ }
  444. { 7 2 -3 */ -> 7 2 -3 T*/ }
  445. { -7 2 3 */ -> -7 2 3 T*/ }
  446. { -7 2 -3 */ -> -7 2 -3 T*/ }
  447. \ J.H has now removed this one!!! { MAX-INT 2 1 */ -> MAX-INT 2 1 T*/ }
  448. \ J.H has now removed this one!!! { MIN-INT 2 1 */ -> MIN-INT 2 1 T*/ }
  449. { MAX-INT 2 MAX-INT */ -> MAX-INT 2 MAX-INT T*/ }
  450. { MIN-INT 2 MIN-INT */ -> MIN-INT 2 MIN-INT T*/ }
  451. { 0 2 1 */MOD -> 0 2 1 T*/MOD }
  452. { 1 2 1 */MOD -> 1 2 1 T*/MOD }
  453. { 2 2 1 */MOD -> 2 2 1 T*/MOD }
  454. { -1 2 1 */MOD -> -1 2 1 T*/MOD }
  455. { -2 2 1 */MOD -> -2 2 1 T*/MOD }
  456. { 0 2 -1 */MOD -> 0 2 -1 T*/MOD }
  457. { 1 2 -1 */MOD -> 1 2 -1 T*/MOD }
  458. { 2 2 -1 */MOD -> 2 2 -1 T*/MOD }
  459. { -1 2 -1 */MOD -> -1 2 -1 T*/MOD }
  460. { -2 2 -1 */MOD -> -2 2 -1 T*/MOD }
  461. { 2 2 2 */MOD -> 2 2 2 T*/MOD }
  462. { -1 2 -1 */MOD -> -1 2 -1 T*/MOD }
  463. { -2 2 -2 */MOD -> -2 2 -2 T*/MOD }
  464. { 7 2 3 */MOD -> 7 2 3 T*/MOD }
  465. { 7 2 -3 */MOD -> 7 2 -3 T*/MOD }
  466. { -7 2 3 */MOD -> -7 2 3 T*/MOD }
  467. { -7 2 -3 */MOD -> -7 2 -3 T*/MOD }
  468. \ has now removed this one!!! { MAX-INT 2 1 */MOD -> MAX-INT 2 1 T*/MOD }
  469. \ has now removed this one!!! { MIN-INT 2 1 */MOD -> MIN-INT 2 1 T*/MOD }
  470. { MAX-INT 2 MAX-INT */MOD -> MAX-INT 2 MAX-INT T*/MOD }
  471. { MIN-INT 2 MIN-INT */MOD -> MIN-INT 2 MIN-INT T*/MOD }
  472. \ ------------------------------------------------------------------------
  473. TESTING HERE , @ ! CELL+ CELLS C, C@ C! 2@ 2! ALIGN ALIGNED +! ALLOT
  474. HERE 1 ALLOT
  475. HERE
  476. CONSTANT 2NDA
  477. CONSTANT 1STA
  478. { 1STA 2NDA < -> <TRUE> } \ HERE MUST GROW WITH ALLOT
  479. { 1STA 1+ -> 2NDA } \ ... BY ONE ADDRESS UNIT
  480. ( MISSING TEST: NEGATIVE ALLOT )
  481. HERE 1 ,
  482. HERE 2 ,
  483. CONSTANT 2ND
  484. CONSTANT 1ST
  485. { 1ST 2ND < -> <TRUE> } \ HERE MUST GROW WITH ALLOT
  486. { 1ST CELL+ -> 2ND } \ ... BY ONE CELL
  487. { 1ST 1 CELLS + -> 2ND }
  488. { 1ST @ 2ND @ -> 1 2 }
  489. { 5 1ST ! -> }
  490. { 1ST @ 2ND @ -> 5 2 }
  491. { 6 2ND ! -> }
  492. { 1ST @ 2ND @ -> 5 6 }
  493. { 1ST 2@ -> 6 5 }
  494. { 2 1 1ST 2! -> }
  495. { 1ST 2@ -> 2 1 }
  496. HERE 1 C,
  497. HERE 2 C,
  498. CONSTANT 2NDC
  499. CONSTANT 1STC
  500. { 1STC 2NDC < -> <TRUE> } \ HERE MUST GROW WITH ALLOT
  501. { 1STC 1+ -> 2NDC } \ ... BY ONE CHAR
  502. { 1STC 1 + -> 2NDC }
  503. { 1STC C@ 2NDC C@ -> 1 2 }
  504. { 3 1STC C! -> }
  505. { 1STC C@ 2NDC C@ -> 3 2 }
  506. { 4 2NDC C! -> }
  507. { 1STC C@ 2NDC C@ -> 3 4 }
  508. HERE 1 ALLOT ALIGN 123 , CONSTANT X
  509. { X 1+ ALIGNED @ -> 123 }
  510. ( MISSING TEST: CHARS AT ALIGNED ADDRESS )
  511. { 1 CELLS 1 MOD -> 0 } \ SIZE OF CELL MULTIPLE OF SIZE OF CHAR
  512. { 0 1ST ! -> }
  513. { 1 1ST +! -> }
  514. { 1ST @ -> 1 }
  515. { -1 1ST +! 1ST @ -> 0 }
  516. \ ------------------------------------------------------------------------
  517. TESTING [ ] BL & "
  518. { BL -> 20 }
  519. { &X -> 58 }
  520. { &H -> 48 }
  521. { : GC1 &X ; -> }
  522. { : GC2 &H ; -> }
  523. { GC1 -> 58 }
  524. { GC2 -> 48 }
  525. { : GC3 [ GC1 ] LITERAL ; -> }
  526. { GC3 -> 58 }
  527. { : GC4 "XY" ; -> }
  528. { GC4 SWAP DROP -> 2 }
  529. { GC4 DROP DUP C@ SWAP 1+ C@ -> 58 59 }
  530. \ ------------------------------------------------------------------------
  531. TESTING FIND EXECUTE IMMEDIATE COUNT LITERAL POSTPONE STATE '
  532. { : GT1 123 ; -> }
  533. { 'GT1 EXECUTE -> 123 }
  534. { : GT2 'GT1 ; IMMEDIATE -> }
  535. { GT2 EXECUTE -> 123 }
  536. : GT1STRING "GT1" ;
  537. : GT2STRING "GT2" ;
  538. { GT1STRING FOUND -> 'GT1 }
  539. { GT2STRING FOUND -> 'GT2 }
  540. ( HOW TO SEARCH FOR NON-EXISTENT WORD? ) \ Solved AH see next lines
  541. CREATE GT2A -1 C,
  542. : GT2ASTRING GT2A 1 ;
  543. { GT2ASTRING FOUND >NFA @ @ -> 0 }
  544. { : GT3 GT2 LITERAL ; -> }
  545. { GT3 -> 'GT1 }
  546. { GT1STRING DROP DUP COUNT >R SWAP - R> -> 1 &G }
  547. { : GT4 POSTPONE GT1 ; IMMEDIATE -> }
  548. { : GT5 GT4 ; -> }
  549. { GT5 -> 123 }
  550. { : GT6 345 ; IMMEDIATE -> }
  551. { : GT7 POSTPONE GT6 ; -> }
  552. { GT7 -> 345 }
  553. { : GT8 STATE @ ; IMMEDIATE -> }
  554. { GT8 -> 0 }
  555. { : GT9 GT8 LITERAL ; -> }
  556. { GT9 0= -> <FALSE> }
  557. \ ------------------------------------------------------------------------
  558. TESTING IF ELSE THEN BEGIN WHILE REPEAT UNTIL
  559. { : GI1 IF 123 THEN ; -> }
  560. { : GI2 IF 123 ELSE 234 THEN ; -> }
  561. { 0 GI1 -> }
  562. { 1 GI1 -> 123 }
  563. { -1 GI1 -> 123 }
  564. { 0 GI2 -> 234 }
  565. { 1 GI2 -> 123 }
  566. { -1 GI1 -> 123 }
  567. { : GI3 BEGIN DUP 5 < WHILE DUP 1+ REPEAT ; -> }
  568. { 0 GI3 -> 0 1 2 3 4 5 }
  569. { 4 GI3 -> 4 5 }
  570. { 5 GI3 -> 5 }
  571. { 6 GI3 -> 6 }
  572. { : GI4 BEGIN DUP 1+ DUP 5 > UNTIL ; -> }
  573. { 3 GI4 -> 3 4 5 6 }
  574. { 5 GI4 -> 5 6 }
  575. { 6 GI4 -> 6 7 }
  576. { : GI5 BEGIN DUP 2 > WHILE DUP 5 < WHILE DUP 1+ REPEAT 123 ELSE 345 THEN ; -> }
  577. { 1 GI5 -> 1 345 }
  578. { 2 GI5 -> 2 345 }
  579. { 3 GI5 -> 3 4 5 123 }
  580. { 4 GI5 -> 4 5 123 }
  581. { 5 GI5 -> 5 123 }
  582. \ ------------------------------------------------------------------------
  583. TESTING DO LOOP +LOOP I J UNLOOP LEAVE EXIT
  584. : UNLOOP 'RDROP , 'RDROP , 'RDROP , ; IMMEDIATE
  585. { : GD1 DO I LOOP ; -> }
  586. { 4 1 GD1 -> 1 2 3 }
  587. { 2 -1 GD1 -> -1 0 1 }
  588. { MID-UINT+1 MID-UINT GD1 -> MID-UINT }
  589. { : GD2 DO I -1 +LOOP ; -> }
  590. { 1 4 GD2 -> 4 3 2 1 }
  591. { -1 2 GD2 -> 2 1 0 -1 }
  592. { MID-UINT MID-UINT+1 GD2 -> MID-UINT+1 MID-UINT }
  593. { : GD3 DO 1 0 DO J LOOP LOOP ; -> }
  594. { 4 1 GD3 -> 1 2 3 }
  595. { 2 -1 GD3 -> -1 0 1 }
  596. { MID-UINT+1 MID-UINT GD3 -> MID-UINT }
  597. { : GD4 DO 1 0 DO J LOOP -1 +LOOP ; -> }
  598. { 1 4 GD4 -> 4 3 2 1 }
  599. { -1 2 GD4 -> 2 1 0 -1 }
  600. { MID-UINT MID-UINT+1 GD4 -> MID-UINT+1 MID-UINT }
  601. { : GD5 123 SWAP 0 DO I 4 > IF DROP 234 LEAVE THEN LOOP ; -> }
  602. { 1 GD5 -> 123 }
  603. { 5 GD5 -> 123 }
  604. { 6 GD5 -> 234 }
  605. { : GD6 ( PAT: {0 0},{0 0}{1 0}{1 1},{0 0}{1 0}{1 1}{2 0}{2 1}{2 2} )
  606. 0 SWAP 0 DO
  607. I 1+ 0 DO I J + 3 = IF I UNLOOP I UNLOOP EXIT THEN 1+ LOOP
  608. LOOP ; -> }
  609. { 1 GD6 -> 1 }
  610. { 2 GD6 -> 3 }
  611. { 3 GD6 -> 4 1 2 }
  612. \ ------------------------------------------------------------------------
  613. TESTING DEFINING WORDS: : ; CONSTANT VARIABLE CREATE DOES> >BODY
  614. { 123 CONSTANT X123 -> }
  615. { X123 -> 123 }
  616. { : EQU CONSTANT ; -> }
  617. { X123 EQU Y123 -> }
  618. { Y123 -> 123 }
  619. { VARIABLE V1 -> }
  620. { 123 V1 ! -> }
  621. { V1 @ -> 123 }
  622. { : NOP : POSTPONE ; ; -> }
  623. { NOP NOP1 NOP NOP2 -> }
  624. { NOP1 -> }
  625. { NOP2 -> }
  626. { : DOES1 DOES> @ 1 + ; -> }
  627. { : DOES2 DOES> @ 2 + ; -> }
  628. { CREATE CR1 -> }
  629. { CR1 -> HERE }
  630. { 'CR1 >BODY -> HERE }
  631. { 1 , -> }
  632. { CR1 @ -> 1 }
  633. { DOES1 -> }
  634. { CR1 -> 2 }
  635. { DOES2 -> }
  636. { CR1 -> 3 }
  637. { : WEIRD: CREATE DOES> 1 + DOES> 2 + ; -> }
  638. { WEIRD: W1 -> }
  639. { 'W1 >BODY -> HERE }
  640. { W1 -> HERE 1 + }
  641. { W1 -> HERE 2 + }
  642. \ ------------------------------------------------------------------------
  643. TESTING EVALUATE
  644. : GE1 "123" ; IMMEDIATE
  645. : GE2 "123 1+" ; IMMEDIATE
  646. : GE3 ": GE4 345 ;" ;
  647. : GE5 EVALUATE ; IMMEDIATE
  648. { GE1 EVALUATE -> 123 } ( TEST EVALUATE IN INTERP. STATE )
  649. { GE2 EVALUATE -> 124 }
  650. { GE3 EVALUATE -> }
  651. { GE4 -> 345 }
  652. { : GE6 GE1 GE5 ; -> } ( TEST EVALUATE IN COMPILE STATE )
  653. { GE6 -> 123 }
  654. { : GE7 GE2 GE5 ; -> }
  655. { GE7 -> 124 }
  656. \ ------------------------------------------------------------------------
  657. TESTING SRC PP NAME
  658. \ The phrase results is equivalent to ISO `` SOURCE ''
  659. : GS1 "SRC 2@ SWAP OVER - " 2DUP EVALUATE
  660. >R SWAP >R = R> R> = ;
  661. { GS1 -> <TRUE> <TRUE> }
  662. VARIABLE SCANS
  663. : RESCAN? -1 SCANS +! SCANS @ IF SRC @ PP ! THEN ;
  664. { 2 SCANS !
  665. 345 RESCAN?
  666. -> 345 345 }
  667. : GS2 5 SCANS ! "123 RESCAN?" EVALUATE ;
  668. { GS2 -> 123 123 123 123 123 }
  669. : GS3 NAME SWAP C@ ;
  670. { GS3 HELLO -> 5 &H }
  671. : GS4 SRC CELL+ @ PP ! ;
  672. { GS4 123 456
  673. -> }
  674. \ ------------------------------------------------------------------------
  675. TESTING <% % %S %> HOLD SIGN BASE >NUMBER HEX DECIMAL
  676. : S= \ ( ADDR1 C1 ADDR2 C2 -- T/F ) COMPARE TWO STRINGS.
  677. SDSWAP OVER <> IF \ COMPARE LENGTHS
  678. DROP 2DROP <FALSE> \ LENGTHS MISMATCH
  679. ELSE
  680. CORA 0= \ IF NON-EMPTY STRINGS
  681. THEN ;
  682. : GP1 <% 41 HOLD 42 HOLD 0 %> "BA" S= ;
  683. { GP1 -> <TRUE> }
  684. : GP2 <% -1 SIGN 0 SIGN -1 SIGN 0 %> "--" S= ;
  685. { GP2 -> <TRUE> }
  686. : GP3 <% 1 % % %> "01" S= ;
  687. { GP3 -> <TRUE> }
  688. : GP4 <% 1 %S %> "1" S= ;
  689. { GP4 -> <TRUE> }
  690. 24 CONSTANT MAX-BASE \ BASE 2 .. 36
  691. : COUNT-BITS
  692. 0 0 INVERT BEGIN DUP WHILE >R 1+ R> 1 LSHIFT REPEAT DROP ;
  693. COUNT-BITS CONSTANT #BITS-U \ NUMBER OF BITS IN UD
  694. : GP5
  695. BASE @ <TRUE>
  696. MAX-BASE 1+ 2 DO \ FOR EACH POSSIBLE BASE
  697. I BASE ! \ TBD: ASSUMES BASE WORKS
  698. I <% %S %> "10" S= AND
  699. LOOP
  700. SWAP BASE ! ;
  701. { GP5 -> <TRUE> }
  702. : GP6
  703. BASE @ >R 2 BASE !
  704. MAX-UINT <% %S %> \ MAXIMUM UD TO BINARY
  705. R> BASE ! \ S: C-ADDR U
  706. DUP #BITS-U = SWAP
  707. 0 DO \ S: C-ADDR FLAG
  708. OVER C@ &1 = AND \ ALL ONES
  709. >R 1+ R>
  710. LOOP SWAP DROP ;
  711. { GP6 -> <TRUE> }
  712. : GP7
  713. BASE @ >R MAX-BASE BASE !
  714. <TRUE>
  715. A 0 DO
  716. I <% %S %>
  717. 1 = SWAP C@ I 30 + = AND AND
  718. LOOP
  719. MAX-BASE A DO
  720. I <% %S %>
  721. 1 = SWAP C@ 41 I A - + = AND AND
  722. LOOP
  723. R> BASE ! ;
  724. { GP7 -> <TRUE> }
  725. \ >NUMBER TESTS
  726. CREATE GN-BUF _ , _ C,
  727. : GN-STRING GN-BUF $@ ;
  728. : GN-CONSUMED GN-BUF $@ DROP 1+ 0 ;
  729. : GN' PP@@ 2DROP &' PARSE GN-BUF $! GN-STRING ;
  730. \ : >NUMBER SAVE SET-SRC 'NUMBER CATCH RESTORE THROW 0 D+ ;
  731. { 0 0 GN' 0' >NUMBER -> 0 0 GN-CONSUMED }
  732. { 0 0 GN' 1' >NUMBER -> 1 0 GN-CONSUMED }
  733. { 1 0 GN' 1' >NUMBER -> BASE @ 1+ 0 GN-CONSUMED }
  734. { 0 0 GN' -' >NUMBER -> 0 0 GN-STRING } \ SHOULD FAIL TO CONVERT THESE
  735. { 0 0 GN' +' >NUMBER -> 0 0 GN-STRING }
  736. \ { 0 0 GN' .' >NUMBER -> 0 0 GN-STRING }
  737. : >NUMBER-BASED
  738. BASE @ >R BASE ! >NUMBER R> BASE ! ;
  739. { 0 0 GN' 2' 10 >NUMBER-BASED -> 2 0 GN-CONSUMED }
  740. { 0 0 GN' 2' 2 >NUMBER-BASED -> 0 0 GN-STRING }
  741. { 0 0 GN' F' 10 >NUMBER-BASED -> F 0 GN-CONSUMED }
  742. { 0 0 GN' G' 10 >NUMBER-BASED -> 0 0 GN-STRING }
  743. { 0 0 GN' G' MAX-BASE >NUMBER-BASED -> 10 0 GN-CONSUMED }
  744. { 0 0 GN' Z' MAX-BASE >NUMBER-BASED -> 23 0 GN-CONSUMED }
  745. : GN1 \ ( U BASE -- U' LEN ) U SHOULD EQUAL U' AND LEN SHOULD BE ZERO.
  746. BASE @ >R BASE !
  747. <% %S %>
  748. 0 0 2SWAP >NUMBER SWAP DROP SWAP DROP \ REMOVE STRING ADDRESS AND MS CELL
  749. R> BASE ! ;
  750. { 0 2 GN1 -> 0 0 }
  751. { MAX-UINT 2 GN1 -> MAX-UINT 0 }
  752. \ test removed
  753. { 0 MAX-BASE GN1 -> 0 0 }
  754. { MAX-UINT MAX-BASE GN1 -> MAX-UINT 0 }
  755. \ test removed
  756. : GN2 \ ( -- 16 10 )
  757. BASE @ >R HEX BASE @ DECIMAL BASE @ R> BASE ! ;
  758. { GN2 -> 10 A }
  759. \ ------------------------------------------------------------------------
  760. TESTING FILL MOVE
  761. CREATE FBUF 00 C, 00 C, 00 C,
  762. CREATE SBUF 12 C, 34 C, 56 C,
  763. : SEEBUF FBUF C@ FBUF 1+ C@ FBUF 1+ 1+ C@ ;
  764. { FBUF 0 20 FILL -> }
  765. { SEEBUF -> 00 00 00 }
  766. { FBUF 1 20 FILL -> }
  767. { SEEBUF -> 20 00 00 }
  768. { FBUF 3 20 FILL -> }
  769. { SEEBUF -> 20 20 20 }
  770. { FBUF FBUF 3 MOVE -> } \ BIZARRE SPECIAL CASE
  771. { SEEBUF -> 20 20 20 }
  772. { SBUF FBUF 0 MOVE -> }
  773. { SEEBUF -> 20 20 20 }
  774. { SBUF FBUF 1 MOVE -> }
  775. { SEEBUF -> 12 20 20 }
  776. { SBUF FBUF 3 MOVE -> }
  777. { SEEBUF -> 12 34 56 }
  778. { FBUF FBUF 1+ 2 MOVE -> }
  779. { SEEBUF -> 12 12 34 }
  780. { FBUF 1+ FBUF 2 MOVE -> }
  781. { SEEBUF -> 12 34 34 }
  782. \ ------------------------------------------------------------------------
  783. TESTING OUTPUT: . " CR EMIT SPACE TYPE
  784. : OUTPUT-TEST
  785. "YOU SHOULD SEE 0-9 SEPARATED BY A SPACE:" TYPE CR
  786. 9 1+ 0 DO I . LOOP CR
  787. "YOU SHOULD SEE A-G SEPARATED BY A SPACE:" TYPE CR
  788. &G 1+ &A DO I EMIT SPACE LOOP CR
  789. "YOU SHOULD SEE TWO SEPARATE LINES:" TYPE CR
  790. "LINE 1" TYPE CR "LINE 2" TYPE CR
  791. "YOU SHOULD SEE THE NUMBER RANGES OF SIGNED AND UNSIGNED NUMBERS:" TYPE CR
  792. " SIGNED: " TYPE MIN-INT . MAX-INT . CR
  793. "UNSIGNED: " TYPE 0 U. MAX-UINT U. CR
  794. ;
  795. { OUTPUT-TEST -> }
  796. \ ------------------------------------------------------------------------
  797. TESTING INPUT: ACCEPT
  798. CREATE ABUF 80 ALLOT
  799. : ACCEPT-TEST
  800. CR "PLEASE TYPE UP TO 80 CHARACTERS:" TYPE CR
  801. ABUF 80 ACCEPT
  802. CR "RECEIVED: " TYPE &" EMIT
  803. ABUF SWAP TYPE &" EMIT CR
  804. ;
  805. "YOU SHOULD SEE THE FOLLOWING LINE ANOTHER TIME AFTER RECEIVED:" TYPE CR
  806. "THIS IS AN INPUT LINE FOLLOWING IN THE SOURCE" TYPE CR
  807. { ACCEPT-TEST -> }
  808. THIS IS AN INPUT LINE FOLLOWING IN THE SOURCE
  809. \ ------------------------------------------------------------------------
  810. TESTING DICTIONARY SEARCH RULES
  811. { : GDX 123 ; : GDX GDX 234 ; -> }
  812. { GDX -> 123 234 }
  813. TESTING FINISHED
  814. BYE