compiler.h 36 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985
  1. #pragma once
  2. #include "codeobject.h"
  3. #include "common.h"
  4. #include "expr.h"
  5. namespace pkpy{
  6. class Compiler;
  7. typedef void (Compiler::*PrattCallback)();
  8. struct PrattRule{
  9. PrattCallback prefix;
  10. PrattCallback infix;
  11. Precedence precedence;
  12. };
  13. class Compiler {
  14. inline static PrattRule rules[kTokenCount];
  15. std::unique_ptr<Lexer> lexer;
  16. stack<CodeEmitContext> contexts;
  17. VM* vm;
  18. bool used;
  19. // for parsing token stream
  20. int i = 0;
  21. std::vector<Token> tokens;
  22. const Token& prev() { return tokens.at(i-1); }
  23. const Token& curr() { return tokens.at(i); }
  24. const Token& next() { return tokens.at(i+1); }
  25. void advance(int delta=1) { i += delta; }
  26. CodeEmitContext* ctx() { return &contexts.top(); }
  27. CompileMode mode() const{ return lexer->src->mode; }
  28. NameScope name_scope() const { return contexts.size()>1 ? NAME_LOCAL : NAME_GLOBAL; }
  29. template<typename... Args>
  30. CodeObject_ push_context(Args&&... args){
  31. CodeObject_ co = make_sp<CodeObject>(std::forward<Args>(args)...);
  32. contexts.push(CodeEmitContext(vm, co));
  33. return co;
  34. }
  35. void pop_context(){
  36. if(!ctx()->s_expr.empty()){
  37. throw std::runtime_error("!ctx()->s_expr.empty()\n" + ctx()->_log_s_expr());
  38. }
  39. // if the last op does not return, add a default return None
  40. if(ctx()->co->codes.empty() || ctx()->co->codes.back().op != OP_RETURN_VALUE){
  41. ctx()->emit(OP_LOAD_NONE, BC_NOARG, BC_KEEPLINE);
  42. ctx()->emit(OP_RETURN_VALUE, BC_NOARG, BC_KEEPLINE);
  43. }
  44. ctx()->co->optimize(vm);
  45. contexts.pop();
  46. }
  47. static void init_pratt_rules(){
  48. if(rules[TK(".")].precedence != PREC_NONE) return;
  49. // http://journal.stuffwithstuff.com/2011/03/19/pratt-parsers-expression-parsing-made-easy/
  50. #define METHOD(name) &Compiler::name
  51. #define NO_INFIX nullptr, PREC_NONE
  52. for(TokenIndex i=0; i<kTokenCount; i++) rules[i] = { nullptr, NO_INFIX };
  53. rules[TK(".")] = { nullptr, METHOD(exprAttrib), PREC_ATTRIB };
  54. rules[TK("(")] = { METHOD(exprGroup), METHOD(exprCall), PREC_CALL };
  55. rules[TK("[")] = { METHOD(exprList), METHOD(exprSubscr), PREC_SUBSCRIPT };
  56. rules[TK("{")] = { METHOD(exprMap), NO_INFIX };
  57. rules[TK("%")] = { nullptr, METHOD(exprBinaryOp), PREC_FACTOR };
  58. rules[TK("+")] = { nullptr, METHOD(exprBinaryOp), PREC_TERM };
  59. rules[TK("-")] = { METHOD(exprUnaryOp), METHOD(exprBinaryOp), PREC_TERM };
  60. rules[TK("*")] = { METHOD(exprUnaryOp), METHOD(exprBinaryOp), PREC_FACTOR };
  61. rules[TK("/")] = { nullptr, METHOD(exprBinaryOp), PREC_FACTOR };
  62. rules[TK("//")] = { nullptr, METHOD(exprBinaryOp), PREC_FACTOR };
  63. rules[TK("**")] = { nullptr, METHOD(exprBinaryOp), PREC_EXPONENT };
  64. rules[TK(">")] = { nullptr, METHOD(exprBinaryOp), PREC_COMPARISION };
  65. rules[TK("<")] = { nullptr, METHOD(exprBinaryOp), PREC_COMPARISION };
  66. rules[TK("==")] = { nullptr, METHOD(exprBinaryOp), PREC_EQUALITY };
  67. rules[TK("!=")] = { nullptr, METHOD(exprBinaryOp), PREC_EQUALITY };
  68. rules[TK(">=")] = { nullptr, METHOD(exprBinaryOp), PREC_COMPARISION };
  69. rules[TK("<=")] = { nullptr, METHOD(exprBinaryOp), PREC_COMPARISION };
  70. rules[TK("in")] = { nullptr, METHOD(exprBinaryOp), PREC_TEST };
  71. rules[TK("is")] = { nullptr, METHOD(exprBinaryOp), PREC_TEST };
  72. rules[TK("<<")] = { nullptr, METHOD(exprBinaryOp), PREC_BITWISE_SHIFT };
  73. rules[TK(">>")] = { nullptr, METHOD(exprBinaryOp), PREC_BITWISE_SHIFT };
  74. rules[TK("&")] = { nullptr, METHOD(exprBinaryOp), PREC_BITWISE_AND };
  75. rules[TK("|")] = { nullptr, METHOD(exprBinaryOp), PREC_BITWISE_OR };
  76. rules[TK("^")] = { nullptr, METHOD(exprBinaryOp), PREC_BITWISE_XOR };
  77. rules[TK("?")] = { nullptr, METHOD(exprTernary), PREC_TERNARY };
  78. rules[TK(",")] = { nullptr, METHOD(exprTuple), PREC_TUPLE };
  79. rules[TK("not in")] = { nullptr, METHOD(exprBinaryOp), PREC_TEST };
  80. rules[TK("is not")] = { nullptr, METHOD(exprBinaryOp), PREC_TEST };
  81. rules[TK("and") ] = { nullptr, METHOD(exprAnd), PREC_LOGICAL_AND };
  82. rules[TK("or")] = { nullptr, METHOD(exprOr), PREC_LOGICAL_OR };
  83. rules[TK("not")] = { METHOD(exprNot), nullptr, PREC_LOGICAL_NOT };
  84. rules[TK("True")] = { METHOD(exprLiteral0), NO_INFIX };
  85. rules[TK("False")] = { METHOD(exprLiteral0), NO_INFIX };
  86. rules[TK("None")] = { METHOD(exprLiteral0), NO_INFIX };
  87. rules[TK("...")] = { METHOD(exprLiteral0), NO_INFIX };
  88. rules[TK("lambda")] = { METHOD(exprLambda), NO_INFIX };
  89. rules[TK("@id")] = { METHOD(exprName), NO_INFIX };
  90. rules[TK("@num")] = { METHOD(exprLiteral), NO_INFIX };
  91. rules[TK("@str")] = { METHOD(exprLiteral), NO_INFIX };
  92. rules[TK("@fstr")] = { METHOD(exprFString), NO_INFIX };
  93. #undef METHOD
  94. #undef NO_INFIX
  95. }
  96. bool match(TokenIndex expected) {
  97. if (curr().type != expected) return false;
  98. advance();
  99. return true;
  100. }
  101. void consume(TokenIndex expected) {
  102. if (!match(expected)){
  103. SyntaxError(
  104. fmt("expected '", TK_STR(expected), "', but got '", TK_STR(curr().type), "'")
  105. );
  106. }
  107. }
  108. bool match_newlines_repl(){
  109. return match_newlines(mode()==REPL_MODE);
  110. }
  111. bool match_newlines(bool repl_throw=false) {
  112. bool consumed = false;
  113. if (curr().type == TK("@eol")) {
  114. while (curr().type == TK("@eol")) advance();
  115. consumed = true;
  116. }
  117. if (repl_throw && curr().type == TK("@eof")){
  118. throw NeedMoreLines(ctx()->is_compiling_class);
  119. }
  120. return consumed;
  121. }
  122. bool match_end_stmt() {
  123. if (match(TK(";"))) { match_newlines(); return true; }
  124. if (match_newlines() || curr().type == TK("@eof")) return true;
  125. if (curr().type == TK("@dedent")) return true;
  126. return false;
  127. }
  128. void consume_end_stmt() {
  129. if (!match_end_stmt()) SyntaxError("expected statement end");
  130. }
  131. /*************************************************/
  132. void EXPR(bool push_stack=true) {
  133. parse_expression(PREC_TUPLE+1, push_stack);
  134. }
  135. void EXPR_TUPLE(bool push_stack=true) {
  136. parse_expression(PREC_TUPLE, push_stack);
  137. }
  138. // special case for `for loop` and `comp`
  139. Expr_ EXPR_VARS(){
  140. std::vector<Expr_> items;
  141. do {
  142. consume(TK("@id"));
  143. items.push_back(make_expr<NameExpr>(prev().str(), name_scope()));
  144. } while(match(TK(",")));
  145. if(items.size()==1) return std::move(items[0]);
  146. return make_expr<TupleExpr>(std::move(items));
  147. }
  148. template <typename T, typename... Args>
  149. std::unique_ptr<T> make_expr(Args&&... args) {
  150. std::unique_ptr<T> expr = std::make_unique<T>(std::forward<Args>(args)...);
  151. expr->line = prev().line;
  152. return expr;
  153. }
  154. // PASS
  155. void exprLiteral(){
  156. ctx()->s_expr.push(make_expr<LiteralExpr>(prev().value));
  157. }
  158. // PASS
  159. void exprFString(){
  160. ctx()->s_expr.push(make_expr<FStringExpr>(std::get<Str>(prev().value)));
  161. }
  162. // PASS
  163. void exprLambda(){
  164. auto e = make_expr<LambdaExpr>(name_scope());
  165. if(!match(TK(":"))){
  166. _compile_f_args(e->decl, false);
  167. consume(TK(":"));
  168. }
  169. e->decl->code = push_context(lexer->src, e->decl->name.sv());
  170. EXPR(false); // https://github.com/blueloveTH/pocketpy/issues/37
  171. ctx()->emit(OP_RETURN_VALUE, BC_NOARG, BC_KEEPLINE);
  172. pop_context();
  173. ctx()->s_expr.push(std::move(e));
  174. }
  175. // PASS
  176. void exprTuple(){
  177. std::vector<Expr_> items;
  178. items.push_back(ctx()->s_expr.popx());
  179. do {
  180. EXPR(); // NOTE: "1," will fail, "1,2" will be ok
  181. items.push_back(ctx()->s_expr.popx());
  182. } while(match(TK(",")));
  183. ctx()->s_expr.push(make_expr<TupleExpr>(
  184. std::move(items)
  185. ));
  186. }
  187. // PASS
  188. void exprOr(){
  189. auto e = make_expr<OrExpr>();
  190. e->lhs = ctx()->s_expr.popx();
  191. parse_expression(PREC_LOGICAL_OR + 1);
  192. e->rhs = ctx()->s_expr.popx();
  193. ctx()->s_expr.push(std::move(e));
  194. }
  195. // PASS
  196. void exprAnd(){
  197. auto e = make_expr<AndExpr>();
  198. e->lhs = ctx()->s_expr.popx();
  199. parse_expression(PREC_LOGICAL_AND + 1);
  200. e->rhs = ctx()->s_expr.popx();
  201. ctx()->s_expr.push(std::move(e));
  202. }
  203. // PASS
  204. void exprTernary(){
  205. auto e = make_expr<TernaryExpr>();
  206. e->cond = ctx()->s_expr.popx();
  207. EXPR(); // if true
  208. e->true_expr = ctx()->s_expr.popx();
  209. consume(TK(":"));
  210. EXPR(); // if false
  211. e->false_expr = ctx()->s_expr.popx();
  212. ctx()->s_expr.push(std::move(e));
  213. }
  214. // PASS
  215. void exprBinaryOp(){
  216. auto e = make_expr<BinaryExpr>();
  217. e->op = prev().type;
  218. e->lhs = ctx()->s_expr.popx();
  219. parse_expression(rules[e->op].precedence + 1);
  220. e->rhs = ctx()->s_expr.popx();
  221. ctx()->s_expr.push(std::move(e));
  222. }
  223. // PASS
  224. void exprNot() {
  225. parse_expression(PREC_LOGICAL_NOT + 1);
  226. ctx()->s_expr.push(make_expr<NotExpr>(ctx()->s_expr.popx()));
  227. }
  228. // PASS
  229. void exprUnaryOp(){
  230. TokenIndex op = prev().type;
  231. parse_expression(PREC_UNARY + 1);
  232. switch(op){
  233. case TK("-"):
  234. ctx()->s_expr.push(make_expr<NegatedExpr>(ctx()->s_expr.popx()));
  235. break;
  236. case TK("*"):
  237. ctx()->s_expr.push(make_expr<StarredExpr>(ctx()->s_expr.popx()));
  238. break;
  239. default: UNREACHABLE();
  240. }
  241. }
  242. // PASS
  243. void exprGroup(){
  244. match_newlines_repl();
  245. EXPR_TUPLE(); // () is just for change precedence
  246. match_newlines_repl();
  247. consume(TK(")"));
  248. }
  249. // PASS
  250. template<typename T>
  251. void _consume_comp(Expr_ expr){
  252. static_assert(std::is_base_of<CompExpr, T>::value);
  253. std::unique_ptr<CompExpr> ce = make_expr<T>();
  254. ce->expr = std::move(expr);
  255. ce->vars = EXPR_VARS();
  256. consume(TK("in"));
  257. EXPR();
  258. ce->iter = ctx()->s_expr.popx();
  259. match_newlines_repl();
  260. if(match(TK("if"))){
  261. EXPR();
  262. ce->cond = ctx()->s_expr.popx();
  263. }
  264. ctx()->s_expr.push(std::move(ce));
  265. match_newlines_repl();
  266. }
  267. // PASS
  268. void exprList() {
  269. int line = prev().line;
  270. std::vector<Expr_> items;
  271. do {
  272. match_newlines_repl();
  273. if (curr().type == TK("]")) break;
  274. EXPR();
  275. items.push_back(ctx()->s_expr.popx());
  276. match_newlines_repl();
  277. if(items.size()==1 && match(TK("for"))){
  278. _consume_comp<ListCompExpr>(std::move(items[0]));
  279. consume(TK("]"));
  280. return;
  281. }
  282. match_newlines_repl();
  283. } while (match(TK(",")));
  284. consume(TK("]"));
  285. auto e = make_expr<ListExpr>(std::move(items));
  286. e->line = line; // override line
  287. ctx()->s_expr.push(std::move(e));
  288. }
  289. // PASS
  290. void exprMap() {
  291. bool parsing_dict = false; // {...} may be dict or set
  292. std::vector<Expr_> items;
  293. do {
  294. match_newlines_repl();
  295. if (curr().type == TK("}")) break;
  296. EXPR();
  297. if(curr().type == TK(":")) parsing_dict = true;
  298. if(parsing_dict){
  299. consume(TK(":"));
  300. EXPR();
  301. auto dict_item = make_expr<DictItemExpr>();
  302. dict_item->key = ctx()->s_expr.popx();
  303. dict_item->value = ctx()->s_expr.popx();
  304. items.push_back(std::move(dict_item));
  305. }else{
  306. items.push_back(ctx()->s_expr.popx());
  307. }
  308. match_newlines_repl();
  309. if(items.size()==1 && match(TK("for"))){
  310. if(parsing_dict) _consume_comp<DictCompExpr>(std::move(items[0]));
  311. else _consume_comp<SetCompExpr>(std::move(items[0]));
  312. consume(TK("}"));
  313. return;
  314. }
  315. match_newlines_repl();
  316. } while (match(TK(",")));
  317. consume(TK("}"));
  318. if(items.size()==0 || parsing_dict){
  319. auto e = make_expr<DictExpr>(std::move(items));
  320. ctx()->s_expr.push(std::move(e));
  321. }else{
  322. auto e = make_expr<SetExpr>(std::move(items));
  323. ctx()->s_expr.push(std::move(e));
  324. }
  325. }
  326. // PASS
  327. void exprCall() {
  328. auto e = make_expr<CallExpr>();
  329. e->callable = ctx()->s_expr.popx();
  330. do {
  331. match_newlines_repl();
  332. if (curr().type==TK(")")) break;
  333. if(curr().type==TK("@id") && next().type==TK("=")) {
  334. consume(TK("@id"));
  335. Str key = prev().str();
  336. consume(TK("="));
  337. EXPR();
  338. e->kwargs.push_back({key, ctx()->s_expr.popx()});
  339. } else{
  340. if(!e->kwargs.empty()) SyntaxError("positional argument follows keyword argument");
  341. EXPR();
  342. e->args.push_back(ctx()->s_expr.popx());
  343. }
  344. match_newlines_repl();
  345. } while (match(TK(",")));
  346. consume(TK(")"));
  347. if(e->args.size() > 32767) SyntaxError("too many positional arguments");
  348. if(e->kwargs.size() > 32767) SyntaxError("too many keyword arguments");
  349. ctx()->s_expr.push(std::move(e));
  350. }
  351. // PASS
  352. void exprName(){
  353. Str name = prev().str();
  354. NameScope scope = name_scope();
  355. if(ctx()->co->global_names.count(name)){
  356. scope = NAME_GLOBAL;
  357. }
  358. ctx()->s_expr.push(make_expr<NameExpr>(name, scope));
  359. }
  360. // PASS
  361. void exprAttrib() {
  362. consume(TK("@id"));
  363. ctx()->s_expr.push(
  364. make_expr<AttribExpr>(ctx()->s_expr.popx(), prev().str())
  365. );
  366. }
  367. // PASS
  368. void exprSubscr() {
  369. auto e = make_expr<SubscrExpr>();
  370. e->a = ctx()->s_expr.popx();
  371. auto slice = make_expr<SliceExpr>();
  372. bool is_slice = false;
  373. // a[<0> <state:1> : state<3> : state<5>]
  374. int state = 0;
  375. do{
  376. switch(state){
  377. case 0:
  378. if(match(TK(":"))){
  379. is_slice=true;
  380. state=2;
  381. break;
  382. }
  383. if(match(TK("]"))) SyntaxError();
  384. EXPR_TUPLE();
  385. slice->start = ctx()->s_expr.popx();
  386. state=1;
  387. break;
  388. case 1:
  389. if(match(TK(":"))){
  390. is_slice=true;
  391. state=2;
  392. break;
  393. }
  394. if(match(TK("]"))) goto __SUBSCR_END;
  395. SyntaxError("expected ':' or ']'");
  396. break;
  397. case 2:
  398. if(match(TK(":"))){
  399. state=4;
  400. break;
  401. }
  402. if(match(TK("]"))) goto __SUBSCR_END;
  403. EXPR_TUPLE();
  404. slice->stop = ctx()->s_expr.popx();
  405. state=3;
  406. break;
  407. case 3:
  408. if(match(TK(":"))){
  409. state=4;
  410. break;
  411. }
  412. if(match(TK("]"))) goto __SUBSCR_END;
  413. SyntaxError("expected ':' or ']'");
  414. break;
  415. case 4:
  416. if(match(TK("]"))) goto __SUBSCR_END;
  417. EXPR_TUPLE();
  418. slice->step = ctx()->s_expr.popx();
  419. state=5;
  420. break;
  421. case 5: consume(TK("]")); goto __SUBSCR_END;
  422. }
  423. }while(true);
  424. __SUBSCR_END:
  425. if(is_slice){
  426. e->b = std::move(slice);
  427. }else{
  428. if(state != 1) UNREACHABLE();
  429. e->b = std::move(slice->start);
  430. }
  431. ctx()->s_expr.push(std::move(e));
  432. }
  433. // PASS
  434. void exprLiteral0() {
  435. ctx()->s_expr.push(make_expr<Literal0Expr>(prev().type));
  436. }
  437. void compile_block_body() {
  438. consume(TK(":"));
  439. if(curr().type!=TK("@eol") && curr().type!=TK("@eof")){
  440. compile_stmt(); // inline block
  441. return;
  442. }
  443. if(!match_newlines(mode()==REPL_MODE)){
  444. SyntaxError("expected a new line after ':'");
  445. }
  446. consume(TK("@indent"));
  447. while (curr().type != TK("@dedent")) {
  448. match_newlines();
  449. compile_stmt();
  450. match_newlines();
  451. }
  452. consume(TK("@dedent"));
  453. }
  454. Str _compile_import() {
  455. consume(TK("@id"));
  456. Str name = prev().str();
  457. int index = ctx()->add_name(name);
  458. ctx()->emit(OP_IMPORT_NAME, index, prev().line);
  459. return name;
  460. }
  461. // import a as b
  462. void compile_normal_import() {
  463. do {
  464. Str name = _compile_import();
  465. if (match(TK("as"))) {
  466. consume(TK("@id"));
  467. name = prev().str();
  468. }
  469. int index = ctx()->add_name(name);
  470. auto op = name_scope()==NAME_LOCAL ? OP_STORE_LOCAL : OP_STORE_GLOBAL;
  471. ctx()->emit(op, index, prev().line);
  472. } while (match(TK(",")));
  473. consume_end_stmt();
  474. }
  475. // from a import b as c, d as e
  476. void compile_from_import() {
  477. _compile_import();
  478. consume(TK("import"));
  479. if (match(TK("*"))) {
  480. if(name_scope() != NAME_GLOBAL) SyntaxError("import * should be used in global scope");
  481. ctx()->emit(OP_IMPORT_STAR, BC_NOARG, prev().line);
  482. consume_end_stmt();
  483. return;
  484. }
  485. do {
  486. ctx()->emit(OP_DUP_TOP, BC_NOARG, BC_KEEPLINE);
  487. consume(TK("@id"));
  488. Str name = prev().str();
  489. int index = ctx()->add_name(name);
  490. ctx()->emit(OP_LOAD_ATTR, index, prev().line);
  491. if (match(TK("as"))) {
  492. consume(TK("@id"));
  493. name = prev().str();
  494. }
  495. index = ctx()->add_name(name);
  496. auto op = name_scope()==NAME_LOCAL ? OP_STORE_LOCAL : OP_STORE_GLOBAL;
  497. ctx()->emit(op, index, prev().line);
  498. } while (match(TK(",")));
  499. ctx()->emit(OP_POP_TOP, BC_NOARG, BC_KEEPLINE);
  500. consume_end_stmt();
  501. }
  502. void parse_expression(int precedence, bool push_stack=true) {
  503. advance();
  504. PrattCallback prefix = rules[prev().type].prefix;
  505. if (prefix == nullptr) SyntaxError(Str("expected an expression, but got ") + TK_STR(prev().type));
  506. (this->*prefix)();
  507. while (rules[curr().type].precedence >= precedence) {
  508. TokenIndex op = curr().type;
  509. advance();
  510. PrattCallback infix = rules[op].infix;
  511. if(infix == nullptr) throw std::runtime_error("(infix == nullptr) is true");
  512. (this->*infix)();
  513. }
  514. if(!push_stack) ctx()->emit_expr();
  515. }
  516. // PASS
  517. void compile_if_stmt() {
  518. EXPR(false); // condition
  519. int patch = ctx()->emit(OP_POP_JUMP_IF_FALSE, BC_NOARG, prev().line);
  520. compile_block_body();
  521. if (match(TK("elif"))) {
  522. int exit_patch = ctx()->emit(OP_JUMP_ABSOLUTE, BC_NOARG, prev().line);
  523. ctx()->patch_jump(patch);
  524. compile_if_stmt();
  525. ctx()->patch_jump(exit_patch);
  526. } else if (match(TK("else"))) {
  527. int exit_patch = ctx()->emit(OP_JUMP_ABSOLUTE, BC_NOARG, prev().line);
  528. ctx()->patch_jump(patch);
  529. compile_block_body();
  530. ctx()->patch_jump(exit_patch);
  531. } else {
  532. ctx()->patch_jump(patch);
  533. }
  534. }
  535. // PASS
  536. void compile_while_loop() {
  537. ctx()->enter_block(WHILE_LOOP);
  538. EXPR(false); // condition
  539. int patch = ctx()->emit(OP_POP_JUMP_IF_FALSE, BC_NOARG, prev().line);
  540. compile_block_body();
  541. ctx()->emit(OP_LOOP_CONTINUE, BC_NOARG, BC_KEEPLINE);
  542. ctx()->patch_jump(patch);
  543. ctx()->exit_block();
  544. }
  545. // PASS
  546. void compile_for_loop() {
  547. Expr_ vars = EXPR_VARS();
  548. consume(TK("in"));
  549. EXPR(false);
  550. ctx()->emit(OP_GET_ITER, BC_NOARG, BC_KEEPLINE);
  551. ctx()->enter_block(FOR_LOOP);
  552. ctx()->emit(OP_FOR_ITER, BC_NOARG, BC_KEEPLINE);
  553. bool ok = vars->emit_store(ctx());
  554. if(!ok) SyntaxError(); // this error occurs in `vars` instead of this line, but...nevermind
  555. compile_block_body();
  556. ctx()->emit(OP_LOOP_CONTINUE, BC_NOARG, BC_KEEPLINE);
  557. ctx()->exit_block();
  558. }
  559. void compile_try_except() {
  560. ctx()->enter_block(TRY_EXCEPT);
  561. ctx()->emit(OP_TRY_BLOCK_ENTER, BC_NOARG, prev().line);
  562. compile_block_body();
  563. ctx()->emit(OP_TRY_BLOCK_EXIT, BC_NOARG, BC_KEEPLINE);
  564. std::vector<int> patches = {
  565. ctx()->emit(OP_JUMP_ABSOLUTE, BC_NOARG, BC_KEEPLINE)
  566. };
  567. ctx()->exit_block();
  568. do {
  569. consume(TK("except"));
  570. if(match(TK("@id"))){
  571. int namei = ctx()->add_name(prev().str());
  572. ctx()->emit(OP_EXCEPTION_MATCH, namei, prev().line);
  573. }else{
  574. ctx()->emit(OP_LOAD_TRUE, BC_NOARG, BC_KEEPLINE);
  575. }
  576. int patch = ctx()->emit(OP_POP_JUMP_IF_FALSE, BC_NOARG, BC_KEEPLINE);
  577. // pop the exception on match
  578. ctx()->emit(OP_POP_TOP, BC_NOARG, BC_KEEPLINE);
  579. compile_block_body();
  580. patches.push_back(ctx()->emit(OP_JUMP_ABSOLUTE, BC_NOARG, BC_KEEPLINE));
  581. ctx()->patch_jump(patch);
  582. }while(curr().type == TK("except"));
  583. // no match, re-raise
  584. ctx()->emit(OP_RE_RAISE, BC_NOARG, BC_KEEPLINE);
  585. for (int patch : patches) ctx()->patch_jump(patch);
  586. }
  587. void compile_decorated(){
  588. std::vector<Expr_> decorators;
  589. do{
  590. EXPR();
  591. decorators.push_back(ctx()->s_expr.popx());
  592. if(!match_newlines_repl()) SyntaxError();
  593. }while(match(TK("@")));
  594. consume(TK("def"));
  595. compile_function(decorators);
  596. }
  597. bool try_compile_assignment(){
  598. Expr* lhs_p = ctx()->s_expr.top().get();
  599. bool inplace;
  600. switch (curr().type) {
  601. case TK("+="): case TK("-="): case TK("*="): case TK("/="): case TK("//="): case TK("%="):
  602. case TK("<<="): case TK(">>="): case TK("&="): case TK("|="): case TK("^="): {
  603. if(ctx()->is_compiling_class) SyntaxError();
  604. inplace = true;
  605. advance();
  606. auto e = make_expr<BinaryExpr>();
  607. e->op = prev().type - 1; // -1 to remove =
  608. e->lhs = ctx()->s_expr.popx();
  609. EXPR_TUPLE();
  610. e->rhs = ctx()->s_expr.popx();
  611. ctx()->s_expr.push(std::move(e));
  612. } break;
  613. case TK("="):
  614. inplace = false;
  615. advance();
  616. EXPR_TUPLE();
  617. break;
  618. default: return false;
  619. }
  620. // std::cout << ctx()->_log_s_expr() << std::endl;
  621. Expr_ rhs = ctx()->s_expr.popx();
  622. if(lhs_p->is_starred() || rhs->is_starred()){
  623. SyntaxError("can't use starred expression here");
  624. }
  625. rhs->emit(ctx());
  626. bool ok = lhs_p->emit_store(ctx());
  627. if(!ok) SyntaxError();
  628. if(!inplace) ctx()->s_expr.pop();
  629. return true;
  630. }
  631. void compile_stmt() {
  632. advance();
  633. int kw_line = prev().line; // backup line number
  634. switch(prev().type){
  635. case TK("break"):
  636. if (!ctx()->is_curr_block_loop()) SyntaxError("'break' outside loop");
  637. ctx()->emit(OP_LOOP_BREAK, BC_NOARG, kw_line);
  638. consume_end_stmt();
  639. break;
  640. case TK("continue"):
  641. if (!ctx()->is_curr_block_loop()) SyntaxError("'continue' not properly in loop");
  642. ctx()->emit(OP_LOOP_CONTINUE, BC_NOARG, kw_line);
  643. consume_end_stmt();
  644. break;
  645. case TK("yield"):
  646. if (contexts.size() <= 1) SyntaxError("'yield' outside function");
  647. EXPR_TUPLE(false);
  648. // if yield present, mark the function as generator
  649. ctx()->co->is_generator = true;
  650. ctx()->emit(OP_YIELD_VALUE, BC_NOARG, kw_line);
  651. consume_end_stmt();
  652. break;
  653. case TK("return"):
  654. if (contexts.size() <= 1) SyntaxError("'return' outside function");
  655. if(match_end_stmt()){
  656. ctx()->emit(OP_LOAD_NONE, BC_NOARG, kw_line);
  657. }else{
  658. EXPR_TUPLE(false);
  659. consume_end_stmt();
  660. }
  661. ctx()->emit(OP_RETURN_VALUE, BC_NOARG, kw_line);
  662. break;
  663. /*************************************************/
  664. case TK("if"): compile_if_stmt(); break;
  665. case TK("while"): compile_while_loop(); break;
  666. case TK("for"): compile_for_loop(); break;
  667. case TK("import"): compile_normal_import(); break;
  668. case TK("from"): compile_from_import(); break;
  669. case TK("def"): compile_function(); break;
  670. case TK("@"): compile_decorated(); break;
  671. case TK("try"): compile_try_except(); break;
  672. case TK("pass"): consume_end_stmt(); break;
  673. /*************************************************/
  674. case TK("assert"):
  675. EXPR_TUPLE(false);
  676. ctx()->emit(OP_ASSERT, BC_NOARG, kw_line);
  677. consume_end_stmt();
  678. break;
  679. case TK("global"):
  680. do {
  681. consume(TK("@id"));
  682. ctx()->co->global_names.insert(prev().str());
  683. } while (match(TK(",")));
  684. consume_end_stmt();
  685. break;
  686. case TK("raise"): {
  687. consume(TK("@id"));
  688. int dummy_t = ctx()->add_name(prev().str());
  689. if(match(TK("(")) && !match(TK(")"))){
  690. EXPR(false); consume(TK(")"));
  691. }else{
  692. ctx()->emit(OP_LOAD_NONE, BC_NOARG, BC_KEEPLINE);
  693. }
  694. ctx()->emit(OP_RAISE, dummy_t, kw_line);
  695. consume_end_stmt();
  696. } break;
  697. case TK("del"): {
  698. EXPR_TUPLE();
  699. Expr_ e = ctx()->s_expr.popx();
  700. bool ok = e->emit_del(ctx());
  701. if(!ok) SyntaxError();
  702. consume_end_stmt();
  703. } break;
  704. case TK("with"): {
  705. // TODO: reimpl this
  706. EXPR(false);
  707. ctx()->emit(OP_POP_TOP, BC_NOARG, prev().line);
  708. consume(TK("as"));
  709. consume(TK("@id"));
  710. // int index = ctx()->add_name(prev().str());
  711. // emit(OP_STORE_NAME, index);
  712. // emit(OP_LOAD_NAME_REF, index);
  713. // emit(OP_WITH_ENTER);
  714. compile_block_body();
  715. // emit(OP_LOAD_NAME_REF, index);
  716. // emit(OP_WITH_EXIT);
  717. } break;
  718. /*************************************************/
  719. // TODO: refactor goto/label use special $ syntax
  720. case TK("label"): {
  721. if(mode()!=EXEC_MODE) SyntaxError("'label' is only available in EXEC_MODE");
  722. consume(TK(".")); consume(TK("@id"));
  723. bool ok = ctx()->add_label(prev().str());
  724. if(!ok) SyntaxError("label " + prev().str().escape() + " already exists");
  725. consume_end_stmt();
  726. } break;
  727. case TK("goto"):
  728. if(mode()!=EXEC_MODE) SyntaxError("'goto' is only available in EXEC_MODE");
  729. consume(TK(".")); consume(TK("@id"));
  730. ctx()->emit(OP_GOTO, ctx()->add_name(prev().str()), prev().line);
  731. consume_end_stmt();
  732. break;
  733. /*************************************************/
  734. // handle dangling expression or assignment
  735. default: {
  736. advance(-1); // do revert since we have pre-called advance() at the beginning
  737. EXPR_TUPLE();
  738. if(!try_compile_assignment()){
  739. ctx()->emit_expr();
  740. if(mode()==REPL_MODE && name_scope()==NAME_GLOBAL){
  741. ctx()->emit(OP_PRINT_EXPR, BC_NOARG, BC_KEEPLINE);
  742. }else{
  743. ctx()->emit(OP_POP_TOP, BC_NOARG, BC_KEEPLINE);
  744. }
  745. }
  746. consume_end_stmt();
  747. }
  748. }
  749. }
  750. // PASS
  751. void compile_class(){
  752. consume(TK("@id"));
  753. int namei = ctx()->add_name(prev().str());
  754. int super_namei = -1;
  755. if(match(TK("(")) && match(TK("@id"))){
  756. super_namei = ctx()->add_name(prev().str());
  757. consume(TK(")"));
  758. }
  759. if(super_namei == -1) ctx()->emit(OP_LOAD_NONE, BC_NOARG, prev().line);
  760. else ctx()->emit(OP_LOAD_GLOBAL, super_namei, prev().line);
  761. ctx()->emit(OP_BEGIN_CLASS, namei, BC_KEEPLINE);
  762. ctx()->is_compiling_class = true;
  763. compile_block_body();
  764. ctx()->is_compiling_class = false;
  765. ctx()->emit(OP_END_CLASS, BC_NOARG, BC_KEEPLINE);
  766. }
  767. void _compile_f_args(FuncDecl_ decl, bool enable_type_hints){
  768. int state = 0; // 0 for args, 1 for *args, 2 for k=v, 3 for **kwargs
  769. do {
  770. if(state == 3) SyntaxError("**kwargs should be the last argument");
  771. match_newlines();
  772. if(match(TK("*"))){
  773. if(state < 1) state = 1;
  774. else SyntaxError("*args should be placed before **kwargs");
  775. }
  776. else if(match(TK("**"))){
  777. state = 3;
  778. }
  779. consume(TK("@id"));
  780. const Str& name = prev().str();
  781. if(decl->has_name(name)) SyntaxError("duplicate argument name");
  782. // eat type hints
  783. if(enable_type_hints && match(TK(":"))) consume(TK("@id"));
  784. if(state == 0 && curr().type == TK("=")) state = 2;
  785. switch (state)
  786. {
  787. case 0: decl->args.push_back(name); break;
  788. case 1: decl->starred_arg = name; state+=1; break;
  789. case 2: {
  790. consume(TK("="));
  791. PyObject* value = read_literal();
  792. if(value == nullptr){
  793. SyntaxError(Str("expect a literal, not ") + TK_STR(curr().type));
  794. }
  795. decl->kwargs.set(name, value);
  796. decl->kwargs_order.push_back(name);
  797. } break;
  798. case 3: SyntaxError("**kwargs is not supported yet"); break;
  799. }
  800. } while (match(TK(",")));
  801. }
  802. void compile_function(const std::vector<Expr_>& decorators={}){
  803. FuncDecl_ decl = make_sp<FuncDecl>();
  804. StrName obj_name;
  805. consume(TK("@id"));
  806. decl->name = prev().str();
  807. if(!ctx()->is_compiling_class && match(TK("::"))){
  808. consume(TK("@id"));
  809. obj_name = decl->name;
  810. decl->name = prev().str();
  811. }
  812. consume(TK("("));
  813. if (!match(TK(")"))) {
  814. _compile_f_args(decl, true);
  815. consume(TK(")"));
  816. }
  817. if(match(TK("->"))){
  818. if(!match(TK("None"))) consume(TK("@id"));
  819. }
  820. decl->code = push_context(lexer->src, decl->name.sv());
  821. compile_block_body();
  822. pop_context();
  823. ctx()->emit(OP_LOAD_FUNCTION, ctx()->add_func_decl(decl), prev().line);
  824. // add decorators
  825. for(auto it=decorators.rbegin(); it!=decorators.rend(); ++it){
  826. (*it)->emit(ctx());
  827. ctx()->emit(OP_ROT_TWO, BC_NOARG, (*it)->line);
  828. ctx()->emit(OP_LOAD_NULL, BC_NOARG, BC_KEEPLINE);
  829. ctx()->emit(OP_ROT_TWO, BC_NOARG, BC_KEEPLINE);
  830. ctx()->emit(OP_CALL, 1, (*it)->line);
  831. }
  832. if(!ctx()->is_compiling_class){
  833. if(obj_name.empty()){
  834. auto e = make_expr<NameExpr>(decl->name, name_scope());
  835. e->emit_store(ctx());
  836. } else {
  837. ctx()->emit(OP_LOAD_GLOBAL, ctx()->add_name(obj_name), prev().line);
  838. int index = ctx()->add_name(decl->name);
  839. ctx()->emit(OP_STORE_ATTR, index, prev().line);
  840. }
  841. }else{
  842. int index = ctx()->add_name(decl->name);
  843. ctx()->emit(OP_STORE_CLASS_ATTR, index, prev().line);
  844. }
  845. }
  846. PyObject* read_literal(){
  847. advance();
  848. switch(prev().type){
  849. case TK("-"): {
  850. consume(TK("@num"));
  851. PyObject* val = LiteralExpr(prev().value).to_object(ctx());
  852. return vm->num_negated(val);
  853. }
  854. case TK("@num"): return LiteralExpr(prev().value).to_object(ctx());
  855. case TK("@str"): return LiteralExpr(prev().value).to_object(ctx());
  856. case TK("True"): return VAR(true);
  857. case TK("False"): return VAR(false);
  858. case TK("None"): return vm->None;
  859. case TK("..."): return vm->Ellipsis;
  860. default: break;
  861. }
  862. return nullptr;
  863. }
  864. void SyntaxError(Str msg){ lexer->throw_err("SyntaxError", msg, curr().line, curr().start); }
  865. void SyntaxError(){ lexer->throw_err("SyntaxError", "invalid syntax", curr().line, curr().start); }
  866. void IndentationError(Str msg){ lexer->throw_err("IndentationError", msg, curr().line, curr().start); }
  867. public:
  868. Compiler(VM* vm, const Str& source, const Str& filename, CompileMode mode){
  869. this->vm = vm;
  870. this->used = false;
  871. this->lexer = std::make_unique<Lexer>(
  872. make_sp<SourceData>(source, filename, mode)
  873. );
  874. // TODO: check if already initialized
  875. init_pratt_rules();
  876. }
  877. CodeObject_ compile(){
  878. if(used) UNREACHABLE();
  879. used = true;
  880. tokens = lexer->run();
  881. // if(lexer->src->filename == "<stdin>"){
  882. // for(auto& t: tokens) std::cout << t.info() << std::endl;
  883. // }
  884. CodeObject_ code = push_context(lexer->src, lexer->src->filename);
  885. advance(); // skip @sof, so prev() is always valid
  886. match_newlines(); // skip possible leading '\n'
  887. if(mode()==EVAL_MODE) {
  888. EXPR_TUPLE(false);
  889. consume(TK("@eof"));
  890. ctx()->emit(OP_RETURN_VALUE, BC_NOARG, BC_KEEPLINE);
  891. pop_context();
  892. return code;
  893. }else if(mode()==JSON_MODE){
  894. EXPR();
  895. Expr_ e = ctx()->s_expr.popx();
  896. if(!e->is_json_object()) SyntaxError("expect a JSON object, literal or array");
  897. consume(TK("@eof"));
  898. e->emit(ctx());
  899. ctx()->emit(OP_RETURN_VALUE, BC_NOARG, BC_KEEPLINE);
  900. pop_context();
  901. return code;
  902. }
  903. while (!match(TK("@eof"))) {
  904. if (match(TK("class"))) {
  905. compile_class();
  906. } else {
  907. compile_stmt();
  908. }
  909. match_newlines();
  910. }
  911. pop_context();
  912. return code;
  913. }
  914. };
  915. } // namespace pkpy