Compiler.c 34 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222
  1. #include <setjmp.h>
  2. #include <stdarg.h>
  3. #include <stdio.h>
  4. #include <stdlib.h>
  5. #include <string.h>
  6. #include "Compiler.h"
  7. #include "DataType.h"
  8. #include "tokenizer/Tokenizer.h"
  9. #include "utils/Functions.h"
  10. #include "utils/Variables.h"
  11. #include "vm/Operation.h"
  12. #define ERROR_LENGTH 256
  13. #define RETURN_BUFFER 16
  14. #define BREAK_BUFFER 32
  15. #define DT_OPERATION(op) \
  16. case DT_INT: cAddOperation(OP_##op##_INT); break; \
  17. case DT_BOOL: cAddOperation(OP_##op##_BOOL); break; \
  18. case DT_FLOAT: cAddOperation(OP_##op##_FLOAT); break;
  19. static jmp_buf errorJump;
  20. static char error[ERROR_LENGTH] = {'\0'};
  21. static ByteCode* code;
  22. static int16 line = 1;
  23. static Variables vars;
  24. static Functions functions;
  25. static Functions functionQueue;
  26. static Structs structs;
  27. static int returns[RETURN_BUFFER];
  28. static int returnIndex = 0;
  29. static bool hasReturn = false;
  30. static DataType returnType;
  31. static int breaks[BREAK_BUFFER];
  32. static int breakIndex = 0;
  33. static int forWhileStack = 0;
  34. static int continueAt = 0;
  35. typedef struct {
  36. Operation intOp;
  37. Operation floatOp;
  38. Operation boolOp;
  39. Operation pointerOp;
  40. const char* name;
  41. } TypedOp;
  42. static const TypedOp TYPED_MUL = {OP_MUL_INT, OP_MUL_FLOAT, OP_NOTHING,
  43. OP_NOTHING, "*"};
  44. static const TypedOp TYPED_DIV = {OP_DIV_INT, OP_DIV_FLOAT, OP_NOTHING,
  45. OP_NOTHING, "/"};
  46. static const TypedOp TYPED_MOD = {OP_MOD_INT, OP_NOTHING, OP_NOTHING,
  47. OP_NOTHING, "%"};
  48. static const TypedOp TYPED_ADD = {OP_ADD_INT, OP_ADD_FLOAT, OP_NOTHING,
  49. OP_NOTHING, "+"};
  50. static const TypedOp TYPED_SUB = {OP_SUB_INT, OP_SUB_FLOAT, OP_NOTHING,
  51. OP_NOTHING, "-"};
  52. static const TypedOp TYPED_LESS = {OP_LESS_INT, OP_LESS_FLOAT, OP_NOTHING,
  53. OP_NOTHING, "<"};
  54. static const TypedOp TYPED_LESS_EQUAL = {OP_GREATER_INT, OP_GREATER_FLOAT,
  55. OP_NOTHING, OP_NOTHING, "<="};
  56. static const TypedOp TYPED_GREATER = {OP_GREATER_INT, OP_GREATER_FLOAT,
  57. OP_NOTHING, OP_NOTHING, ">"};
  58. static const TypedOp TYPED_GREATER_EQUAL = {OP_LESS_INT, OP_LESS_FLOAT,
  59. OP_NOTHING, OP_NOTHING, ">="};
  60. static const TypedOp TYPED_EQUAL = {OP_EQUAL_INT, OP_EQUAL_FLOAT, OP_EQUAL_BOOL,
  61. OP_EQUAL_POINTER, "=="};
  62. static const TypedOp TYPED_NOT_EQUAL = {OP_EQUAL_INT, OP_EQUAL_FLOAT,
  63. OP_EQUAL_BOOL, OP_EQUAL_POINTER, "!="};
  64. static const TypedOp TYPED_BIT_OR = {OP_BIT_OR, OP_NOTHING, OP_NOTHING,
  65. OP_NOTHING, "|"};
  66. static const TypedOp TYPED_BIT_XOR = {OP_BIT_XOR, OP_NOTHING, OP_NOTHING,
  67. OP_NOTHING, "^"};
  68. static const TypedOp TYPED_BIT_AND = {OP_BIT_AND, OP_NOTHING, OP_NOTHING,
  69. OP_NOTHING, "&"};
  70. static const TypedOp TYPED_LEFT_SHIFT = {OP_LEFT_SHIFT, OP_NOTHING, OP_NOTHING,
  71. OP_NOTHING, "<<"};
  72. static const TypedOp TYPED_RIGHT_SHIFT = {OP_RIGHT_SHIFT, OP_NOTHING,
  73. OP_NOTHING, OP_NOTHING, ">>"};
  74. static void cError(const char* format, ...) {
  75. va_list args;
  76. va_start(args, format);
  77. vsnprintf(error, ERROR_LENGTH, format, args);
  78. va_end(args);
  79. longjmp(errorJump, 0);
  80. }
  81. static const char* cGetName(DataType dt) {
  82. return dtGetName(&structs, dt);
  83. }
  84. static void cInvalidOperation(DataType a, DataType b, const char* op) {
  85. cError("invalid operation: %s %s %s", cGetName(a), op, cGetName(b));
  86. }
  87. static void cNotDeclared(const char* name) {
  88. cError("variable %s has not been declared", name);
  89. }
  90. static void cDeclared(const char* name) {
  91. cError("%s has already been declared", name);
  92. }
  93. static void cTooMuchArguments() {
  94. cError("too much function arguments");
  95. }
  96. static void cUnexpectedToken(Token t) {
  97. cError("unexpected token on line %d: %s", line, tGetName(t));
  98. }
  99. static void cAddOperation(Operation token) {
  100. unsigned char c = token;
  101. bcAddBytes(code, &c, 1);
  102. }
  103. static int cReserveInt() {
  104. return bcReserveBytes(code, sizeof(int));
  105. }
  106. static void cSetInt(int p, int i) {
  107. bcSetBytes(code, p, &i, sizeof(int));
  108. }
  109. static void cAddInt(int i) {
  110. bcAddBytes(code, &i, sizeof(int));
  111. }
  112. static void cAddIntOperation(Operation token, int i) {
  113. cAddOperation(token);
  114. cAddInt(i);
  115. }
  116. static void cAddByteOperation(Operation token, char c) {
  117. cAddOperation(token);
  118. bcAddBytes(code, &c, sizeof(char));
  119. }
  120. static void cAddInt16(int16 i) {
  121. bcAddBytes(code, &i, sizeof(int16));
  122. }
  123. static Token cReadTokenAndLine() {
  124. Token t = tReadToken();
  125. if(tReadInt16(&line)) {
  126. return t;
  127. }
  128. return T_END;
  129. }
  130. static void cConsumeToken(Token wanted) {
  131. Token t = cReadTokenAndLine();
  132. if(wanted != t) {
  133. cError("unexpected token on line %d: expected '%s' got '%s'", line,
  134. tGetName(wanted), tGetName(t));
  135. }
  136. }
  137. static bool cConsumeTokenIf(Token t) {
  138. if(tPeekToken() == t) {
  139. cReadTokenAndLine();
  140. return true;
  141. }
  142. return false;
  143. }
  144. static void cConstantInt() {
  145. int value;
  146. if(!tReadInt(&value)) {
  147. cError("int token without an int on line %d", line);
  148. }
  149. cAddIntOperation(OP_PUSH_INT, value);
  150. }
  151. static void cConstantFloat() {
  152. float value;
  153. if(!tReadFloat(&value)) {
  154. cError("float token without a float on line %d", line);
  155. }
  156. cAddOperation(OP_PUSH_FLOAT);
  157. bcAddBytes(code, &value, sizeof(float));
  158. }
  159. static const char* cReadString() {
  160. int length;
  161. const char* literal = tReadString(&length);
  162. if(literal == NULL) {
  163. cError("literal without string on line %d", line);
  164. }
  165. return literal;
  166. }
  167. static DataType cExpression();
  168. static void cCallFunctionArguments(Function* f) {
  169. while(!cConsumeTokenIf(T_CLOSE_BRACKET)) {
  170. DataType dt = cExpression();
  171. if(fAddArgument(f, dt, &structs)) {
  172. cTooMuchArguments();
  173. }
  174. if(cConsumeTokenIf(T_COMMA) && tPeekToken() == T_CLOSE_BRACKET) {
  175. cUnexpectedToken(tPeekToken());
  176. }
  177. }
  178. }
  179. static DataType cCallFunction(const char* name) {
  180. cAddIntOperation(OP_PUSH_INT, 0);
  181. Function f;
  182. fInit(&f, name, line);
  183. cCallFunctionArguments(&f);
  184. cAddOperation(OP_GOSUB);
  185. Function* found = fsSearch(&functions, &f);
  186. if(found == NULL) {
  187. cError("unknown function");
  188. }
  189. if(found->address == -1) {
  190. f.returnType = found->returnType;
  191. f.address = cReserveInt();
  192. fsAdd(&functionQueue, &f);
  193. } else {
  194. cAddInt(found->address);
  195. }
  196. cAddInt(found->size);
  197. return found->returnType;
  198. }
  199. static void cWalkStruct(Variable* v) {
  200. int offset = 0;
  201. while(true) {
  202. if(cConsumeTokenIf(T_OPEN_SQUARE_BRACKET)) {
  203. if(!dtIsPointer(v->type)) {
  204. cError("[] need a pointer");
  205. }
  206. cAddOperation(OP_REFERENCE);
  207. DataType index = cExpression();
  208. if(!dtCompare(index, dtInt())) {
  209. cError("array index must be an int");
  210. }
  211. cConsumeToken(T_CLOSE_SQUARE_BRACKET);
  212. cAddOperation(OP_ADD_REFERENCE);
  213. v->type = dtReference(v->type);
  214. }
  215. int pointers;
  216. if(cConsumeTokenIf(T_ARROW)) {
  217. pointers = 1;
  218. cAddOperation(OP_REFERENCE);
  219. } else if(cConsumeTokenIf(T_POINT)) {
  220. pointers = 0;
  221. } else {
  222. break;
  223. }
  224. Struct* st = dtGetStruct(&structs, v->type);
  225. if(st == NULL || v->type.pointers != pointers) {
  226. cError("%s is not a %s but %s", v->name,
  227. pointers ? "struct*" : "struct", cGetName(v->type));
  228. }
  229. cConsumeToken(T_LITERAL);
  230. const char* name = cReadString();
  231. Variable inner;
  232. if(vSearchStruct(&inner, &structs, st, name)) {
  233. cError("%s has no member %s", v->name, name);
  234. }
  235. v->type = inner.type;
  236. v->name = inner.name;
  237. offset += inner.address;
  238. }
  239. if(offset > 0) {
  240. cAddIntOperation(OP_PUSH_INT, offset);
  241. cAddOperation(OP_ADD_REFERENCE);
  242. }
  243. }
  244. static void cReference(Variable* v, int dimension) {
  245. cAddIntOperation(OP_DEREFERENCE_VAR, v->address);
  246. while(dimension > 0) {
  247. if(!dtIsPointer(v->type)) {
  248. cError("too many *");
  249. }
  250. v->type = dtReference(v->type);
  251. dimension--;
  252. cAddOperation(OP_REFERENCE);
  253. }
  254. cWalkStruct(v);
  255. }
  256. static void cLoadRef(Variable* v) {
  257. if(dtIsPointer(v->type)) {
  258. cAddOperation(OP_LOAD_POINTER);
  259. return;
  260. }
  261. switch(v->type.type) {
  262. DT_OPERATION(LOAD);
  263. case DT_STRUCT:
  264. {
  265. Struct* st = dtGetStruct(&structs, v->type);
  266. if(st == NULL) {
  267. cError("compiler struct error");
  268. }
  269. cAddIntOperation(OP_LOAD, dtGetSize(v->type, &structs));
  270. break;
  271. }
  272. default: cError("cannot load type %s", cGetName(v->type));
  273. }
  274. }
  275. static void cStore(Variable* v, DataType dt, const char* name) {
  276. if(!dtCompare(v->type, dt)) {
  277. cInvalidOperation(v->type, dt, name);
  278. }
  279. if(dtIsPointer(v->type)) {
  280. cAddOperation(OP_STORE_POINTER);
  281. return;
  282. }
  283. switch(v->type.type) {
  284. DT_OPERATION(STORE);
  285. default: cError("cannot store type %s", cGetName(v->type));
  286. }
  287. }
  288. static DataType cPostChange(Variable* v, int change, const char* name) {
  289. if(!dtCompare(v->type, dtInt())) {
  290. cError("%s needs an int", name);
  291. }
  292. cAddByteOperation(OP_PUSH_POST_INT_CHANGE, change);
  293. return dtInt();
  294. }
  295. static DataType cLiteral() {
  296. const char* literal = cReadString();
  297. if(cConsumeTokenIf(T_OPEN_BRACKET)) {
  298. DataType dt = cCallFunction(literal);
  299. if(dtCompare(dt, dtVoid())) {
  300. cError("function returns void");
  301. }
  302. return dt;
  303. }
  304. Variable v;
  305. if(vsSearch(&vars, &v, literal)) {
  306. cNotDeclared(literal);
  307. }
  308. cReference(&v, 0);
  309. if(cConsumeTokenIf(T_INCREMENT)) {
  310. return cPostChange(&v, 1, "++");
  311. } else if(cConsumeTokenIf(T_DECREMENT)) {
  312. return cPostChange(&v, -1, "--");
  313. }
  314. cLoadRef(&v);
  315. return v.type;
  316. }
  317. static DataType cBracketPrimary() {
  318. DataType result = cExpression();
  319. cConsumeToken(T_CLOSE_BRACKET);
  320. return result;
  321. }
  322. static DataType cAllocArray() {
  323. cConsumeToken(T_INT);
  324. cConsumeToken(T_OPEN_SQUARE_BRACKET);
  325. DataType index = cExpression();
  326. if(!dtCompare(index, dtInt())) {
  327. cError("array size must be an int");
  328. }
  329. cConsumeToken(T_CLOSE_SQUARE_BRACKET);
  330. cAddIntOperation(OP_NEW, dtGetSize(dtInt(), &structs));
  331. return dtToArray(dtInt(), 1);
  332. }
  333. static DataType cLength() {
  334. DataType pointer = cExpression();
  335. if(!dtIsPointer(pointer)) {
  336. cError("length expects a pointer");
  337. }
  338. cAddOperation(OP_LENGTH);
  339. return dtInt();
  340. }
  341. static DataType cPrimary() {
  342. Token t = cReadTokenAndLine();
  343. switch(t) {
  344. case T_CONST_INT: cConstantInt(); return dtInt();
  345. case T_CONST_FLOAT: cConstantFloat(); return dtFloat();
  346. case T_TRUE: cAddOperation(OP_PUSH_TRUE); return dtBool();
  347. case T_FALSE: cAddOperation(OP_PUSH_FALSE); return dtBool();
  348. case T_OPEN_BRACKET: return cBracketPrimary();
  349. case T_LITERAL: return cLiteral();
  350. case T_NEW: return cAllocArray();
  351. case T_LENGTH: return cLength();
  352. default: cUnexpectedToken(t); return dtVoid();
  353. }
  354. }
  355. static DataType cPreChange(int change, const char* name) {
  356. cConsumeToken(T_LITERAL);
  357. const char* literal = cReadString();
  358. Variable v;
  359. if(vsSearch(&vars, &v, literal)) {
  360. cNotDeclared(literal);
  361. }
  362. cReference(&v, 0);
  363. if(!dtCompare(v.type, dtInt())) {
  364. cError("%s needs an int", name);
  365. }
  366. cAddByteOperation(OP_PUSH_PRE_INT_CHANGE, change);
  367. return dtInt();
  368. }
  369. static DataType cPreUnary() {
  370. if(cConsumeTokenIf(T_SUB)) {
  371. DataType result = cPrimary();
  372. if(dtCompare(result, dtInt())) {
  373. cAddOperation(OP_INVERT_SIGN_INT);
  374. } else if(dtCompare(result, dtFloat())) {
  375. cAddOperation(OP_INVERT_SIGN_FLOAT);
  376. } else {
  377. cError("cannot invert sign of %s", cGetName(result));
  378. }
  379. return result;
  380. } else if(cConsumeTokenIf(T_INCREMENT)) {
  381. return cPreChange(1, "++");
  382. } else if(cConsumeTokenIf(T_DECREMENT)) {
  383. return cPreChange(-1, "--");
  384. } else if(cConsumeTokenIf(T_NOT)) {
  385. int counter = 1;
  386. while(cConsumeTokenIf(T_NOT)) {
  387. counter++;
  388. }
  389. DataType result = cPrimary();
  390. if(!dtCompare(result, dtBool())) {
  391. cError("! needs a bool not %s", cGetName(result));
  392. }
  393. cAddOperation(OP_NOT);
  394. if((counter & 1) == 0) {
  395. cAddOperation(OP_NOT);
  396. }
  397. return dtBool();
  398. } else if(cConsumeTokenIf(T_BIT_NOT)) {
  399. DataType result = cPrimary();
  400. if(dtCompare(result, dtInt())) {
  401. cAddOperation(OP_BIT_NOT);
  402. } else {
  403. cError("~ needs an int not %s", cGetName(result));
  404. }
  405. return result;
  406. } else if(cConsumeTokenIf(T_BIT_AND)) {
  407. cConsumeToken(T_LITERAL);
  408. const char* literal = cReadString();
  409. Variable v;
  410. if(vsSearch(&vars, &v, literal)) {
  411. cNotDeclared(literal);
  412. }
  413. cReference(&v, 0);
  414. return dtDereference(v.type);
  415. } else if(cConsumeTokenIf(T_MUL)) {
  416. int c = 1;
  417. while(cConsumeTokenIf(T_MUL)) {
  418. c++;
  419. }
  420. cConsumeToken(T_LITERAL);
  421. const char* literal = cReadString();
  422. Variable v;
  423. if(vsSearch(&vars, &v, literal)) {
  424. cNotDeclared(literal);
  425. }
  426. cReference(&v, c);
  427. cLoadRef(&v);
  428. return v.type;
  429. }
  430. return cPrimary();
  431. }
  432. static void cAddTypeOperation(DataType a, DataType b, const TypedOp* op) {
  433. if(dtCompare(a, dtInt()) && dtCompare(b, dtInt()) &&
  434. op->intOp != OP_NOTHING) {
  435. cAddOperation(op->intOp);
  436. } else if(dtCompare(a, dtFloat()) && dtCompare(b, dtFloat()) &&
  437. op->floatOp != OP_NOTHING) {
  438. cAddOperation(op->floatOp);
  439. } else if(dtCompare(a, dtBool()) && dtCompare(b, dtBool()) &&
  440. op->boolOp != OP_NOTHING) {
  441. cAddOperation(op->boolOp);
  442. } else if(dtCompare(a, b) && dtIsPointer(a) &&
  443. op->pointerOp != OP_NOTHING) {
  444. cAddOperation(op->pointerOp);
  445. } else {
  446. cInvalidOperation(a, b, op->name);
  447. }
  448. }
  449. static DataType cMul() {
  450. DataType a = cPreUnary();
  451. while(true) {
  452. if(cConsumeTokenIf(T_MUL)) {
  453. cAddTypeOperation(a, cPreUnary(), &TYPED_MUL);
  454. } else if(cConsumeTokenIf(T_DIV)) {
  455. cAddTypeOperation(a, cPreUnary(), &TYPED_DIV);
  456. } else if(cConsumeTokenIf(T_MOD)) {
  457. cAddTypeOperation(a, cPreUnary(), &TYPED_MOD);
  458. } else {
  459. break;
  460. }
  461. }
  462. return a;
  463. }
  464. static DataType cAdd() {
  465. DataType a = cMul();
  466. while(true) {
  467. if(cConsumeTokenIf(T_ADD)) {
  468. cAddTypeOperation(a, cMul(), &TYPED_ADD);
  469. } else if(cConsumeTokenIf(T_SUB)) {
  470. cAddTypeOperation(a, cMul(), &TYPED_SUB);
  471. } else {
  472. break;
  473. }
  474. }
  475. return a;
  476. }
  477. static DataType cShift() {
  478. DataType a = cAdd();
  479. while(true) {
  480. if(cConsumeTokenIf(T_LEFT_SHIFT)) {
  481. cAddTypeOperation(a, cAdd(), &TYPED_LEFT_SHIFT);
  482. } else if(cConsumeTokenIf(T_RIGHT_SHIFT)) {
  483. cAddTypeOperation(a, cAdd(), &TYPED_RIGHT_SHIFT);
  484. } else {
  485. break;
  486. }
  487. }
  488. return a;
  489. }
  490. static DataType cComparison() {
  491. DataType a = cShift();
  492. while(true) {
  493. if(cConsumeTokenIf(T_LESS)) {
  494. cAddTypeOperation(a, cShift(), &TYPED_LESS);
  495. a = dtBool();
  496. } else if(cConsumeTokenIf(T_LESS_EQUAL)) {
  497. cAddTypeOperation(a, cShift(), &TYPED_LESS_EQUAL);
  498. cAddOperation(OP_NOT);
  499. a = dtBool();
  500. } else if(cConsumeTokenIf(T_GREATER)) {
  501. cAddTypeOperation(a, cShift(), &TYPED_GREATER);
  502. a = dtBool();
  503. } else if(cConsumeTokenIf(T_GREATER_EQUAL)) {
  504. cAddTypeOperation(a, cShift(), &TYPED_GREATER_EQUAL);
  505. cAddOperation(OP_NOT);
  506. a = dtBool();
  507. } else {
  508. break;
  509. }
  510. }
  511. return a;
  512. }
  513. static DataType cEqual() {
  514. DataType a = cComparison();
  515. while(true) {
  516. if(cConsumeTokenIf(T_EQUAL)) {
  517. cAddTypeOperation(a, cComparison(), &TYPED_EQUAL);
  518. a = dtBool();
  519. } else if(cConsumeTokenIf(T_NOT_EQUAL)) {
  520. cAddTypeOperation(a, cComparison(), &TYPED_NOT_EQUAL);
  521. cAddOperation(OP_NOT);
  522. a = dtBool();
  523. } else {
  524. break;
  525. }
  526. }
  527. return a;
  528. }
  529. static DataType cBitAnd() {
  530. DataType a = cEqual();
  531. while(cConsumeTokenIf(T_BIT_AND)) {
  532. DataType b = cEqual();
  533. cAddTypeOperation(a, b, &TYPED_BIT_AND);
  534. }
  535. return a;
  536. }
  537. static DataType cBitXor() {
  538. DataType a = cBitAnd();
  539. while(cConsumeTokenIf(T_BIT_XOR)) {
  540. DataType b = cBitAnd();
  541. cAddTypeOperation(a, b, &TYPED_BIT_XOR);
  542. }
  543. return a;
  544. }
  545. static DataType cBitOr() {
  546. DataType a = cBitXor();
  547. while(cConsumeTokenIf(T_BIT_OR)) {
  548. DataType b = cBitXor();
  549. cAddTypeOperation(a, b, &TYPED_BIT_OR);
  550. }
  551. return a;
  552. }
  553. static DataType cAnd() {
  554. DataType a = cBitOr();
  555. while(cConsumeTokenIf(T_AND)) {
  556. cAddOperation(OP_PEEK_FALSE_GOTO);
  557. int p = cReserveInt();
  558. DataType b = cBitOr();
  559. if(!dtCompare(a, dtBool()) || !dtCompare(b, dtBool())) {
  560. cInvalidOperation(a, b, "&&");
  561. }
  562. cAddOperation(OP_AND);
  563. cSetInt(p, code->length);
  564. }
  565. return a;
  566. }
  567. static DataType cOr() {
  568. DataType a = cAnd();
  569. while(cConsumeTokenIf(T_OR)) {
  570. cAddOperation(OP_PEEK_TRUE_GOTO);
  571. int p = cReserveInt();
  572. DataType b = cAnd();
  573. if(!dtCompare(a, dtBool()) || !dtCompare(b, dtBool())) {
  574. cInvalidOperation(a, b, "||");
  575. }
  576. cAddOperation(OP_OR);
  577. cSetInt(p, code->length);
  578. }
  579. return a;
  580. }
  581. static DataType cExpression() {
  582. return cOr();
  583. }
  584. static void cOperationSet(Variable* v, const TypedOp* op) {
  585. cAddOperation(OP_DUPLICATE_REFERENCE);
  586. cLoadRef(v);
  587. DataType dt = cExpression();
  588. cAddTypeOperation(v->type, dt, op);
  589. cStore(v, dt, "=");
  590. }
  591. static void cAddPostLineChange(Variable* v, int change, const char* name) {
  592. if(!dtCompare(v->type, dtInt())) {
  593. cError("%s needs an int", name);
  594. }
  595. cAddByteOperation(OP_INT_CHANGE, change);
  596. }
  597. static DataType cExtendType(DataType dt) {
  598. while(cConsumeTokenIf(T_MUL)) {
  599. dt = dtDereference(dt);
  600. }
  601. return dt;
  602. }
  603. static void cDeclareStruct(Struct* st) {
  604. DataType dt = cExtendType(dtStruct(st));
  605. cConsumeToken(T_LITERAL);
  606. const char* var = cReadString();
  607. if(vsInScope(&vars, var)) {
  608. cDeclared(var);
  609. }
  610. Variable* vp = vsAdd(&vars, var, dt, &structs);
  611. if(dtIsPointer(dt)) {
  612. cConsumeToken(T_SET);
  613. cReference(vp, 0);
  614. cStore(vp, cExpression(), "=");
  615. }
  616. }
  617. static void cLineVariable(const char* name, int dimension) {
  618. Variable v;
  619. if(vsSearch(&vars, &v, name)) {
  620. cNotDeclared(name);
  621. }
  622. cReference(&v, dimension);
  623. Token t = cReadTokenAndLine();
  624. switch(t) {
  625. case T_SET: cStore(&v, cExpression(), "="); break;
  626. case T_ADD_SET: cOperationSet(&v, &TYPED_ADD); break;
  627. case T_SUB_SET: cOperationSet(&v, &TYPED_SUB); break;
  628. case T_MUL_SET: cOperationSet(&v, &TYPED_MUL); break;
  629. case T_DIV_SET: cOperationSet(&v, &TYPED_DIV); break;
  630. case T_MOD_SET: cOperationSet(&v, &TYPED_MOD); break;
  631. case T_BIT_AND_SET: cOperationSet(&v, &TYPED_BIT_AND); break;
  632. case T_BIT_OR_SET: cOperationSet(&v, &TYPED_BIT_OR); break;
  633. case T_BIT_XOR_SET: cOperationSet(&v, &TYPED_BIT_XOR); break;
  634. case T_LEFT_SHIFT_SET: cOperationSet(&v, &TYPED_LEFT_SHIFT); break;
  635. case T_RIGHT_SHIFT_SET: cOperationSet(&v, &TYPED_RIGHT_SHIFT); break;
  636. case T_INCREMENT: cAddPostLineChange(&v, 1, "++"); break;
  637. case T_DECREMENT: cAddPostLineChange(&v, -1, "--"); break;
  638. default: cUnexpectedToken(t);
  639. }
  640. }
  641. static void cLineLiteral() {
  642. const char* literal = cReadString();
  643. if(cConsumeTokenIf(T_OPEN_BRACKET)) {
  644. DataType dt = cCallFunction(literal);
  645. if(!dtCompare(dt, dtVoid())) {
  646. cError("function returns %s not void", cGetName(dt));
  647. }
  648. return;
  649. }
  650. Struct* st = stsSearch(&structs, literal);
  651. if(st != NULL) {
  652. cDeclareStruct(st);
  653. return;
  654. }
  655. cLineVariable(literal, 0);
  656. }
  657. static void cLine(Token t);
  658. static void cConsumeBody() {
  659. int oldLine = line;
  660. while(!cConsumeTokenIf(T_CLOSE_CURVED_BRACKET)) {
  661. Token t = cReadTokenAndLine();
  662. if(t == T_END) {
  663. line = oldLine;
  664. cError("unexpected end of file: non closed curved bracket");
  665. }
  666. cLine(t);
  667. }
  668. }
  669. static void cConsumeScope() {
  670. Scope scope;
  671. vsEnterScope(&vars, &scope);
  672. cConsumeBody();
  673. vsLeaveScope(&vars, &scope);
  674. }
  675. static void cAddReturn(Operation op) {
  676. cAddOperation(op);
  677. returns[returnIndex++] = cReserveInt();
  678. }
  679. static void cReturn() {
  680. if(returnIndex >= RETURN_BUFFER) {
  681. cError("too much returns in function");
  682. }
  683. hasReturn = true;
  684. if(dtCompare(returnType, dtVoid())) {
  685. cConsumeToken(T_SEMICOLON);
  686. cAddReturn(OP_RETURN);
  687. return;
  688. }
  689. DataType dt = cExpression();
  690. if(!dtCompare(dt, returnType)) {
  691. cError("wrong return type, should be %s", cGetName(returnType));
  692. }
  693. if(dtCompare(dt, dtInt())) {
  694. cAddReturn(OP_RETURN_INT);
  695. } else if(dtCompare(dt, dtBool())) {
  696. cAddReturn(OP_RETURN_BOOL);
  697. } else if(dtCompare(dt, dtFloat())) {
  698. cAddReturn(OP_RETURN_FLOAT);
  699. } else {
  700. cError("cannot return %s", cGetName(dt));
  701. }
  702. cConsumeToken(T_SEMICOLON);
  703. }
  704. static void cPrint() {
  705. DataType dt = cExpression();
  706. if(dtIsPointer(dt)) {
  707. cAddOperation(OP_PRINT_POINTER);
  708. cConsumeToken(T_SEMICOLON);
  709. return;
  710. }
  711. switch(dt.type) {
  712. DT_OPERATION(PRINT);
  713. default: cError("cannot print type %s", cGetName(dt));
  714. }
  715. cConsumeToken(T_SEMICOLON);
  716. }
  717. static void cIf() {
  718. cConsumeToken(T_OPEN_BRACKET);
  719. DataType dt = cExpression();
  720. if(!dtCompare(dt, dtBool())) {
  721. cError("if expects a bool not %s", cGetName(dt));
  722. }
  723. cConsumeToken(T_CLOSE_BRACKET);
  724. cAddOperation(OP_IF_GOTO);
  725. int ifP = cReserveInt();
  726. cConsumeToken(T_OPEN_CURVED_BRACKET);
  727. cConsumeScope();
  728. cSetInt(ifP, code->length);
  729. if(cConsumeTokenIf(T_ELSE)) {
  730. cAddOperation(OP_GOTO);
  731. int elseP = cReserveInt();
  732. cSetInt(ifP, code->length);
  733. if(cConsumeTokenIf(T_IF)) {
  734. cIf();
  735. } else {
  736. cConsumeToken(T_OPEN_CURVED_BRACKET);
  737. cConsumeScope();
  738. }
  739. cSetInt(elseP, code->length);
  740. }
  741. }
  742. static void cConsumeBreaks(int start, int address) {
  743. for(int i = start; i < breakIndex; i++) {
  744. cSetInt(breaks[i], address);
  745. }
  746. breakIndex = start;
  747. }
  748. static void cWhile() {
  749. int start = code->length;
  750. cConsumeToken(T_OPEN_BRACKET);
  751. DataType dt = cExpression();
  752. if(!dtCompare(dt, dtBool())) {
  753. cError("while expects a bool not %s", cGetName(dt));
  754. }
  755. cConsumeToken(T_CLOSE_BRACKET);
  756. cAddOperation(OP_IF_GOTO);
  757. int ifP = cReserveInt();
  758. int breakStart = breakIndex;
  759. forWhileStack++;
  760. int oldContinue = continueAt;
  761. continueAt = start;
  762. cConsumeToken(T_OPEN_CURVED_BRACKET);
  763. cConsumeScope();
  764. continueAt = oldContinue;
  765. forWhileStack--;
  766. cAddIntOperation(OP_GOTO, start);
  767. cSetInt(ifP, code->length);
  768. cConsumeBreaks(breakStart, code->length);
  769. }
  770. static void cDeclare(DataType dt) {
  771. dt = cExtendType(dt);
  772. cConsumeToken(T_LITERAL);
  773. const char* var = cReadString();
  774. if(vsInScope(&vars, var)) {
  775. cDeclared(var);
  776. }
  777. Variable* vp = vsAdd(&vars, var, dt, &structs);
  778. cConsumeToken(T_SET);
  779. cReference(vp, 0);
  780. cStore(vp, cExpression(), "=");
  781. }
  782. static void cAddPreLineChange(int change, const char* name) {
  783. cConsumeToken(T_LITERAL);
  784. const char* literal = cReadString();
  785. Variable v;
  786. if(vsSearch(&vars, &v, literal)) {
  787. cNotDeclared(literal);
  788. }
  789. cReference(&v, 0);
  790. cAddPostLineChange(&v, change, name);
  791. }
  792. static void cDelete() {
  793. DataType pointer = cExpression();
  794. if(!dtIsPointer(pointer)) {
  795. cError("delete expects a pointer");
  796. }
  797. cAddOperation(OP_DELETE);
  798. }
  799. static void cLineExpression(Token t) {
  800. switch(t) {
  801. case T_LITERAL: cLineLiteral(); break;
  802. case T_INT: cDeclare(dtInt()); break;
  803. case T_BOOL: cDeclare(dtBool()); break;
  804. case T_FLOAT: cDeclare(dtFloat()); break;
  805. case T_INCREMENT: cAddPreLineChange(1, "++"); break;
  806. case T_DECREMENT: cAddPreLineChange(-1, "--"); break;
  807. case T_MUL:
  808. {
  809. int c = 1;
  810. while(cConsumeTokenIf(T_MUL)) {
  811. c++;
  812. }
  813. cConsumeToken(T_LITERAL);
  814. cLineVariable(cReadString(), c);
  815. break;
  816. }
  817. case T_DELETE: cDelete(); break;
  818. default: cUnexpectedToken(t);
  819. }
  820. }
  821. static void cFor() {
  822. Scope scope;
  823. vsEnterScope(&vars, &scope);
  824. cConsumeToken(T_OPEN_BRACKET);
  825. cLineExpression(cReadTokenAndLine());
  826. cConsumeToken(T_SEMICOLON);
  827. int startCheck = code->length;
  828. DataType dt = cExpression();
  829. if(!dtCompare(dt, dtBool())) {
  830. cError("for expects a bool not %s", cGetName(dt));
  831. }
  832. cConsumeToken(T_SEMICOLON);
  833. cAddOperation(OP_IF_GOTO);
  834. int end = cReserveInt();
  835. cAddOperation(OP_GOTO);
  836. int beginBody = cReserveInt();
  837. int startPerLoop = code->length;
  838. cLineExpression(cReadTokenAndLine());
  839. cAddIntOperation(OP_GOTO, startCheck);
  840. cConsumeToken(T_CLOSE_BRACKET);
  841. cSetInt(beginBody, code->length);
  842. int breakStart = breakIndex;
  843. forWhileStack++;
  844. int oldContinue = continueAt;
  845. continueAt = startPerLoop;
  846. cConsumeToken(T_OPEN_CURVED_BRACKET);
  847. cConsumeBody();
  848. continueAt = oldContinue;
  849. forWhileStack--;
  850. cAddIntOperation(OP_GOTO, startPerLoop);
  851. cSetInt(end, code->length);
  852. cConsumeBreaks(breakStart, code->length);
  853. vsLeaveScope(&vars, &scope);
  854. }
  855. static void cBreak() {
  856. if(forWhileStack == 0) {
  857. cError("break without for or while on line %d", line);
  858. } else if(breakIndex >= BREAK_BUFFER) {
  859. cError("too much breaks around line %d", line);
  860. }
  861. cAddOperation(OP_GOTO);
  862. breaks[breakIndex++] = cReserveInt();
  863. cConsumeToken(T_SEMICOLON);
  864. }
  865. static void cContinue() {
  866. if(forWhileStack == 0) {
  867. cError("continue without for or while on line %d", line);
  868. }
  869. cAddIntOperation(OP_GOTO, continueAt);
  870. cConsumeToken(T_SEMICOLON);
  871. }
  872. static void cLine(Token t) {
  873. hasReturn = false;
  874. cAddOperation(OP_LINE);
  875. cAddInt16(line);
  876. switch(t) {
  877. case T_OPEN_CURVED_BRACKET: cConsumeScope(); break;
  878. case T_PRINT: cPrint(); break;
  879. case T_RETURN: cReturn(); break;
  880. case T_IF: cIf(); break;
  881. case T_WHILE: cWhile(); break;
  882. case T_FOR: cFor(); break;
  883. case T_BREAK: cBreak(); break;
  884. case T_CONTINUE: cContinue(); break;
  885. default: cLineExpression(t); cConsumeToken(T_SEMICOLON);
  886. }
  887. }
  888. static void cFunctionArgument(Function* f);
  889. static void cFunctionCommaOrEnd(Function* f) {
  890. if(cConsumeTokenIf(T_CLOSE_BRACKET)) {
  891. return;
  892. }
  893. cConsumeToken(T_COMMA);
  894. cFunctionArgument(f);
  895. }
  896. static void cFunctionAddArgument(Function* f, DataType dt) {
  897. dt = cExtendType(dt);
  898. cConsumeToken(T_LITERAL);
  899. const char* name = cReadString();
  900. if(vsInScope(&vars, name)) {
  901. cDeclared(name);
  902. }
  903. vsAdd(&vars, name, dt, &structs);
  904. if(fAddArgument(f, dt, &structs)) {
  905. cTooMuchArguments();
  906. }
  907. cFunctionCommaOrEnd(f);
  908. }
  909. static void cFunctionArgument(Function* f) {
  910. Token t = cReadTokenAndLine();
  911. switch(t) {
  912. case T_INT: cFunctionAddArgument(f, dtInt()); break;
  913. case T_FLOAT: cFunctionAddArgument(f, dtFloat()); break;
  914. case T_BOOL: cFunctionAddArgument(f, dtBool()); break;
  915. case T_LITERAL:
  916. {
  917. const char* structName = cReadString();
  918. Struct* st = stsSearch(&structs, structName);
  919. if(st == NULL) {
  920. cError("struct %s does not exist");
  921. }
  922. cFunctionAddArgument(f, dtStruct(st));
  923. break;
  924. }
  925. default: cUnexpectedToken(t);
  926. }
  927. }
  928. static void cFunctionArguments(Function* f) {
  929. cConsumeToken(T_OPEN_BRACKET);
  930. if(!cConsumeTokenIf(T_CLOSE_BRACKET)) {
  931. cFunctionArgument(f);
  932. }
  933. }
  934. static int cReserve(int offset) {
  935. cAddOperation(OP_RESERVE);
  936. int p = cReserveInt();
  937. cAddInt(offset);
  938. return p;
  939. }
  940. static void cFree(int p, int bytes) {
  941. cAddIntOperation(OP_RETURN, bytes);
  942. cSetInt(p, bytes);
  943. }
  944. static void cLinkReturns(int bytes) {
  945. for(int i = 0; i < returnIndex; i++) {
  946. cSetInt(returns[i], bytes);
  947. }
  948. returnIndex = 0;
  949. }
  950. static void cInnerFunction(Function* f) {
  951. cConsumeToken(T_OPEN_CURVED_BRACKET);
  952. int p = cReserve(f->size);
  953. returnIndex = 0;
  954. hasReturn = false;
  955. cConsumeScope();
  956. if(!dtCompare(returnType, dtVoid()) && !hasReturn) {
  957. cError("missing return");
  958. }
  959. cFree(p, vars.maxAddress);
  960. cLinkReturns(vars.maxAddress);
  961. }
  962. static bool cForwardFunction(Function* found, Function* f) {
  963. if(!cConsumeTokenIf(T_SEMICOLON)) {
  964. return false;
  965. } else if(found != NULL) {
  966. cError("function registered twice");
  967. }
  968. f->address = -1;
  969. fsAdd(&functions, f);
  970. return true;
  971. }
  972. static void cBuildFunction(Function* f, DataType rType) {
  973. cConsumeToken(T_LITERAL);
  974. fInit(f, cReadString(), line);
  975. f->returnType = rType;
  976. vsReset(&vars);
  977. cFunctionArguments(f);
  978. }
  979. static void cFunction(DataType rType) {
  980. Function f;
  981. cBuildFunction(&f, rType);
  982. Function* found = fsSearch(&functions, &f);
  983. if(cForwardFunction(found, &f)) {
  984. return;
  985. }
  986. cAddOperation(OP_LINE);
  987. cAddInt16(line);
  988. cAddOperation(OP_GOTO);
  989. int end = cReserveInt();
  990. f.address = code->length;
  991. if(found != NULL) {
  992. if(found->address == -1) {
  993. found->address = f.address;
  994. } else {
  995. cError("function registered twice");
  996. }
  997. } else {
  998. fsAdd(&functions, &f);
  999. }
  1000. returnType = rType;
  1001. cInnerFunction(&f);
  1002. cSetInt(end, code->length);
  1003. }
  1004. static void cStruct() {
  1005. cConsumeToken(T_LITERAL);
  1006. const char* name = cReadString();
  1007. if(stsSearch(&structs, name) != NULL) {
  1008. cError("struct registered twice");
  1009. }
  1010. Struct* st = stsAdd(&structs, name);
  1011. DataType self = dtStruct(st);
  1012. cConsumeToken(T_OPEN_CURVED_BRACKET);
  1013. while(!cConsumeTokenIf(T_CLOSE_CURVED_BRACKET)) {
  1014. Token t = cReadTokenAndLine();
  1015. DataType dt = dtVoid();
  1016. switch(t) {
  1017. case T_INT: dt = dtInt(); break;
  1018. case T_BOOL: dt = dtBool(); break;
  1019. case T_FLOAT: dt = dtFloat(); break;
  1020. case T_LITERAL:
  1021. {
  1022. const char* name = cReadString();
  1023. Struct* st = stsSearch(&structs, name);
  1024. if(st == NULL) {
  1025. cError("struct %s does not exist");
  1026. }
  1027. dt = dtStruct(st);
  1028. break;
  1029. }
  1030. default: cUnexpectedToken(t);
  1031. }
  1032. dt = cExtendType(dt);
  1033. if(dtCompare(dt, self)) {
  1034. cError("struct %s contains itself", name);
  1035. }
  1036. cConsumeToken(T_LITERAL);
  1037. const char* name = cReadString();
  1038. stAddVariable(st, name, dt);
  1039. cConsumeToken(T_SEMICOLON);
  1040. }
  1041. cConsumeToken(T_SEMICOLON);
  1042. }
  1043. static void cGlobalScope(Token t) {
  1044. switch(t) {
  1045. case T_VOID: cFunction(dtVoid()); break;
  1046. case T_INT: cFunction(dtInt()); break;
  1047. case T_BOOL: cFunction(dtBool()); break;
  1048. case T_FLOAT: cFunction(dtFloat()); break;
  1049. case T_STRUCT: cStruct(); break;
  1050. default: cUnexpectedToken(t);
  1051. }
  1052. }
  1053. static void cCallMain() {
  1054. Function f;
  1055. fInit(&f, "main", line);
  1056. Function* found = fsSearch(&functions, &f);
  1057. if(found != NULL && dtCompare(found->returnType, dtVoid())) {
  1058. cAddIntOperation(OP_PUSH_INT, 0);
  1059. cAddIntOperation(OP_GOSUB, found->address);
  1060. cAddInt(found->size);
  1061. }
  1062. }
  1063. static void cForEachLine() {
  1064. Token t = cReadTokenAndLine();
  1065. while(t != T_END) {
  1066. cGlobalScope(t);
  1067. t = cReadTokenAndLine();
  1068. }
  1069. cCallMain();
  1070. }
  1071. static void cLinkQueuedFunctions() {
  1072. for(int i = 0; i < functionQueue.entries; i++) {
  1073. Function* f = functionQueue.data + i;
  1074. Function* found = fsSearch(&functions, f);
  1075. if(found == NULL) {
  1076. line = f->line;
  1077. cError("unknown function");
  1078. } else if(!dtCompare(f->returnType, found->returnType)) {
  1079. line = f->line;
  1080. cError("function return type is not %s", cGetName(f->returnType));
  1081. }
  1082. cSetInt(f->address, found->address);
  1083. }
  1084. }
  1085. static void cAllocAndCompile() {
  1086. forWhileStack = 0;
  1087. breakIndex = 0;
  1088. returnType = dtVoid();
  1089. vsInit(&vars);
  1090. fsInit(&functions);
  1091. fsInit(&functionQueue);
  1092. stsInit(&structs);
  1093. if(!setjmp(errorJump)) {
  1094. cForEachLine();
  1095. cLinkQueuedFunctions();
  1096. }
  1097. stsDelete(&structs);
  1098. fsDelete(&functionQueue);
  1099. fsDelete(&functions);
  1100. vsDelete(&vars);
  1101. }
  1102. ByteCode* cCompile() {
  1103. error[0] = '\0';
  1104. code = bcInit();
  1105. cAllocAndCompile();
  1106. if(error[0] != '\0') {
  1107. bcDelete(code);
  1108. return NULL;
  1109. }
  1110. return code;
  1111. }
  1112. const char* cGetError() {
  1113. return error;
  1114. }
  1115. int cGetLine() {
  1116. return line;
  1117. }