compiler.h 46 KB

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