├── .clang-format ├── .gitignore ├── LICENSE ├── README.md ├── build.sh ├── module ├── list.c ├── os.c ├── str.c ├── strconv.c └── sys.c └── src ├── code.h ├── compiler.c ├── keg.c ├── keg.h ├── lexer.c ├── main.c ├── object.c ├── object.h ├── opcode.h ├── table.c ├── table.h ├── token.h ├── trace.h ├── type.c ├── type.h ├── vm.c └── vm.h /.clang-format: -------------------------------------------------------------------------------- 1 | BasedOnStyle: Chromium -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | *.o 2 | drift 3 | drift.exe 4 | .vscode 5 | .idea 6 | *.swp 7 | *.json 8 | node_modules 9 | gcc 10 | lib* 11 | *.so 12 | p.py -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 2021 bingxio 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | drift Copyright (C) 2021 bingxio 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Drift Script 2 | 3 | A minimalist and mundane scripting language. 4 | 5 | I like all simple things, simple and beautiful, simple and strong. I know that all development in the world comes from simplicity. Every line of code, character, format, indentation, etc. is a beautiful product. 6 | 7 | - Written in pure c99 language version. 8 | - Bytecode execution. 9 | - After optimization, the size is only about 100 kb. 10 | - Provide external interfaces to access languages libraries that support links. 11 | 12 | The official website is https://drift-lang.fun/, the document is being prepared. 13 | 14 | ### Build 15 | 16 | The number of source files for the drift compiler is small, building them is also very simple. 17 | 18 | Please ensure that the [GCC](https://www.gnu.org/software/gcc/) compiler is installed on your system. My GCC version is 11.2.0. 19 | 20 | Execute the **build.sh** file using a UNIX like system. You can add **-bug** parameter to generate debugging information, which will build the **-fsanitize=address** parameter into the drift compiler. Add the **-mod** parameter to compile only dynamic libraries. 21 | 22 | No parameters added: 23 | 24 | 1. Build the C file in the **src** directory as the target file. 25 | 2. Build the target file as an executable. 26 | 3. Build the C file under the **module** folder as the dynamic library file. 27 | 28 | Now get the drift compiler and some dynamic standard libraries. 29 | -------------------------------------------------------------------------------- /build.sh: -------------------------------------------------------------------------------- 1 | # build.sh 2 | # @bingxio - https://drift-lang.fun/ 3 | CC=gcc 4 | BUG="" 5 | 6 | if [ -n "$1" ]; then 7 | if [ $1 == "-mod" ]; then 8 | for f in `ls ./module/*.c`; do 9 | $CC -fPIC -shared $f -o `basename $f .c`.so 10 | done 11 | echo "Done!" 12 | exit; 13 | elif [ $1 == "-bug" ]; then 14 | BUG="-fsanitize=address" 15 | else 16 | echo "unknown arg: $1" 17 | exit; 18 | fi 19 | fi 20 | 21 | OUT="" 22 | 23 | for f in `ls ./src/*.c`; do 24 | $CC -std=c99 -c -g $f 25 | OUT="$OUT `basename $f .c`.o" 26 | done 27 | echo $OUT 28 | 29 | $CC $BUG $OUT -W -ldl -o drift 30 | 31 | rm -f *.o 32 | echo "Done!" 33 | -------------------------------------------------------------------------------- /module/list.c: -------------------------------------------------------------------------------- 1 | #include "../src/vm.h" 2 | 3 | reg_mod *list() { 4 | reg_mod *m = new_mod("list"); 5 | emit_member(m, "to_string", C_METHOD); 6 | return m; 7 | } 8 | 9 | void to_string(keg *arg) { 10 | object *obj = check_front(arg); 11 | 12 | if (obj->kind != OBJ_ARRAY) { 13 | throw_error("object is not an array type"); 14 | } 15 | 16 | keg *elem = obj->value.arr.element; 17 | 18 | char *str = malloc(sizeof(char) * 256); 19 | memset(str, 0, 256); 20 | 21 | for (int i = 0; i < elem->item; i++) { 22 | strcat(str, obj_raw_string(elem->data[i], false)); 23 | strcat(str, " "); 24 | } 25 | push_stack(new_string(str)); 26 | } 27 | 28 | static const char *mods[] = {"list", NULL}; 29 | 30 | void init() { reg_c_mod(mods); } -------------------------------------------------------------------------------- /module/os.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | #include "../src/vm.h" 6 | 7 | reg_mod *os() { 8 | reg_mod *m = new_mod("os"); 9 | emit_member(m, "command", C_METHOD); 10 | emit_member(m, "listdir", C_METHOD); 11 | emit_member(m, "filename", C_METHOD); 12 | emit_member(m, "rm", C_METHOD); 13 | emit_member(m, "filesize", C_METHOD); 14 | return m; 15 | } 16 | 17 | void command(keg *arg) { 18 | const char *cm = check_str(arg, 0); 19 | int status = system(cm); 20 | object *obj = new_num(status); 21 | push_stack(obj); 22 | } 23 | 24 | void listdir(keg *arg) { 25 | const char *ph = check_str(arg, 0); 26 | 27 | struct dirent *dt; 28 | DIR *dir = opendir(ph); 29 | if (dir == NULL) { 30 | throw_error("cannot open this dir"); 31 | } 32 | 33 | object *list = new_array(T_STRING); 34 | keg *elem = list->value.arr.element; 35 | 36 | while (true) { 37 | dt = readdir(dir); 38 | if (dt != NULL) { 39 | if (dt->d_type == 8) { 40 | elem = append_keg(elem, new_string(dt->d_name)); 41 | } 42 | } else { 43 | break; 44 | } 45 | } 46 | push_stack(list); 47 | } 48 | 49 | void filename(keg *arg) { 50 | const char *str = check_str(arg, 0); 51 | char *d = malloc(sizeof(char) * 32); 52 | 53 | memset(d, 0, sizeof(char) * 32); 54 | 55 | for (int i = 0; i < strlen(str); i++) { 56 | if (str[i] != '.') { 57 | d[i] = str[i]; 58 | } 59 | } 60 | push_stack(new_string(d)); 61 | } 62 | 63 | void rm(keg *arg) { 64 | const char *path = check_str(arg, 0); 65 | int status = remove(path); 66 | push_stack(new_num(status)); 67 | } 68 | 69 | void filesize(keg *arg) { 70 | const char *path = check_str(arg, 0); 71 | 72 | struct stat sb; 73 | int ret = stat(path, &sb); 74 | int n = 0; 75 | if (ret == 0) { 76 | n = sb.st_size; 77 | } 78 | push_stack(new_num(n)); 79 | } 80 | 81 | static const char *mods[] = {"os", NULL}; 82 | 83 | void init() { reg_c_mod(mods); } -------------------------------------------------------------------------------- /module/str.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | #include "../src/vm.h" 4 | 5 | reg_mod *str() { 6 | reg_mod *m = new_mod("str"); 7 | emit_member(m, "end_with", C_METHOD); 8 | emit_member(m, "to_str", C_METHOD); 9 | return m; 10 | } 11 | 12 | void end_with(keg *arg) { 13 | const char *b = check_str(arg, 0); 14 | const char *a = check_str(arg, 1); 15 | 16 | int x = strlen(a); 17 | int y = strlen(b); 18 | 19 | bool equal = true; 20 | 21 | if (y > x) { 22 | throw_error("Judge that the length of the string is greater than itself"); 23 | } 24 | for (int i = x - y, j = 0; i < x; i++) { 25 | if (a[i] != b[j++]) { 26 | equal = false; 27 | break; 28 | } 29 | } 30 | push_stack(new_bool(equal)); 31 | } 32 | 33 | static const char *mods[] = {"str", NULL}; 34 | 35 | void init() { reg_c_mod(mods); } -------------------------------------------------------------------------------- /module/strconv.c: -------------------------------------------------------------------------------- 1 | #include "../src/vm.h" 2 | 3 | reg_mod *strconv() { 4 | reg_mod *m = new_mod("strconv"); 5 | emit_member(m, "to_int", C_METHOD); 6 | emit_member(m, "to_float", C_METHOD); 7 | emit_member(m, "to_string", C_METHOD); 8 | return m; 9 | } 10 | 11 | object *get_front(keg *arg) { 12 | check_front(arg); 13 | return arg->data[0]; 14 | } 15 | 16 | void to_int(keg *arg) { 17 | object *obj = get_front(arg); 18 | int num; 19 | 20 | switch (obj->kind) { 21 | case OBJ_STRING: { 22 | char *str = obj->value.str; 23 | num = atoi(str); 24 | break; 25 | } 26 | case OBJ_FLOAT: 27 | num = (int)obj->value.f; 28 | break; 29 | case OBJ_CHAR: 30 | num = obj->value.c; 31 | break; 32 | default: 33 | throw_error("only allowed string and float object"); 34 | } 35 | push_stack(new_num(num)); 36 | } 37 | 38 | void to_float(keg *arg) { 39 | object *obj = get_front(arg); 40 | double d = 0; 41 | 42 | switch (obj->kind) { 43 | case OBJ_INT: 44 | d = (double)obj->value.num; 45 | break; 46 | case OBJ_STRING: { 47 | char *str = obj->value.str; 48 | d = (double)atoi(str); 49 | break; 50 | } 51 | default: 52 | throw_error("only allowed int and string object"); 53 | } 54 | push_stack(new_float(d)); 55 | } 56 | 57 | void to_string(keg *arg) { 58 | object *obj = get_front(arg); 59 | char *str = malloc(sizeof(char) * STRING_CAP_MAX); 60 | 61 | switch (obj->kind) { 62 | case OBJ_INT: 63 | sprintf(str, "%d", obj->value.num); 64 | break; 65 | case OBJ_FLOAT: 66 | sprintf(str, "%f", obj->value.f); 67 | break; 68 | default: 69 | throw_error("only allowed int and float object"); 70 | } 71 | push_stack(new_string(str)); 72 | } 73 | 74 | static const char *user_mods[] = {"strconv", NULL}; 75 | 76 | void init() { reg_c_mod(user_mods); } -------------------------------------------------------------------------------- /module/sys.c: -------------------------------------------------------------------------------- 1 | #include "../src/vm.h" 2 | 3 | extern int code_argc; 4 | extern char **code_argv; 5 | 6 | reg_mod *sys() { 7 | reg_mod *m = new_mod("sys"); 8 | emit_member(m, "argc", C_VAR); 9 | emit_member(m, "argv", C_VAR); 10 | return m; 11 | } 12 | 13 | void argc() { push_stack(new_num(code_argc - 1)); } 14 | 15 | void argv() { 16 | object *list = new_array(T_STRING); 17 | keg *elem = list->value.arr.element; 18 | 19 | for (int i = 1; i < code_argc; i++) { 20 | char *str = code_argv[i]; 21 | elem = append_keg(elem, new_string(str)); 22 | } 23 | push_stack(list); 24 | } 25 | 26 | static const char *mods[] = {"sys", NULL}; 27 | 28 | void init() { reg_c_mod(mods); } -------------------------------------------------------------------------------- /src/code.h: -------------------------------------------------------------------------------- 1 | /* Drift 2 | * 3 | * - https://drift-lang.fun/ 4 | * 5 | * GPL v3 License - bingxio */ 6 | #ifndef FT_CODE_H 7 | #define FT_CODE_H 8 | 9 | #include "keg.h" 10 | 11 | typedef struct { 12 | char* description; 13 | keg* names; 14 | keg* codes; 15 | keg* offsets; 16 | keg* types; 17 | keg* objects; 18 | keg* lines; 19 | } code_object; 20 | 21 | #endif -------------------------------------------------------------------------------- /src/compiler.c: -------------------------------------------------------------------------------- 1 | /* Drift 2 | * 3 | * - https://drift-lang.fun/ 4 | * 5 | * GPL v3 License - bingxio */ 6 | #include 7 | #include 8 | #include 9 | 10 | #include "keg.h" 11 | #include "object.h" 12 | #include "opcode.h" 13 | #include "token.h" 14 | #include "trace.h" 15 | #include "type.h" 16 | 17 | typedef struct { 18 | keg* tokens; 19 | token pre; 20 | token cur; 21 | int16_t iof; 22 | int16_t inf; 23 | int16_t itf; 24 | int p; 25 | bool loop; 26 | keg* codes; 27 | } compile_state; 28 | 29 | code_object* new_code(char* des) { 30 | code_object* code = malloc(sizeof(code_object)); 31 | code->description = des; 32 | code->codes = NULL; 33 | code->lines = NULL; 34 | code->names = NULL; 35 | code->objects = NULL; 36 | code->offsets = NULL; 37 | code->types = NULL; 38 | return code; 39 | } 40 | 41 | compile_state cst; 42 | void block(); 43 | 44 | compile_state backup_state() { 45 | compile_state up; 46 | up.iof = cst.iof; 47 | up.inf = cst.inf; 48 | up.itf = cst.itf; 49 | up.p = cst.p; 50 | return up; 51 | } 52 | 53 | void reset_state(compile_state* state, compile_state up) { 54 | state->iof = up.iof; 55 | state->inf = up.inf; 56 | state->itf = up.itf; 57 | state->p = up.p; 58 | } 59 | 60 | void clear_state() { 61 | cst.iof = 0; 62 | cst.inf = 0; 63 | cst.itf = 0; 64 | } 65 | 66 | #define PUSH_CODE(code) cst.codes = append_keg(cst.codes, code) 67 | #define BACK_CODE (code_object*)back_keg(cst.codes) 68 | 69 | void replace_holder(int16_t place, int16_t off) { 70 | code_object* code = BACK_CODE; 71 | if (code->offsets == NULL) { 72 | return; 73 | } 74 | for (int i = 0; i < code->offsets->item; i++) { 75 | if (*(int16_t*)(code->offsets->data[i]) == place) { 76 | int16_t* f = malloc(sizeof(int16_t)); 77 | *f = off; 78 | replace_keg(code->offsets, i, f); 79 | } 80 | } 81 | } 82 | 83 | int16_t* get_offset_p() { 84 | code_object* code = BACK_CODE; 85 | int16_t* f = malloc(sizeof(int16_t)); 86 | *f = code->offsets->item; 87 | return f; 88 | } 89 | 90 | int get_code_len() { 91 | code_object* code = BACK_CODE; 92 | if (code->codes == NULL) { 93 | return 0; 94 | } 95 | return code->codes->item; 96 | } 97 | 98 | void insert_offset(int p, int16_t off) { 99 | code_object* code = BACK_CODE; 100 | int16_t* f = malloc(sizeof(int16_t)); 101 | *f = off; 102 | if (p == -1) { 103 | code->offsets = append_keg(code->offsets, f); 104 | } else { 105 | insert_keg(code->offsets, p, f); 106 | } 107 | } 108 | 109 | void emit_offset(int16_t off) { 110 | code_object* code = BACK_CODE; 111 | int16_t* f = malloc(sizeof(int16_t)); 112 | *f = off; 113 | code->offsets = append_keg(code->offsets, f); 114 | } 115 | 116 | void emit_name(char* name) { 117 | code_object* code = BACK_CODE; 118 | if (code->names != NULL) { 119 | for (int i = 0; i < code->names->item; i++) { 120 | if (strcmp((char*)code->names->data[i], name) == 0) { 121 | emit_offset(i); 122 | return; 123 | } 124 | } 125 | } 126 | code->names = append_keg(code->names, name); 127 | emit_offset(cst.inf++); 128 | } 129 | 130 | void emit_type(type* t) { 131 | code_object* code = BACK_CODE; 132 | for (int i = 0; code->types != NULL && i < code->types->item; i++) { 133 | type* x = code->types->data[i]; 134 | if (x->kind <= 4 && t->kind <= 4 && x->kind == t->kind) { 135 | free(t); 136 | emit_offset(i); 137 | return; 138 | } 139 | } 140 | code->types = append_keg(code->types, t); 141 | emit_offset(cst.itf++); 142 | } 143 | 144 | void emit_obj(object* obj) { 145 | code_object* code = BACK_CODE; 146 | code->objects = append_keg(code->objects, obj); 147 | emit_offset(cst.iof++); 148 | } 149 | 150 | int l = 0; 151 | int t = -1; 152 | 153 | void emit_code(uint8_t op) { 154 | op_code* c = malloc(sizeof(uint8_t)); 155 | *c = op; 156 | int* n = malloc(sizeof(int)); 157 | if (t != -1) { 158 | *n = t; 159 | t = -1; 160 | } else { 161 | *n = l; 162 | } 163 | code_object* code = BACK_CODE; 164 | code->codes = append_keg(code->codes, c); 165 | code->lines = append_keg(code->lines, n); 166 | } 167 | 168 | int p = 0; 169 | 170 | void iter() { 171 | cst.pre = cst.cur; 172 | if (p == cst.tokens->item) { 173 | return; 174 | } 175 | cst.cur = *(token*)cst.tokens->data[p++]; 176 | cst.p = p - 2; 177 | } 178 | 179 | typedef enum { 180 | P_LOWEST, 181 | P_OR, 182 | P_AND, 183 | P_EQ, 184 | P_COMPARE, 185 | P_TERM, 186 | P_FACTOR, 187 | P_NEW, 188 | P_UNARY, 189 | P_CALL, 190 | } precedence; 191 | 192 | typedef void (*function)(); 193 | 194 | typedef struct { 195 | token_kind kind; 196 | function prefix; 197 | function infix; 198 | int precedence; 199 | } rule; 200 | 201 | rule get_rule(token_kind kind); 202 | void set_precedence(int prec); 203 | 204 | static inline int get_pre_prec() { 205 | return get_rule(cst.pre.kind).precedence; 206 | } 207 | 208 | static inline int get_cur_prec() { 209 | return get_rule(cst.cur.kind).precedence; 210 | } 211 | 212 | static inline void both_iter() { 213 | iter(); 214 | iter(); 215 | } 216 | 217 | enum expect_kind { PRE, CUR }; 218 | 219 | void expect_error(token_kind kind) { 220 | TRACE("\033[1;31mcompiler %d:\033[0m unexpected '%s' but it's '%s'.\n", 221 | cst.pre.line, token_string[kind], cst.pre.literal) 222 | } 223 | 224 | void expect(enum expect_kind exp, token_kind kind) { 225 | if (exp == PRE && cst.pre.kind != kind) { 226 | expect_error(kind); 227 | } 228 | if (exp == CUR && cst.cur.kind != kind) { 229 | expect_error(kind); 230 | } 231 | iter(); 232 | } 233 | 234 | void debug() { 235 | printf("%s %s\n", cst.pre.literal, cst.cur.literal); 236 | } 237 | 238 | void syntax_error() { 239 | TRACE("\033[1;31mcompiler %d:\033[0m syntax error.\n", cst.pre.line) 240 | } 241 | 242 | void no_block_error() { 243 | TRACE("\033[1;31mcompiler %d:\033[0m no block statement.\n", cst.pre.line) 244 | } 245 | 246 | void literal() { 247 | token tok = cst.pre; 248 | object* obj = malloc(sizeof(object)); 249 | 250 | switch (tok.kind) { 251 | case NUMBER: 252 | obj->kind = OBJ_INT; 253 | obj->value.num = atoi(tok.literal); 254 | break; 255 | case FLOAT: 256 | obj->kind = OBJ_FLOAT; 257 | obj->value.f = atof(tok.literal); 258 | break; 259 | case CHAR: 260 | obj->kind = OBJ_CHAR; 261 | obj->value.c = tok.literal[0]; 262 | break; 263 | case STRING: 264 | obj->kind = OBJ_STRING; 265 | obj->value.str = tok.literal; 266 | break; 267 | case NIL: 268 | obj->kind = OBJ_NIL; 269 | break; 270 | } 271 | emit_obj(obj); 272 | emit_code(CONST_OF); 273 | } 274 | 275 | void name() { 276 | token name = cst.pre; 277 | token_kind kind = cst.cur.kind; 278 | 279 | switch (kind) { 280 | case EQ: 281 | both_iter(); 282 | set_precedence(P_LOWEST); 283 | 284 | emit_code(ASSIGN_TO); 285 | emit_name(name.literal); 286 | break; 287 | case R_ARROW: 288 | both_iter(); 289 | 290 | compile_state up_state = backup_state(); 291 | clear_state(); 292 | 293 | code_object* code = new_code(name.literal); 294 | PUSH_CODE(code); 295 | block(); 296 | 297 | reset_state(&cst, up_state); 298 | 299 | code_object* ptr = pop_back_keg(cst.codes); 300 | object* obj = malloc(sizeof(object)); 301 | obj->kind = OBJ_EBLOCK; 302 | obj->value.eb.name = name.literal; 303 | obj->value.eb.code = ptr; 304 | 305 | emit_code(SET_EB); 306 | emit_obj(obj); 307 | break; 308 | default: 309 | emit_code(LOAD_OF); 310 | emit_name(name.literal); 311 | } 312 | } 313 | 314 | void recv_eb() { 315 | iter(); 316 | set_precedence(P_LOWEST); 317 | emit_code(RECV_EB); 318 | } 319 | 320 | void unary() { 321 | token_kind op = cst.pre.kind; 322 | iter(); 323 | set_precedence(P_UNARY); 324 | 325 | if (op == SUB) { 326 | emit_code(TO_NOT); 327 | } 328 | if (op == BANG) { 329 | emit_code(TO_BANG); 330 | } 331 | } 332 | 333 | void binary() { 334 | token_kind op = cst.pre.kind; 335 | 336 | int prec = get_pre_prec(); 337 | iter(); 338 | set_precedence(prec); 339 | 340 | switch (op) { 341 | case ADD: 342 | emit_code(TO_ADD); 343 | break; 344 | case SUB: 345 | emit_code(TO_SUB); 346 | break; 347 | case MUL: 348 | emit_code(TO_MUL); 349 | break; 350 | case DIV: 351 | emit_code(TO_DIV); 352 | break; 353 | case SUR: 354 | emit_code(TO_SUR); 355 | break; 356 | case OR: 357 | emit_code(TO_OR); 358 | break; 359 | case ADDR: 360 | emit_code(TO_AND); 361 | break; 362 | case EQ_EQ: 363 | emit_code(TO_EQ_EQ); 364 | break; 365 | case BANG_EQ: 366 | emit_code(TO_NOT_EQ); 367 | break; 368 | case GREATER: 369 | emit_code(TO_GR); 370 | break; 371 | case GR_EQ: 372 | emit_code(TO_GR_EQ); 373 | break; 374 | case LESS: 375 | emit_code(TO_LE); 376 | break; 377 | case LE_EQ: 378 | emit_code(TO_LE_EQ); 379 | break; 380 | } 381 | } 382 | 383 | void group() { 384 | iter(); 385 | if (cst.cur.kind == R_PAREN || cst.cur.kind == COMMA) { 386 | int item = 0; 387 | while (cst.pre.kind != R_PAREN) { 388 | set_precedence(P_LOWEST); 389 | item++; 390 | iter(); 391 | if (cst.pre.kind == R_PAREN) { 392 | break; 393 | } 394 | expect(PRE, COMMA); 395 | } 396 | emit_code(BUILD_TUP); 397 | emit_offset(item); 398 | return; 399 | } 400 | if (cst.pre.kind == R_PAREN) { 401 | emit_code(BUILD_TUP); 402 | emit_offset(0); 403 | return; 404 | } 405 | set_precedence(P_LOWEST); 406 | expect(CUR, R_PAREN); 407 | } 408 | 409 | void get() { 410 | iter(); 411 | token name = cst.pre; 412 | if (cst.cur.kind == EQ) { 413 | both_iter(); 414 | set_precedence(P_LOWEST); 415 | emit_code(SET_OF); 416 | } else { 417 | emit_code(GET_OF); 418 | } 419 | emit_name(name.literal); 420 | } 421 | 422 | void call() { 423 | iter(); 424 | int item = 0; 425 | while (cst.pre.kind != R_PAREN) { 426 | set_precedence(P_LOWEST); 427 | item++; 428 | iter(); 429 | if (cst.pre.kind == R_PAREN) { 430 | break; 431 | } 432 | expect(PRE, COMMA); 433 | } 434 | emit_code(CALL_FUNC); 435 | emit_offset(item); 436 | } 437 | 438 | void indexes() { 439 | iter(); 440 | set_precedence(P_LOWEST); 441 | expect(CUR, R_BRACKET); 442 | if (cst.cur.kind == EQ) { 443 | both_iter(); 444 | set_precedence(P_LOWEST); 445 | emit_code(TO_REPLACE); 446 | } else { 447 | emit_code(TO_INDEX); 448 | } 449 | } 450 | 451 | void array() { 452 | iter(); 453 | int item = 0; 454 | while (cst.pre.kind != R_BRACKET) { 455 | set_precedence(P_LOWEST); 456 | item++; 457 | iter(); 458 | if (cst.pre.kind == R_BRACKET) { 459 | break; 460 | } 461 | expect(PRE, COMMA); 462 | } 463 | emit_code(BUILD_ARR); 464 | emit_offset(item); 465 | } 466 | 467 | void map() { 468 | iter(); 469 | int item = 0; 470 | while (cst.pre.kind != R_BRACE) { 471 | set_precedence(P_LOWEST); 472 | iter(); 473 | expect(PRE, COLON); 474 | set_precedence(P_LOWEST); 475 | iter(); 476 | item += 2; 477 | if (cst.pre.kind == R_BRACE) { 478 | break; 479 | } 480 | expect(PRE, COMMA); 481 | } 482 | emit_code(BUILD_MAP); 483 | emit_offset(item); 484 | } 485 | 486 | void tnew() { 487 | iter(); 488 | set_precedence(P_LOWEST); 489 | iter(); 490 | expect(PRE, L_BRACE); 491 | int item = 0; 492 | while (cst.pre.kind != R_BRACE) { 493 | if (cst.pre.kind != LITERAL) { 494 | syntax_error(); 495 | } 496 | emit_code(SET_NAME); 497 | emit_name(cst.pre.literal); 498 | iter(); 499 | expect(PRE, COLON); 500 | set_precedence(P_LOWEST); 501 | iter(); 502 | item += 2; 503 | if (cst.pre.kind == R_BRACE) { 504 | break; 505 | } 506 | expect(PRE, COMMA); 507 | } 508 | emit_code(NEW_OBJ); 509 | emit_offset(item); 510 | } 511 | 512 | void gcin() { 513 | iter(); 514 | if (cst.pre.kind != LITERAL) { 515 | syntax_error(); 516 | } 517 | emit_name(cst.pre.literal); 518 | emit_code(GET_IN_OF); 519 | } 520 | 521 | void gmod() { 522 | iter(); 523 | token name = cst.pre; 524 | if (cst.cur.kind == EQ) { 525 | both_iter(); 526 | set_precedence(P_LOWEST); 527 | emit_code(REF_SET); 528 | } else { 529 | emit_code(REF_MODULE); 530 | } 531 | emit_name(name.literal); 532 | } 533 | 534 | #define RULE_COUNT 28 535 | 536 | rule rules[RULE_COUNT] = { 537 | {EOH, NULL, NULL, P_LOWEST}, {LITERAL, name, NULL, P_LOWEST}, 538 | {NUMBER, literal, NULL, P_LOWEST}, {FLOAT, literal, NULL, P_LOWEST}, 539 | {STRING, literal, NULL, P_LOWEST}, {CHAR, literal, NULL, P_LOWEST}, 540 | {NIL, literal, NULL, P_LOWEST}, {BANG, unary, NULL, P_LOWEST}, 541 | {ADD, NULL, binary, P_TERM}, {SUB, unary, binary, P_TERM}, 542 | {MUL, NULL, binary, P_FACTOR}, {DIV, NULL, binary, P_FACTOR}, 543 | {SUR, NULL, binary, P_FACTOR}, {NEW, tnew, NULL, P_NEW}, 544 | {OR, NULL, binary, P_OR}, {ADDR, NULL, binary, P_AND}, 545 | {EQ_EQ, NULL, binary, P_EQ}, {BANG_EQ, NULL, binary, P_EQ}, 546 | {GREATER, NULL, binary, P_COMPARE}, {GR_EQ, NULL, binary, P_COMPARE}, 547 | {LESS, NULL, binary, P_COMPARE}, {LE_EQ, NULL, binary, P_COMPARE}, 548 | {L_PAREN, group, call, P_CALL}, {DOT, gcin, get, P_CALL}, 549 | {REF, NULL, gmod, P_CALL}, {L_BRACKET, array, indexes, P_CALL}, 550 | {L_BRACE, map, NULL, P_CALL}, {L_ARROW, NULL, recv_eb, P_CALL}, 551 | }; 552 | 553 | rule get_rule(token_kind kind) { 554 | for (int i = 1; i < RULE_COUNT; i++) { 555 | if (rules[i].kind == kind) { 556 | return rules[i]; 557 | } 558 | } 559 | return rules[0]; 560 | } 561 | 562 | void set_precedence(int precedence) { 563 | rule prefix = get_rule(cst.pre.kind); 564 | if (prefix.prefix == NULL) { 565 | TRACE( 566 | "\033[1;31mcompiler %d:\033[0m not found prefix function of token " 567 | "'%s'.\n", 568 | cst.pre.line, cst.pre.literal) 569 | return; 570 | } 571 | prefix.prefix(); 572 | while (precedence <= get_cur_prec()) { 573 | rule infix = get_rule(cst.cur.kind); 574 | if (infix.infix != NULL) { 575 | iter(); 576 | infix.infix(); 577 | } else { 578 | break; 579 | } 580 | } 581 | } 582 | 583 | type* set_type() { 584 | token now = cst.pre; 585 | type* T = malloc(sizeof(type)); 586 | switch (now.kind) { 587 | case LITERAL: 588 | if (strcmp(now.literal, "int") == 0) 589 | T->kind = T_INT; 590 | else if (strcmp(now.literal, "float") == 0) 591 | T->kind = T_FLOAT; 592 | else if (strcmp(now.literal, "bool") == 0) 593 | T->kind = T_BOOL; 594 | else if (strcmp(now.literal, "char") == 0) 595 | T->kind = T_CHAR; 596 | else if (strcmp(now.literal, "string") == 0) 597 | T->kind = T_STRING; 598 | else if (strcmp(now.literal, "any") == 0) 599 | T->kind = T_ANY; 600 | else { 601 | T->kind = T_USER; 602 | T->inner.name = now.literal; 603 | } 604 | break; 605 | case L_BRACKET: { 606 | both_iter(); 607 | T->kind = T_ARRAY; 608 | T->inner.single = (struct type*)set_type(); 609 | break; 610 | } 611 | case L_PAREN: { 612 | both_iter(); 613 | T->kind = T_TUPLE; 614 | T->inner.single = (struct type*)set_type(); 615 | break; 616 | } 617 | case L_BRACE: { 618 | both_iter(); 619 | T->kind = T_MAP; 620 | expect(PRE, LESS); 621 | T->inner.both.T1 = (struct type*)set_type(); 622 | iter(); 623 | expect(PRE, COMMA); 624 | T->inner.both.T2 = (struct type*)set_type(); 625 | expect(CUR, GREATER); 626 | break; 627 | } 628 | case OR: 629 | iter(); 630 | keg* arg = new_keg(); 631 | type* ret = NULL; 632 | while (cst.pre.kind != OR) { 633 | arg = append_keg(arg, set_type()); 634 | iter(); 635 | if (cst.pre.kind == OR) { 636 | break; 637 | } 638 | expect(PRE, COMMA); 639 | } 640 | if (cst.cur.kind == R_ARROW) { 641 | both_iter(); 642 | ret = set_type(); 643 | } 644 | T->kind = T_FUNCTION; 645 | T->inner.fn.arg = arg; 646 | T->inner.fn.ret = (struct type*)ret; 647 | break; 648 | default: 649 | TRACE("\033[1;31mcompiler %d:\033[0m unknown '%s' type.\n", cst.pre.line, 650 | cst.pre.literal); 651 | } 652 | return T; 653 | } 654 | 655 | keg* parse_generic() { 656 | keg* gt = new_keg(); 657 | iter(); 658 | if (cst.pre.kind == GREATER) { 659 | syntax_error(); 660 | } 661 | while (true) { 662 | token name = cst.pre; 663 | if (name.kind != LITERAL) { 664 | syntax_error(); 665 | } 666 | iter(); 667 | 668 | type* t = malloc(sizeof(type)); 669 | t->kind = T_GENERIC; 670 | 671 | generic* ge = malloc(sizeof(generic)); 672 | ge->name = name.literal; 673 | 674 | if (cst.pre.kind == GREATER || cst.pre.kind == COMMA) { 675 | ge->count = 0; 676 | } else { 677 | type* T = set_type(); 678 | iter(); 679 | if (cst.pre.kind == OR) { 680 | ge->mtype.multiple = new_keg(); 681 | ge->mtype.multiple = append_keg(ge->mtype.multiple, T); 682 | iter(); 683 | 684 | while (cst.pre.kind != COMMA && cst.pre.kind != GREATER) { 685 | ge->mtype.multiple = append_keg(ge->mtype.multiple, set_type()); 686 | iter(); 687 | } 688 | ge->count = ge->mtype.multiple->item; 689 | } else { 690 | ge->count = 1; 691 | ge->mtype.T = T; 692 | } 693 | } 694 | t->inner.ge = (struct generic*)ge; 695 | gt = append_keg(gt, t); 696 | 697 | if (cst.pre.kind == COMMA) { 698 | iter(); 699 | continue; 700 | } 701 | if (cst.pre.kind == GREATER) { 702 | iter(); 703 | break; 704 | } 705 | } 706 | return gt; 707 | } 708 | 709 | enum generic_type { NONE_TYPE, OTHER }; 710 | 711 | void check_generic_type(keg* gt, enum generic_type t) { 712 | for (int i = 0; i < gt->item; i++) { 713 | generic* g = (generic*)((type*)gt->data[i])->inner.ge; 714 | if (t == NONE_TYPE && g->count != 0) { 715 | syntax_error(); 716 | } 717 | if (t == OTHER && g->count < 1) { 718 | syntax_error(); 719 | } 720 | } 721 | } 722 | 723 | void def_interface(token name, keg* gt, int off, int poff) { 724 | if (off <= poff) { 725 | no_block_error(); 726 | } 727 | check_generic_type(gt, NONE_TYPE); 728 | 729 | object* obj = malloc(sizeof(object)); 730 | obj->kind = OBJ_INTERFACE; 731 | obj->value.in.name = name.literal; 732 | obj->value.in.element = NULL; 733 | obj->value.in.gt = gt; 734 | 735 | while (true) { 736 | method* m = malloc(sizeof(method)); 737 | m->ret = NULL; 738 | iter(); 739 | 740 | if (cst.pre.kind != SLASH) { 741 | keg* arg = new_keg(); 742 | 743 | while (true) { 744 | arg = append_keg(arg, set_type()); 745 | iter(); 746 | if (cst.pre.kind == SLASH) { 747 | break; 748 | } 749 | expect(PRE, COMMA); 750 | } 751 | iter(); 752 | 753 | m->name = cst.pre.literal; 754 | m->arg = arg; 755 | } else { 756 | iter(); 757 | m->name = cst.pre.literal; 758 | m->arg = new_keg(); 759 | } 760 | if (cst.cur.kind == R_ARROW) { 761 | both_iter(); 762 | m->ret = set_type(); 763 | } 764 | 765 | obj->value.in.element = append_keg(obj->value.in.element, m); 766 | 767 | if (cst.cur.off == off) { 768 | iter(); 769 | } else { 770 | break; 771 | } 772 | } 773 | t = name.line; 774 | emit_code(INTERFACE); 775 | emit_obj(obj); 776 | } 777 | 778 | void def_function(keg* gt) { 779 | check_generic_type(gt, OTHER); 780 | 781 | keg* K = new_keg(); 782 | keg* V = new_keg(); 783 | 784 | object* obj = malloc(sizeof(object)); 785 | obj->kind = OBJ_FUNCTION; 786 | obj->value.fn.k = K; 787 | obj->value.fn.v = V; 788 | obj->value.fn.mutiple = NULL; 789 | obj->value.fn.self = NULL; 790 | obj->value.fn.gt = gt; 791 | 792 | if (cst.pre.kind != R_PAREN) { 793 | while (true) { 794 | if (cst.cur.kind == R_PAREN) { 795 | break; 796 | } 797 | 798 | K = append_keg(K, cst.pre.literal); 799 | if (cst.cur.kind != COMMA) { 800 | iter(); 801 | 802 | if (cst.pre.kind == L_ARROW) { 803 | iter(); 804 | obj->value.fn.mutiple = set_type(); 805 | 806 | iter(); 807 | if (cst.pre.kind != R_PAREN) { 808 | fprintf(stderr, 809 | "\033[1;31mcompiler %d:\033[0m multiple " 810 | "parameters can only be at the end.\n", 811 | cst.pre.line); 812 | exit(EXIT_SUCCESS); 813 | } 814 | break; 815 | } 816 | type* T = set_type(); 817 | iter(); 818 | 819 | while (K->item != V->item) { 820 | V = append_keg(V, T); 821 | } 822 | if (cst.pre.kind == R_PAREN) { 823 | break; 824 | } 825 | expect(PRE, COMMA); 826 | } else { 827 | both_iter(); 828 | } 829 | } 830 | } 831 | iter(); 832 | token name = cst.pre; 833 | iter(); 834 | 835 | if (cst.pre.kind == R_ARROW) { 836 | iter(); 837 | obj->value.fn.ret = set_type(); 838 | iter(); 839 | } else { 840 | obj->value.fn.ret = NULL; 841 | } 842 | compile_state up_state = backup_state(); 843 | clear_state(); 844 | 845 | code_object* code = new_code(name.literal); 846 | PUSH_CODE(code); 847 | block(); 848 | 849 | reset_state(&cst, up_state); 850 | 851 | code_object* ptr = pop_back_keg(cst.codes); 852 | obj->value.fn.name = ptr->description; 853 | obj->value.fn.code = ptr; 854 | 855 | t = name.line; 856 | emit_code(FUNCTION); 857 | emit_obj(obj); 858 | } 859 | 860 | void def_class(token name, keg* gt) { 861 | check_generic_type(gt, OTHER); 862 | 863 | compile_state up_state = backup_state(); 864 | clear_state(); 865 | 866 | code_object* code = new_code(name.literal); 867 | PUSH_CODE(code); 868 | block(); 869 | 870 | reset_state(&cst, up_state); 871 | 872 | code_object* ptr = pop_back_keg(cst.codes); 873 | 874 | object* obj = malloc(sizeof(object)); 875 | obj->kind = OBJ_CLASS; 876 | obj->value.cl.name = ptr->description; 877 | obj->value.cl.code = ptr; 878 | obj->value.cl.fr = NULL; 879 | obj->value.cl.init = false; 880 | obj->value.cl.gt = gt; 881 | 882 | t = name.line; 883 | emit_code(CLASS); 884 | emit_obj(obj); 885 | } 886 | 887 | void stmt() { 888 | l = cst.pre.line; 889 | switch (cst.pre.kind) { 890 | case DEF: { 891 | iter(); 892 | if (cst.pre.kind == EOH) { 893 | return; 894 | } 895 | 896 | keg* gt = new_keg(); 897 | if (cst.pre.kind == LESS) { 898 | gt = parse_generic(); 899 | } 900 | token name = cst.pre; 901 | iter(); 902 | 903 | int poff = (*(token*)(cst.tokens->data)[cst.p - 1]).off; 904 | 905 | if (cst.pre.kind == LESS) { 906 | if (gt->data != NULL) { 907 | syntax_error(); 908 | } 909 | gt = parse_generic(); 910 | } 911 | int off = cst.pre.off; 912 | 913 | if (cst.pre.kind == SLASH) { 914 | def_interface(name, gt, off, poff); 915 | } else if (name.kind == L_PAREN) { 916 | def_function(gt); 917 | } else if (cst.pre.kind == DEF) { 918 | def_class(name, gt); 919 | } else { 920 | type* T = set_type(); 921 | iter(); 922 | 923 | if (cst.pre.kind == EQ) { 924 | iter(); 925 | set_precedence(P_LOWEST); 926 | 927 | emit_type(T); 928 | emit_code(STORE_NAME); 929 | emit_name(name.literal); 930 | } else { 931 | if (T->kind != T_USER) { 932 | syntax_error(); 933 | } 934 | if (off <= poff) { 935 | no_block_error(); 936 | } 937 | keg* elem = new_keg(); 938 | elem = append_keg(elem, T->inner.name); 939 | free(T); 940 | 941 | while (true) { 942 | elem = append_keg(elem, cst.pre.literal); 943 | if (cst.cur.off == off) { 944 | iter(); 945 | } else { 946 | break; 947 | } 948 | } 949 | object* obj = malloc(sizeof(object)); 950 | obj->kind = OBJ_ENUMERATE; 951 | obj->value.en.name = name.literal; 952 | obj->value.en.element = elem; 953 | 954 | emit_code(ENUMERATE); 955 | emit_obj(obj); 956 | } 957 | } 958 | break; 959 | } 960 | case IF: { 961 | iter(); 962 | set_precedence(P_LOWEST); 963 | iter(); 964 | 965 | emit_code(F_JUMP_TO); 966 | int16_t if_p = *get_offset_p(); 967 | block(); 968 | 969 | keg* p = new_keg(); 970 | 971 | if (cst.cur.kind == EF || cst.cur.kind == NF) { 972 | p = append_keg(p, get_offset_p()); 973 | emit_code(JUMP_TO); 974 | } 975 | 976 | insert_offset(if_p, get_code_len()); 977 | 978 | while (cst.cur.kind == EF) { 979 | both_iter(); 980 | set_precedence(P_LOWEST); 981 | iter(); 982 | 983 | emit_code(F_JUMP_TO); 984 | int16_t ef_p = *get_offset_p(); 985 | block(); 986 | 987 | if (cst.cur.kind == EF || cst.cur.kind == NF) { 988 | int16_t* f = get_offset_p(); 989 | *f += 1; 990 | p = append_keg(p, f); 991 | emit_code(JUMP_TO); 992 | } 993 | 994 | insert_offset(ef_p, get_code_len()); 995 | } 996 | if (cst.cur.kind == NF) { 997 | both_iter(); 998 | block(); 999 | } 1000 | for (int i = 0; i < p->item; i++) { 1001 | int f = *(int*)p->data[i]; 1002 | insert_offset(f + 1, get_code_len()); 1003 | } 1004 | free_keg(p); 1005 | break; 1006 | } 1007 | case AOP: { 1008 | cst.loop = true; 1009 | iter(); 1010 | 1011 | int begin_p = get_code_len(); 1012 | if (cst.pre.kind != R_ARROW) { 1013 | set_precedence(P_LOWEST); 1014 | iter(); 1015 | 1016 | emit_code(F_JUMP_TO); 1017 | int16_t expr_p = *get_offset_p(); 1018 | 1019 | block(); 1020 | 1021 | emit_code(JUMP_TO); 1022 | insert_offset(-1, begin_p); 1023 | 1024 | insert_offset(expr_p, get_code_len()); 1025 | } else { 1026 | iter(); 1027 | block(); 1028 | 1029 | emit_code(JUMP_TO); 1030 | insert_offset(-1, begin_p); 1031 | } 1032 | 1033 | replace_holder(-1, get_code_len()); 1034 | replace_holder(-2, begin_p); 1035 | break; 1036 | } 1037 | case FOR: { 1038 | cst.loop = true; 1039 | iter(); 1040 | 1041 | if (cst.pre.kind == LITERAL && cst.cur.kind == L_ARROW) { 1042 | token name = cst.pre; 1043 | 1044 | both_iter(); 1045 | stmt(); 1046 | 1047 | int begin_p = get_code_len() + 1; 1048 | 1049 | emit_code(RANGE_OF); 1050 | emit_name(name.literal); 1051 | int16_t begin_of = *get_offset_p(); 1052 | int begin = get_code_len(); 1053 | 1054 | iter(); 1055 | block(); 1056 | 1057 | emit_code(RANGE_GO); 1058 | emit_name(name.literal); 1059 | emit_offset(begin_p); 1060 | 1061 | insert_offset(begin_of, get_code_len()); 1062 | 1063 | replace_holder(-1, get_code_len()); 1064 | replace_holder(-2, begin - 1); 1065 | break; 1066 | } 1067 | 1068 | stmt(); 1069 | iter(); 1070 | expect(PRE, SEMICOLON); 1071 | 1072 | int begin_p = get_code_len(); 1073 | 1074 | set_precedence(P_LOWEST); 1075 | iter(); 1076 | expect(PRE, SEMICOLON); 1077 | emit_code(F_JUMP_TO); 1078 | int16_t expr_p = *get_offset_p(); 1079 | 1080 | emit_code(JUMP_TO); 1081 | int16_t body_p = *get_offset_p(); 1082 | 1083 | int update_p = get_code_len(); 1084 | 1085 | set_precedence(P_LOWEST); 1086 | iter(); 1087 | emit_code(JUMP_TO); 1088 | insert_offset(-1, begin_p); 1089 | 1090 | insert_offset(body_p, get_code_len()); 1091 | block(); 1092 | emit_code(JUMP_TO); 1093 | insert_offset(-1, update_p); 1094 | 1095 | insert_offset(expr_p, get_code_len()); 1096 | 1097 | replace_holder(-1, get_code_len()); 1098 | replace_holder(-2, update_p); 1099 | break; 1100 | } 1101 | case OUT: 1102 | case GO: 1103 | if (!cst.loop) { 1104 | fprintf(stderr, 1105 | "\033[1;31mcompiler %d:\033[0m Loop control \ 1106 | statement cannot be used outside loop.\n", 1107 | cst.pre.line); 1108 | exit(EXIT_SUCCESS); 1109 | } 1110 | token_kind kind = cst.pre.kind; 1111 | iter(); 1112 | if (cst.pre.kind == R_ARROW) { 1113 | emit_code(JUMP_TO); 1114 | } else { 1115 | set_precedence(P_LOWEST); 1116 | emit_code(T_JUMP_TO); 1117 | } 1118 | emit_offset(kind == OUT ? -1 : -2); 1119 | break; 1120 | case RET: 1121 | iter(); 1122 | if (cst.pre.kind == R_ARROW) { 1123 | emit_code(TO_RET); 1124 | } else { 1125 | stmt(); 1126 | emit_code(RET_OF); 1127 | } 1128 | break; 1129 | case USE: { 1130 | token_kind kind = cst.pre.kind; 1131 | iter(); 1132 | bool internal = cst.pre.kind == L_ARROW; 1133 | if (internal) { 1134 | iter(); 1135 | } 1136 | if (cst.pre.kind != LITERAL) { 1137 | syntax_error(); 1138 | } 1139 | emit_code(SET_NAME); 1140 | emit_name(cst.pre.literal); 1141 | int count = 1; 1142 | while (cst.cur.kind == SLASH) { 1143 | both_iter(); 1144 | if (cst.pre.kind != LITERAL) { 1145 | syntax_error(); 1146 | } 1147 | emit_code(SET_NAME); 1148 | emit_name(cst.pre.literal); 1149 | count++; 1150 | } 1151 | emit_code(internal ? USE_IN_MOD : USE_MOD); 1152 | emit_offset(count); 1153 | break; 1154 | } 1155 | default: 1156 | set_precedence(P_LOWEST); 1157 | } 1158 | } 1159 | 1160 | void block() { 1161 | token* tok = cst.tokens->data[cst.p - 1]; 1162 | int off = cst.pre.off; 1163 | if (off <= tok->off) { 1164 | no_block_error(); 1165 | } 1166 | while (true) { 1167 | stmt(); 1168 | if (cst.cur.off == off) { 1169 | iter(); 1170 | } else { 1171 | break; 1172 | } 1173 | } 1174 | } 1175 | 1176 | extern keg* compile(keg* t) { 1177 | p = 0; 1178 | 1179 | cst.tokens = t; 1180 | cst.codes = NULL; 1181 | cst.p = 0; 1182 | clear_state(); 1183 | 1184 | both_iter(); 1185 | 1186 | code_object* code = new_code("main"); 1187 | PUSH_CODE(code); 1188 | 1189 | while (cst.pre.kind != EOH && !trace) { 1190 | stmt(); 1191 | iter(); 1192 | cst.loop = false; 1193 | } 1194 | emit_code(TO_RET); 1195 | return cst.codes; 1196 | } 1197 | 1198 | extern void disassemble_code(code_object* code) { 1199 | printf("%s: %d code, %d name, %d type, %d object, %d offset\n", 1200 | code->description, code->codes == NULL ? 0 : code->codes->item, 1201 | code->names == NULL ? 0 : code->names->item, 1202 | code->types == NULL ? 0 : code->types->item, 1203 | code->objects == NULL ? 0 : code->objects->item, 1204 | code->offsets == NULL ? 0 : code->offsets->item); 1205 | 1206 | for (int b = 0, p = 0, pl = -1; b < code->codes->item; b++) { 1207 | int line = *(int*)code->lines->data[b]; 1208 | if (line != pl) { 1209 | printf("L%-4d", *(int*)code->lines->data[b]); 1210 | pl = line; 1211 | } else { 1212 | printf("%-5s", " "); 1213 | } 1214 | 1215 | op_code* inner = code->codes->data[b]; 1216 | printf("[%2d] %10s", b, code_string[*inner]); 1217 | printf("%-1c", ' '); 1218 | 1219 | switch (*inner) { 1220 | case CONST_OF: 1221 | case ENUMERATE: 1222 | case FUNCTION: 1223 | case INTERFACE: 1224 | case CLASS: 1225 | case SET_EB: { 1226 | int16_t* off = code->offsets->data[p++]; 1227 | object* obj = code->objects->data[*off]; 1228 | printf("%d %s\n", *off, obj_string(obj)); 1229 | break; 1230 | } 1231 | case LOAD_OF: 1232 | case GET_OF: 1233 | case GET_IN_OF: 1234 | case SET_OF: 1235 | case ASSIGN_TO: 1236 | case SET_NAME: 1237 | case REF_MODULE: 1238 | case REF_SET: { 1239 | int16_t* off = code->offsets->data[p++]; 1240 | char* name = code->names->data[*off]; 1241 | if (*inner == SET_NAME) 1242 | printf("%d '%s'\n", *off, name); 1243 | else 1244 | printf("%d #%s\n", *off, name); 1245 | break; 1246 | } 1247 | case CALL_FUNC: 1248 | case NEW_OBJ: 1249 | case JUMP_TO: 1250 | case T_JUMP_TO: 1251 | case F_JUMP_TO: { 1252 | int16_t* off = code->offsets->data[p++]; 1253 | printf("%d\n", *off); 1254 | break; 1255 | } 1256 | case STORE_NAME: { 1257 | int16_t* x = code->offsets->data[p]; 1258 | int16_t* y = code->offsets->data[p + 1]; 1259 | printf("%d %s %d '%s'\n", *x, type_string(code->types->data[*x]), *y, 1260 | code->names->data[*y]); 1261 | p += 2; 1262 | break; 1263 | } 1264 | case RANGE_OF: 1265 | case RANGE_GO: { 1266 | int16_t* x = code->offsets->data[p]; 1267 | int16_t* y = code->offsets->data[p + 1]; 1268 | printf("%d #%s %d\n", *x, code->names->data[*x], *y); 1269 | p += 2; 1270 | break; 1271 | } 1272 | case BUILD_ARR: 1273 | case BUILD_TUP: 1274 | case BUILD_MAP: 1275 | case USE_MOD: 1276 | case USE_IN_MOD: { 1277 | int16_t* item = code->offsets->data[p++]; 1278 | printf("%d\n", *item); 1279 | break; 1280 | } 1281 | default: 1282 | printf("\n"); 1283 | } 1284 | } 1285 | 1286 | if (code->objects != NULL) { 1287 | for (int i = 0; i < code->objects->item; i++) { 1288 | object* obj = code->objects->data[i]; 1289 | switch (obj->kind) { 1290 | case OBJ_FUNCTION: 1291 | disassemble_code(obj->value.fn.code); 1292 | break; 1293 | case OBJ_CLASS: 1294 | disassemble_code(obj->value.cl.code); 1295 | break; 1296 | case OBJ_EBLOCK: 1297 | disassemble_code(obj->value.eb.code); 1298 | break; 1299 | } 1300 | } 1301 | } 1302 | } 1303 | -------------------------------------------------------------------------------- /src/keg.c: -------------------------------------------------------------------------------- 1 | /* Drift 2 | * 3 | * - https://drift-lang.fun/ 4 | * 5 | * GPL v3 License - bingxio */ 6 | #include "keg.h" 7 | 8 | keg* new_keg() { 9 | keg* g = malloc(sizeof(keg)); 10 | g->data = NULL; 11 | g->item = 0; 12 | g->cap = 0; 13 | return g; 14 | } 15 | 16 | keg* append_keg(keg* g, void* ptr) { 17 | if (g == NULL) { 18 | g = new_keg(); 19 | } 20 | if (g->cap == 0 || g->item + 1 > g->cap) { 21 | g->cap = g->cap == 0 ? 4 : g->cap * 2; 22 | g->data = realloc(g->data, sizeof(void*) * g->cap); 23 | } 24 | g->data[g->item++] = ptr; 25 | return g; 26 | } 27 | 28 | void* back_keg(keg* g) { 29 | if (g->item == 0) { 30 | return NULL; 31 | } 32 | return g->data[g->item - 1]; 33 | } 34 | 35 | void* pop_back_keg(keg* g) { 36 | if (g->item == 0) { 37 | return NULL; 38 | } 39 | return g->data[--g->item]; 40 | } 41 | 42 | void insert_keg(keg* g, int p, void* ptr) { 43 | if (p < 0) { 44 | return; 45 | } 46 | if (p != 0 && p > g->item) { 47 | p = g->item - 1; 48 | } 49 | g = append_keg(g, ptr); 50 | for (int i = p, j = 1, m = 2; i < g->item - 1; i++) { 51 | g->data[g->item - j] = g->data[g->item - m]; 52 | j++; 53 | m++; 54 | } 55 | g->data[p] = ptr; 56 | } 57 | 58 | void replace_keg(keg* g, int p, void* ptr) { 59 | if (p < 0) { 60 | return; 61 | } 62 | g->data[p] = ptr; 63 | } 64 | 65 | void remove_keg(keg* g, int i) { 66 | if (i < 0 || i > g->item - 1) { 67 | return; 68 | } 69 | for (int j = i; j <= g->item; j++) { 70 | g->data[j] = g->data[j + 1]; 71 | } 72 | g->item--; 73 | } 74 | 75 | void free_keg(keg* g) { 76 | if (g->data != NULL) { 77 | free(g->data); 78 | } 79 | free(g); 80 | } -------------------------------------------------------------------------------- /src/keg.h: -------------------------------------------------------------------------------- 1 | /* Drift 2 | * 3 | * - https://drift-lang.fun/ 4 | * 5 | * GPL v3 License - bingxio */ 6 | #ifndef FT_LIST_H 7 | #define FT_LIST_H 8 | 9 | #include 10 | 11 | typedef struct { 12 | void** data; 13 | int item; 14 | int cap; 15 | } keg; 16 | 17 | keg* new_keg(); 18 | 19 | keg* append_keg(keg*, void*); 20 | 21 | void* back_keg(keg*); 22 | 23 | void* pop_back_keg(keg*); 24 | 25 | void insert_keg(keg*, int, void*); 26 | 27 | void replace_keg(keg*, int, void*); 28 | 29 | void remove_keg(keg*, int); 30 | 31 | void free_keg(keg*); 32 | 33 | #endif -------------------------------------------------------------------------------- /src/lexer.c: -------------------------------------------------------------------------------- 1 | /* Drift 2 | * 3 | * - https://drift-lang.fun/ 4 | * 5 | * GPL v3 License - bingxio */ 6 | #include 7 | #include 8 | 9 | #include "keg.h" 10 | #include "token.h" 11 | #include "trace.h" 12 | 13 | static inline bool is_space(char c) { 14 | return c == ' ' || c == '\t' || c == '\n' || c == '\r' || c == '\0'; 15 | } 16 | 17 | static inline bool is_digit(char c) { 18 | return c >= '0' && c <= '9'; 19 | } 20 | 21 | static inline bool is_ident(char c) { 22 | return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '_'; 23 | } 24 | 25 | token_kind to_keyword(const char* literal) { 26 | for (int i = 36; i < 48; i++) { 27 | if (strcmp(literal, token_string[i]) == 0) { 28 | return i; 29 | } 30 | } 31 | return LITERAL; 32 | } 33 | 34 | token* new_token(token_kind k, char* literal, int line, int off) { 35 | token* tok = malloc(sizeof(token)); 36 | tok->kind = k; 37 | tok->literal = literal; 38 | tok->line = line; 39 | tok->off = off; 40 | return tok; 41 | } 42 | 43 | bool next(const char* buf, int* p, char c) { 44 | if (*p + 1 > strlen(buf)) { 45 | return false; 46 | } 47 | if (buf[*p + 1] == c) { 48 | *p += 2; 49 | return true; 50 | } 51 | (*p)++; 52 | return false; 53 | } 54 | 55 | void paste_literal(char* literal, const char* buf, int* p, int i) { 56 | for (int x = 0, j = *p; x < j; x++) { 57 | literal[x] = buf[i - *p]; 58 | (*p)--; 59 | if (x + 1 == j) { 60 | literal[x + 1] = '\0'; 61 | } 62 | } 63 | } 64 | 65 | extern keg* lexer(const char* buf, int fsize) { 66 | keg* tokens = NULL; 67 | bool new_line = true; 68 | for (int i = 0, line = 1, off = 0; i < fsize;) { 69 | char c = buf[i]; 70 | while (is_space(c)) { 71 | if (c == '\n') { 72 | line++; 73 | off = -1; 74 | new_line = true; 75 | } 76 | if (i + 1 >= fsize) { 77 | ++i; 78 | break; 79 | } 80 | c = buf[++i]; 81 | if (new_line) { 82 | off++; 83 | } 84 | } 85 | if (i >= fsize) { 86 | break; 87 | } 88 | if (new_line) { 89 | new_line = false; 90 | } 91 | if (is_digit(c)) { 92 | int p = 0; 93 | bool f = false; 94 | while (is_digit(c) || c == '.') { 95 | if (c == '.') { 96 | f = true; 97 | } 98 | p++; 99 | c = buf[++i]; 100 | } 101 | char* literal = malloc((p + 1) * sizeof(char)); 102 | paste_literal(literal, buf, &p, i); 103 | 104 | token* tok = new_token(f ? FLOAT : NUMBER, literal, line, off); 105 | tokens = append_keg(tokens, tok); 106 | continue; 107 | } 108 | if (is_ident(c)) { 109 | int p = 0; 110 | while (is_ident(c)) { 111 | p++; 112 | c = buf[++i]; 113 | } 114 | char* literal = malloc((p + 1) * sizeof(char)); 115 | paste_literal(literal, buf, &p, i); 116 | 117 | token* tok = new_token(to_keyword(literal), literal, line, off); 118 | tokens = append_keg(tokens, tok); 119 | continue; 120 | } 121 | token t = {.line = line, .off = off}; 122 | switch (c) { 123 | case '+': 124 | i++; 125 | t.kind = ADD; 126 | t.literal = "+"; 127 | break; 128 | case '-': 129 | if (next(buf, &i, '>')) { 130 | t.kind = R_ARROW; 131 | t.literal = "->"; 132 | } else { 133 | t.kind = SUB; 134 | t.literal = "-"; 135 | } 136 | break; 137 | case '*': 138 | i++; 139 | t.kind = MUL; 140 | t.literal = "*"; 141 | break; 142 | case '/': 143 | i++; 144 | t.kind = DIV; 145 | t.literal = "/"; 146 | break; 147 | case '%': 148 | i++; 149 | t.kind = SUR; 150 | t.literal = "%"; 151 | break; 152 | case '<': 153 | if (next(buf, &i, '=')) { 154 | t.kind = LE_EQ; 155 | t.literal = "<="; 156 | } else { 157 | if (buf[i] == '-') { 158 | t.kind = L_ARROW; 159 | t.literal = "<-"; 160 | i++; 161 | } else { 162 | t.kind = LESS; 163 | t.literal = "<"; 164 | } 165 | } 166 | break; 167 | case '>': 168 | if (next(buf, &i, '=')) { 169 | t.kind = GR_EQ; 170 | t.literal = ">="; 171 | } else { 172 | t.kind = GREATER; 173 | t.literal = ">"; 174 | } 175 | break; 176 | case ' ': 177 | case '\t': 178 | case '\r': 179 | case '\n': 180 | case '\0': 181 | continue; 182 | case '#': 183 | while (buf[++i] != '\n') 184 | ; 185 | continue; 186 | case '\'': { 187 | i++; 188 | char* literal = malloc(sizeof(char)); 189 | literal[0] = buf[i++]; 190 | c = buf[i]; 191 | if (c != '\'') { 192 | TRACE( 193 | "\033[1;31mlexer %d:\033[0m missing single quotation " 194 | "mark to the right.\n", 195 | line) 196 | goto out; 197 | } else { 198 | i += 1; 199 | } 200 | t.kind = CHAR; 201 | t.literal = literal; 202 | } break; 203 | case '"': { 204 | c = buf[++i]; 205 | int p = 0; 206 | while (c != '"') { 207 | c = buf[++i]; 208 | p++; 209 | if (i == fsize) { 210 | TRACE( 211 | "\033[1;31mlexer %d:\033[0m missing closing double " 212 | "quote.\n", 213 | line) 214 | goto out; 215 | } 216 | } 217 | char* literal; 218 | if (p == 0) { 219 | literal = ""; 220 | } else { 221 | literal = malloc((p + 1) * sizeof(char)); 222 | paste_literal(literal, buf, &p, i); 223 | } 224 | for (int i = 0; i < strlen(literal); i++) { 225 | if (literal[i] == '\n') { 226 | line++; 227 | } 228 | } 229 | i++; 230 | t.kind = STRING; 231 | t.literal = literal; 232 | } break; 233 | case '.': 234 | i++; 235 | t.kind = DOT; 236 | t.literal = "."; 237 | break; 238 | case ',': 239 | i++; 240 | t.kind = COMMA; 241 | t.literal = ","; 242 | break; 243 | case ':': 244 | if (next(buf, &i, ':')) { 245 | t.kind = REF; 246 | t.literal = "::"; 247 | } else { 248 | t.kind = COLON; 249 | t.literal = ":"; 250 | } 251 | break; 252 | case '=': 253 | if (next(buf, &i, '=')) { 254 | t.kind = EQ_EQ; 255 | t.literal = "=="; 256 | } else { 257 | t.kind = EQ; 258 | t.literal = "="; 259 | } 260 | break; 261 | case ';': 262 | i++; 263 | t.kind = SEMICOLON; 264 | t.literal = ";"; 265 | break; 266 | case '&': 267 | i++; 268 | t.kind = ADDR; 269 | t.literal = "&"; 270 | break; 271 | case '|': 272 | i++; 273 | t.kind = OR; 274 | t.literal = "|"; 275 | break; 276 | case '!': 277 | if (next(buf, &i, '=')) { 278 | t.kind = BANG_EQ; 279 | t.literal = "!="; 280 | } else { 281 | t.kind = BANG; 282 | t.literal = "!"; 283 | } 284 | break; 285 | case '{': 286 | i++; 287 | t.kind = L_BRACE; 288 | t.literal = "{"; 289 | break; 290 | case '}': 291 | i++; 292 | t.kind = R_BRACE; 293 | t.literal = "}"; 294 | break; 295 | case '[': 296 | i++; 297 | t.kind = L_BRACKET; 298 | t.literal = "["; 299 | break; 300 | case ']': 301 | i++; 302 | t.kind = R_BRACKET; 303 | t.literal = "]"; 304 | break; 305 | case '(': 306 | i++; 307 | t.kind = L_PAREN; 308 | t.literal = "("; 309 | break; 310 | case ')': 311 | i++; 312 | t.kind = R_PAREN; 313 | t.literal = ")"; 314 | break; 315 | case '\\': 316 | i++; 317 | t.kind = SLASH; 318 | t.literal = "\\"; 319 | break; 320 | default: 321 | TRACE("\033[1;31mlexer %d:\033[0m unknown character '%c' ASCII %d.\n", 322 | line, c, c) 323 | goto out; 324 | } 325 | tokens = append_keg(tokens, new_token(t.kind, t.literal, t.line, t.off)); 326 | } 327 | if (tokens != NULL) { 328 | token* end = back_keg(tokens); 329 | token* eoh = new_token(EOH, "EOF", end->line + 1, 0); 330 | tokens = append_keg(tokens, eoh); 331 | } else { 332 | tokens = append_keg(tokens, new_token(EOH, "EOF", 0, 0)); 333 | } 334 | out: 335 | return tokens; 336 | } 337 | 338 | extern void disassemble_token(keg* tokens) { 339 | for (int i = 0; i < tokens->item; i++) { 340 | token* t = tokens->data[i]; 341 | printf("[%3d]\t%-5d %-5d %-5d %-30s\n", i, t->kind, t->line, t->off, 342 | t->literal); 343 | } 344 | } -------------------------------------------------------------------------------- /src/main.c: -------------------------------------------------------------------------------- 1 | /* Drift 2 | * 3 | * - https://drift-lang.fun/ 4 | * 5 | * GPL v3 License - bingxio */ 6 | #include "token.h" 7 | #include "vm.h" 8 | 9 | #define COMPILER_VERSION "Drift 0.0.1 (MADE AT Sep 2021 17, 09:38:45)" 10 | #define DRIFT_LICENSE "GNU General Public License GPL v3.0" 11 | 12 | bool show_tokens; 13 | bool show_bytes; 14 | bool show_tb; 15 | bool repl_mode; 16 | 17 | extern keg* lexer(const char*, int); 18 | extern keg* compile(keg*); 19 | 20 | extern void disassemble_code(code_object*); 21 | extern void disassemble_token(keg*); 22 | 23 | bool trace; 24 | 25 | void run(char* source, int fsize, char* filename) { 26 | keg* tokens = lexer(source, fsize); 27 | free(source); 28 | 29 | if (show_tokens) { 30 | disassemble_token(tokens); 31 | return; 32 | } 33 | 34 | keg* codes = compile(tokens); 35 | if (show_bytes) { 36 | disassemble_code(codes->data[0]); 37 | return; 38 | } 39 | 40 | vm_state state = evaluate(codes->data[0], filename); 41 | if (show_tb) { 42 | frame* main = state.frame->data[0]; 43 | disassemble_table(main->tb, main->code->description); 44 | } 45 | 46 | free_keg(codes); 47 | free(state.filename); 48 | 49 | free_tokens(tokens); 50 | } 51 | 52 | static vm_state state; 53 | 54 | void run_repl(char* line, int size) { 55 | keg* tokens = lexer(line, size); 56 | if (trace) { 57 | return; 58 | } 59 | 60 | keg* codes = compile(tokens); 61 | if (trace) { 62 | return; 63 | } 64 | 65 | state = evaluate(codes->data[0], "REPL"); 66 | 67 | free(line); 68 | free_tokens(tokens); 69 | free_keg(codes); 70 | } 71 | 72 | void usage() { 73 | printf( 74 | "usage: drift [FILE(.ft)]