Compiler.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623
  1. #include <setjmp.h>
  2. #include <stdarg.h>
  3. #include <stdio.h>
  4. #include "Compiler.h"
  5. #include "FunctionMap.h"
  6. #include "Operation.h"
  7. #include "StringIntMap.h"
  8. #include "Tokenizer.h"
  9. #define ERROR_LENGTH 256
  10. #define RETURN_BUFFER 16
  11. static jmp_buf errorJump;
  12. static char error[ERROR_LENGTH] = {'\0'};
  13. static ByteCode* code;
  14. static int16 line = 1;
  15. static int varIndex = 0;
  16. static StringIntMap vars[2];
  17. static FunctionMap functions;
  18. static int returns[RETURN_BUFFER];
  19. static int returnIndex = 0;
  20. static int returnState = 0;
  21. static void cError(const char* format, ...) {
  22. va_list args;
  23. va_start(args, format);
  24. vsnprintf(error, ERROR_LENGTH, format, args);
  25. va_end(args);
  26. longjmp(errorJump, 0);
  27. }
  28. static int cAddVar(const char* var) {
  29. int index = vars[varIndex].entries;
  30. simAdd(vars + varIndex, var, &index);
  31. return index;
  32. }
  33. static void cUnexpectedToken(Token t) {
  34. cError("unexpected token on line %d: %s", line, tGetTokenName(t));
  35. }
  36. static void cAddOperation(Operation token) {
  37. unsigned char c = token;
  38. bcAddBytes(code, &c, 1);
  39. }
  40. static int cReserveInt() {
  41. return bcReserveBytes(code, sizeof(int));
  42. }
  43. static void cSetInt(int p, int i) {
  44. bcSetBytes(code, p, &i, sizeof(int));
  45. }
  46. static void cAddInt(int i) {
  47. bcAddBytes(code, &i, sizeof(int));
  48. }
  49. static void cAddInt16(int16 i) {
  50. bcAddBytes(code, &i, sizeof(int16));
  51. }
  52. static void cAddFloat(float f) {
  53. bcAddBytes(code, &f, sizeof(float));
  54. }
  55. static int cAddPush(int offset) {
  56. cAddOperation(OP_PUSH_VARS);
  57. int p = cReserveInt();
  58. cAddInt(offset);
  59. return p;
  60. }
  61. static void cAddPop(int p, int vars) {
  62. cAddOperation(OP_POP_VARS);
  63. cAddInt(vars);
  64. cSetInt(p, vars);
  65. }
  66. static Token cReadTokenAndLine() {
  67. Token t = tReadToken();
  68. if(tReadInt16(&line)) {
  69. return t;
  70. }
  71. return T_END;
  72. }
  73. static void cConsumeToken(Token wanted) {
  74. Token t = cReadTokenAndLine();
  75. if(wanted != t) {
  76. cError("unexpected token on line %d: expected '%s' got '%s'", line, tGetTokenName(wanted), tGetTokenName(t));
  77. }
  78. }
  79. static bool cConsumeTokenIf(Token t) {
  80. if(tPeekToken() == t) {
  81. cReadTokenAndLine();
  82. return true;
  83. }
  84. return false;
  85. }
  86. static void cConstantInt() {
  87. int value;
  88. if(!tReadInt(&value)) {
  89. cError("int token without an int on line %d", line);
  90. }
  91. cAddOperation(OP_PUSH_INT);
  92. cAddInt(value);
  93. }
  94. static void cConstantFloat() {
  95. float value;
  96. if(!tReadFloat(&value)) {
  97. cError("float token without a float on line %d", line);
  98. }
  99. cAddOperation(OP_PUSH_FLOAT);
  100. cAddFloat(value);
  101. }
  102. static const char* cReadString() {
  103. const char* literal = tReadString();
  104. if(literal == NULL) {
  105. cError("literal without string on line %d", line);
  106. }
  107. return literal;
  108. }
  109. static void cGetVar(const char* var) {
  110. cAddOperation(OP_GET);
  111. cAddInt(cAddVar(var));
  112. }
  113. static void cExpression();
  114. static int cCallFunctionArguments() {
  115. int arguments = 0;
  116. while(!cConsumeTokenIf(T_CLOSE_BRACKET)) {
  117. arguments++;
  118. cExpression();
  119. if(cConsumeTokenIf(T_COMMA) && tPeekToken() == T_CLOSE_BRACKET) {
  120. cUnexpectedToken(tPeekToken());
  121. }
  122. }
  123. return arguments;
  124. }
  125. static void cCallFunction(const char* literal, bool noReturn) {
  126. cAddOperation(OP_PUSH_INT);
  127. cAddInt(0);
  128. int arguments = cCallFunctionArguments();
  129. Function* f = fmSearch(&functions, literal, arguments);
  130. cAddOperation(OP_GOSUB);
  131. if(f == NULL) {
  132. fmEnqueue(&functions, literal, arguments, line, cReserveInt(), noReturn);
  133. cAddInt(arguments);
  134. cAddOperation(OP_NOTHING);
  135. } else {
  136. if(!noReturn && !f->returns) {
  137. cError("function '%s' needs a return value on line %d", f->name, line);
  138. }
  139. cAddInt(f->address);
  140. cAddInt(arguments);
  141. if(f->returns && noReturn) {
  142. cAddOperation(OP_POP);
  143. }
  144. }
  145. }
  146. static void cPostIncrement(const char* literal) {
  147. cAddOperation(OP_POST_INCREMENT);
  148. cAddInt(cAddVar(literal));
  149. }
  150. static void cPostDecrement(const char* literal) {
  151. cAddOperation(OP_POST_DECREMENT);
  152. cAddInt(cAddVar(literal));
  153. }
  154. static void cLiteral() {
  155. const char* literal = cReadString();
  156. if(cConsumeTokenIf(T_OPEN_BRACKET)) {
  157. cCallFunction(literal, false);
  158. } else if(cConsumeTokenIf(T_INCREMENT)) {
  159. cPostIncrement(literal);
  160. } else if(cConsumeTokenIf(T_DECREMENT)) {
  161. cPostDecrement(literal);
  162. } else {
  163. cGetVar(literal);
  164. }
  165. }
  166. static void cPrimary() {
  167. Token t = cReadTokenAndLine();
  168. switch(t) {
  169. case T_INT: cConstantInt(); break;
  170. case T_FLOAT: cConstantFloat(); break;
  171. case T_NULL: cAddOperation(OP_PUSH_NULL); break;
  172. case T_TRUE: cAddOperation(OP_PUSH_TRUE); break;
  173. case T_FALSE: cAddOperation(OP_PUSH_FALSE); break;
  174. case T_OPEN_BRACKET:
  175. cExpression();
  176. cConsumeToken(T_CLOSE_BRACKET);
  177. break;
  178. case T_LITERAL: cLiteral(); break;
  179. default: cUnexpectedToken(t); break;
  180. }
  181. }
  182. static void cPreIncrement() {
  183. cConsumeToken(T_LITERAL);
  184. cAddOperation(OP_PRE_INCREMENT);
  185. cAddInt(cAddVar(cReadString()));
  186. }
  187. static void cPreDecrement() {
  188. cConsumeToken(T_LITERAL);
  189. cAddOperation(OP_PRE_DECREMENT);
  190. cAddInt(cAddVar(cReadString()));
  191. }
  192. static void cPreUnary() {
  193. if(cConsumeTokenIf(T_SUB)) {
  194. cPrimary();
  195. cAddOperation(OP_INVERT_SIGN);
  196. } else if(cConsumeTokenIf(T_INCREMENT)) {
  197. cPreIncrement();
  198. } else if(cConsumeTokenIf(T_DECREMENT)) {
  199. cPreDecrement();
  200. } else if(cConsumeTokenIf(T_NOT)) {
  201. int counter = 1;
  202. while(cConsumeTokenIf(T_NOT)) {
  203. counter++;
  204. }
  205. cPrimary();
  206. cAddOperation(OP_NOT);
  207. if((counter & 1) == 0) {
  208. cAddOperation(OP_NOT);
  209. }
  210. } else {
  211. cPrimary();
  212. }
  213. }
  214. static void cMul() {
  215. cPreUnary();
  216. while(true) {
  217. if(cConsumeTokenIf(T_MUL)) {
  218. cPreUnary();
  219. cAddOperation(OP_MUL);
  220. } else if(cConsumeTokenIf(T_DIV)) {
  221. cPreUnary();
  222. cAddOperation(OP_DIV);
  223. } else if(cConsumeTokenIf(T_MOD)) {
  224. cPreUnary();
  225. cAddOperation(OP_MOD);
  226. } else {
  227. break;
  228. }
  229. }
  230. }
  231. static void cAdd() {
  232. cMul();
  233. while(true) {
  234. if(cConsumeTokenIf(T_ADD)) {
  235. cMul();
  236. cAddOperation(OP_ADD);
  237. } else if(cConsumeTokenIf(T_SUB)) {
  238. cMul();
  239. cAddOperation(OP_SUB);
  240. } else {
  241. break;
  242. }
  243. }
  244. }
  245. static void cComparison() {
  246. cAdd();
  247. while(true) {
  248. if(cConsumeTokenIf(T_LESS)) {
  249. cAdd();
  250. cAddOperation(OP_LESS);
  251. } else if(cConsumeTokenIf(T_LESS_EQUAL)) {
  252. cAdd();
  253. cAddOperation(OP_GREATER);
  254. cAddOperation(OP_NOT);
  255. } else if(cConsumeTokenIf(T_GREATER)) {
  256. cAdd();
  257. cAddOperation(OP_GREATER);
  258. } else if(cConsumeTokenIf(T_GREATER_EQUAL)) {
  259. cAdd();
  260. cAddOperation(OP_LESS);
  261. cAddOperation(OP_NOT);
  262. } else if(cConsumeTokenIf(T_EQUAL)) {
  263. cAdd();
  264. cAddOperation(OP_EQUAL);
  265. } else if(cConsumeTokenIf(T_NOT_EQUAL)) {
  266. cAdd();
  267. cAddOperation(OP_EQUAL);
  268. cAddOperation(OP_NOT);
  269. } else {
  270. break;
  271. }
  272. }
  273. }
  274. static void cLogical() {
  275. cComparison();
  276. while(true) {
  277. if(cConsumeTokenIf(T_AND)) {
  278. cAddOperation(OP_DUPLICATE);
  279. cAddOperation(OP_IF_GOTO);
  280. int p = cReserveInt();
  281. cComparison();
  282. cAddOperation(OP_AND);
  283. cSetInt(p, code->length);
  284. } else if(cConsumeTokenIf(T_OR)) {
  285. cAddOperation(OP_DUPLICATE);
  286. cAddOperation(OP_NOT);
  287. cAddOperation(OP_IF_GOTO);
  288. int p = cReserveInt();
  289. cComparison();
  290. cAddOperation(OP_OR);
  291. cSetInt(p, code->length);
  292. } else {
  293. break;
  294. }
  295. }
  296. }
  297. static void cExpression() {
  298. cLogical();
  299. }
  300. static void cSetVar(const char* literal) {
  301. cExpression();
  302. cAddOperation(OP_SET);
  303. cAddInt(cAddVar(literal));
  304. }
  305. static void cOperationSetVar(const char* literal, Operation op) {
  306. cGetVar(literal);
  307. cExpression();
  308. cAddOperation(op);
  309. cAddOperation(OP_SET);
  310. cAddInt(cAddVar(literal));
  311. }
  312. static void cLineLiteral() {
  313. const char* literal = cReadString();
  314. Token t = cReadTokenAndLine();
  315. switch(t) {
  316. case T_SET: cSetVar(literal); break;
  317. case T_ADD_SET: cOperationSetVar(literal, OP_ADD); break;
  318. case T_SUB_SET: cOperationSetVar(literal, OP_SUB); break;
  319. case T_MUL_SET: cOperationSetVar(literal, OP_MUL); break;
  320. case T_DIV_SET: cOperationSetVar(literal, OP_DIV); break;
  321. case T_MOD_SET: cOperationSetVar(literal, OP_MOD); break;
  322. case T_OPEN_BRACKET: cCallFunction(literal, true); break;
  323. case T_INCREMENT:
  324. cPostIncrement(literal);
  325. cAddOperation(OP_POP);
  326. break;
  327. case T_DECREMENT:
  328. cPostDecrement(literal);
  329. cAddOperation(OP_POP);
  330. break;
  331. default: cUnexpectedToken(t);
  332. }
  333. }
  334. static int cFunctionArguments() {
  335. int arguments = 0;
  336. while(!cConsumeTokenIf(T_CLOSE_BRACKET)) {
  337. cConsumeToken(T_LITERAL);
  338. arguments++;
  339. cAddVar(cReadString());
  340. if(cConsumeTokenIf(T_COMMA) && tPeekToken() != T_LITERAL) {
  341. cUnexpectedToken(tPeekToken());
  342. }
  343. }
  344. return arguments;
  345. }
  346. static void cLine(Token t);
  347. static void cConsumeBody() {
  348. cConsumeToken(T_OPEN_CURVED_BRACKET);
  349. int oldLine = line;
  350. while(!cConsumeTokenIf(T_CLOSE_CURVED_BRACKET)) {
  351. Token t = cReadTokenAndLine();
  352. if(t == T_END) {
  353. cError("unexpected end of file: non closed curved bracket on line %d", oldLine);
  354. }
  355. cLine(t);
  356. }
  357. }
  358. static void cLinkReturns() {
  359. for(int i = 0; i < returnIndex; i++) {
  360. cSetInt(returns[i], vars[1].entries);
  361. }
  362. returnIndex = 0;
  363. }
  364. static void cFunctionBody(const char* name, int arguments) {
  365. int oldLine = line;
  366. cAddOperation(OP_GOTO);
  367. int gotoIndex = cReserveInt();
  368. int address = code->length;
  369. returnState = 0;
  370. int p = cAddPush(arguments);
  371. cConsumeBody();
  372. cAddPop(p, vars[1].entries);
  373. cLinkReturns();
  374. if(!fmAdd(&functions, name, arguments, address, returnState == 2)) {
  375. cError("function registered twice on line %d", oldLine);
  376. }
  377. cAddOperation(OP_RETURN);
  378. cSetInt(gotoIndex, code->length);
  379. }
  380. static void cFunction() {
  381. if(varIndex == 1) {
  382. cError("function inside function on line %d", line);
  383. }
  384. cConsumeToken(T_LITERAL);
  385. const char* name = cReadString();
  386. cConsumeToken(T_OPEN_BRACKET);
  387. varIndex = 1;
  388. vars[1].entries = 0;
  389. cFunctionBody(name, cFunctionArguments());
  390. varIndex = 0;
  391. }
  392. static void cAddReturn() {
  393. cAddOperation(OP_POP_VARS);
  394. returns[returnIndex++] = cReserveInt(vars);
  395. cAddOperation(OP_RETURN);
  396. }
  397. static void cReturn() {
  398. if(varIndex == 0) {
  399. cError("return without a function on line %d", line);
  400. } else if(returnIndex >= RETURN_BUFFER) {
  401. cError("too much returns in function around line %d", line);
  402. }
  403. if(cConsumeTokenIf(T_SEMICOLON)) {
  404. if(returnState == 2) {
  405. cError("mixed return type on line %d", line);
  406. }
  407. returnState = 1;
  408. cAddReturn();
  409. } else {
  410. if(returnState == 1) {
  411. cError("mixed return type on line %d", line);
  412. }
  413. returnState = 2;
  414. cExpression();
  415. cAddOperation(OP_SET_RETURN);
  416. cAddReturn();
  417. cConsumeToken(T_SEMICOLON);
  418. }
  419. }
  420. static void cPrint() {
  421. cExpression();
  422. cConsumeToken(T_SEMICOLON);
  423. cAddOperation(OP_PRINT);
  424. }
  425. static void cIf() {
  426. cConsumeToken(T_OPEN_BRACKET);
  427. cExpression();
  428. cConsumeToken(T_CLOSE_BRACKET);
  429. cAddOperation(OP_IF_GOTO);
  430. int ifP = cReserveInt();
  431. cConsumeBody();
  432. cSetInt(ifP, code->length);
  433. if(cConsumeTokenIf(T_ELSE)) {
  434. cAddOperation(OP_GOTO);
  435. int elseP = cReserveInt();
  436. cSetInt(ifP, code->length);
  437. if(cConsumeTokenIf(T_IF)) {
  438. cIf();
  439. } else {
  440. cConsumeBody();
  441. }
  442. cSetInt(elseP, code->length);
  443. }
  444. }
  445. static void cWhile() {
  446. int start = code->length;
  447. cConsumeToken(T_OPEN_BRACKET);
  448. cExpression();
  449. cConsumeToken(T_CLOSE_BRACKET);
  450. cAddOperation(OP_IF_GOTO);
  451. int ifP = cReserveInt();
  452. cConsumeBody();
  453. cAddOperation(OP_GOTO);
  454. cAddInt(start);
  455. cSetInt(ifP, code->length);
  456. }
  457. static void cLineExpression(Token t) {
  458. switch(t) {
  459. case T_LITERAL: cLineLiteral(); break;
  460. case T_INCREMENT:
  461. cPreIncrement();
  462. cAddOperation(OP_POP);
  463. break;
  464. case T_DECREMENT:
  465. cPreDecrement();
  466. cAddOperation(OP_POP);
  467. break;
  468. default: cUnexpectedToken(t);
  469. }
  470. }
  471. static void cFor() {
  472. cConsumeToken(T_OPEN_BRACKET);
  473. cLineExpression(cReadTokenAndLine());
  474. cConsumeToken(T_SEMICOLON);
  475. int startCheck = code->length;
  476. cExpression();
  477. cConsumeToken(T_SEMICOLON);
  478. cAddOperation(OP_IF_GOTO);
  479. int end = cReserveInt();
  480. cAddOperation(OP_GOTO);
  481. int beginBody = cReserveInt();
  482. int startPerLoop = code->length;
  483. cLineExpression(cReadTokenAndLine());
  484. cAddOperation(OP_GOTO);
  485. cAddInt(startCheck);
  486. cConsumeToken(T_CLOSE_BRACKET);
  487. cSetInt(beginBody, code->length);
  488. cConsumeBody();
  489. cAddOperation(OP_GOTO);
  490. cAddInt(startPerLoop);
  491. cSetInt(end, code->length);
  492. }
  493. static void cLine(Token t) {
  494. cAddOperation(OP_LINE);
  495. cAddInt16(line);
  496. switch(t) {
  497. case T_PRINT: cPrint(); break;
  498. case T_FUNCTION: cFunction(); break;
  499. case T_RETURN: cReturn(); break;
  500. case T_IF: cIf(); break;
  501. case T_WHILE: cWhile(); break;
  502. case T_FOR: cFor(); break;
  503. default: cLineExpression(t); cConsumeToken(T_SEMICOLON);
  504. }
  505. }
  506. static void cForEachLine() {
  507. Token t = cReadTokenAndLine();
  508. while(t != T_END) {
  509. cLine(t);
  510. t = cReadTokenAndLine();
  511. }
  512. }
  513. static void cLinkQueuedFunctions() {
  514. for(int i = 0; i < functions.queueEntries; i++) {
  515. Function* f = fmSearch(&functions, functions.queue[i].name, functions.queue[i].arguments);
  516. if(f == NULL) {
  517. cError("unknown function on line %d", functions.queue[i].line);
  518. } else if(!functions.queue[i].noReturn && !f->returns) {
  519. cError("function '%s' needs a return value on line %d", f->name, functions.queue[i].line);
  520. }
  521. cSetInt(functions.queue[i].reserved, f->address);
  522. if(functions.queue[i].noReturn && f->returns) {
  523. code->code[functions.queue[i].reserved + sizeof(int) * 2] = OP_POP;
  524. }
  525. }
  526. }
  527. static void cAllocAndCompile() {
  528. varIndex = 0;
  529. returnIndex = 0;
  530. simInit(vars);
  531. simInit(vars + 1);
  532. fmInit(&functions);
  533. if(!setjmp(errorJump)) {
  534. int p = cAddPush(0);
  535. cForEachLine();
  536. cAddPop(p, vars[varIndex].entries);
  537. cLinkQueuedFunctions();
  538. }
  539. fmDelete(&functions);
  540. simDelete(vars + 1);
  541. simDelete(vars);
  542. }
  543. ByteCode* cCompile() {
  544. error[0] = '\0';
  545. code = bcInit();
  546. cAllocAndCompile();
  547. if(error[0] != '\0') {
  548. bcDelete(code);
  549. return NULL;
  550. }
  551. return code;
  552. }
  553. const char* cGetError() {
  554. return error;
  555. }