compiler.h 36 KB

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