compiler.h 36 KB

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