compiler.h 45 KB

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