compiler.h 45 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169
  1. #pragma once
  2. #include "parser.h"
  3. #include "error.h"
  4. #include "ceval.h"
  5. namespace pkpy{
  6. class Compiler;
  7. typedef void (Compiler::*GrammarFn)();
  8. typedef void (Compiler::*CompilerAction)();
  9. struct GrammarRule{
  10. GrammarFn prefix;
  11. GrammarFn infix;
  12. Precedence precedence;
  13. };
  14. enum StringType { NORMAL_STRING, RAW_STRING, F_STRING };
  15. class Compiler {
  16. std::unique_ptr<Parser> parser;
  17. std::stack<CodeObject_> codes;
  18. int lexing_count = 0;
  19. bool used = false;
  20. VM* vm;
  21. std::map<TokenIndex, GrammarRule> rules;
  22. CodeObject_ co() const{ return codes.top(); }
  23. CompileMode mode() const{ return parser->src->mode; }
  24. NameScope name_scope() const { return codes.size()>1 ? NAME_LOCAL : NAME_GLOBAL; }
  25. public:
  26. Compiler(VM* vm, const char* source, Str filename, CompileMode mode){
  27. this->vm = vm;
  28. this->parser = std::make_unique<Parser>(
  29. make_sp<SourceData>(source, filename, mode)
  30. );
  31. // http://journal.stuffwithstuff.com/2011/03/19/pratt-parsers-expression-parsing-made-easy/
  32. #define METHOD(name) &Compiler::name
  33. #define NO_INFIX nullptr, PREC_NONE
  34. for(TokenIndex i=0; i<kTokenCount; i++) rules[i] = { nullptr, NO_INFIX };
  35. rules[TK(".")] = { nullptr, METHOD(exprAttrib), PREC_ATTRIB };
  36. rules[TK("(")] = { METHOD(exprGrouping), METHOD(exprCall), PREC_CALL };
  37. rules[TK("[")] = { METHOD(exprList), METHOD(exprSubscript), PREC_SUBSCRIPT };
  38. rules[TK("{")] = { METHOD(exprMap), NO_INFIX };
  39. rules[TK("%")] = { nullptr, METHOD(exprBinaryOp), PREC_FACTOR };
  40. rules[TK("+")] = { nullptr, METHOD(exprBinaryOp), PREC_TERM };
  41. rules[TK("-")] = { METHOD(exprUnaryOp), METHOD(exprBinaryOp), PREC_TERM };
  42. rules[TK("*")] = { METHOD(exprUnaryOp), METHOD(exprBinaryOp), PREC_FACTOR };
  43. rules[TK("/")] = { nullptr, METHOD(exprBinaryOp), PREC_FACTOR };
  44. rules[TK("//")] = { nullptr, METHOD(exprBinaryOp), PREC_FACTOR };
  45. rules[TK("**")] = { nullptr, METHOD(exprBinaryOp), PREC_EXPONENT };
  46. rules[TK(">")] = { nullptr, METHOD(exprBinaryOp), PREC_COMPARISION };
  47. rules[TK("<")] = { nullptr, METHOD(exprBinaryOp), PREC_COMPARISION };
  48. rules[TK("==")] = { nullptr, METHOD(exprBinaryOp), PREC_EQUALITY };
  49. rules[TK("!=")] = { nullptr, METHOD(exprBinaryOp), PREC_EQUALITY };
  50. rules[TK(">=")] = { nullptr, METHOD(exprBinaryOp), PREC_COMPARISION };
  51. rules[TK("<=")] = { nullptr, METHOD(exprBinaryOp), PREC_COMPARISION };
  52. rules[TK("in")] = { nullptr, METHOD(exprBinaryOp), PREC_TEST };
  53. rules[TK("is")] = { nullptr, METHOD(exprBinaryOp), PREC_TEST };
  54. rules[TK("not in")] = { nullptr, METHOD(exprBinaryOp), PREC_TEST };
  55. rules[TK("is not")] = { nullptr, METHOD(exprBinaryOp), PREC_TEST };
  56. rules[TK("and") ] = { nullptr, METHOD(exprAnd), PREC_LOGICAL_AND };
  57. rules[TK("or")] = { nullptr, METHOD(exprOr), PREC_LOGICAL_OR };
  58. rules[TK("not")] = { METHOD(exprUnaryOp), nullptr, PREC_UNARY };
  59. rules[TK("True")] = { METHOD(exprValue), NO_INFIX };
  60. rules[TK("False")] = { METHOD(exprValue), NO_INFIX };
  61. rules[TK("lambda")] = { METHOD(exprLambda), NO_INFIX };
  62. rules[TK("None")] = { METHOD(exprValue), NO_INFIX };
  63. rules[TK("...")] = { METHOD(exprValue), NO_INFIX };
  64. rules[TK("@id")] = { METHOD(exprName), NO_INFIX };
  65. rules[TK("@num")] = { METHOD(exprLiteral), NO_INFIX };
  66. rules[TK("@str")] = { METHOD(exprLiteral), NO_INFIX };
  67. rules[TK("@fstr")] = { METHOD(exprFString), NO_INFIX };
  68. rules[TK("?")] = { nullptr, METHOD(exprTernary), PREC_TERNARY };
  69. rules[TK("=")] = { nullptr, METHOD(exprAssign), PREC_ASSIGNMENT };
  70. rules[TK("+=")] = { nullptr, METHOD(exprAssign), PREC_ASSIGNMENT };
  71. rules[TK("-=")] = { nullptr, METHOD(exprAssign), PREC_ASSIGNMENT };
  72. rules[TK("*=")] = { nullptr, METHOD(exprAssign), PREC_ASSIGNMENT };
  73. rules[TK("/=")] = { nullptr, METHOD(exprAssign), PREC_ASSIGNMENT };
  74. rules[TK("//=")] = { nullptr, METHOD(exprAssign), PREC_ASSIGNMENT };
  75. rules[TK("%=")] = { nullptr, METHOD(exprAssign), PREC_ASSIGNMENT };
  76. rules[TK("&=")] = { nullptr, METHOD(exprAssign), PREC_ASSIGNMENT };
  77. rules[TK("|=")] = { nullptr, METHOD(exprAssign), PREC_ASSIGNMENT };
  78. rules[TK("^=")] = { nullptr, METHOD(exprAssign), PREC_ASSIGNMENT };
  79. rules[TK(">>=")] = { nullptr, METHOD(exprAssign), PREC_ASSIGNMENT };
  80. rules[TK("<<=")] = { nullptr, METHOD(exprAssign), PREC_ASSIGNMENT };
  81. rules[TK(",")] = { nullptr, METHOD(exprComma), PREC_COMMA };
  82. rules[TK("<<")] = { nullptr, METHOD(exprBinaryOp), PREC_BITWISE_SHIFT };
  83. rules[TK(">>")] = { nullptr, METHOD(exprBinaryOp), PREC_BITWISE_SHIFT };
  84. rules[TK("&")] = { nullptr, METHOD(exprBinaryOp), PREC_BITWISE_AND };
  85. rules[TK("|")] = { nullptr, METHOD(exprBinaryOp), PREC_BITWISE_OR };
  86. rules[TK("^")] = { nullptr, METHOD(exprBinaryOp), PREC_BITWISE_XOR };
  87. #undef METHOD
  88. #undef NO_INFIX
  89. #define EXPR() parse_expression(PREC_TERNARY) // no '=' and ',' just a simple expression
  90. #define EXPR_TUPLE() parse_expression(PREC_COMMA) // no '=', but ',' is allowed
  91. #define EXPR_ANY() parse_expression(PREC_ASSIGNMENT)
  92. }
  93. private:
  94. Str eat_string_until(char quote, bool raw) {
  95. bool quote3 = parser->match_n_chars(2, quote);
  96. std::vector<char> buff;
  97. while (true) {
  98. char c = parser->eatchar_include_newline();
  99. if (c == quote){
  100. if(quote3 && !parser->match_n_chars(2, quote)){
  101. buff.push_back(c);
  102. continue;
  103. }
  104. break;
  105. }
  106. if (c == '\0'){
  107. if(quote3 && parser->src->mode == REPL_MODE){
  108. throw NeedMoreLines(false);
  109. }
  110. SyntaxError("EOL while scanning string literal");
  111. }
  112. if (c == '\n'){
  113. if(!quote3) SyntaxError("EOL while scanning string literal");
  114. else{
  115. buff.push_back(c);
  116. continue;
  117. }
  118. }
  119. if (!raw && c == '\\') {
  120. switch (parser->eatchar_include_newline()) {
  121. case '"': buff.push_back('"'); break;
  122. case '\'': buff.push_back('\''); break;
  123. case '\\': buff.push_back('\\'); break;
  124. case 'n': buff.push_back('\n'); break;
  125. case 'r': buff.push_back('\r'); break;
  126. case 't': buff.push_back('\t'); break;
  127. default: SyntaxError("invalid escape char");
  128. }
  129. } else {
  130. buff.push_back(c);
  131. }
  132. }
  133. return Str(buff.data(), buff.size());
  134. }
  135. void eat_string(char quote, StringType type) {
  136. Str s = eat_string_until(quote, type == RAW_STRING);
  137. if(type == F_STRING){
  138. parser->set_next_token(TK("@fstr"), py_var(vm, s));
  139. }else{
  140. parser->set_next_token(TK("@str"), py_var(vm, s));
  141. }
  142. }
  143. void eat_number() {
  144. static const std::regex pattern("^(0x)?[0-9a-fA-F]+(\\.[0-9]+)?");
  145. std::smatch m;
  146. const char* i = parser->token_start;
  147. while(*i != '\n' && *i != '\0') i++;
  148. std::string s = std::string(parser->token_start, i);
  149. try{
  150. if (std::regex_search(s, m, pattern)) {
  151. // here is m.length()-1, since the first char was eaten by lex_token()
  152. for(int j=0; j<m.length()-1; j++) parser->eatchar();
  153. int base = 10;
  154. size_t size;
  155. if (m[1].matched) base = 16;
  156. if (m[2].matched) {
  157. if(base == 16) SyntaxError("hex literal should not contain a dot");
  158. parser->set_next_token(TK("@num"), py_var(vm, S_TO_FLOAT(m[0], &size)));
  159. } else {
  160. parser->set_next_token(TK("@num"), py_var(vm, S_TO_INT(m[0], &size, base)));
  161. }
  162. if (size != m.length()) UNREACHABLE();
  163. }
  164. }catch(std::exception& _){
  165. SyntaxError("invalid number literal");
  166. }
  167. }
  168. void lex_token(){
  169. lexing_count++;
  170. _lex_token();
  171. lexing_count--;
  172. }
  173. // Lex the next token and set it as the next token.
  174. void _lex_token() {
  175. parser->prev = parser->curr;
  176. parser->curr = parser->next_token();
  177. //std::cout << parser->curr.info() << std::endl;
  178. while (parser->peekchar() != '\0') {
  179. parser->token_start = parser->curr_char;
  180. char c = parser->eatchar_include_newline();
  181. switch (c) {
  182. case '\'': case '"': eat_string(c, NORMAL_STRING); return;
  183. case '#': parser->skip_line_comment(); break;
  184. case '{': parser->set_next_token(TK("{")); return;
  185. case '}': parser->set_next_token(TK("}")); return;
  186. case ',': parser->set_next_token(TK(",")); return;
  187. case ':': parser->set_next_token_2(':', TK(":"), TK("::")); return;
  188. case ';': parser->set_next_token(TK(";")); return;
  189. case '(': parser->set_next_token(TK("(")); return;
  190. case ')': parser->set_next_token(TK(")")); return;
  191. case '[': parser->set_next_token(TK("[")); return;
  192. case ']': parser->set_next_token(TK("]")); return;
  193. case '@': parser->set_next_token(TK("@")); return;
  194. case '%': parser->set_next_token_2('=', TK("%"), TK("%=")); return;
  195. case '&': parser->set_next_token_2('=', TK("&"), TK("&=")); return;
  196. case '|': parser->set_next_token_2('=', TK("|"), TK("|=")); return;
  197. case '^': parser->set_next_token_2('=', TK("^"), TK("^=")); return;
  198. case '?': parser->set_next_token(TK("?")); return;
  199. case '.': {
  200. if(parser->matchchar('.')) {
  201. if(parser->matchchar('.')) {
  202. parser->set_next_token(TK("..."));
  203. } else {
  204. SyntaxError("invalid token '..'");
  205. }
  206. } else {
  207. parser->set_next_token(TK("."));
  208. }
  209. return;
  210. }
  211. case '=': parser->set_next_token_2('=', TK("="), TK("==")); return;
  212. case '+': parser->set_next_token_2('=', TK("+"), TK("+=")); return;
  213. case '>': {
  214. if(parser->matchchar('=')) parser->set_next_token(TK(">="));
  215. else if(parser->matchchar('>')) parser->set_next_token_2('=', TK(">>"), TK(">>="));
  216. else parser->set_next_token(TK(">"));
  217. return;
  218. }
  219. case '<': {
  220. if(parser->matchchar('=')) parser->set_next_token(TK("<="));
  221. else if(parser->matchchar('<')) parser->set_next_token_2('=', TK("<<"), TK("<<="));
  222. else parser->set_next_token(TK("<"));
  223. return;
  224. }
  225. case '-': {
  226. if(parser->matchchar('=')) parser->set_next_token(TK("-="));
  227. else if(parser->matchchar('>')) parser->set_next_token(TK("->"));
  228. else parser->set_next_token(TK("-"));
  229. return;
  230. }
  231. case '!':
  232. if(parser->matchchar('=')) parser->set_next_token(TK("!="));
  233. else SyntaxError("expected '=' after '!'");
  234. break;
  235. case '*':
  236. if (parser->matchchar('*')) {
  237. parser->set_next_token(TK("**")); // '**'
  238. } else {
  239. parser->set_next_token_2('=', TK("*"), TK("*="));
  240. }
  241. return;
  242. case '/':
  243. if(parser->matchchar('/')) {
  244. parser->set_next_token_2('=', TK("//"), TK("//="));
  245. } else {
  246. parser->set_next_token_2('=', TK("/"), TK("/="));
  247. }
  248. return;
  249. case '\r': break; // just ignore '\r'
  250. case ' ': case '\t': parser->eat_spaces(); break;
  251. case '\n': {
  252. parser->set_next_token(TK("@eol"));
  253. if(!parser->eat_indentation()) IndentationError("unindent does not match any outer indentation level");
  254. return;
  255. }
  256. default: {
  257. if(c == 'f'){
  258. if(parser->matchchar('\'')) {eat_string('\'', F_STRING); return;}
  259. if(parser->matchchar('"')) {eat_string('"', F_STRING); return;}
  260. }else if(c == 'r'){
  261. if(parser->matchchar('\'')) {eat_string('\'', RAW_STRING); return;}
  262. if(parser->matchchar('"')) {eat_string('"', RAW_STRING); return;}
  263. }
  264. if (c >= '0' && c <= '9') {
  265. eat_number();
  266. return;
  267. }
  268. switch (parser->eat_name())
  269. {
  270. case 0: break;
  271. case 1: SyntaxError("invalid char: " + std::string(1, c));
  272. case 2: SyntaxError("invalid utf8 sequence: " + std::string(1, c));
  273. case 3: SyntaxError("@id contains invalid char"); break;
  274. case 4: SyntaxError("invalid JSON token"); break;
  275. default: UNREACHABLE();
  276. }
  277. return;
  278. }
  279. }
  280. }
  281. parser->token_start = parser->curr_char;
  282. parser->set_next_token(TK("@eof"));
  283. }
  284. inline TokenIndex peek() {
  285. return parser->curr.type;
  286. }
  287. // not sure this will work
  288. TokenIndex peek_next() {
  289. if(parser->nexts.empty()) return TK("@eof");
  290. return parser->nexts.front().type;
  291. }
  292. bool match(TokenIndex expected) {
  293. if (peek() != expected) return false;
  294. lex_token();
  295. return true;
  296. }
  297. void consume(TokenIndex expected) {
  298. if (!match(expected)){
  299. StrStream ss;
  300. ss << "expected '" << TK_STR(expected) << "', but got '" << TK_STR(peek()) << "'";
  301. SyntaxError(ss.str());
  302. }
  303. }
  304. bool match_newlines(bool repl_throw=false) {
  305. bool consumed = false;
  306. if (peek() == TK("@eol")) {
  307. while (peek() == TK("@eol")) lex_token();
  308. consumed = true;
  309. }
  310. if (repl_throw && peek() == TK("@eof")){
  311. throw NeedMoreLines(co()->_is_compiling_class);
  312. }
  313. return consumed;
  314. }
  315. bool match_end_stmt() {
  316. if (match(TK(";"))) { match_newlines(); return true; }
  317. if (match_newlines() || peek()==TK("@eof")) return true;
  318. if (peek() == TK("@dedent")) return true;
  319. return false;
  320. }
  321. void consume_end_stmt() {
  322. if (!match_end_stmt()) SyntaxError("expected statement end");
  323. }
  324. void exprLiteral() {
  325. PyVar value = parser->prev.value;
  326. int index = co()->add_const(value);
  327. emit(OP_LOAD_CONST, index);
  328. }
  329. void exprFString() {
  330. static const std::regex pattern(R"(\{(.*?)\})");
  331. PyVar value = parser->prev.value;
  332. Str s = py_cast<Str>(vm, value);
  333. std::sregex_iterator begin(s.begin(), s.end(), pattern);
  334. std::sregex_iterator end;
  335. int size = 0;
  336. int i = 0;
  337. for(auto it = begin; it != end; it++) {
  338. std::smatch m = *it;
  339. if (i < m.position()) {
  340. std::string literal = s.substr(i, m.position() - i);
  341. emit(OP_LOAD_CONST, co()->add_const(py_var(vm, literal)));
  342. size++;
  343. }
  344. emit(OP_LOAD_EVAL_FN);
  345. emit(OP_LOAD_CONST, co()->add_const(py_var(vm, m[1].str())));
  346. emit(OP_CALL, 1);
  347. size++;
  348. i = (int)(m.position() + m.length());
  349. }
  350. if (i < s.size()) {
  351. std::string literal = s.substr(i, s.size() - i);
  352. emit(OP_LOAD_CONST, co()->add_const(py_var(vm, literal)));
  353. size++;
  354. }
  355. emit(OP_BUILD_STRING, size);
  356. }
  357. void exprLambda() {
  358. Function func;
  359. func.name = "<lambda>";
  360. if(!match(TK(":"))){
  361. _compile_f_args(func, false);
  362. consume(TK(":"));
  363. }
  364. func.code = make_sp<CodeObject>(parser->src, func.name.str());
  365. this->codes.push(func.code);
  366. co()->_rvalue += 1; EXPR_TUPLE(); co()->_rvalue -= 1;
  367. emit(OP_RETURN_VALUE);
  368. func.code->optimize(vm);
  369. this->codes.pop();
  370. emit(OP_LOAD_FUNCTION, co()->add_const(py_var(vm, func)));
  371. if(name_scope() == NAME_LOCAL) emit(OP_SETUP_CLOSURE);
  372. }
  373. void exprAssign() {
  374. int lhs = co()->codes.empty() ? -1 : co()->codes.size() - 1;
  375. co()->_rvalue += 1;
  376. TokenIndex op = parser->prev.type;
  377. if(op == TK("=")) { // a = (expr)
  378. EXPR_TUPLE();
  379. if(lhs!=-1 && co()->codes[lhs].op == OP_LOAD_NAME_REF){
  380. if(co()->_is_compiling_class){
  381. emit(OP_STORE_CLASS_ATTR, co()->codes[lhs].arg);
  382. }else{
  383. emit(OP_STORE_NAME, co()->codes[lhs].arg);
  384. }
  385. co()->codes[lhs].op = OP_NO_OP;
  386. co()->codes[lhs].arg = -1;
  387. }else{
  388. if(co()->_is_compiling_class) SyntaxError();
  389. emit(OP_STORE_REF);
  390. }
  391. }else{ // a += (expr) -> a = a + (expr)
  392. if(co()->_is_compiling_class) SyntaxError();
  393. EXPR();
  394. switch (op) {
  395. case TK("+="): emit(OP_INPLACE_BINARY_OP, 0); break;
  396. case TK("-="): emit(OP_INPLACE_BINARY_OP, 1); break;
  397. case TK("*="): emit(OP_INPLACE_BINARY_OP, 2); break;
  398. case TK("/="): emit(OP_INPLACE_BINARY_OP, 3); break;
  399. case TK("//="): emit(OP_INPLACE_BINARY_OP, 4); break;
  400. case TK("%="): emit(OP_INPLACE_BINARY_OP, 5); break;
  401. case TK("<<="): emit(OP_INPLACE_BITWISE_OP, 0); break;
  402. case TK(">>="): emit(OP_INPLACE_BITWISE_OP, 1); break;
  403. case TK("&="): emit(OP_INPLACE_BITWISE_OP, 2); break;
  404. case TK("|="): emit(OP_INPLACE_BITWISE_OP, 3); break;
  405. case TK("^="): emit(OP_INPLACE_BITWISE_OP, 4); break;
  406. default: UNREACHABLE();
  407. }
  408. }
  409. co()->_rvalue -= 1;
  410. }
  411. void exprComma() {
  412. int size = 1; // an expr is in the stack now
  413. do {
  414. EXPR(); // NOTE: "1," will fail, "1,2" will be ok
  415. size++;
  416. } while(match(TK(",")));
  417. emit(co()->_rvalue ? OP_BUILD_TUPLE : OP_BUILD_TUPLE_REF, size);
  418. }
  419. void exprOr() {
  420. int patch = emit(OP_JUMP_IF_TRUE_OR_POP);
  421. parse_expression(PREC_LOGICAL_OR);
  422. patch_jump(patch);
  423. }
  424. void exprAnd() {
  425. int patch = emit(OP_JUMP_IF_FALSE_OR_POP);
  426. parse_expression(PREC_LOGICAL_AND);
  427. patch_jump(patch);
  428. }
  429. void exprTernary() {
  430. int patch = emit(OP_POP_JUMP_IF_FALSE);
  431. EXPR(); // if true
  432. int patch2 = emit(OP_JUMP_ABSOLUTE);
  433. consume(TK(":"));
  434. patch_jump(patch);
  435. EXPR(); // if false
  436. patch_jump(patch2);
  437. }
  438. void exprBinaryOp() {
  439. TokenIndex op = parser->prev.type;
  440. parse_expression((Precedence)(rules[op].precedence + 1));
  441. switch (op) {
  442. case TK("+"): emit(OP_BINARY_OP, 0); break;
  443. case TK("-"): emit(OP_BINARY_OP, 1); break;
  444. case TK("*"): emit(OP_BINARY_OP, 2); break;
  445. case TK("/"): emit(OP_BINARY_OP, 3); break;
  446. case TK("//"): emit(OP_BINARY_OP, 4); break;
  447. case TK("%"): emit(OP_BINARY_OP, 5); break;
  448. case TK("**"): emit(OP_BINARY_OP, 6); break;
  449. case TK("<"): emit(OP_COMPARE_OP, 0); break;
  450. case TK("<="): emit(OP_COMPARE_OP, 1); break;
  451. case TK("=="): emit(OP_COMPARE_OP, 2); break;
  452. case TK("!="): emit(OP_COMPARE_OP, 3); break;
  453. case TK(">"): emit(OP_COMPARE_OP, 4); break;
  454. case TK(">="): emit(OP_COMPARE_OP, 5); break;
  455. case TK("in"): emit(OP_CONTAINS_OP, 0); break;
  456. case TK("not in"): emit(OP_CONTAINS_OP, 1); break;
  457. case TK("is"): emit(OP_IS_OP, 0); break;
  458. case TK("is not"): emit(OP_IS_OP, 1); break;
  459. case TK("<<"): emit(OP_BITWISE_OP, 0); break;
  460. case TK(">>"): emit(OP_BITWISE_OP, 1); break;
  461. case TK("&"): emit(OP_BITWISE_OP, 2); break;
  462. case TK("|"): emit(OP_BITWISE_OP, 3); break;
  463. case TK("^"): emit(OP_BITWISE_OP, 4); break;
  464. default: UNREACHABLE();
  465. }
  466. }
  467. void exprUnaryOp() {
  468. TokenIndex op = parser->prev.type;
  469. parse_expression((Precedence)(PREC_UNARY + 1));
  470. switch (op) {
  471. case TK("-"): emit(OP_UNARY_NEGATIVE); break;
  472. case TK("not"): emit(OP_UNARY_NOT); break;
  473. case TK("*"): emit(OP_UNARY_STAR, co()->_rvalue); break;
  474. default: UNREACHABLE();
  475. }
  476. }
  477. void exprGrouping() {
  478. match_newlines(mode()==REPL_MODE);
  479. EXPR_TUPLE();
  480. match_newlines(mode()==REPL_MODE);
  481. consume(TK(")"));
  482. }
  483. void exprList() {
  484. int _patch = emit(OP_NO_OP);
  485. int _body_start = co()->codes.size();
  486. int ARGC = 0;
  487. do {
  488. match_newlines(mode()==REPL_MODE);
  489. if (peek() == TK("]")) break;
  490. EXPR(); ARGC++;
  491. match_newlines(mode()==REPL_MODE);
  492. if(ARGC == 1 && match(TK("for"))) goto __LISTCOMP;
  493. } while (match(TK(",")));
  494. match_newlines(mode()==REPL_MODE);
  495. consume(TK("]"));
  496. emit(OP_BUILD_LIST, ARGC);
  497. return;
  498. __LISTCOMP:
  499. int _body_end_return = emit(OP_JUMP_ABSOLUTE, -1);
  500. int _body_end = co()->codes.size();
  501. co()->codes[_patch].op = OP_JUMP_ABSOLUTE;
  502. co()->codes[_patch].arg = _body_end;
  503. emit(OP_BUILD_LIST, 0);
  504. EXPR_FOR_VARS();consume(TK("in"));EXPR_TUPLE();
  505. match_newlines(mode()==REPL_MODE);
  506. int _skipPatch = emit(OP_JUMP_ABSOLUTE);
  507. int _cond_start = co()->codes.size();
  508. int _cond_end_return = -1;
  509. if(match(TK("if"))) {
  510. EXPR_TUPLE();
  511. _cond_end_return = emit(OP_JUMP_ABSOLUTE, -1);
  512. }
  513. patch_jump(_skipPatch);
  514. emit(OP_GET_ITER);
  515. co()->_enter_block(FOR_LOOP);
  516. emit(OP_FOR_ITER);
  517. if(_cond_end_return != -1) { // there is an if condition
  518. emit(OP_JUMP_ABSOLUTE, _cond_start);
  519. patch_jump(_cond_end_return);
  520. int ifpatch = emit(OP_POP_JUMP_IF_FALSE);
  521. emit(OP_JUMP_ABSOLUTE, _body_start);
  522. patch_jump(_body_end_return);
  523. emit(OP_LIST_APPEND);
  524. patch_jump(ifpatch);
  525. }else{
  526. emit(OP_JUMP_ABSOLUTE, _body_start);
  527. patch_jump(_body_end_return);
  528. emit(OP_LIST_APPEND);
  529. }
  530. emit(OP_LOOP_CONTINUE, -1, true);
  531. co()->_exit_block();
  532. match_newlines(mode()==REPL_MODE);
  533. consume(TK("]"));
  534. }
  535. void exprMap() {
  536. bool parsing_dict = false;
  537. int size = 0;
  538. do {
  539. match_newlines(mode()==REPL_MODE);
  540. if (peek() == TK("}")) break;
  541. EXPR();
  542. if(peek() == TK(":")) parsing_dict = true;
  543. if(parsing_dict){
  544. consume(TK(":"));
  545. EXPR();
  546. }
  547. size++;
  548. match_newlines(mode()==REPL_MODE);
  549. } while (match(TK(",")));
  550. consume(TK("}"));
  551. if(size == 0 || parsing_dict) emit(OP_BUILD_MAP, size);
  552. else emit(OP_BUILD_SET, size);
  553. }
  554. void exprCall() {
  555. int ARGC = 0;
  556. int KWARGC = 0;
  557. bool need_unpack = false;
  558. do {
  559. match_newlines(mode()==REPL_MODE);
  560. if (peek() == TK(")")) break;
  561. if(peek() == TK("@id") && peek_next() == TK("=")) {
  562. consume(TK("@id"));
  563. const Str& key = parser->prev.str();
  564. emit(OP_LOAD_CONST, co()->add_const(py_var(vm, key)));
  565. consume(TK("="));
  566. co()->_rvalue += 1; EXPR(); co()->_rvalue -= 1;
  567. KWARGC++;
  568. } else{
  569. if(KWARGC > 0) SyntaxError("positional argument follows keyword argument");
  570. co()->_rvalue += 1; EXPR(); co()->_rvalue -= 1;
  571. if(co()->codes.back().op == OP_UNARY_STAR) need_unpack = true;
  572. ARGC++;
  573. }
  574. match_newlines(mode()==REPL_MODE);
  575. } while (match(TK(",")));
  576. consume(TK(")"));
  577. if(ARGC > 32767) SyntaxError("too many positional arguments");
  578. if(KWARGC > 32767) SyntaxError("too many keyword arguments");
  579. if(KWARGC > 0){
  580. emit(need_unpack ? OP_CALL_KWARGS_UNPACK : OP_CALL_KWARGS, (KWARGC << 16) | ARGC);
  581. }else{
  582. emit(need_unpack ? OP_CALL_UNPACK : OP_CALL, ARGC);
  583. }
  584. }
  585. void exprName(){ _exprName(false); }
  586. void _exprName(bool force_lvalue) {
  587. Token tkname = parser->prev;
  588. int index = co()->add_name(tkname.str(), name_scope());
  589. bool fast_load = !force_lvalue && co()->_rvalue>0;
  590. emit(fast_load ? OP_LOAD_NAME : OP_LOAD_NAME_REF, index);
  591. }
  592. void exprAttrib() {
  593. consume(TK("@id"));
  594. const Str& name = parser->prev.str();
  595. int index = co()->add_name(name, NAME_ATTR);
  596. emit(co()->_rvalue ? OP_BUILD_ATTR : OP_BUILD_ATTR_REF, index);
  597. }
  598. // [:], [:b]
  599. // [a], [a:], [a:b]
  600. void exprSubscript() {
  601. if(match(TK(":"))){
  602. emit(OP_LOAD_NONE);
  603. if(match(TK("]"))){
  604. emit(OP_LOAD_NONE);
  605. }else{
  606. EXPR_TUPLE();
  607. consume(TK("]"));
  608. }
  609. emit(OP_BUILD_SLICE);
  610. }else{
  611. EXPR_TUPLE();
  612. if(match(TK(":"))){
  613. if(match(TK("]"))){
  614. emit(OP_LOAD_NONE);
  615. }else{
  616. EXPR_TUPLE();
  617. consume(TK("]"));
  618. }
  619. emit(OP_BUILD_SLICE);
  620. }else{
  621. consume(TK("]"));
  622. }
  623. }
  624. emit(OP_BUILD_INDEX, (int)(co()->_rvalue>0));
  625. }
  626. void exprValue() {
  627. TokenIndex op = parser->prev.type;
  628. switch (op) {
  629. case TK("None"): emit(OP_LOAD_NONE); break;
  630. case TK("True"): emit(OP_LOAD_TRUE); break;
  631. case TK("False"): emit(OP_LOAD_FALSE); break;
  632. case TK("..."): emit(OP_LOAD_ELLIPSIS); break;
  633. default: UNREACHABLE();
  634. }
  635. }
  636. int emit(Opcode opcode, int arg=-1, bool keepline=false) {
  637. int line = parser->prev.line;
  638. co()->codes.push_back(
  639. Bytecode{(uint8_t)opcode, arg, line, (uint16_t)co()->_curr_block_i}
  640. );
  641. int i = co()->codes.size() - 1;
  642. if(keepline && i>=1) co()->codes[i].line = co()->codes[i-1].line;
  643. return i;
  644. }
  645. inline void patch_jump(int addr_index) {
  646. int target = co()->codes.size();
  647. co()->codes[addr_index].arg = target;
  648. }
  649. void compile_block_body(CompilerAction action=nullptr) {
  650. if(action == nullptr) action = &Compiler::compile_stmt;
  651. consume(TK(":"));
  652. if(peek()!=TK("@eol") && peek()!=TK("@eof")){
  653. (this->*action)(); // inline block
  654. return;
  655. }
  656. if(!match_newlines(mode()==REPL_MODE)){
  657. SyntaxError("expected a new line after ':'");
  658. }
  659. consume(TK("@indent"));
  660. while (peek() != TK("@dedent")) {
  661. match_newlines();
  662. (this->*action)();
  663. match_newlines();
  664. }
  665. consume(TK("@dedent"));
  666. }
  667. Token _compile_import() {
  668. consume(TK("@id"));
  669. Token tkmodule = parser->prev;
  670. int index = co()->add_name(tkmodule.str(), NAME_SPECIAL);
  671. emit(OP_IMPORT_NAME, index);
  672. return tkmodule;
  673. }
  674. // import a as b
  675. void compile_normal_import() {
  676. do {
  677. Token tkmodule = _compile_import();
  678. if (match(TK("as"))) {
  679. consume(TK("@id"));
  680. tkmodule = parser->prev;
  681. }
  682. int index = co()->add_name(tkmodule.str(), name_scope());
  683. emit(OP_STORE_NAME, index);
  684. } while (match(TK(",")));
  685. consume_end_stmt();
  686. }
  687. // from a import b as c, d as e
  688. void compile_from_import() {
  689. Token tkmodule = _compile_import();
  690. consume(TK("import"));
  691. if (match(TK("*"))) {
  692. if(name_scope() != NAME_GLOBAL) SyntaxError("import * can only be used in global scope");
  693. emit(OP_STORE_ALL_NAMES);
  694. consume_end_stmt();
  695. return;
  696. }
  697. do {
  698. emit(OP_DUP_TOP_VALUE);
  699. consume(TK("@id"));
  700. Token tkname = parser->prev;
  701. int index = co()->add_name(tkname.str(), NAME_ATTR);
  702. emit(OP_BUILD_ATTR, index);
  703. if (match(TK("as"))) {
  704. consume(TK("@id"));
  705. tkname = parser->prev;
  706. }
  707. index = co()->add_name(tkname.str(), name_scope());
  708. emit(OP_STORE_NAME, index);
  709. } while (match(TK(",")));
  710. emit(OP_POP_TOP);
  711. consume_end_stmt();
  712. }
  713. void parse_expression(Precedence precedence) {
  714. lex_token();
  715. GrammarFn prefix = rules[parser->prev.type].prefix;
  716. if (prefix == nullptr) SyntaxError(Str("expected an expression, but got ") + TK_STR(parser->prev.type));
  717. (this->*prefix)();
  718. bool meet_assign_token = false;
  719. while (rules[peek()].precedence >= precedence) {
  720. lex_token();
  721. TokenIndex op = parser->prev.type;
  722. if (op == TK("=")){
  723. if(meet_assign_token) SyntaxError();
  724. meet_assign_token = true;
  725. }
  726. GrammarFn infix = rules[op].infix;
  727. if(infix == nullptr) throw std::runtime_error("(infix == nullptr) is true");
  728. (this->*infix)();
  729. }
  730. }
  731. void compile_if_stmt() {
  732. match_newlines();
  733. co()->_rvalue += 1;
  734. EXPR_TUPLE(); // condition
  735. co()->_rvalue -= 1;
  736. int ifpatch = emit(OP_POP_JUMP_IF_FALSE);
  737. compile_block_body();
  738. if (match(TK("elif"))) {
  739. int exit_jump = emit(OP_JUMP_ABSOLUTE);
  740. patch_jump(ifpatch);
  741. compile_if_stmt();
  742. patch_jump(exit_jump);
  743. } else if (match(TK("else"))) {
  744. int exit_jump = emit(OP_JUMP_ABSOLUTE);
  745. patch_jump(ifpatch);
  746. compile_block_body();
  747. patch_jump(exit_jump);
  748. } else {
  749. patch_jump(ifpatch);
  750. }
  751. }
  752. void compile_while_loop() {
  753. co()->_enter_block(WHILE_LOOP);
  754. co()->_rvalue += 1;
  755. EXPR_TUPLE(); // condition
  756. co()->_rvalue -= 1;
  757. int patch = emit(OP_POP_JUMP_IF_FALSE);
  758. compile_block_body();
  759. emit(OP_LOOP_CONTINUE, -1, true);
  760. patch_jump(patch);
  761. co()->_exit_block();
  762. }
  763. void EXPR_FOR_VARS(){
  764. int size = 0;
  765. do {
  766. consume(TK("@id"));
  767. _exprName(true); size++;
  768. } while (match(TK(",")));
  769. if(size > 1) emit(OP_BUILD_TUPLE_REF, size);
  770. }
  771. void compile_for_loop() {
  772. EXPR_FOR_VARS();consume(TK("in"));
  773. co()->_rvalue += 1; EXPR_TUPLE(); co()->_rvalue -= 1;
  774. emit(OP_GET_ITER);
  775. co()->_enter_block(FOR_LOOP);
  776. emit(OP_FOR_ITER);
  777. compile_block_body();
  778. emit(OP_LOOP_CONTINUE, -1, true);
  779. co()->_exit_block();
  780. }
  781. void compile_try_except() {
  782. co()->_enter_block(TRY_EXCEPT);
  783. emit(OP_TRY_BLOCK_ENTER);
  784. compile_block_body();
  785. emit(OP_TRY_BLOCK_EXIT);
  786. std::vector<int> patches = { emit(OP_JUMP_ABSOLUTE) };
  787. co()->_exit_block();
  788. do {
  789. consume(TK("except"));
  790. if(match(TK("@id"))){
  791. int name_idx = co()->add_name(parser->prev.str(), NAME_SPECIAL);
  792. emit(OP_EXCEPTION_MATCH, name_idx);
  793. }else{
  794. emit(OP_LOAD_TRUE);
  795. }
  796. int patch = emit(OP_POP_JUMP_IF_FALSE);
  797. emit(OP_POP_TOP); // pop the exception on match
  798. compile_block_body();
  799. patches.push_back(emit(OP_JUMP_ABSOLUTE));
  800. patch_jump(patch);
  801. }while(peek() == TK("except"));
  802. emit(OP_RE_RAISE); // no match, re-raise
  803. for (int patch : patches) patch_jump(patch);
  804. }
  805. void compile_stmt() {
  806. if (match(TK("break"))) {
  807. if (!co()->_is_curr_block_loop()) SyntaxError("'break' outside loop");
  808. consume_end_stmt();
  809. emit(OP_LOOP_BREAK);
  810. } else if (match(TK("continue"))) {
  811. if (!co()->_is_curr_block_loop()) SyntaxError("'continue' not properly in loop");
  812. consume_end_stmt();
  813. emit(OP_LOOP_CONTINUE);
  814. } else if (match(TK("yield"))) {
  815. if (codes.size() == 1) SyntaxError("'yield' outside function");
  816. co()->_rvalue += 1;
  817. EXPR_TUPLE();
  818. co()->_rvalue -= 1;
  819. consume_end_stmt();
  820. co()->is_generator = true;
  821. emit(OP_YIELD_VALUE, -1, true);
  822. } else if (match(TK("return"))) {
  823. if (codes.size() == 1) SyntaxError("'return' outside function");
  824. if(match_end_stmt()){
  825. emit(OP_LOAD_NONE);
  826. }else{
  827. co()->_rvalue += 1;
  828. EXPR_TUPLE(); // return value
  829. co()->_rvalue -= 1;
  830. consume_end_stmt();
  831. }
  832. emit(OP_RETURN_VALUE, -1, true);
  833. } else if (match(TK("if"))) {
  834. compile_if_stmt();
  835. } else if (match(TK("while"))) {
  836. compile_while_loop();
  837. } else if (match(TK("for"))) {
  838. compile_for_loop();
  839. } else if (match(TK("import"))){
  840. compile_normal_import();
  841. } else if (match(TK("from"))){
  842. compile_from_import();
  843. } else if (match(TK("def"))){
  844. compile_function();
  845. } else if (match(TK("@"))){
  846. EXPR();
  847. if(!match_newlines(mode()==REPL_MODE)){
  848. SyntaxError("expected a new line after '@'");
  849. }
  850. emit(OP_SETUP_DECORATOR);
  851. consume(TK("def"));
  852. compile_function();
  853. } else if (match(TK("try"))) {
  854. compile_try_except();
  855. } else if(match(TK("assert"))) {
  856. co()->_rvalue += 1;
  857. EXPR();
  858. if (match(TK(","))) EXPR();
  859. else emit(OP_LOAD_CONST, co()->add_const(py_var(vm, "")));
  860. co()->_rvalue -= 1;
  861. emit(OP_ASSERT);
  862. consume_end_stmt();
  863. } else if(match(TK("with"))){
  864. EXPR();
  865. consume(TK("as"));
  866. consume(TK("@id"));
  867. Token tkname = parser->prev;
  868. int index = co()->add_name(tkname.str(), name_scope());
  869. emit(OP_STORE_NAME, index);
  870. emit(OP_LOAD_NAME_REF, index);
  871. emit(OP_WITH_ENTER);
  872. compile_block_body();
  873. emit(OP_LOAD_NAME_REF, index);
  874. emit(OP_WITH_EXIT);
  875. } else if(match(TK("label"))){
  876. if(mode() != EXEC_MODE) SyntaxError("'label' is only available in EXEC_MODE");
  877. consume(TK(".")); consume(TK("@id"));
  878. Str label = parser->prev.str();
  879. bool ok = co()->add_label(label);
  880. if(!ok) SyntaxError("label '" + label + "' already exists");
  881. consume_end_stmt();
  882. } else if(match(TK("goto"))){ // https://entrian.com/goto/
  883. if(mode() != EXEC_MODE) SyntaxError("'goto' is only available in EXEC_MODE");
  884. consume(TK(".")); consume(TK("@id"));
  885. emit(OP_GOTO, co()->add_name(parser->prev.str(), NAME_SPECIAL));
  886. consume_end_stmt();
  887. } else if(match(TK("raise"))){
  888. consume(TK("@id"));
  889. int dummy_t = co()->add_name(parser->prev.str(), NAME_SPECIAL);
  890. if(match(TK("(")) && !match(TK(")"))){
  891. EXPR(); consume(TK(")"));
  892. }else{
  893. emit(OP_LOAD_NONE);
  894. }
  895. emit(OP_RAISE, dummy_t);
  896. consume_end_stmt();
  897. } else if(match(TK("del"))){
  898. EXPR_TUPLE();
  899. emit(OP_DELETE_REF);
  900. consume_end_stmt();
  901. } else if(match(TK("global"))){
  902. do {
  903. consume(TK("@id"));
  904. co()->global_names[parser->prev.str()] = 1;
  905. } while (match(TK(",")));
  906. consume_end_stmt();
  907. } else if(match(TK("pass"))){
  908. consume_end_stmt();
  909. } else {
  910. EXPR_ANY();
  911. consume_end_stmt();
  912. // If last op is not an assignment, pop the result.
  913. uint8_t last_op = co()->codes.back().op;
  914. if( last_op!=OP_STORE_NAME && last_op!=OP_STORE_REF &&
  915. last_op!=OP_INPLACE_BINARY_OP && last_op!=OP_INPLACE_BITWISE_OP &&
  916. last_op!=OP_STORE_ALL_NAMES && last_op!=OP_STORE_CLASS_ATTR){
  917. if(last_op == OP_BUILD_TUPLE_REF) co()->codes.back().op = OP_BUILD_TUPLE;
  918. if(mode()==REPL_MODE && name_scope() == NAME_GLOBAL) emit(OP_PRINT_EXPR, -1, true);
  919. emit(OP_POP_TOP, -1, true);
  920. }
  921. }
  922. }
  923. void compile_class(){
  924. consume(TK("@id"));
  925. int cls_name_idx = co()->add_name(parser->prev.str(), NAME_GLOBAL);
  926. int super_cls_name_idx = -1;
  927. if(match(TK("(")) && match(TK("@id"))){
  928. super_cls_name_idx = co()->add_name(parser->prev.str(), NAME_GLOBAL);
  929. consume(TK(")"));
  930. }
  931. if(super_cls_name_idx == -1) emit(OP_LOAD_NONE);
  932. else emit(OP_LOAD_NAME, super_cls_name_idx);
  933. emit(OP_BEGIN_CLASS, cls_name_idx);
  934. co()->_is_compiling_class = true;
  935. compile_block_body();
  936. co()->_is_compiling_class = false;
  937. emit(OP_END_CLASS);
  938. }
  939. void _compile_f_args(Function& func, bool enable_type_hints){
  940. int state = 0; // 0 for args, 1 for *args, 2 for k=v, 3 for **kwargs
  941. do {
  942. if(state == 3) SyntaxError("**kwargs should be the last argument");
  943. match_newlines();
  944. if(match(TK("*"))){
  945. if(state < 1) state = 1;
  946. else SyntaxError("*args should be placed before **kwargs");
  947. }
  948. else if(match(TK("**"))){
  949. state = 3;
  950. }
  951. consume(TK("@id"));
  952. const Str& name = parser->prev.str();
  953. if(func.has_name(name)) SyntaxError("duplicate argument name");
  954. // eat type hints
  955. if(enable_type_hints && match(TK(":"))) consume(TK("@id"));
  956. if(state == 0 && peek() == TK("=")) state = 2;
  957. switch (state)
  958. {
  959. case 0: func.args.push_back(name); break;
  960. case 1: func.starred_arg = name; state+=1; break;
  961. case 2: {
  962. consume(TK("="));
  963. PyVarOrNull value = read_literal();
  964. if(value == nullptr){
  965. SyntaxError(Str("expect a literal, not ") + TK_STR(parser->curr.type));
  966. }
  967. func.kwargs.set(name, value);
  968. func.kwargs_order.push_back(name);
  969. } break;
  970. case 3: SyntaxError("**kwargs is not supported yet"); break;
  971. }
  972. } while (match(TK(",")));
  973. }
  974. void compile_function(){
  975. bool has_decorator = !co()->codes.empty() && co()->codes.back().op == OP_SETUP_DECORATOR;
  976. Function func;
  977. StrName obj_name;
  978. consume(TK("@id"));
  979. func.name = parser->prev.str();
  980. if(!co()->_is_compiling_class && match(TK("::"))){
  981. consume(TK("@id"));
  982. obj_name = func.name;
  983. func.name = parser->prev.str();
  984. }
  985. consume(TK("("));
  986. if (!match(TK(")"))) {
  987. _compile_f_args(func, true);
  988. consume(TK(")"));
  989. }
  990. if(match(TK("->"))) consume(TK("@id")); // eat type hints
  991. func.code = make_sp<CodeObject>(parser->src, func.name.str());
  992. this->codes.push(func.code);
  993. compile_block_body();
  994. func.code->optimize(vm);
  995. this->codes.pop();
  996. emit(OP_LOAD_FUNCTION, co()->add_const(py_var(vm, func)));
  997. if(name_scope() == NAME_LOCAL) emit(OP_SETUP_CLOSURE);
  998. if(!co()->_is_compiling_class){
  999. if(obj_name.empty()){
  1000. if(has_decorator) emit(OP_CALL, 1);
  1001. emit(OP_STORE_NAME, co()->add_name(func.name, name_scope()));
  1002. } else {
  1003. if(has_decorator) SyntaxError("decorator is not supported here");
  1004. emit(OP_LOAD_NAME, co()->add_name(obj_name, name_scope()));
  1005. int index = co()->add_name(func.name, NAME_ATTR);
  1006. emit(OP_BUILD_ATTR_REF, index);
  1007. emit(OP_ROT_TWO);
  1008. emit(OP_STORE_REF);
  1009. }
  1010. }else{
  1011. if(has_decorator) emit(OP_CALL, 1);
  1012. emit(OP_STORE_CLASS_ATTR, co()->add_name(func.name, name_scope()));
  1013. }
  1014. }
  1015. PyVarOrNull read_literal(){
  1016. if(match(TK("-"))){
  1017. consume(TK("@num"));
  1018. PyVar val = parser->prev.value;
  1019. return vm->num_negated(val);
  1020. }
  1021. if(match(TK("@num"))) return parser->prev.value;
  1022. if(match(TK("@str"))) return parser->prev.value;
  1023. if(match(TK("True"))) return py_var(vm, true);
  1024. if(match(TK("False"))) return py_var(vm, false);
  1025. if(match(TK("None"))) return vm->None;
  1026. if(match(TK("..."))) return vm->Ellipsis;
  1027. return nullptr;
  1028. }
  1029. /***** Error Reporter *****/
  1030. void throw_err(Str type, Str msg){
  1031. int lineno = parser->curr.line;
  1032. const char* cursor = parser->curr.start;
  1033. // if error occurs in lexing, lineno should be `parser->current_line`
  1034. if(lexing_count > 0){
  1035. lineno = parser->current_line;
  1036. cursor = parser->curr_char;
  1037. }
  1038. if(parser->peekchar() == '\n') lineno--;
  1039. auto e = Exception("SyntaxError", msg);
  1040. e.st_push(parser->src->snapshot(lineno, cursor));
  1041. throw e;
  1042. }
  1043. void SyntaxError(Str msg){ throw_err("SyntaxError", msg); }
  1044. void SyntaxError(){ throw_err("SyntaxError", "invalid syntax"); }
  1045. void IndentationError(Str msg){ throw_err("IndentationError", msg); }
  1046. public:
  1047. CodeObject_ compile(){
  1048. // can only be called once
  1049. if(used) UNREACHABLE();
  1050. used = true;
  1051. CodeObject_ code = make_sp<CodeObject>(parser->src, Str("<module>"));
  1052. codes.push(code);
  1053. lex_token(); lex_token();
  1054. match_newlines();
  1055. if(mode()==EVAL_MODE) {
  1056. EXPR_TUPLE();
  1057. consume(TK("@eof"));
  1058. code->optimize(vm);
  1059. return code;
  1060. }else if(mode()==JSON_MODE){
  1061. PyVarOrNull value = read_literal();
  1062. if(value != nullptr) emit(OP_LOAD_CONST, code->add_const(value));
  1063. else if(match(TK("{"))) exprMap();
  1064. else if(match(TK("["))) exprList();
  1065. else SyntaxError("expect a JSON object or array");
  1066. consume(TK("@eof"));
  1067. return code; // no need to optimize for JSON decoding
  1068. }
  1069. while (!match(TK("@eof"))) {
  1070. if (match(TK("class"))) {
  1071. compile_class();
  1072. } else {
  1073. compile_stmt();
  1074. }
  1075. match_newlines();
  1076. }
  1077. code->optimize(vm);
  1078. return code;
  1079. }
  1080. };
  1081. } // namespace pkpy