compiler.h 41 KB

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