compiler.cpp 47 KB

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