OPS.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624
  1. /* voc 2.1.0 [2019/11/01]. Bootstrapping compiler for address size 8, alignment 8. xrtspaSF */
  2. #define SHORTINT INT8
  3. #define INTEGER INT16
  4. #define LONGINT INT32
  5. #define SET UINT32
  6. #include "SYSTEM.h"
  7. #include "OPM.h"
  8. typedef
  9. CHAR OPS_Name[256];
  10. typedef
  11. CHAR OPS_String[256];
  12. export OPS_Name OPS_name;
  13. export OPS_String OPS_str;
  14. export INT16 OPS_numtyp;
  15. export INT64 OPS_intval;
  16. export REAL OPS_realval;
  17. export LONGREAL OPS_lrlval;
  18. static CHAR OPS_ch;
  19. export void OPS_Get (INT8 *sym);
  20. static void OPS_Identifier (INT8 *sym);
  21. export void OPS_Init (void);
  22. static void OPS_Number (void);
  23. static void OPS_Str (INT8 *sym);
  24. static void OPS_err (INT16 n);
  25. static void OPS_err (INT16 n)
  26. {
  27. OPM_err(n);
  28. }
  29. static void OPS_Str (INT8 *sym)
  30. {
  31. INT16 i;
  32. CHAR och;
  33. i = 0;
  34. och = OPS_ch;
  35. for (;;) {
  36. OPM_Get(&OPS_ch);
  37. if (OPS_ch == och) {
  38. break;
  39. }
  40. if (OPS_ch < ' ') {
  41. OPS_err(3);
  42. break;
  43. }
  44. if (i == 255) {
  45. OPS_err(241);
  46. break;
  47. }
  48. OPS_str[__X(i, 256)] = OPS_ch;
  49. i += 1;
  50. }
  51. OPM_Get(&OPS_ch);
  52. OPS_str[__X(i, 256)] = 0x00;
  53. OPS_intval = i + 1;
  54. if (OPS_intval == 2) {
  55. *sym = 35;
  56. OPS_numtyp = 1;
  57. OPS_intval = (INT16)OPS_str[0];
  58. } else {
  59. *sym = 37;
  60. }
  61. }
  62. static void OPS_Identifier (INT8 *sym)
  63. {
  64. INT16 i;
  65. i = 0;
  66. do {
  67. OPS_name[__X(i, 256)] = OPS_ch;
  68. i += 1;
  69. OPM_Get(&OPS_ch);
  70. } while (!(((OPS_ch < '0' || ('9' < OPS_ch && __CAP(OPS_ch) < 'A')) || 'Z' < __CAP(OPS_ch)) || i == 256));
  71. if (i == 256) {
  72. OPS_err(240);
  73. i -= 1;
  74. }
  75. OPS_name[__X(i, 256)] = 0x00;
  76. *sym = 38;
  77. }
  78. static struct Number__6 {
  79. struct Number__6 *lnk;
  80. } *Number__6_s;
  81. static INT16 Ord__7 (CHAR ch, BOOLEAN hex);
  82. static LONGREAL Ten__9 (INT16 e);
  83. static LONGREAL Ten__9 (INT16 e)
  84. {
  85. LONGREAL x, p;
  86. x = (LONGREAL)1;
  87. p = (LONGREAL)10;
  88. while (e > 0) {
  89. if (__ODD(e)) {
  90. x = x * p;
  91. }
  92. e = __ASHR(e, 1);
  93. if (e > 0) {
  94. p = p * p;
  95. }
  96. }
  97. return x;
  98. }
  99. static INT16 Ord__7 (CHAR ch, BOOLEAN hex)
  100. {
  101. if (ch <= '9') {
  102. return (INT16)ch - 48;
  103. } else if (hex) {
  104. return ((INT16)ch - 65) + 10;
  105. } else {
  106. OPS_err(2);
  107. return 0;
  108. }
  109. __RETCHK;
  110. }
  111. static void OPS_Number (void)
  112. {
  113. INT16 i, m, n, d, e;
  114. CHAR dig[24];
  115. LONGREAL f;
  116. CHAR expCh;
  117. BOOLEAN neg;
  118. struct Number__6 _s;
  119. _s.lnk = Number__6_s;
  120. Number__6_s = &_s;
  121. i = 0;
  122. m = 0;
  123. n = 0;
  124. d = 0;
  125. for (;;) {
  126. if (('0' <= OPS_ch && OPS_ch <= '9') || (((d == 0 && 'A' <= OPS_ch)) && OPS_ch <= 'F')) {
  127. if (m > 0 || OPS_ch != '0') {
  128. if (n < 24) {
  129. dig[__X(n, 24)] = OPS_ch;
  130. n += 1;
  131. }
  132. m += 1;
  133. }
  134. OPM_Get(&OPS_ch);
  135. i += 1;
  136. } else if (OPS_ch == '.') {
  137. OPM_Get(&OPS_ch);
  138. if (OPS_ch == '.') {
  139. OPS_ch = 0x7f;
  140. break;
  141. } else if (d == 0) {
  142. d = i;
  143. } else {
  144. OPS_err(2);
  145. }
  146. } else {
  147. break;
  148. }
  149. }
  150. if (d == 0) {
  151. if (n == m) {
  152. OPS_intval = 0;
  153. i = 0;
  154. if (OPS_ch == 'X') {
  155. OPM_Get(&OPS_ch);
  156. OPS_numtyp = 1;
  157. if (n <= 2) {
  158. while (i < n) {
  159. OPS_intval = __ASHL(OPS_intval, 4) + (INT64)Ord__7(dig[__X(i, 24)], 1);
  160. i += 1;
  161. }
  162. } else {
  163. OPS_err(203);
  164. }
  165. } else if (OPS_ch == 'H') {
  166. OPM_Get(&OPS_ch);
  167. OPS_numtyp = 2;
  168. if (n <= 16) {
  169. if ((n == 16 && dig[0] > '7')) {
  170. OPS_intval = -1;
  171. }
  172. while (i < n) {
  173. OPS_intval = __ASHL(OPS_intval, 4) + (INT64)Ord__7(dig[__X(i, 24)], 1);
  174. i += 1;
  175. }
  176. } else {
  177. OPS_err(203);
  178. }
  179. } else {
  180. OPS_numtyp = 2;
  181. while (i < n) {
  182. d = Ord__7(dig[__X(i, 24)], 0);
  183. i += 1;
  184. if (OPS_intval <= __DIV(9223372036854775807LL - (INT64)d, 10)) {
  185. OPS_intval = OPS_intval * 10 + (INT64)d;
  186. } else {
  187. OPS_err(203);
  188. }
  189. }
  190. }
  191. } else {
  192. OPS_err(203);
  193. }
  194. } else {
  195. f = (LONGREAL)0;
  196. e = 0;
  197. expCh = 'E';
  198. while (n > 0) {
  199. n -= 1;
  200. f = (Ord__7(dig[__X(n, 24)], 0) + f) / (LONGREAL)(LONGREAL)10;
  201. }
  202. if (OPS_ch == 'E' || OPS_ch == 'D') {
  203. expCh = OPS_ch;
  204. OPM_Get(&OPS_ch);
  205. neg = 0;
  206. if (OPS_ch == '-') {
  207. neg = 1;
  208. OPM_Get(&OPS_ch);
  209. } else if (OPS_ch == '+') {
  210. OPM_Get(&OPS_ch);
  211. }
  212. if (('0' <= OPS_ch && OPS_ch <= '9')) {
  213. do {
  214. n = Ord__7(OPS_ch, 0);
  215. OPM_Get(&OPS_ch);
  216. if (e <= __DIV(32767 - n, 10)) {
  217. e = e * 10 + n;
  218. } else {
  219. OPS_err(203);
  220. }
  221. } while (!(OPS_ch < '0' || '9' < OPS_ch));
  222. if (neg) {
  223. e = -e;
  224. }
  225. } else {
  226. OPS_err(2);
  227. }
  228. }
  229. e -= (i - d) - m;
  230. if (expCh == 'E') {
  231. OPS_numtyp = 3;
  232. if ((-37 < e && e <= 38)) {
  233. if (e < 0) {
  234. OPS_realval = (f / (LONGREAL)Ten__9(-e));
  235. } else {
  236. OPS_realval = (f * Ten__9(e));
  237. }
  238. } else {
  239. OPS_err(203);
  240. }
  241. } else {
  242. OPS_numtyp = 4;
  243. if ((-307 < e && e <= 308)) {
  244. if (e < 0) {
  245. OPS_lrlval = f / (LONGREAL)Ten__9(-e);
  246. } else {
  247. OPS_lrlval = f * Ten__9(e);
  248. }
  249. } else {
  250. OPS_err(203);
  251. }
  252. }
  253. }
  254. Number__6_s = _s.lnk;
  255. }
  256. static struct Get__1 {
  257. struct Get__1 *lnk;
  258. } *Get__1_s;
  259. static void Comment__2 (void);
  260. static void Comment__2 (void)
  261. {
  262. OPM_Get(&OPS_ch);
  263. for (;;) {
  264. for (;;) {
  265. while (OPS_ch == '(') {
  266. OPM_Get(&OPS_ch);
  267. if (OPS_ch == '*') {
  268. Comment__2();
  269. }
  270. }
  271. if (OPS_ch == '*') {
  272. OPM_Get(&OPS_ch);
  273. break;
  274. }
  275. if (OPS_ch == 0x00) {
  276. break;
  277. }
  278. OPM_Get(&OPS_ch);
  279. }
  280. if (OPS_ch == ')') {
  281. OPM_Get(&OPS_ch);
  282. break;
  283. }
  284. if (OPS_ch == 0x00) {
  285. OPS_err(5);
  286. break;
  287. }
  288. }
  289. }
  290. void OPS_Get (INT8 *sym)
  291. {
  292. INT8 s;
  293. struct Get__1 _s;
  294. _s.lnk = Get__1_s;
  295. Get__1_s = &_s;
  296. OPM_errpos = OPM_curpos - 1;
  297. while (OPS_ch <= ' ') {
  298. if (OPS_ch == 0x00) {
  299. *sym = 64;
  300. Get__1_s = _s.lnk;
  301. return;
  302. } else {
  303. OPM_Get(&OPS_ch);
  304. }
  305. }
  306. switch (OPS_ch) {
  307. case '"': case '\'':
  308. OPS_Str(&s);
  309. break;
  310. case '#':
  311. s = 10;
  312. OPM_Get(&OPS_ch);
  313. break;
  314. case '&':
  315. s = 5;
  316. OPM_Get(&OPS_ch);
  317. break;
  318. case '(':
  319. OPM_Get(&OPS_ch);
  320. if (OPS_ch == '*') {
  321. Comment__2();
  322. OPS_Get(&s);
  323. } else {
  324. s = 30;
  325. }
  326. break;
  327. case ')':
  328. s = 22;
  329. OPM_Get(&OPS_ch);
  330. break;
  331. case '*':
  332. s = 1;
  333. OPM_Get(&OPS_ch);
  334. break;
  335. case '+':
  336. s = 6;
  337. OPM_Get(&OPS_ch);
  338. break;
  339. case ',':
  340. s = 19;
  341. OPM_Get(&OPS_ch);
  342. break;
  343. case '-':
  344. s = 7;
  345. OPM_Get(&OPS_ch);
  346. break;
  347. case '.':
  348. OPM_Get(&OPS_ch);
  349. if (OPS_ch == '.') {
  350. OPM_Get(&OPS_ch);
  351. s = 21;
  352. } else {
  353. s = 18;
  354. }
  355. break;
  356. case '/':
  357. s = 2;
  358. OPM_Get(&OPS_ch);
  359. break;
  360. case '0': case '1': case '2': case '3': case '4':
  361. case '5': case '6': case '7': case '8': case '9':
  362. OPS_Number();
  363. s = 35;
  364. break;
  365. case ':':
  366. OPM_Get(&OPS_ch);
  367. if (OPS_ch == '=') {
  368. OPM_Get(&OPS_ch);
  369. s = 34;
  370. } else {
  371. s = 20;
  372. }
  373. break;
  374. case ';':
  375. s = 39;
  376. OPM_Get(&OPS_ch);
  377. break;
  378. case '<':
  379. OPM_Get(&OPS_ch);
  380. if (OPS_ch == '=') {
  381. OPM_Get(&OPS_ch);
  382. s = 12;
  383. } else {
  384. s = 11;
  385. }
  386. break;
  387. case '=':
  388. s = 9;
  389. OPM_Get(&OPS_ch);
  390. break;
  391. case '>':
  392. OPM_Get(&OPS_ch);
  393. if (OPS_ch == '=') {
  394. OPM_Get(&OPS_ch);
  395. s = 14;
  396. } else {
  397. s = 13;
  398. }
  399. break;
  400. case 'A':
  401. OPS_Identifier(&s);
  402. if (__STRCMP(OPS_name, "ARRAY") == 0) {
  403. s = 54;
  404. }
  405. break;
  406. case 'B':
  407. OPS_Identifier(&s);
  408. if (__STRCMP(OPS_name, "BEGIN") == 0) {
  409. s = 57;
  410. } else if (__STRCMP(OPS_name, "BY") == 0) {
  411. s = 29;
  412. }
  413. break;
  414. case 'C':
  415. OPS_Identifier(&s);
  416. if (__STRCMP(OPS_name, "CASE") == 0) {
  417. s = 46;
  418. } else if (__STRCMP(OPS_name, "CONST") == 0) {
  419. s = 58;
  420. }
  421. break;
  422. case 'D':
  423. OPS_Identifier(&s);
  424. if (__STRCMP(OPS_name, "DO") == 0) {
  425. s = 27;
  426. } else if (__STRCMP(OPS_name, "DIV") == 0) {
  427. s = 3;
  428. }
  429. break;
  430. case 'E':
  431. OPS_Identifier(&s);
  432. if (__STRCMP(OPS_name, "END") == 0) {
  433. s = 41;
  434. } else if (__STRCMP(OPS_name, "ELSE") == 0) {
  435. s = 42;
  436. } else if (__STRCMP(OPS_name, "ELSIF") == 0) {
  437. s = 43;
  438. } else if (__STRCMP(OPS_name, "EXIT") == 0) {
  439. s = 52;
  440. }
  441. break;
  442. case 'F':
  443. OPS_Identifier(&s);
  444. if (__STRCMP(OPS_name, "FOR") == 0) {
  445. s = 49;
  446. }
  447. break;
  448. case 'I':
  449. OPS_Identifier(&s);
  450. if (__STRCMP(OPS_name, "IF") == 0) {
  451. s = 45;
  452. } else if (__STRCMP(OPS_name, "IN") == 0) {
  453. s = 15;
  454. } else if (__STRCMP(OPS_name, "IS") == 0) {
  455. s = 16;
  456. } else if (__STRCMP(OPS_name, "IMPORT") == 0) {
  457. s = 62;
  458. }
  459. break;
  460. case 'L':
  461. OPS_Identifier(&s);
  462. if (__STRCMP(OPS_name, "LOOP") == 0) {
  463. s = 50;
  464. }
  465. break;
  466. case 'M':
  467. OPS_Identifier(&s);
  468. if (__STRCMP(OPS_name, "MOD") == 0) {
  469. s = 4;
  470. } else if (__STRCMP(OPS_name, "MODULE") == 0) {
  471. s = 63;
  472. }
  473. break;
  474. case 'N':
  475. OPS_Identifier(&s);
  476. if (__STRCMP(OPS_name, "NIL") == 0) {
  477. s = 36;
  478. }
  479. break;
  480. case 'O':
  481. OPS_Identifier(&s);
  482. if (__STRCMP(OPS_name, "OR") == 0) {
  483. s = 8;
  484. } else if (__STRCMP(OPS_name, "OF") == 0) {
  485. s = 25;
  486. }
  487. break;
  488. case 'P':
  489. OPS_Identifier(&s);
  490. if (__STRCMP(OPS_name, "PROCEDURE") == 0) {
  491. s = 61;
  492. } else if (__STRCMP(OPS_name, "POINTER") == 0) {
  493. s = 56;
  494. }
  495. break;
  496. case 'R':
  497. OPS_Identifier(&s);
  498. if (__STRCMP(OPS_name, "RECORD") == 0) {
  499. s = 55;
  500. } else if (__STRCMP(OPS_name, "REPEAT") == 0) {
  501. s = 48;
  502. } else if (__STRCMP(OPS_name, "RETURN") == 0) {
  503. s = 53;
  504. }
  505. break;
  506. case 'T':
  507. OPS_Identifier(&s);
  508. if (__STRCMP(OPS_name, "THEN") == 0) {
  509. s = 26;
  510. } else if (__STRCMP(OPS_name, "TO") == 0) {
  511. s = 28;
  512. } else if (__STRCMP(OPS_name, "TYPE") == 0) {
  513. s = 59;
  514. }
  515. break;
  516. case 'U':
  517. OPS_Identifier(&s);
  518. if (__STRCMP(OPS_name, "UNTIL") == 0) {
  519. s = 44;
  520. }
  521. break;
  522. case 'V':
  523. OPS_Identifier(&s);
  524. if (__STRCMP(OPS_name, "VAR") == 0) {
  525. s = 60;
  526. }
  527. break;
  528. case 'W':
  529. OPS_Identifier(&s);
  530. if (__STRCMP(OPS_name, "WHILE") == 0) {
  531. s = 47;
  532. } else if (__STRCMP(OPS_name, "WITH") == 0) {
  533. s = 51;
  534. }
  535. break;
  536. case 'G': case 'H': case 'J': case 'K': case 'Q':
  537. case 'S': case 'X': case 'Y': case 'Z':
  538. OPS_Identifier(&s);
  539. break;
  540. case '[':
  541. s = 31;
  542. OPM_Get(&OPS_ch);
  543. break;
  544. case ']':
  545. s = 23;
  546. OPM_Get(&OPS_ch);
  547. break;
  548. case '^':
  549. s = 17;
  550. OPM_Get(&OPS_ch);
  551. break;
  552. case 'a': case 'b': case 'c': case 'd': case 'e':
  553. case 'f': case 'g': case 'h': case 'i': case 'j':
  554. case 'k': case 'l': case 'm': case 'n': case 'o':
  555. case 'p': case 'q': case 'r': case 's': case 't':
  556. case 'u': case 'v': case 'w': case 'x': case 'y':
  557. case 'z':
  558. OPS_Identifier(&s);
  559. break;
  560. case '{':
  561. s = 32;
  562. OPM_Get(&OPS_ch);
  563. break;
  564. case '|':
  565. s = 40;
  566. OPM_Get(&OPS_ch);
  567. break;
  568. case '}':
  569. s = 24;
  570. OPM_Get(&OPS_ch);
  571. break;
  572. case '~':
  573. s = 33;
  574. OPM_Get(&OPS_ch);
  575. break;
  576. case 0x7f:
  577. s = 21;
  578. OPM_Get(&OPS_ch);
  579. break;
  580. default:
  581. s = 0;
  582. OPM_Get(&OPS_ch);
  583. break;
  584. }
  585. *sym = s;
  586. Get__1_s = _s.lnk;
  587. }
  588. void OPS_Init (void)
  589. {
  590. OPS_ch = ' ';
  591. }
  592. export void *OPS__init(void)
  593. {
  594. __DEFMOD;
  595. __MODULE_IMPORT(OPM);
  596. __REGMOD("OPS", 0);
  597. __REGCMD("Init", OPS_Init);
  598. /* BEGIN */
  599. __ENDMOD;
  600. }