Compiler.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578
  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 {
  201. cPrimary();
  202. }
  203. }
  204. static void cMul() {
  205. cPreUnary();
  206. while(true) {
  207. if(cConsumeTokenIf(T_MUL)) {
  208. cPreUnary();
  209. cAddOperation(OP_MUL);
  210. } else if(cConsumeTokenIf(T_DIV)) {
  211. cPreUnary();
  212. cAddOperation(OP_DIV);
  213. } else if(cConsumeTokenIf(T_MOD)) {
  214. cPreUnary();
  215. cAddOperation(OP_MOD);
  216. } else {
  217. break;
  218. }
  219. }
  220. }
  221. static void cAdd() {
  222. cMul();
  223. while(true) {
  224. if(cConsumeTokenIf(T_ADD)) {
  225. cMul();
  226. cAddOperation(OP_ADD);
  227. } else if(cConsumeTokenIf(T_SUB)) {
  228. cMul();
  229. cAddOperation(OP_SUB);
  230. } else {
  231. break;
  232. }
  233. }
  234. }
  235. static void cComparison() {
  236. cAdd();
  237. while(true) {
  238. if(cConsumeTokenIf(T_LESS)) {
  239. cAdd();
  240. cAddOperation(OP_LESS);
  241. } else if(cConsumeTokenIf(T_LESS_EQUAL)) {
  242. cAdd();
  243. cAddOperation(OP_GREATER);
  244. cAddOperation(OP_NOT);
  245. } else if(cConsumeTokenIf(T_GREATER)) {
  246. cAdd();
  247. cAddOperation(OP_GREATER);
  248. } else if(cConsumeTokenIf(T_GREATER_EQUAL)) {
  249. cAdd();
  250. cAddOperation(OP_LESS);
  251. cAddOperation(OP_NOT);
  252. } else if(cConsumeTokenIf(T_EQUAL)) {
  253. cAdd();
  254. cAddOperation(OP_EQUAL);
  255. } else if(cConsumeTokenIf(T_NOT_EQUAL)) {
  256. cAdd();
  257. cAddOperation(OP_EQUAL);
  258. cAddOperation(OP_NOT);
  259. } else {
  260. break;
  261. }
  262. }
  263. }
  264. static void cLogical() {
  265. cComparison();
  266. while(true) {
  267. if(cConsumeTokenIf(T_AND)) {
  268. cAddOperation(OP_DUPLICATE);
  269. cAddOperation(OP_IF_GOTO);
  270. int p = cReserveInt();
  271. cComparison();
  272. cAddOperation(OP_AND);
  273. cSetInt(p, code->length);
  274. } else if(cConsumeTokenIf(T_OR)) {
  275. cAddOperation(OP_DUPLICATE);
  276. cAddOperation(OP_NOT);
  277. cAddOperation(OP_IF_GOTO);
  278. int p = cReserveInt();
  279. cComparison();
  280. cAddOperation(OP_OR);
  281. cSetInt(p, code->length);
  282. } else {
  283. break;
  284. }
  285. }
  286. }
  287. static void cExpression() {
  288. cLogical();
  289. }
  290. static void cSetVar(const char* literal) {
  291. cExpression();
  292. cConsumeToken(T_SEMICOLON);
  293. cAddOperation(OP_SET);
  294. cAddInt(cAddVar(literal));
  295. }
  296. static void cLineLiteral() {
  297. const char* literal = cReadString();
  298. Token t = cReadTokenAndLine();
  299. switch(t) {
  300. case T_SET: cSetVar(literal); break;
  301. case T_OPEN_BRACKET:
  302. cCallFunction(literal, true);
  303. cConsumeToken(T_SEMICOLON);
  304. break;
  305. case T_INCREMENT:
  306. cPostIncrement(literal);
  307. cConsumeToken(T_SEMICOLON);
  308. cAddOperation(OP_POP);
  309. break;
  310. case T_DECREMENT:
  311. cPostDecrement(literal);
  312. cConsumeToken(T_SEMICOLON);
  313. cAddOperation(OP_POP);
  314. break;
  315. default: cUnexpectedToken(t);
  316. }
  317. }
  318. static int cFunctionArguments() {
  319. int arguments = 0;
  320. while(!cConsumeTokenIf(T_CLOSE_BRACKET)) {
  321. cConsumeToken(T_LITERAL);
  322. arguments++;
  323. cAddVar(cReadString());
  324. if(cConsumeTokenIf(T_COMMA) && tPeekToken() != T_LITERAL) {
  325. cUnexpectedToken(tPeekToken());
  326. }
  327. }
  328. return arguments;
  329. }
  330. static void cLine(Token t);
  331. static void cConsumeBody() {
  332. cConsumeToken(T_OPEN_CURVED_BRACKET);
  333. int oldLine = line;
  334. while(!cConsumeTokenIf(T_CLOSE_CURVED_BRACKET)) {
  335. Token t = cReadTokenAndLine();
  336. if(t == T_END) {
  337. cError("unexpected end of file: non closed curved bracket on line %d", oldLine);
  338. }
  339. cLine(t);
  340. }
  341. }
  342. static void cLinkReturns() {
  343. for(int i = 0; i < returnIndex; i++) {
  344. cSetInt(returns[i], vars[1].entries);
  345. }
  346. returnIndex = 0;
  347. }
  348. static void cFunctionBody(const char* name, int arguments) {
  349. int oldLine = line;
  350. cAddOperation(OP_GOTO);
  351. int gotoIndex = cReserveInt();
  352. int address = code->length;
  353. returnState = 0;
  354. int p = cAddPush(arguments);
  355. cConsumeBody();
  356. cAddPop(p, vars[1].entries);
  357. cLinkReturns();
  358. if(!fmAdd(&functions, name, arguments, address, returnState == 2)) {
  359. cError("function registered twice on line %d", oldLine);
  360. }
  361. cAddOperation(OP_RETURN);
  362. cSetInt(gotoIndex, code->length);
  363. }
  364. static void cFunction() {
  365. if(varIndex == 1) {
  366. cError("function inside function on line %d", line);
  367. }
  368. cConsumeToken(T_LITERAL);
  369. const char* name = cReadString();
  370. cConsumeToken(T_OPEN_BRACKET);
  371. varIndex = 1;
  372. vars[1].entries = 0;
  373. cFunctionBody(name, cFunctionArguments());
  374. varIndex = 0;
  375. }
  376. static void cAddReturn() {
  377. cAddOperation(OP_POP_VARS);
  378. returns[returnIndex++] = cReserveInt(vars);
  379. cAddOperation(OP_RETURN);
  380. }
  381. static void cReturn() {
  382. if(varIndex == 0) {
  383. cError("return without a function on line %d", line);
  384. } else if(returnIndex >= RETURN_BUFFER) {
  385. cError("too much returns in function around line %d", line);
  386. }
  387. if(cConsumeTokenIf(T_SEMICOLON)) {
  388. if(returnState == 2) {
  389. cError("mixed return type on line %d", line);
  390. }
  391. returnState = 1;
  392. cAddReturn();
  393. } else {
  394. if(returnState == 1) {
  395. cError("mixed return type on line %d", line);
  396. }
  397. returnState = 2;
  398. cExpression();
  399. cAddOperation(OP_SET_RETURN);
  400. cAddReturn();
  401. cConsumeToken(T_SEMICOLON);
  402. }
  403. }
  404. static void cPrint() {
  405. cExpression();
  406. cConsumeToken(T_SEMICOLON);
  407. cAddOperation(OP_PRINT);
  408. }
  409. static void cIf() {
  410. cConsumeToken(T_OPEN_BRACKET);
  411. cExpression();
  412. cConsumeToken(T_CLOSE_BRACKET);
  413. cAddOperation(OP_IF_GOTO);
  414. int ifP = cReserveInt();
  415. cConsumeBody();
  416. cSetInt(ifP, code->length);
  417. if(cConsumeTokenIf(T_ELSE)) {
  418. cAddOperation(OP_GOTO);
  419. int elseP = cReserveInt();
  420. cSetInt(ifP, code->length);
  421. if(cConsumeTokenIf(T_IF)) {
  422. cIf();
  423. } else {
  424. cConsumeBody();
  425. }
  426. cSetInt(elseP, code->length);
  427. }
  428. }
  429. static void cWhile() {
  430. int start = code->length;
  431. cConsumeToken(T_OPEN_BRACKET);
  432. cExpression();
  433. cConsumeToken(T_CLOSE_BRACKET);
  434. cAddOperation(OP_IF_GOTO);
  435. int ifP = cReserveInt();
  436. cConsumeBody();
  437. cAddOperation(OP_GOTO);
  438. cAddInt(start);
  439. cSetInt(ifP, code->length);
  440. }
  441. static void cLine(Token t) {
  442. cAddOperation(OP_LINE);
  443. cAddInt16(line);
  444. switch(t) {
  445. case T_PRINT: cPrint(); break;
  446. case T_LITERAL: cLineLiteral(); break;
  447. case T_FUNCTION: cFunction(); break;
  448. case T_RETURN: cReturn(); break;
  449. case T_IF: cIf(); break;
  450. case T_WHILE: cWhile(); break;
  451. case T_INCREMENT:
  452. cPreIncrement();
  453. cConsumeToken(T_SEMICOLON);
  454. cAddOperation(OP_POP);
  455. break;
  456. case T_DECREMENT:
  457. cPreDecrement();
  458. cConsumeToken(T_SEMICOLON);
  459. cAddOperation(OP_POP);
  460. break;
  461. default: cUnexpectedToken(t);
  462. }
  463. }
  464. static void cForEachLine() {
  465. Token t = cReadTokenAndLine();
  466. while(t != T_END) {
  467. cLine(t);
  468. t = cReadTokenAndLine();
  469. }
  470. }
  471. static void cLinkQueuedFunctions() {
  472. for(int i = 0; i < functions.queueEntries; i++) {
  473. Function* f = fmSearch(&functions, functions.queue[i].name, functions.queue[i].arguments);
  474. if(f == NULL) {
  475. cError("unknown function on line %d", functions.queue[i].line);
  476. } else if(!functions.queue[i].noReturn && !f->returns) {
  477. cError("function '%s' needs a return value on line %d", f->name, functions.queue[i].line);
  478. }
  479. cSetInt(functions.queue[i].reserved, f->address);
  480. if(functions.queue[i].noReturn && f->returns) {
  481. code->code[functions.queue[i].reserved + sizeof(int) * 2] = OP_POP;
  482. }
  483. }
  484. }
  485. static void cAllocAndCompile() {
  486. varIndex = 0;
  487. returnIndex = 0;
  488. simInit(vars);
  489. simInit(vars + 1);
  490. fmInit(&functions);
  491. if(!setjmp(errorJump)) {
  492. int p = cAddPush(0);
  493. cForEachLine();
  494. cAddPop(p, vars[varIndex].entries);
  495. cLinkQueuedFunctions();
  496. }
  497. fmDelete(&functions);
  498. simDelete(vars + 1);
  499. simDelete(vars);
  500. }
  501. ByteCode* cCompile() {
  502. error[0] = '\0';
  503. code = bcInit();
  504. cAllocAndCompile();
  505. if(error[0] != '\0') {
  506. bcDelete(code);
  507. return NULL;
  508. }
  509. return code;
  510. }
  511. const char* cGetError() {
  512. return error;
  513. }