compiler.cpp 47 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363
  1. #include "pocketpy/compiler/compiler.hpp"
  2. #include "pocketpy/common/config.h"
  3. #include "pocketpy/interpreter/vm.hpp"
  4. #include "pocketpy/objects/codeobject.hpp"
  5. #include <cstdarg>
  6. namespace pkpy {
  7. #define consume(expected) if(!match(expected)) return SyntaxError("expected '%s', got '%s'", pk_TokenSymbols[expected], pk_TokenSymbols[curr().type]);
  8. #define consume_end_stmt() if(!match_end_stmt()) return SyntaxError("expected statement end")
  9. #define check_newlines_repl() { bool __nml; match_newlines(&__nml); if(__nml) return NeedMoreLines(); }
  10. #define check(B) if((err = B)) return err
  11. PrattRule Compiler::rules[TK__COUNT__];
  12. NameScope Compiler::name_scope() const noexcept{
  13. auto s = contexts.size() > 1 ? NAME_LOCAL : NAME_GLOBAL;
  14. if(unknown_global_scope && s == NAME_GLOBAL) s = NAME_GLOBAL_UNKNOWN;
  15. return s;
  16. }
  17. CodeObject* Compiler::push_global_context() noexcept{
  18. CodeObject* co = new CodeObject(lexer.src, static_cast<const Str&>(lexer.src->filename));
  19. co->start_line = __i == 0 ? 1 : prev().line;
  20. contexts.push_back(CodeEmitContext(vm, co, contexts.size()));
  21. return co;
  22. }
  23. FuncDecl_ Compiler::push_f_context(Str name) noexcept{
  24. CodeObject* co = new CodeObject(lexer.src, name);
  25. FuncDecl_ decl = std::make_shared<FuncDecl>(co);
  26. decl->code->start_line = __i == 0 ? 1 : prev().line;
  27. decl->nested = name_scope() == NAME_LOCAL;
  28. contexts.push_back(CodeEmitContext(vm, decl->code, contexts.size()));
  29. contexts.back().func = decl;
  30. return decl;
  31. }
  32. Error* Compiler::pop_context() noexcept{
  33. assert(ctx()->s_size() == 0);
  34. // add a `return None` in the end as a guard
  35. // previously, we only do this if the last opcode is not a return
  36. // however, this is buggy...since there may be a jump to the end (out of bound) even if the last opcode is a return
  37. ctx()->emit_(OP_RETURN_VALUE, 1, BC_KEEPLINE, true);
  38. // find the last valid token
  39. int j = __i - 1;
  40. while(tk(j).type == TK_EOL || tk(j).type == TK_DEDENT || tk(j).type == TK_EOF)
  41. j--;
  42. ctx()->co->end_line = tk(j).line;
  43. // some check here
  44. auto& codes = ctx()->co->codes;
  45. if(ctx()->co->nlocals > PK_MAX_CO_VARNAMES) {
  46. return SyntaxError("maximum number of local variables exceeded");
  47. }
  48. if(ctx()->co->consts.size() > 65530) {
  49. return SyntaxError("maximum number of constants exceeded");
  50. }
  51. // pre-compute LOOP_BREAK and LOOP_CONTINUE
  52. for(int i = 0; i < codes.size(); i++) {
  53. Bytecode& bc = codes[i];
  54. if(bc.op == OP_LOOP_CONTINUE) {
  55. CodeBlock* block = &ctx()->co->blocks[bc.arg];
  56. Bytecode__set_signed_arg(&bc, block->start - i);
  57. } else if(bc.op == OP_LOOP_BREAK) {
  58. CodeBlock* block = &ctx()->co->blocks[bc.arg];
  59. Bytecode__set_signed_arg(&bc, (block->end2 != -1 ? block->end2 : block->end) - i);
  60. }
  61. }
  62. // pre-compute func->is_simple
  63. FuncDecl_ func = contexts.back().func;
  64. if(func) {
  65. // check generator
  66. for(Bytecode bc: func->code->codes) {
  67. if(bc.op == OP_YIELD_VALUE || bc.op == OP_FOR_ITER_YIELD_VALUE) {
  68. func->type = FuncType_GENERATOR;
  69. for(Bytecode bc: func->code->codes) {
  70. if(bc.op == OP_RETURN_VALUE && bc.arg == BC_NOARG) {
  71. return SyntaxError("'return' with argument inside generator function");
  72. }
  73. }
  74. break;
  75. }
  76. }
  77. if(func->type == FuncType_UNSET) {
  78. bool is_simple = true;
  79. if(func->kwargs.count > 0) is_simple = false;
  80. if(func->starred_arg >= 0) is_simple = false;
  81. if(func->starred_kwarg >= 0) is_simple = false;
  82. if(is_simple) {
  83. func->type = FuncType_SIMPLE;
  84. bool is_empty = false;
  85. if(func->code->codes.size() == 1) {
  86. Bytecode bc = func->code->codes[0];
  87. if(bc.op == OP_RETURN_VALUE && bc.arg == 1) { is_empty = true; }
  88. }
  89. if(is_empty) func->type = FuncType_EMPTY;
  90. } else
  91. func->type = FuncType_NORMAL;
  92. }
  93. assert(func->type != FuncType_UNSET);
  94. }
  95. contexts.back().s_clean();
  96. contexts.pop_back();
  97. return NULL;
  98. }
  99. void Compiler::init_pratt_rules() noexcept{
  100. static bool initialized = false;
  101. if(initialized) return;
  102. initialized = true;
  103. // clang-format off
  104. // http://journal.stuffwithstuff.com/2011/03/19/pratt-parsers-expression-parsing-made-easy/
  105. #define PK_METHOD(name) &Compiler::name
  106. #define PK_NO_INFIX nullptr, PREC_LOWEST
  107. for(int i = 0; i < TK__COUNT__; i++) rules[i] = { nullptr, PK_NO_INFIX };
  108. rules[TK_DOT] = { nullptr, PK_METHOD(exprAttrib), PREC_PRIMARY };
  109. rules[TK_LPAREN] = { PK_METHOD(exprGroup), PK_METHOD(exprCall), PREC_PRIMARY };
  110. rules[TK_LBRACKET] = { PK_METHOD(exprList), PK_METHOD(exprSubscr), PREC_PRIMARY };
  111. rules[TK_LBRACE] = { PK_METHOD(exprMap), PK_NO_INFIX };
  112. rules[TK_MOD] = { nullptr, PK_METHOD(exprBinaryOp), PREC_FACTOR };
  113. rules[TK_ADD] = { nullptr, PK_METHOD(exprBinaryOp), PREC_TERM };
  114. rules[TK_SUB] = { PK_METHOD(exprUnaryOp), PK_METHOD(exprBinaryOp), PREC_TERM };
  115. rules[TK_MUL] = { PK_METHOD(exprUnaryOp), PK_METHOD(exprBinaryOp), PREC_FACTOR };
  116. rules[TK_INVERT] = { PK_METHOD(exprUnaryOp), nullptr, PREC_UNARY };
  117. rules[TK_DIV] = { nullptr, PK_METHOD(exprBinaryOp), PREC_FACTOR };
  118. rules[TK_FLOORDIV] = { nullptr, PK_METHOD(exprBinaryOp), PREC_FACTOR };
  119. rules[TK_POW] = { PK_METHOD(exprUnaryOp), PK_METHOD(exprBinaryOp), PREC_EXPONENT };
  120. rules[TK_GT] = { nullptr, PK_METHOD(exprBinaryOp), PREC_COMPARISION };
  121. rules[TK_LT] = { nullptr, PK_METHOD(exprBinaryOp), PREC_COMPARISION };
  122. rules[TK_EQ] = { nullptr, PK_METHOD(exprBinaryOp), PREC_COMPARISION };
  123. rules[TK_NE] = { nullptr, PK_METHOD(exprBinaryOp), PREC_COMPARISION };
  124. rules[TK_GE] = { nullptr, PK_METHOD(exprBinaryOp), PREC_COMPARISION };
  125. rules[TK_LE] = { nullptr, PK_METHOD(exprBinaryOp), PREC_COMPARISION };
  126. rules[TK_IN] = { nullptr, PK_METHOD(exprBinaryOp), PREC_COMPARISION };
  127. rules[TK_IS] = { nullptr, PK_METHOD(exprBinaryOp), PREC_COMPARISION };
  128. rules[TK_LSHIFT] = { nullptr, PK_METHOD(exprBinaryOp), PREC_BITWISE_SHIFT };
  129. rules[TK_RSHIFT] = { nullptr, PK_METHOD(exprBinaryOp), PREC_BITWISE_SHIFT };
  130. rules[TK_AND] = { nullptr, PK_METHOD(exprBinaryOp), PREC_BITWISE_AND };
  131. rules[TK_OR] = { nullptr, PK_METHOD(exprBinaryOp), PREC_BITWISE_OR };
  132. rules[TK_XOR] = { nullptr, PK_METHOD(exprBinaryOp), PREC_BITWISE_XOR };
  133. rules[TK_DECORATOR] = { nullptr, PK_METHOD(exprBinaryOp), PREC_FACTOR };
  134. rules[TK_IF] = { nullptr, PK_METHOD(exprTernary), PREC_TERNARY };
  135. rules[TK_NOT_IN] = { nullptr, PK_METHOD(exprBinaryOp), PREC_COMPARISION };
  136. rules[TK_IS_NOT] = { nullptr, PK_METHOD(exprBinaryOp), PREC_COMPARISION };
  137. rules[TK_AND_KW ] = { nullptr, PK_METHOD(exprAnd), PREC_LOGICAL_AND };
  138. rules[TK_OR_KW] = { nullptr, PK_METHOD(exprOr), PREC_LOGICAL_OR };
  139. rules[TK_NOT_KW] = { PK_METHOD(exprNot), nullptr, PREC_LOGICAL_NOT };
  140. rules[TK_TRUE] = { PK_METHOD(exprLiteral0), PK_NO_INFIX };
  141. rules[TK_FALSE] = { PK_METHOD(exprLiteral0), PK_NO_INFIX };
  142. rules[TK_NONE] = { PK_METHOD(exprLiteral0), PK_NO_INFIX };
  143. rules[TK_DOTDOTDOT] = { PK_METHOD(exprLiteral0), PK_NO_INFIX };
  144. rules[TK_LAMBDA] = { PK_METHOD(exprLambda), PK_NO_INFIX };
  145. rules[TK_ID] = { PK_METHOD(exprName), PK_NO_INFIX };
  146. rules[TK_NUM] = { PK_METHOD(exprLiteral), PK_NO_INFIX };
  147. rules[TK_STR] = { PK_METHOD(exprLiteral), PK_NO_INFIX };
  148. rules[TK_FSTR] = { PK_METHOD(exprFString), PK_NO_INFIX };
  149. rules[TK_LONG] = { PK_METHOD(exprLong), PK_NO_INFIX };
  150. rules[TK_IMAG] = { PK_METHOD(exprImag), PK_NO_INFIX };
  151. rules[TK_BYTES] = { PK_METHOD(exprBytes), PK_NO_INFIX };
  152. rules[TK_COLON] = { PK_METHOD(exprSlice0), PK_METHOD(exprSlice1), PREC_PRIMARY };
  153. #undef PK_METHOD
  154. #undef PK_NO_INFIX
  155. // clang-format on
  156. }
  157. bool Compiler::match(TokenIndex expected) noexcept{
  158. if(curr().type != expected) return false;
  159. advance();
  160. return true;
  161. }
  162. bool Compiler::match_newlines(bool* need_more_lines) noexcept{
  163. bool consumed = false;
  164. if(curr().type == TK_EOL) {
  165. while(curr().type == TK_EOL) advance();
  166. consumed = true;
  167. }
  168. if(need_more_lines) {
  169. *need_more_lines = (mode() == REPL_MODE && curr().type == TK_EOF);
  170. }
  171. return consumed;
  172. }
  173. bool Compiler::match_end_stmt() noexcept{
  174. if(match(TK_SEMICOLON)) {
  175. match_newlines();
  176. return true;
  177. }
  178. if(match_newlines() || curr().type == TK_EOF) return true;
  179. if(curr().type == TK_DEDENT) return true;
  180. return false;
  181. }
  182. Error* Compiler::EXPR_TUPLE(bool allow_slice) noexcept{
  183. Error* err;
  184. check(parse_expression(PREC_LOWEST + 1, allow_slice));
  185. if(!match(TK_COMMA)) return NULL;
  186. // tuple expression
  187. int count = 1;
  188. do {
  189. if(curr().brackets_level) check_newlines_repl()
  190. if(!is_expression(allow_slice)) break;
  191. check(parse_expression(PREC_LOWEST + 1, allow_slice));
  192. count += 1;
  193. if(curr().brackets_level) check_newlines_repl();
  194. } while(match(TK_COMMA));
  195. TupleExpr* e = make_expr<TupleExpr>(count);
  196. for(int i=count-1; i>=0; i--)
  197. e->items[i] = ctx()->s_popx();
  198. ctx()->s_push(e);
  199. return NULL;
  200. }
  201. Error* Compiler::EXPR_VARS() noexcept{
  202. int count = 0;
  203. do {
  204. consume(TK_ID);
  205. ctx()->s_push(make_expr<NameExpr>(prev().str(), name_scope()));
  206. count += 1;
  207. } while(match(TK_COMMA));
  208. if(count > 1){
  209. TupleExpr* e = make_expr<TupleExpr>(count);
  210. for(int i=count-1; i>=0; i--)
  211. e->items[i] = ctx()->s_popx();
  212. ctx()->s_push(e);
  213. }
  214. return NULL;
  215. }
  216. Error* Compiler::exprLiteral() noexcept{
  217. ctx()->s_push(make_expr<LiteralExpr>(prev().value));
  218. return NULL;
  219. }
  220. Error* Compiler::exprLong() noexcept{
  221. ctx()->s_push(make_expr<LongExpr>(prev().str()));
  222. return NULL;
  223. }
  224. Error* Compiler::exprImag() noexcept{
  225. ctx()->s_push(make_expr<ImagExpr>(std::get<f64>(prev().value)));
  226. return NULL;
  227. }
  228. Error* Compiler::exprBytes() noexcept{
  229. ctx()->s_push(make_expr<BytesExpr>(std::get<Str>(prev().value)));
  230. return NULL;
  231. }
  232. Error* Compiler::exprFString() noexcept{
  233. ctx()->s_push(make_expr<FStringExpr>(std::get<Str>(prev().value)));
  234. return NULL;
  235. }
  236. Error* Compiler::exprLambda() noexcept{
  237. Error* err;
  238. FuncDecl_ decl = push_f_context("<lambda>");
  239. int line = prev().line; // backup line
  240. if(!match(TK_COLON)) {
  241. check(_compile_f_args(decl, false));
  242. consume(TK_COLON);
  243. }
  244. // https://github.com/pocketpy/pocketpy/issues/37
  245. check(parse_expression(PREC_LAMBDA + 1));
  246. ctx()->s_emit_top();
  247. ctx()->emit_(OP_RETURN_VALUE, BC_NOARG, BC_KEEPLINE);
  248. check(pop_context());
  249. LambdaExpr* e = make_expr<LambdaExpr>(decl);
  250. e->line = line;
  251. ctx()->s_push(e);
  252. return NULL;
  253. }
  254. Error* Compiler::exprOr() noexcept{
  255. int line = prev().line;
  256. Error* err;
  257. check(parse_expression(PREC_LOGICAL_OR + 1));
  258. auto e = make_expr<OrExpr>();
  259. e->line = line;
  260. e->rhs = ctx()->s_popx();
  261. e->lhs = ctx()->s_popx();
  262. ctx()->s_push(e);
  263. return NULL;
  264. }
  265. Error* Compiler::exprAnd() noexcept{
  266. int line = prev().line;
  267. Error* err;
  268. check(parse_expression(PREC_LOGICAL_AND + 1));
  269. auto e = make_expr<AndExpr>();
  270. e->line = line;
  271. e->rhs = ctx()->s_popx();
  272. e->lhs = ctx()->s_popx();
  273. ctx()->s_push(e);
  274. return NULL;
  275. }
  276. Error* Compiler::exprTernary() noexcept{
  277. // [true_expr]
  278. Error* err;
  279. int line = prev().line;
  280. check(parse_expression(PREC_TERNARY + 1)); // [true_expr, cond]
  281. consume(TK_ELSE);
  282. check(parse_expression(PREC_TERNARY + 1)); // [true_expr, cond, false_expr]
  283. auto e = make_expr<TernaryExpr>();
  284. e->line = line;
  285. e->false_expr = ctx()->s_popx();
  286. e->cond = ctx()->s_popx();
  287. e->true_expr = ctx()->s_popx();
  288. ctx()->s_push(e);
  289. return NULL;
  290. }
  291. Error* Compiler::exprBinaryOp() noexcept{
  292. Error* err;
  293. int line = prev().line;
  294. TokenIndex op = prev().type;
  295. check(parse_expression(rules[op].precedence + 1));
  296. BinaryExpr* e = make_expr<BinaryExpr>(op);
  297. e->line = line;
  298. e->rhs = ctx()->s_popx();
  299. e->lhs = ctx()->s_popx();
  300. ctx()->s_push(e);
  301. return NULL;
  302. }
  303. Error* Compiler::exprNot() noexcept{
  304. Error* err;
  305. check(parse_expression(PREC_LOGICAL_NOT + 1));
  306. NotExpr* e = make_expr<NotExpr>(ctx()->s_popx());
  307. ctx()->s_push(e);
  308. return NULL;
  309. }
  310. Error* Compiler::exprUnaryOp() noexcept{
  311. Error* err;
  312. TokenIndex op = prev().type;
  313. check(parse_expression(PREC_UNARY + 1));
  314. switch(op) {
  315. case TK_SUB: ctx()->s_push(make_expr<NegatedExpr>(ctx()->s_popx())); break;
  316. case TK_INVERT: ctx()->s_push(make_expr<InvertExpr>(ctx()->s_popx())); break;
  317. case TK_MUL: ctx()->s_push(make_expr<StarredExpr>(ctx()->s_popx(), 1)); break;
  318. case TK_POW: ctx()->s_push(make_expr<StarredExpr>(ctx()->s_popx(), 2)); break;
  319. default: assert(false);
  320. }
  321. return NULL;
  322. }
  323. Error* Compiler::exprGroup() noexcept{
  324. Error* err;
  325. check_newlines_repl()
  326. check(EXPR_TUPLE()); // () is just for change precedence
  327. check_newlines_repl()
  328. consume(TK_RPAREN);
  329. if(ctx()->s_top()->is_tuple()) return NULL;
  330. Expr* g = make_expr<GroupedExpr>(ctx()->s_popx());
  331. ctx()->s_push(g);
  332. return NULL;
  333. }
  334. Error* Compiler::consume_comp(Opcode op0, Opcode op1) noexcept{
  335. // [expr]
  336. Error* err;
  337. bool has_cond = false;
  338. check(EXPR_VARS()); // [expr, vars]
  339. consume(TK_IN);
  340. check(parse_expression(PREC_TERNARY + 1)); // [expr, vars, iter]
  341. check_newlines_repl()
  342. if(match(TK_IF)) {
  343. check(parse_expression(PREC_TERNARY + 1)); // [expr, vars, iter, cond]
  344. has_cond = true;
  345. }
  346. CompExpr* ce = make_expr<CompExpr>(op0, op1);
  347. if(has_cond) ce->cond = ctx()->s_popx();
  348. ce->iter = ctx()->s_popx();
  349. ce->vars = ctx()->s_popx();
  350. ce->expr = ctx()->s_popx();
  351. ctx()->s_push(ce);
  352. check_newlines_repl()
  353. return NULL;
  354. }
  355. Error* Compiler::exprList() noexcept{
  356. Error* err;
  357. int line = prev().line;
  358. int count = 0;
  359. do {
  360. check_newlines_repl()
  361. if(curr().type == TK_RBRACKET) break;
  362. check(EXPR()); count += 1;
  363. check_newlines_repl()
  364. if(count == 1 && match(TK_FOR)) {
  365. check(consume_comp(OP_BUILD_LIST, OP_LIST_APPEND));
  366. consume(TK_RBRACKET);
  367. return NULL;
  368. }
  369. check_newlines_repl()
  370. } while(match(TK_COMMA));
  371. consume(TK_RBRACKET);
  372. ListExpr* e = make_expr<ListExpr>(count);
  373. e->line = line; // override line
  374. for(int i=count-1; i>=0; i--)
  375. e->items[i] = ctx()->s_popx();
  376. ctx()->s_push(e);
  377. return NULL;
  378. }
  379. Error* Compiler::exprMap() noexcept{
  380. Error* err;
  381. bool parsing_dict = false; // {...} may be dict or set
  382. int count = 0;
  383. do {
  384. check_newlines_repl()
  385. if(curr().type == TK_RBRACE) break;
  386. check(EXPR()); // [key]
  387. int star_level = ctx()->s_top()->star_level();
  388. if(star_level == 2 || curr().type == TK_COLON) { parsing_dict = true; }
  389. if(parsing_dict) {
  390. if(star_level == 2) {
  391. DictItemExpr* dict_item = make_expr<DictItemExpr>();
  392. dict_item->key = NULL;
  393. dict_item->value = ctx()->s_popx();
  394. ctx()->s_push(dict_item);
  395. } else {
  396. consume(TK_COLON);
  397. check(EXPR());
  398. DictItemExpr* dict_item = make_expr<DictItemExpr>();
  399. dict_item->value = ctx()->s_popx();
  400. dict_item->key = ctx()->s_popx();
  401. ctx()->s_push(dict_item);
  402. }
  403. }
  404. count += 1;
  405. check_newlines_repl()
  406. if(count == 1 && match(TK_FOR)) {
  407. if(parsing_dict){
  408. check(consume_comp(OP_BUILD_DICT, OP_DICT_ADD));
  409. }else{
  410. check(consume_comp(OP_BUILD_SET, OP_SET_ADD));
  411. }
  412. consume(TK_RBRACE);
  413. return NULL;
  414. }
  415. check_newlines_repl()
  416. } while(match(TK_COMMA));
  417. consume(TK_RBRACE);
  418. SequenceExpr* se;
  419. if(count == 0 || parsing_dict) {
  420. se = make_expr<DictExpr>(count);
  421. } else {
  422. se = make_expr<SetExpr>(count);
  423. }
  424. for(int i=count-1; i>=0; i--)
  425. se->items[i] = ctx()->s_popx();
  426. ctx()->s_push(se);
  427. return NULL;
  428. }
  429. Error* Compiler::exprCall() noexcept{
  430. Error* err;
  431. CallExpr* e = make_expr<CallExpr>();
  432. e->callable = ctx()->s_popx();
  433. ctx()->s_push(e); // push onto the stack in advance
  434. do {
  435. check_newlines_repl()
  436. if(curr().type == TK_RPAREN) break;
  437. if(curr().type == TK_ID && next().type == TK_ASSIGN) {
  438. consume(TK_ID);
  439. StrName key(prev().sv());
  440. consume(TK_ASSIGN);
  441. check(EXPR());
  442. e->kwargs.push_back({key, ctx()->s_popx()});
  443. } else {
  444. check(EXPR());
  445. if(ctx()->s_top()->star_level() == 2) {
  446. // **kwargs
  447. e->kwargs.push_back({"**", ctx()->s_popx()});
  448. } else {
  449. // positional argument
  450. if(!e->kwargs.empty()) return SyntaxError("positional argument follows keyword argument");
  451. e->args.push_back(ctx()->s_popx());
  452. }
  453. }
  454. check_newlines_repl()
  455. } while(match(TK_COMMA));
  456. consume(TK_RPAREN);
  457. return NULL;
  458. }
  459. Error* Compiler::exprName() noexcept{
  460. StrName name(prev().sv());
  461. NameScope scope = name_scope();
  462. if(ctx()->global_names.contains(name)) { scope = NAME_GLOBAL; }
  463. ctx()->s_push(make_expr<NameExpr>(name, scope));
  464. return NULL;
  465. }
  466. Error* Compiler::exprAttrib() noexcept{
  467. consume(TK_ID);
  468. ctx()->s_push(make_expr<AttribExpr>(ctx()->s_popx(), StrName::get(prev().sv())));
  469. return NULL;
  470. }
  471. Error* Compiler::exprSlice0() noexcept{
  472. Error* err;
  473. SliceExpr* slice = make_expr<SliceExpr>();
  474. ctx()->s_push(slice); // push onto the stack in advance
  475. if(is_expression()) { // :<stop>
  476. check(EXPR());
  477. slice->stop = ctx()->s_popx();
  478. // try optional step
  479. if(match(TK_COLON)) { // :<stop>:<step>
  480. check(EXPR());
  481. slice->step = ctx()->s_popx();
  482. }
  483. } else if(match(TK_COLON)) {
  484. if(is_expression()) { // ::<step>
  485. check(EXPR());
  486. slice->step = ctx()->s_popx();
  487. } // else ::
  488. } // else :
  489. return NULL;
  490. }
  491. Error* Compiler::exprSlice1() noexcept{
  492. Error* err;
  493. SliceExpr* slice = make_expr<SliceExpr>();
  494. slice->start = ctx()->s_popx();
  495. ctx()->s_push(slice); // push onto the stack in advance
  496. if(is_expression()) { // <start>:<stop>
  497. check(EXPR());
  498. slice->stop = ctx()->s_popx();
  499. // try optional step
  500. if(match(TK_COLON)) { // <start>:<stop>:<step>
  501. check(EXPR());
  502. slice->step = ctx()->s_popx();
  503. }
  504. } else if(match(TK_COLON)) { // <start>::<step>
  505. check(EXPR());
  506. slice->step = ctx()->s_popx();
  507. } // else <start>:
  508. return NULL;
  509. }
  510. Error* Compiler::exprSubscr() noexcept{
  511. Error* err;
  512. int line = prev().line;
  513. check_newlines_repl()
  514. check(EXPR_TUPLE(true));
  515. check_newlines_repl()
  516. consume(TK_RBRACKET); // [lhs, rhs]
  517. SubscrExpr* e = make_expr<SubscrExpr>();
  518. e->line = line;
  519. e->rhs = ctx()->s_popx(); // [lhs]
  520. e->lhs = ctx()->s_popx(); // []
  521. ctx()->s_push(e);
  522. return NULL;
  523. }
  524. Error* Compiler::exprLiteral0() noexcept{
  525. ctx()->s_push(make_expr<Literal0Expr>(prev().type));
  526. return NULL;
  527. }
  528. Error* Compiler::compile_block_body(PrattCallback callback) noexcept{
  529. Error* err;
  530. if(!callback) callback = &Compiler::compile_stmt;
  531. consume(TK_COLON);
  532. if(curr().type != TK_EOL && curr().type != TK_EOF) {
  533. while(true) {
  534. check(compile_stmt());
  535. bool possible = curr().type != TK_EOL && curr().type != TK_EOF;
  536. if(prev().type != TK_SEMICOLON || !possible) break;
  537. }
  538. return NULL;
  539. }
  540. bool need_more_lines;
  541. bool consumed = match_newlines(&need_more_lines);
  542. if(need_more_lines) return NeedMoreLines();
  543. if(!consumed) return SyntaxError("expected a new line after ':'");
  544. consume(TK_INDENT);
  545. while(curr().type != TK_DEDENT) {
  546. match_newlines();
  547. check((this->*callback)());
  548. match_newlines();
  549. }
  550. consume(TK_DEDENT);
  551. return NULL;
  552. }
  553. // import a [as b]
  554. // import a [as b], c [as d]
  555. Error* Compiler::compile_normal_import() noexcept{
  556. do {
  557. consume(TK_ID);
  558. Str name = prev().str();
  559. ctx()->emit_(OP_IMPORT_PATH, ctx()->add_const_string(name.sv()), prev().line);
  560. if(match(TK_AS)) {
  561. consume(TK_ID);
  562. name = prev().str();
  563. }
  564. ctx()->emit_store_name(name_scope(), StrName(name), prev().line);
  565. } while(match(TK_COMMA));
  566. consume_end_stmt();
  567. return NULL;
  568. }
  569. // from a import b [as c], d [as e]
  570. // from a.b import c [as d]
  571. // from . import a [as b]
  572. // from .a import b [as c]
  573. // from ..a import b [as c]
  574. // from .a.b import c [as d]
  575. // from xxx import *
  576. Error* Compiler::compile_from_import() noexcept{
  577. int dots = 0;
  578. while(true) {
  579. switch(curr().type) {
  580. case TK_DOT: dots += 1; break;
  581. case TK_DOTDOT: dots += 2; break;
  582. case TK_DOTDOTDOT: dots += 3; break;
  583. default: goto __EAT_DOTS_END;
  584. }
  585. advance();
  586. }
  587. __EAT_DOTS_END:
  588. SStream ss;
  589. for(int i = 0; i < dots; i++)
  590. ss << '.';
  591. if(dots > 0) {
  592. // @id is optional if dots > 0
  593. if(match(TK_ID)) {
  594. ss << prev().sv();
  595. while(match(TK_DOT)) {
  596. consume(TK_ID);
  597. ss << "." << prev().sv();
  598. }
  599. }
  600. } else {
  601. // @id is required if dots == 0
  602. consume(TK_ID);
  603. ss << prev().sv();
  604. while(match(TK_DOT)) {
  605. consume(TK_ID);
  606. ss << "." << prev().sv();
  607. }
  608. }
  609. ctx()->emit_(OP_IMPORT_PATH, ctx()->add_const_string(ss.str().sv()), prev().line);
  610. consume(TK_IMPORT);
  611. if(match(TK_MUL)) {
  612. if(name_scope() != NAME_GLOBAL) return SyntaxError("from <module> import * can only be used in global scope");
  613. // pop the module and import __all__
  614. ctx()->emit_(OP_POP_IMPORT_STAR, BC_NOARG, prev().line);
  615. consume_end_stmt();
  616. return NULL;
  617. }
  618. do {
  619. ctx()->emit_(OP_DUP_TOP, BC_NOARG, BC_KEEPLINE);
  620. consume(TK_ID);
  621. Str name = prev().str();
  622. ctx()->emit_(OP_LOAD_ATTR, StrName(name).index, prev().line);
  623. if(match(TK_AS)) {
  624. consume(TK_ID);
  625. name = prev().str();
  626. }
  627. ctx()->emit_store_name(name_scope(), StrName(name), prev().line);
  628. } while(match(TK_COMMA));
  629. ctx()->emit_(OP_POP_TOP, BC_NOARG, BC_KEEPLINE);
  630. consume_end_stmt();
  631. return NULL;
  632. }
  633. bool Compiler::is_expression(bool allow_slice) noexcept{
  634. PrattCallback prefix = rules[curr().type].prefix;
  635. return prefix != nullptr && (allow_slice || curr().type != TK_COLON);
  636. }
  637. Error* Compiler::parse_expression(int precedence, bool allow_slice) noexcept{
  638. PrattCallback prefix = rules[curr().type].prefix;
  639. if(prefix == nullptr || (curr().type == TK_COLON && !allow_slice)) {
  640. return SyntaxError("expected an expression, got %s", pk_TokenSymbols[curr().type]);
  641. }
  642. advance();
  643. Error* err;
  644. check((this->*prefix)());
  645. while(rules[curr().type].precedence >= precedence && (allow_slice || curr().type != TK_COLON)) {
  646. TokenIndex op = curr().type;
  647. advance();
  648. PrattCallback infix = rules[op].infix;
  649. assert(infix != nullptr);
  650. check((this->*infix)());
  651. }
  652. return NULL;
  653. }
  654. Error* Compiler::compile_if_stmt() noexcept{
  655. Error* err;
  656. check(EXPR()); // condition
  657. ctx()->s_emit_top();
  658. int patch = ctx()->emit_(OP_POP_JUMP_IF_FALSE, BC_NOARG, prev().line);
  659. err = compile_block_body();
  660. if(err) return err;
  661. if(match(TK_ELIF)) {
  662. int exit_patch = ctx()->emit_(OP_JUMP_FORWARD, BC_NOARG, prev().line);
  663. ctx()->patch_jump(patch);
  664. check(compile_if_stmt());
  665. ctx()->patch_jump(exit_patch);
  666. } else if(match(TK_ELSE)) {
  667. int exit_patch = ctx()->emit_(OP_JUMP_FORWARD, BC_NOARG, prev().line);
  668. ctx()->patch_jump(patch);
  669. check(compile_block_body());
  670. ctx()->patch_jump(exit_patch);
  671. } else {
  672. ctx()->patch_jump(patch);
  673. }
  674. return NULL;
  675. }
  676. Error* Compiler::compile_while_loop() noexcept{
  677. Error* err;
  678. CodeBlock* block = ctx()->enter_block(CodeBlockType_WHILE_LOOP);
  679. check(EXPR()); // condition
  680. ctx()->s_emit_top();
  681. int patch = ctx()->emit_(OP_POP_JUMP_IF_FALSE, BC_NOARG, prev().line);
  682. check(compile_block_body());
  683. ctx()->emit_(OP_LOOP_CONTINUE, ctx()->get_loop(), BC_KEEPLINE, true);
  684. ctx()->patch_jump(patch);
  685. ctx()->exit_block();
  686. // optional else clause
  687. if(match(TK_ELSE)) {
  688. check(compile_block_body());
  689. block->end2 = ctx()->co->codes.size();
  690. }
  691. return NULL;
  692. }
  693. Error* Compiler::compile_for_loop() noexcept{
  694. Error* err;
  695. check(EXPR_VARS()); // [vars]
  696. consume(TK_IN);
  697. check(EXPR_TUPLE()); // [vars, iter]
  698. ctx()->s_emit_top(); // [vars]
  699. ctx()->emit_(OP_GET_ITER_NEW, BC_NOARG, BC_KEEPLINE);
  700. CodeBlock* block = ctx()->enter_block(CodeBlockType_FOR_LOOP);
  701. int for_codei = ctx()->emit_(OP_FOR_ITER, ctx()->curr_iblock, BC_KEEPLINE);
  702. Expr* vars = ctx()->s_popx();
  703. bool ok = vars->emit_store(ctx());
  704. delete_expr(vars);
  705. if(!ok) return SyntaxError(); // this error occurs in `vars` instead of this line, but...nevermind
  706. ctx()->try_merge_for_iter_store(for_codei);
  707. check(compile_block_body());
  708. ctx()->emit_(OP_LOOP_CONTINUE, ctx()->get_loop(), BC_KEEPLINE, true);
  709. ctx()->exit_block();
  710. // optional else clause
  711. if(match(TK_ELSE)) {
  712. check(compile_block_body());
  713. block->end2 = ctx()->co->codes.size();
  714. }
  715. return NULL;
  716. }
  717. Error* Compiler::compile_try_except() noexcept{
  718. Error* err;
  719. ctx()->enter_block(CodeBlockType_TRY_EXCEPT);
  720. ctx()->emit_(OP_TRY_ENTER, BC_NOARG, prev().line);
  721. check(compile_block_body());
  722. small_vector_2<int, 8> patches;
  723. patches.push_back(ctx()->emit_(OP_JUMP_FORWARD, BC_NOARG, BC_KEEPLINE));
  724. ctx()->exit_block();
  725. int finally_entry = -1;
  726. if(curr().type != TK_FINALLY) {
  727. do {
  728. StrName as_name;
  729. consume(TK_EXCEPT);
  730. if(is_expression()) {
  731. check(EXPR()); // push assumed type on to the stack
  732. ctx()->s_emit_top();
  733. ctx()->emit_(OP_EXCEPTION_MATCH, BC_NOARG, prev().line);
  734. if(match(TK_AS)) {
  735. consume(TK_ID);
  736. as_name = StrName(prev().sv());
  737. }
  738. } else {
  739. ctx()->emit_(OP_LOAD_TRUE, BC_NOARG, BC_KEEPLINE);
  740. }
  741. int patch = ctx()->emit_(OP_POP_JUMP_IF_FALSE, BC_NOARG, BC_KEEPLINE);
  742. // on match
  743. if(!as_name.empty()) {
  744. ctx()->emit_(OP_DUP_TOP, BC_NOARG, BC_KEEPLINE);
  745. ctx()->emit_store_name(name_scope(), as_name, BC_KEEPLINE);
  746. }
  747. // pop the exception
  748. ctx()->emit_(OP_POP_EXCEPTION, BC_NOARG, BC_KEEPLINE);
  749. check(compile_block_body());
  750. patches.push_back(ctx()->emit_(OP_JUMP_FORWARD, BC_NOARG, BC_KEEPLINE));
  751. ctx()->patch_jump(patch);
  752. } while(curr().type == TK_EXCEPT);
  753. }
  754. if(match(TK_FINALLY)) {
  755. int patch = ctx()->emit_(OP_JUMP_FORWARD, BC_NOARG, BC_KEEPLINE);
  756. finally_entry = ctx()->co->codes.size();
  757. check(compile_block_body());
  758. ctx()->emit_(OP_JUMP_ABSOLUTE_TOP, BC_NOARG, BC_KEEPLINE);
  759. ctx()->patch_jump(patch);
  760. }
  761. // no match, re-raise
  762. if(finally_entry != -1) {
  763. i64 target = ctx()->co->codes.size() + 2;
  764. ctx()->emit_(OP_LOAD_CONST, ctx()->add_const(VAR(target)), BC_KEEPLINE);
  765. int i = ctx()->emit_(OP_JUMP_FORWARD, BC_NOARG, BC_KEEPLINE);
  766. Bytecode__set_signed_arg(&ctx()->co->codes[i], finally_entry - i);
  767. }
  768. ctx()->emit_(OP_RE_RAISE, BC_NOARG, BC_KEEPLINE);
  769. // no exception or no match, jump to the end
  770. for(int patch: patches)
  771. ctx()->patch_jump(patch);
  772. if(finally_entry != -1) {
  773. i64 target = ctx()->co->codes.size() + 2;
  774. ctx()->emit_(OP_LOAD_CONST, ctx()->add_const(VAR(target)), BC_KEEPLINE);
  775. int i = ctx()->emit_(OP_JUMP_FORWARD, BC_NOARG, BC_KEEPLINE);
  776. Bytecode__set_signed_arg(&ctx()->co->codes[i], finally_entry - i);
  777. }
  778. return NULL;
  779. }
  780. Error* Compiler::compile_decorated() noexcept{
  781. Error* err;
  782. int count = 0;
  783. do {
  784. check(EXPR());
  785. count += 1;
  786. bool need_more_lines;
  787. bool consumed = match_newlines(&need_more_lines);
  788. if(need_more_lines) return NeedMoreLines();
  789. if(!consumed) return SyntaxError("expected a newline after '@'");
  790. } while(match(TK_DECORATOR));
  791. if(match(TK_CLASS)) {
  792. check(compile_class(count));
  793. } else {
  794. consume(TK_DEF);
  795. check(compile_function(count));
  796. }
  797. return NULL;
  798. }
  799. Error* Compiler::try_compile_assignment(bool* is_assign) noexcept{
  800. Error* err;
  801. switch(curr().type) {
  802. case TK_IADD:
  803. case TK_ISUB:
  804. case TK_IMUL:
  805. case TK_IDIV:
  806. case TK_IFLOORDIV:
  807. case TK_IMOD:
  808. case TK_ILSHIFT:
  809. case TK_IRSHIFT:
  810. case TK_IAND:
  811. case TK_IOR:
  812. case TK_IXOR: {
  813. if(ctx()->s_top()->is_starred()) return SyntaxError();
  814. if(ctx()->is_compiling_class){
  815. return SyntaxError("can't use inplace operator in class definition");
  816. }
  817. advance();
  818. // a[x] += 1; a and x should be evaluated only once
  819. // a.x += 1; a should be evaluated only once
  820. // -1 to remove =; inplace=true
  821. int line = prev().line;
  822. TokenIndex op = (TokenIndex)(prev().type - 1);
  823. // [lhs]
  824. check(EXPR_TUPLE()); // [lhs, rhs]
  825. if(ctx()->s_top()->is_starred()) return SyntaxError();
  826. BinaryExpr* e = make_expr<BinaryExpr>(op, true);
  827. e->line = line;
  828. e->rhs = ctx()->s_popx(); // [lhs]
  829. e->lhs = ctx()->s_popx(); // []
  830. e->emit_(ctx());
  831. bool ok = e->lhs->emit_store_inplace(ctx());
  832. delete_expr(e);
  833. if(!ok) return SyntaxError();
  834. *is_assign = true;
  835. return NULL;
  836. }
  837. case TK_ASSIGN: {
  838. int n = 0;
  839. while(match(TK_ASSIGN)) {
  840. check(EXPR_TUPLE());
  841. n += 1;
  842. }
  843. // stack size is n+1
  844. ctx()->s_emit_top(); // emit and pop
  845. for(int j = 1; j < n; j++)
  846. ctx()->emit_(OP_DUP_TOP, BC_NOARG, BC_KEEPLINE);
  847. for(int j = 0; j < n; j++) {
  848. if(ctx()->s_top()->is_starred()) return SyntaxError();
  849. bool ok = ctx()->s_top()->emit_store(ctx());
  850. ctx()->s_pop();
  851. if(!ok) return SyntaxError();
  852. }
  853. *is_assign = true;
  854. return NULL;
  855. }
  856. default: *is_assign = false;
  857. }
  858. return NULL;
  859. }
  860. Error* Compiler::compile_stmt() noexcept{
  861. Error* err;
  862. if(match(TK_CLASS)) {
  863. check(compile_class());
  864. return NULL;
  865. }
  866. advance();
  867. int kw_line = prev().line; // backup line number
  868. int curr_loop_block = ctx()->get_loop();
  869. switch(prev().type) {
  870. case TK_BREAK:
  871. if(curr_loop_block < 0) return SyntaxError("'break' outside loop");
  872. ctx()->emit_(OP_LOOP_BREAK, curr_loop_block, kw_line);
  873. consume_end_stmt();
  874. break;
  875. case TK_CONTINUE:
  876. if(curr_loop_block < 0) return SyntaxError("'continue' not properly in loop");
  877. ctx()->emit_(OP_LOOP_CONTINUE, curr_loop_block, kw_line);
  878. consume_end_stmt();
  879. break;
  880. case TK_YIELD:
  881. if(contexts.size() <= 1) return SyntaxError("'yield' outside function");
  882. check(EXPR_TUPLE());
  883. ctx()->s_emit_top();
  884. ctx()->emit_(OP_YIELD_VALUE, BC_NOARG, kw_line);
  885. consume_end_stmt();
  886. break;
  887. case TK_YIELD_FROM:
  888. if(contexts.size() <= 1) return SyntaxError("'yield from' outside function");
  889. check(EXPR_TUPLE());
  890. ctx()->s_emit_top();
  891. ctx()->emit_(OP_GET_ITER_NEW, BC_NOARG, kw_line);
  892. ctx()->enter_block(CodeBlockType_FOR_LOOP);
  893. ctx()->emit_(OP_FOR_ITER_YIELD_VALUE, BC_NOARG, kw_line);
  894. ctx()->emit_(OP_LOOP_CONTINUE, ctx()->get_loop(), kw_line);
  895. ctx()->exit_block();
  896. consume_end_stmt();
  897. break;
  898. case TK_RETURN:
  899. if(contexts.size() <= 1) return SyntaxError("'return' outside function");
  900. if(match_end_stmt()) {
  901. ctx()->emit_(OP_RETURN_VALUE, 1, kw_line);
  902. } else {
  903. check(EXPR_TUPLE());
  904. ctx()->s_emit_top();
  905. consume_end_stmt();
  906. ctx()->emit_(OP_RETURN_VALUE, BC_NOARG, kw_line);
  907. }
  908. break;
  909. /*************************************************/
  910. case TK_IF: check(compile_if_stmt()); break;
  911. case TK_WHILE: check(compile_while_loop()); break;
  912. case TK_FOR: check(compile_for_loop()); break;
  913. case TK_IMPORT: check(compile_normal_import()); break;
  914. case TK_FROM: check(compile_from_import()); break;
  915. case TK_DEF: check(compile_function()); break;
  916. case TK_DECORATOR: check(compile_decorated()); break;
  917. case TK_TRY: check(compile_try_except()); break;
  918. case TK_PASS: consume_end_stmt(); break;
  919. /*************************************************/
  920. case TK_ASSERT: {
  921. check(EXPR()); // condition
  922. ctx()->s_emit_top();
  923. int index = ctx()->emit_(OP_POP_JUMP_IF_TRUE, BC_NOARG, kw_line);
  924. int has_msg = 0;
  925. if(match(TK_COMMA)) {
  926. check(EXPR()); // message
  927. ctx()->s_emit_top();
  928. has_msg = 1;
  929. }
  930. ctx()->emit_(OP_RAISE_ASSERT, has_msg, kw_line);
  931. ctx()->patch_jump(index);
  932. consume_end_stmt();
  933. break;
  934. }
  935. case TK_GLOBAL:
  936. do {
  937. consume(TK_ID);
  938. ctx()->global_names.push_back(StrName(prev().sv()));
  939. } while(match(TK_COMMA));
  940. consume_end_stmt();
  941. break;
  942. case TK_RAISE: {
  943. check(EXPR());
  944. ctx()->s_emit_top();
  945. ctx()->emit_(OP_RAISE, BC_NOARG, kw_line);
  946. consume_end_stmt();
  947. } break;
  948. case TK_DEL: {
  949. check(EXPR_TUPLE());
  950. if(!ctx()->s_top()->emit_del(ctx())) return SyntaxError();
  951. ctx()->s_pop();
  952. consume_end_stmt();
  953. } break;
  954. case TK_WITH: {
  955. check(EXPR()); // [ <expr> ]
  956. ctx()->s_emit_top();
  957. ctx()->enter_block(CodeBlockType_CONTEXT_MANAGER);
  958. Expr* as_name = nullptr;
  959. if(match(TK_AS)) {
  960. consume(TK_ID);
  961. as_name = make_expr<NameExpr>(prev().str(), name_scope());
  962. }
  963. ctx()->emit_(OP_WITH_ENTER, BC_NOARG, prev().line);
  964. // [ <expr> <expr>.__enter__() ]
  965. if(as_name) {
  966. bool ok = as_name->emit_store(ctx());
  967. delete_expr(as_name);
  968. if(!ok) return SyntaxError();
  969. } else {
  970. ctx()->emit_(OP_POP_TOP, BC_NOARG, BC_KEEPLINE);
  971. }
  972. check(compile_block_body());
  973. ctx()->emit_(OP_WITH_EXIT, BC_NOARG, prev().line);
  974. ctx()->exit_block();
  975. } break;
  976. /*************************************************/
  977. case TK_EQ: {
  978. consume(TK_ID);
  979. if(mode() != EXEC_MODE) return SyntaxError("'label' is only available in EXEC_MODE");
  980. if(!ctx()->add_label(prev().str())) {
  981. Str escaped(prev().str().escape());
  982. return SyntaxError("label %s already exists", escaped.c_str());
  983. }
  984. consume(TK_EQ);
  985. consume_end_stmt();
  986. } break;
  987. case TK_ARROW:
  988. consume(TK_ID);
  989. if(mode() != EXEC_MODE) return SyntaxError("'goto' is only available in EXEC_MODE");
  990. ctx()->emit_(OP_GOTO, StrName(prev().sv()).index, prev().line);
  991. consume_end_stmt();
  992. break;
  993. /*************************************************/
  994. // handle dangling expression or assignment
  995. default: {
  996. advance(-1); // do revert since we have pre-called advance() at the beginning
  997. check(EXPR_TUPLE());
  998. bool is_typed_name = false; // e.g. x: int
  999. // eat variable's type hint if it is a single name
  1000. if(ctx()->s_top()->is_name()) {
  1001. if(match(TK_COLON)) {
  1002. check(consume_type_hints());
  1003. is_typed_name = true;
  1004. if(ctx()->is_compiling_class) {
  1005. NameExpr* ne = static_cast<NameExpr*>(ctx()->s_top());
  1006. ctx()->emit_(OP_ADD_CLASS_ANNOTATION, ne->name.index, BC_KEEPLINE);
  1007. }
  1008. }
  1009. }
  1010. bool is_assign = false;
  1011. check(try_compile_assignment(&is_assign));
  1012. if(!is_assign) {
  1013. if(ctx()->s_size() > 0 && ctx()->s_top()->is_starred()) {
  1014. return SyntaxError();
  1015. }
  1016. if(!is_typed_name) {
  1017. ctx()->s_emit_top();
  1018. if((mode() == CELL_MODE || mode() == REPL_MODE) && name_scope() == NAME_GLOBAL) {
  1019. ctx()->emit_(OP_PRINT_EXPR, BC_NOARG, BC_KEEPLINE);
  1020. } else {
  1021. ctx()->emit_(OP_POP_TOP, BC_NOARG, BC_KEEPLINE);
  1022. }
  1023. } else {
  1024. ctx()->s_pop();
  1025. }
  1026. }
  1027. consume_end_stmt();
  1028. break;
  1029. }
  1030. }
  1031. return NULL;
  1032. }
  1033. Error* Compiler::consume_type_hints() noexcept{
  1034. Error* err;
  1035. check(EXPR());
  1036. ctx()->s_pop();
  1037. return NULL;
  1038. }
  1039. Error* Compiler::compile_class(int decorators) noexcept{
  1040. Error* err;
  1041. consume(TK_ID);
  1042. int namei = StrName(prev().sv()).index;
  1043. bool has_base = false;
  1044. if(match(TK_LPAREN)) {
  1045. if(is_expression()) {
  1046. check(EXPR());
  1047. has_base = true; // [base]
  1048. }
  1049. consume(TK_RPAREN);
  1050. }
  1051. if(!has_base) {
  1052. ctx()->emit_(OP_LOAD_NONE, BC_NOARG, prev().line);
  1053. } else {
  1054. ctx()->s_emit_top(); // []
  1055. }
  1056. ctx()->emit_(OP_BEGIN_CLASS, namei, BC_KEEPLINE);
  1057. for(auto& c: this->contexts) {
  1058. if(c.is_compiling_class) return SyntaxError("nested class is not allowed");
  1059. }
  1060. ctx()->is_compiling_class = true;
  1061. check(compile_block_body());
  1062. ctx()->is_compiling_class = false;
  1063. if(decorators > 0) {
  1064. ctx()->emit_(OP_BEGIN_CLASS_DECORATION, BC_NOARG, BC_KEEPLINE);
  1065. ctx()->s_emit_decorators(decorators);
  1066. ctx()->emit_(OP_END_CLASS_DECORATION, BC_NOARG, BC_KEEPLINE);
  1067. }
  1068. ctx()->emit_(OP_END_CLASS, namei, BC_KEEPLINE);
  1069. return NULL;
  1070. }
  1071. Error* Compiler::_compile_f_args(FuncDecl_ decl, bool enable_type_hints) noexcept{
  1072. int state = 0; // 0 for args, 1 for *args, 2 for k=v, 3 for **kwargs
  1073. Error* err;
  1074. do {
  1075. if(state > 3) return SyntaxError();
  1076. if(state == 3) return SyntaxError("**kwargs should be the last argument");
  1077. match_newlines();
  1078. if(match(TK_MUL)) {
  1079. if(state < 1)
  1080. state = 1;
  1081. else
  1082. return SyntaxError("*args should be placed before **kwargs");
  1083. } else if(match(TK_POW)) {
  1084. state = 3;
  1085. }
  1086. consume(TK_ID);
  1087. StrName name(prev().sv());
  1088. // check duplicate argument name
  1089. for(int j: decl->args) {
  1090. if(decl->code->varnames[j] == name) return SyntaxError("duplicate argument name");
  1091. }
  1092. c11_vector__foreach(FuncDecl::KwArg, &decl->kwargs, kv) {
  1093. if(decl->code->varnames[kv->index] == name) return SyntaxError("duplicate argument name");
  1094. }
  1095. if(decl->starred_arg != -1 && decl->code->varnames[decl->starred_arg] == name) {
  1096. return SyntaxError("duplicate argument name");
  1097. }
  1098. if(decl->starred_kwarg != -1 && decl->code->varnames[decl->starred_kwarg] == name) {
  1099. return SyntaxError("duplicate argument name");
  1100. }
  1101. // eat type hints
  1102. if(enable_type_hints && match(TK_COLON)) check(consume_type_hints());
  1103. if(state == 0 && curr().type == TK_ASSIGN) state = 2;
  1104. int index = ctx()->add_varname(name);
  1105. switch(state) {
  1106. case 0: decl->args.push_back(index); break;
  1107. case 1:
  1108. decl->starred_arg = index;
  1109. state += 1;
  1110. break;
  1111. case 2: {
  1112. consume(TK_ASSIGN);
  1113. PyVar value;
  1114. check(read_literal(&value));
  1115. if(value == nullptr) return SyntaxError("default argument must be a literal");
  1116. decl->add_kwarg(index, name, value);
  1117. } break;
  1118. case 3:
  1119. decl->starred_kwarg = index;
  1120. state += 1;
  1121. break;
  1122. }
  1123. } while(match(TK_COMMA));
  1124. return NULL;
  1125. }
  1126. Error* Compiler::compile_function(int decorators) noexcept{
  1127. Error* err;
  1128. consume(TK_ID);
  1129. Str decl_name = prev().str();
  1130. FuncDecl_ decl = push_f_context(decl_name);
  1131. consume(TK_LPAREN);
  1132. if(!match(TK_RPAREN)) {
  1133. check(_compile_f_args(decl, true));
  1134. consume(TK_RPAREN);
  1135. }
  1136. if(match(TK_ARROW)) check(consume_type_hints());
  1137. check(compile_block_body());
  1138. check(pop_context());
  1139. decl->docstring = nullptr;
  1140. if(decl->code->codes.size() >= 2 && decl->code->codes[0].op == OP_LOAD_CONST &&
  1141. decl->code->codes[1].op == OP_POP_TOP) {
  1142. PyVar c = decl->code->consts[decl->code->codes[0].arg];
  1143. if(is_type(c, vm->tp_str)) {
  1144. decl->code->codes[0].op = OP_NO_OP;
  1145. decl->code->codes[1].op = OP_NO_OP;
  1146. decl->docstring = PK_OBJ_GET(Str, c).c_str();
  1147. }
  1148. }
  1149. ctx()->emit_(OP_LOAD_FUNCTION, ctx()->add_func_decl(decl), prev().line);
  1150. ctx()->s_emit_decorators(decorators);
  1151. if(!ctx()->is_compiling_class) {
  1152. NameExpr* e = make_expr<NameExpr>(decl_name, name_scope());
  1153. e->emit_store(ctx());
  1154. delete_expr(e);
  1155. } else {
  1156. int index = StrName(decl_name).index;
  1157. ctx()->emit_(OP_STORE_CLASS_ATTR, index, prev().line);
  1158. }
  1159. return NULL;
  1160. }
  1161. PyVar Compiler::to_object(const TokenValue& value) noexcept{
  1162. PyVar obj = nullptr;
  1163. if(std::holds_alternative<i64>(value)) { obj = VAR(std::get<i64>(value)); }
  1164. if(std::holds_alternative<f64>(value)) { obj = VAR(std::get<f64>(value)); }
  1165. if(std::holds_alternative<Str>(value)) { obj = VAR(std::get<Str>(value)); }
  1166. assert(obj != nullptr);
  1167. return obj;
  1168. }
  1169. Error* Compiler::read_literal(PyVar* out) noexcept{
  1170. Error* err;
  1171. advance();
  1172. switch(prev().type) {
  1173. case TK_SUB: {
  1174. consume(TK_NUM);
  1175. PyVar val = to_object(prev().value);
  1176. *out = vm->py_negate(val);
  1177. return NULL;
  1178. }
  1179. case TK_NUM: *out = to_object(prev().value); return NULL;
  1180. case TK_STR: *out = to_object(prev().value); return NULL;
  1181. case TK_TRUE: *out = VAR(true); return NULL;
  1182. case TK_FALSE: *out = VAR(false); return NULL;
  1183. case TK_NONE: *out = vm->None; return NULL;
  1184. case TK_DOTDOTDOT: *out = vm->Ellipsis; return NULL;
  1185. case TK_LPAREN: {
  1186. List cpnts;
  1187. while(true) {
  1188. PyVar elem;
  1189. check(read_literal(&elem));
  1190. cpnts.push_back(elem);
  1191. if(curr().type == TK_RPAREN) break;
  1192. consume(TK_COMMA);
  1193. if(curr().type == TK_RPAREN) break;
  1194. }
  1195. consume(TK_RPAREN);
  1196. *out = VAR(cpnts.to_tuple());
  1197. return NULL;
  1198. }
  1199. default: *out = nullptr; return NULL;
  1200. }
  1201. }
  1202. Compiler::Compiler(VM* vm, std::string_view source, const Str& filename, CompileMode mode, bool unknown_global_scope) noexcept:
  1203. lexer(vm, source, filename, mode){
  1204. this->vm = vm;
  1205. this->unknown_global_scope = unknown_global_scope;
  1206. init_pratt_rules();
  1207. }
  1208. Error* Compiler::compile(CodeObject** out) noexcept{
  1209. assert(__i == 0); // make sure it is the first time to compile
  1210. Error* err;
  1211. check(lexer.run());
  1212. // if(lexer.src.filename()[0] != '<'){
  1213. // printf("%s\n", lexer.src.filename().c_str());
  1214. // for(int i=0; i<lexer.nexts.size(); i++){
  1215. // printf("%s: %s\n", pk_TokenSymbols[tk(i).type], tk(i).str().escape().c_str());
  1216. // }
  1217. // }
  1218. CodeObject* code = push_global_context();
  1219. assert(curr().type == TK_SOF);
  1220. advance(); // skip @sof, so prev() is always valid
  1221. match_newlines(); // skip possible leading '\n'
  1222. if(mode() == EVAL_MODE) {
  1223. check(EXPR_TUPLE());
  1224. ctx()->s_emit_top();
  1225. consume(TK_EOF);
  1226. ctx()->emit_(OP_RETURN_VALUE, BC_NOARG, BC_KEEPLINE);
  1227. check(pop_context());
  1228. *out = code;
  1229. return NULL;
  1230. } else if(mode() == JSON_MODE) {
  1231. check(EXPR());
  1232. Expr* e = ctx()->s_popx();
  1233. if(!e->is_json_object()) return SyntaxError("expect a JSON object, literal or array");
  1234. consume(TK_EOF);
  1235. e->emit_(ctx());
  1236. ctx()->emit_(OP_RETURN_VALUE, BC_NOARG, BC_KEEPLINE);
  1237. check(pop_context());
  1238. *out = code;
  1239. return NULL;
  1240. }
  1241. while(!match(TK_EOF)) {
  1242. check(compile_stmt());
  1243. match_newlines();
  1244. }
  1245. check(pop_context());
  1246. *out = code;
  1247. return NULL;
  1248. }
  1249. Compiler::~Compiler(){
  1250. for(CodeEmitContext& ctx: contexts){
  1251. ctx.s_clean();
  1252. }
  1253. }
  1254. Error* Compiler::SyntaxError(const char* msg, ...) noexcept{
  1255. va_list args;
  1256. va_start(args, msg);
  1257. Error* e = lexer._error(false, "SyntaxError", msg, &args);
  1258. e->lineno = err().line;
  1259. e->cursor = err().start;
  1260. va_end(args);
  1261. return e;
  1262. }
  1263. #undef consume
  1264. #undef consume_end_stmt
  1265. #undef check
  1266. #undef check_newlines_repl
  1267. } // namespace pkpy