├── .gitignore ├── scripts └── build.bat ├── Makefile ├── branding └── lantern_logo.png ├── test.lntrn ├── README.md ├── LICENSE └── lantern.c /.gitignore: -------------------------------------------------------------------------------- 1 | .vscode 2 | *.exe 3 | bin/lantern 4 | -------------------------------------------------------------------------------- /scripts/build.bat: -------------------------------------------------------------------------------- 1 | gcc ..\lantern.c -o ..\bin\lantern.exe -Wall -Wextra -Werror -O3 -ffast-math -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | build: 2 | gcc lantern.c -o bin/lantern --pedantic -Wall -Wextra -Werror -O3 -ffast-math 3 | -------------------------------------------------------------------------------- /branding/lantern_logo.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/cococry/Lantern/HEAD/branding/lantern_logo.png -------------------------------------------------------------------------------- /test.lntrn: -------------------------------------------------------------------------------- 1 | macro int_size def 8 end 2 | macro val_count def 10 end 3 | 4 | $int_size $val_count * int alloc = ptr 5 | 6 | 3 0 ptr pset 7 | 9 1 ptr pset 8 | 2 2 ptr pset 9 | 8 3 ptr pset 10 | 6 4 ptr pset 11 | 45 5 ptr pset 12 | 5 6 ptr pset 13 | 32 7 ptr pset 14 | 16 8 ptr pset 15 | 11 9 ptr pset 16 | 17 | "VALUES BEFORE" println 18 | 19 | 0 = counter 20 | while counter 10 < run 21 | "Value: " print 22 | counter ptr pget println 23 | counter 1 + = counter 24 | end 25 | 0 = i 26 | while i $val_count < run 27 | 0 = j 28 | 0 = tmp 29 | i 1 + = j 30 | while j $val_count < run 31 | i ptr pget j ptr pget > if 32 | i ptr pget = tmp 33 | j ptr pget i ptr pset 34 | tmp j ptr pset 35 | end 36 | j 1 + = j 37 | end 38 | i 1 + = i 39 | end 40 | 41 | 42 | "VALUES AFTER" println 43 | 44 | 0 = index 45 | while index 10 < run 46 | "Value: " print 47 | index ptr pget println 48 | index 1 + = index 49 | end 50 | 51 | 52 | ptr free 53 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Lantern 2 | ![License: GPL v3](https://img.shields.io/badge/License-GPLv3-blue.svg) 3 | 4 | Lantern Logo

9 | 10 | **Lantern** is a [stack based](https://en.wikipedia.org/wiki/Stack-oriented_programming), [interpreted](https://en.wikipedia.org/wiki/Interpreter_(computing)) programming language written in **C**. 11 | The goal of the project is creating a fast, bloatless and powerful programming tool 12 | that can be used for multiple purposes. 13 | 14 | The language has **access to the underlying memory structure** and in general 15 | is desinged to be easily used as a [low level programming language](https://en.wikipedia.org/wiki/Low-level_programming_language) too. 16 | 17 | Lantern is, due to the stackbased paradigm of the language it is written in 18 | [reverse polish notation](https://en.wikipedia.org/wiki/Reverse_Polish_notation). 19 | wich sets it apart from a lot languages that work with AST or other structures. 20 | 21 | ## Feature list 22 | 23 | - [x] Conditions & loops 24 | - [x] Heap Memory System 25 | - [x] Stackframe System 26 | - [x] Variables & Type checking 27 | - [x] Stack Mechanics 28 | - [x] Raw Memory Access 29 | - [ ] Functions 30 | - [x] Else-If Functionality 31 | - [x] Macros 32 | - [ ] Access to Syscalls 33 | - [ ] Defining Structs (C-Style) 34 | - [ ] Adding Fundamental Variable Types (float, double, char...) 35 | - [x] String Concatenation & Equality Operators 36 | 37 | ## Building 38 | 39 | ### Linux 40 | 41 | #### Requirements 42 | - GCC Compiler 43 | - Make command 44 | 45 | ```console 46 | mkdir bin 47 | make 48 | ``` 49 | 50 | ### Windows 51 | 52 | #### Requirements 53 | - GCC Compiler 54 | 55 | ```console 56 | mkdir bin 57 | build.bat 58 | ``` 59 | 60 | ## Example Usage 61 | 62 | ### A implentation of the [FizzBuzz problem](https://de.wikipedia.org/wiki/Fizz_buzz) 63 | ```bash 64 | 0 = counter 65 | 66 | while counter 10000 < run 67 | counter 3 % 0 == counter 5 % 0 == and if 68 | "fizzbuzz" println 69 | elif counter 3 % 0 == then 70 | "fizz" println 71 | elif counter 5 % 0 == then 72 | "buzz" println 73 | end 74 | counter println 75 | counter 1 + = counter 76 | end 77 | ``` 78 | 79 | ## Inspiration 80 | - [Forth](https://de.wikipedia.org/wiki/Forth_(Programmiersprache)), a stack based, imperative programming language 81 | - [Python](https://de.wikipedia.org/wiki/Python_(Programmiersprache)), a easy to used, interpreted programming language 82 | - [C](https://de.wikipedia.org/wiki/C_(Programmiersprache)), a statically typed, low level programming language 83 | 84 | 85 | ## Contributing 86 | 87 | You can contribue to Lantern by: 88 | - [Fixing bugs or contributing to features](https://github.com/cococry/Lantern/issues) 89 | - [Changing features or adding new functionality](https://github.com/cococry/Lantern/pulls) 90 | -------------------------------------------------------------------------------- /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) 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 | Copyright (C) 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 | -------------------------------------------------------------------------------- /lantern.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | 9 | #define STACK_CAP 64 10 | #define STACKFRAME_CAP 256 11 | #define PROGRAM_CAP 1024 12 | #define MAX_WORD_SIZE 256 13 | 14 | #define PANIC_ON_ERR(cond, err_type, ...) { \ 15 | if(cond) { \ 16 | printf("Lantern: Error: %s | Error Code: %i\n", #err_type, (int32_t)err_type); \ 17 | printf(__VA_ARGS__); \ 18 | printf("\n"); \ 19 | } \ 20 | } \ 21 | 22 | typedef enum { 23 | INST_STACK_PUSH, INST_STACK_PREV, 24 | INST_PLUS, INST_MINUS, INST_MUL, INST_DIV, INST_MOD, 25 | INST_EQ,INST_NEQ, 26 | INST_GT,INST_LT,INST_GEQ,INST_LEQ, 27 | INST_LOGICAL_AND, INST_LOGICAL_OR, 28 | INST_IF,INST_ELSE, INST_ELIF, INST_THEN, INST_ENDIF, 29 | INST_WHILE, INST_RUN_WHILE, INST_END_WHILE, 30 | INST_PRINT, INST_PRINTLN, 31 | INST_JUMP, 32 | INST_ADD_VAR_TO_STACKFRAME, INST_ASSIGN, INST_VAR_USAGE, INST_VAR_REASSIGN, 33 | INST_HEAP_ALLOC, INST_HEAP_FREE, INST_PTR_GET_I, INST_PTR_SET_I, 34 | INST_INT_TYPE, INST_STR_TYPE, 35 | INST_MACRO, INST_MACRO_DEF, INST_END_MACRO, INST_MACRO_USAGE 36 | } Instruction; 37 | 38 | typedef enum { 39 | VAR_TYPE_INT, 40 | VAR_TYPE_STR 41 | } VariableType; 42 | 43 | typedef enum { 44 | ERR_STACK_OVERFLOW, 45 | ERR_STACK_UNDERFLOW, 46 | ERR_INVALID_JUMP, 47 | ERR_INVALID_STACK_ACCESS, 48 | ERR_INVALID_DATA_TYPE, 49 | ERR_ILLEGAL_INSTRUCTION, 50 | ERR_SYNTAX_ERROR, 51 | ERR_INVALID_PTR, 52 | } Error; 53 | 54 | typedef struct { 55 | size_t data; 56 | VariableType var_type; 57 | bool heap_ptr; 58 | } RuntimeValue; 59 | 60 | typedef struct { 61 | void* data; 62 | VariableType var_type; 63 | } HeapValue; 64 | 65 | typedef struct { 66 | Instruction inst; 67 | RuntimeValue val; 68 | } Token; 69 | 70 | typedef struct { 71 | RuntimeValue val; 72 | uint32_t frame_index; 73 | } StackFrameValue; 74 | 75 | typedef struct { 76 | RuntimeValue stack[STACK_CAP]; 77 | int32_t stack_size; 78 | 79 | HeapValue* heap; 80 | uint32_t heap_size; 81 | 82 | StackFrameValue stackframe[STACKFRAME_CAP]; 83 | uint32_t stackframe_size; 84 | uint32_t stackframe_index; 85 | 86 | uint32_t inst_ptr; 87 | uint32_t program_size; 88 | 89 | uint32_t call_positions[STACK_CAP]; 90 | uint32_t call_positions_count; 91 | 92 | uint32_t macro_positions[PROGRAM_CAP]; 93 | uint32_t macro_count; 94 | bool found_solution_for_if_block; 95 | } ProgramState; 96 | 97 | bool 98 | is_str_int(const char* str) { 99 | for(uint32_t i = 0; i < strlen(str); i++) { 100 | if(!isdigit(str[i])) return false; 101 | } 102 | return true; 103 | } 104 | 105 | bool 106 | is_str_literal(char* str) { 107 | return (str[0] == '"' && str[strlen(str) - 1] == '"' && strlen(str) > 1); 108 | } 109 | 110 | bool 111 | is_str_macro_usage(char* str) { 112 | return str[0] == '$'; 113 | } 114 | 115 | bool 116 | is_str_var_name(const char* str) { 117 | if(is_str_int(str)) { 118 | return false; 119 | } 120 | if(isdigit(str[0])) { 121 | return false; 122 | } 123 | for(uint32_t i = 0; i < strlen(str); i++) { 124 | if(str[i] == '!' || str[i] == '@' || str[i] == '#' || str[i] == '$' 125 | || str[i] == '%' || str[i] == '^' || str[i] == '&' || str[i] == '*' 126 | || str[i] == '(' || str[i] == ')' || str[i] == '-' || str[i] == '{' 127 | || str[i] == '}' || str[i] == '[' || str[i] == ']' || str[i] == ':' 128 | || str[i] == ';' || str[i] == '"' || str[i] == '\'' || str[i] == '<' 129 | || str[i] == '>' || str[i] == '.' || str[i] == '/' || str[i] == '?' 130 | || str[i] == '~' || str[i] == '`') { 131 | return false; 132 | } 133 | } 134 | return true; 135 | } 136 | 137 | bool 138 | int_array_contains(int32_t* arr, uint32_t arr_size, int32_t val) { 139 | for(uint32_t i = 0; i < arr_size; i++) { 140 | if(arr[i] == val) return true; 141 | } 142 | return false; 143 | } 144 | 145 | void 146 | strip_char_from_str(char c, char* str) { 147 | uint32_t len = strlen(str); 148 | for(uint32_t i = 0; i < len; i++) { 149 | if(str[i] == c) { 150 | for(uint32_t j = i; j < len; j++) { 151 | str[j] = str[j+1]; 152 | } 153 | len--; 154 | i--; 155 | } 156 | } 157 | } 158 | 159 | uint32_t 160 | get_word_count_in_file(FILE* file) { 161 | uint32_t words_in_file = 0; 162 | char ch; 163 | bool on_word = false; 164 | while ((ch = fgetc(file)) != EOF) { 165 | if(ch == ' ' || ch == '\t' || ch == '\0' || ch == '\n') { 166 | if (on_word) { 167 | on_word = false; 168 | words_in_file++; 169 | } 170 | } else { 171 | on_word = true; 172 | } 173 | } 174 | return words_in_file; 175 | } 176 | 177 | void 178 | clear_current_stackframe(ProgramState* state) { 179 | for(int32_t i = state->stackframe_size; i >= 0; i--) { 180 | if(state->stackframe[i].frame_index != state->stackframe_index) break; 181 | state->stackframe[i].val.data = SIZE_MAX; 182 | state->stackframe[i].val.heap_ptr = false; 183 | state->stackframe_size--; 184 | } 185 | state->stackframe_index--; 186 | } 187 | 188 | void 189 | heap_free(ProgramState* state, uint32_t pos) { 190 | free(state->heap[pos].data); 191 | state->heap_size--; 192 | } 193 | 194 | uint32_t 195 | heap_alloc(ProgramState* state, size_t size, VariableType type) { 196 | state->heap[state->heap_size].data = malloc(size); 197 | state->heap[state->heap_size++].var_type = type; 198 | return state->heap_size - 1; 199 | } 200 | 201 | RuntimeValue 202 | stack_top(ProgramState* state) { 203 | return state->stack[state->stack_size - 1]; 204 | } 205 | 206 | RuntimeValue 207 | stack_pop(ProgramState* state) { 208 | state->stack_size--; 209 | return state->stack[state->stack_size]; 210 | } 211 | 212 | RuntimeValue 213 | stack_peak(ProgramState* state, uint32_t index) { 214 | return state->stack[state->stack_size - index]; 215 | } 216 | 217 | void 218 | stack_push(ProgramState* state, RuntimeValue val) { 219 | state->stack_size++; 220 | state->stack[state->stack_size - 1] = val; 221 | } 222 | 223 | Token* 224 | load_program_from_file(const char* filepath, uint32_t* program_size, ProgramState* state) { 225 | FILE* file; 226 | file = fopen(filepath, "r"); 227 | if(!file) { 228 | printf("Lantern: [Error]: Cannot read file '%s'.\n", filepath); 229 | return NULL; 230 | } 231 | uint32_t words_in_file = get_word_count_in_file(file); 232 | rewind(file); 233 | 234 | char literals[words_in_file][MAX_WORD_SIZE]; 235 | uint32_t literal_count = 0; 236 | { 237 | char line[MAX_WORD_SIZE]; 238 | bool removed_word_from_literal = false; 239 | while (fgets(line, sizeof(line), file)) { 240 | char literal[MAX_WORD_SIZE] = ""; 241 | bool on_literal = false; 242 | uint32_t literal_char_count = 0; 243 | for(uint32_t i = 0; i < strlen(line); i++) { 244 | if(line[i] == '"' && !on_literal) { 245 | on_literal = true; 246 | literal[literal_char_count++] = line[i]; 247 | continue; 248 | } 249 | if(on_literal) { 250 | literal[literal_char_count++] = line[i]; 251 | if(line[i] == ' ' && !removed_word_from_literal) { 252 | removed_word_from_literal = true; 253 | words_in_file--; 254 | } else if(line[i] != ' ') 255 | removed_word_from_literal = false; 256 | } 257 | if(line[i] == '"' && on_literal) { 258 | on_literal = false; 259 | literal[literal_char_count] = '\0'; 260 | literal_char_count = 0; 261 | char literal_cpy[MAX_WORD_SIZE]; 262 | strcpy(literal_cpy, literal); 263 | strcpy(literals[literal_count++], literal_cpy); 264 | } 265 | } 266 | } 267 | } 268 | *program_size = words_in_file; 269 | rewind(file); 270 | 271 | Token* program = malloc(sizeof(Token) * words_in_file); 272 | 273 | char word[MAX_WORD_SIZE]; 274 | uint32_t i = 0; 275 | bool on_literal = false; 276 | uint32_t literal_token_count = 0; 277 | 278 | char variable_names[MAX_WORD_SIZE][STACKFRAME_CAP]; 279 | uint32_t variable_stackframe_indices[STACKFRAME_CAP]; 280 | uint32_t variable_count = 0; 281 | uint32_t virtual_stackframe_index = 0; 282 | 283 | uint32_t crossreferenced_tokens[*program_size]; 284 | uint32_t crossreferenced_token_count = 0; 285 | 286 | bool on_comment = false; 287 | 288 | char macro_names[MAX_WORD_SIZE][PROGRAM_CAP]; 289 | uint32_t macro_names_count = 0; 290 | while(fscanf(file, "%s", word) != EOF) { 291 | //printf("%s\n", word); 292 | if(strcmp("#", word) == 0 && !on_comment) { 293 | on_comment = true; 294 | } else if(strcmp("#>", word) == 0 && on_comment) { 295 | on_comment = false; 296 | continue; 297 | } 298 | if(on_comment) continue; 299 | 300 | if((!on_literal && word[0] == '"') || (!on_literal && is_str_literal(word))) { 301 | on_literal = !is_str_literal(word); 302 | 303 | char* literal_cpy = malloc(MAX_WORD_SIZE); 304 | strcpy(literal_cpy, literals[literal_token_count]); 305 | strip_char_from_str('"', literal_cpy); 306 | 307 | state->heap[state->heap_size].data = literal_cpy; 308 | state->heap[state->heap_size].var_type = VAR_TYPE_STR; 309 | program[i] = (Token){ .inst = INST_STACK_PUSH }; 310 | program[i].val.data = state->heap_size; 311 | program[i].val.var_type = VAR_TYPE_STR; 312 | program[i].val.heap_ptr = true; 313 | 314 | state->heap_size++; 315 | literal_token_count++; 316 | i++; 317 | continue; 318 | } 319 | if(on_literal && word[strlen(word) - 1] == '"') { 320 | on_literal = false; 321 | continue; 322 | } 323 | if(on_literal) { 324 | continue; 325 | } 326 | if(is_str_int(word)) { 327 | program[i] = (Token){ .inst = INST_STACK_PUSH }; 328 | program[i].val.data = atoi(word); 329 | program[i].val.var_type = VAR_TYPE_INT; 330 | program[i].val.heap_ptr = false; 331 | i++; 332 | continue; 333 | } 334 | if(is_str_macro_usage(word)) { 335 | memmove(word, word+1, strlen(word)); 336 | for(uint32_t j = 0; j < macro_names_count; j++) { 337 | if(strcmp(macro_names[j], word) == 0) { 338 | program[i] = (Token){ .inst = INST_MACRO_USAGE, .val.data = state->macro_positions[j] }; 339 | break; 340 | } 341 | } 342 | i++; 343 | continue; 344 | } 345 | 346 | if(i > 0) { 347 | if(program[i - 1].inst == INST_MACRO) { 348 | strcpy(macro_names[macro_names_count++], word); 349 | i++; 350 | continue; 351 | } 352 | } 353 | if(strcmp(word, "prev") == 0) { 354 | program[i] = (Token){ .inst = INST_STACK_PREV }; 355 | } else if(strcmp(word, "=") == 0) { 356 | program[i] = (Token){ .inst = INST_ASSIGN }; 357 | } else if(strcmp(word, "+") == 0) { 358 | program[i] = (Token){ .inst = INST_PLUS }; 359 | } else if(strcmp(word, "-") == 0) { 360 | program[i] = (Token){ .inst = INST_MINUS }; 361 | } else if(strcmp(word, "*") == 0) { 362 | program[i] = (Token){ .inst = INST_MUL }; 363 | } else if(strcmp(word, "%") == 0) { 364 | program[i] = (Token){ .inst = INST_MOD }; 365 | } else if(strcmp(word, "/") == 0) { 366 | program[i] = (Token){ .inst = INST_MUL }; 367 | } else if(strcmp(word, "==") == 0) { 368 | program[i] = (Token){ .inst = INST_EQ }; 369 | } else if(strcmp(word, "!=") == 0) { 370 | program[i] = (Token){ .inst = INST_NEQ }; 371 | } else if(strcmp(word, ">") == 0) { 372 | program[i] = (Token){ .inst = INST_GT }; 373 | } else if(strcmp(word, "<") == 0) { 374 | program[i] = (Token){ .inst = INST_LT }; 375 | } else if(strcmp(word, ">=") == 0) { 376 | program[i] = (Token){ .inst = INST_GEQ }; 377 | } else if(strcmp(word, "<=") == 0) { 378 | program[i] = (Token){ .inst = INST_LEQ }; 379 | } else if(strcmp(word, "and") == 0) { 380 | program[i] = (Token){ .inst = INST_LOGICAL_AND }; 381 | } else if(strcmp(word, "or") == 0) { 382 | program[i] = (Token){ .inst = INST_LOGICAL_OR }; 383 | } else if(strcmp(word, "if") == 0) { 384 | virtual_stackframe_index++; 385 | program[i] = (Token){ .inst = INST_IF }; 386 | } else if(strcmp(word, "else") == 0) { 387 | program[i] = (Token){ .inst = INST_ELSE }; 388 | } else if(strcmp(word, "end") == 0) { 389 | for(int32_t j = i; j >= 0; j--) { 390 | bool skip_token = false; 391 | for(uint32_t k = 0; k < crossreferenced_token_count; k++) { 392 | if(crossreferenced_tokens[k] != (uint32_t)j) continue; 393 | skip_token = true; 394 | break; 395 | } 396 | if(skip_token) continue; 397 | 398 | if(program[j].inst == INST_IF) { 399 | program[i] = (Token) { .inst = INST_ENDIF }; 400 | virtual_stackframe_index--; 401 | crossreferenced_tokens[crossreferenced_token_count++] = j; 402 | break; 403 | } else if(program[j].inst == INST_WHILE) { 404 | program[i] = (Token){ .inst = INST_END_WHILE }; 405 | program[i].val.data = j; 406 | virtual_stackframe_index--; 407 | crossreferenced_tokens[crossreferenced_token_count++] = j; 408 | break; 409 | } else if(program[j].inst == INST_MACRO) { 410 | program[i] = (Token){ .inst = INST_END_MACRO }; 411 | crossreferenced_tokens[crossreferenced_token_count++] = j; 412 | break; 413 | } 414 | } 415 | } else if(strcmp(word, "then") == 0) { 416 | program[i] = (Token){ .inst = INST_THEN }; 417 | }else if(strcmp(word, "elif") == 0) { 418 | program[i] = (Token){ .inst = INST_ELIF }; 419 | } else if(strcmp(word, "print") == 0) { 420 | program[i] = (Token){ .inst = INST_PRINT }; 421 | } else if(strcmp(word, "while") == 0) { 422 | program[i] = (Token){ .inst = INST_WHILE }; 423 | } else if(strcmp(word, "run") == 0) { 424 | virtual_stackframe_index++; 425 | program[i] = (Token){ .inst = INST_RUN_WHILE }; 426 | } else if(strcmp(word, "println") == 0) { 427 | program[i] = (Token){ .inst = INST_PRINTLN }; 428 | } else if(strcmp(word, "jmp") == 0) { 429 | program[i] = (Token){ .inst = INST_JUMP }; 430 | } else if(strcmp(word, "alloc") == 0) { 431 | program[i] = (Token){ .inst = INST_HEAP_ALLOC }; 432 | } else if(strcmp(word, "free") == 0) { 433 | program[i] = (Token){ .inst = INST_HEAP_FREE }; 434 | } else if(strcmp(word, "pget") == 0) { 435 | program[i] = (Token){ .inst = INST_PTR_GET_I }; 436 | } else if(strcmp(word, "pset") == 0) { 437 | program[i] = (Token){ .inst = INST_PTR_SET_I }; 438 | } else if(strcmp(word, "int") == 0) { 439 | program[i] = (Token){ .inst = INST_INT_TYPE }; 440 | } else if(strcmp(word, "str") == 0) { 441 | program[i] = (Token){ .inst = INST_STR_TYPE }; 442 | } else if(strcmp(word, "macro") == 0) { 443 | program[i] = (Token){ .inst = INST_MACRO }; 444 | } else if(strcmp(word, "def") == 0) { 445 | program[i] = (Token){ .inst = INST_MACRO_DEF }; 446 | state->macro_positions[state->macro_count++] = i; 447 | } else { 448 | if(is_str_var_name(word)) { 449 | if(program[i - 1].inst == INST_ASSIGN) { 450 | PANIC_ON_ERR(i < 2, ERR_SYNTAX_ERROR, "Assigning variable to nothing."); 451 | bool re_assigning = false; 452 | for(uint32_t j = 0; j < variable_count; j++) { 453 | if(strcmp(variable_names[j], word) == 0) { 454 | int32_t stackframe_index = -1; 455 | for(uint32_t k = 0; k < variable_count; k++) { 456 | if(strcmp(variable_names[k], word) != 0) continue; 457 | stackframe_index = k; 458 | break; 459 | } 460 | re_assigning = true; 461 | program[i] = (Token){ .inst = INST_VAR_REASSIGN }; 462 | program[i].val.data = stackframe_index; 463 | break; 464 | } 465 | } 466 | if(!re_assigning) { 467 | strcpy(variable_names[variable_count], word); 468 | variable_stackframe_indices[variable_count++] = virtual_stackframe_index; 469 | program[i] = (Token){ .inst = INST_ADD_VAR_TO_STACKFRAME}; 470 | } 471 | i++; 472 | continue; 473 | } 474 | int32_t stackframe_index = -1; 475 | for(uint32_t i = 0; i < variable_count; i++) { 476 | if(strcmp(variable_names[i], word) != 0 || variable_stackframe_indices[i] > virtual_stackframe_index) continue; 477 | stackframe_index = i; 478 | break; 479 | } 480 | PANIC_ON_ERR(stackframe_index == -1, ERR_SYNTAX_ERROR, "Undeclared identifier '%s'.", word); 481 | program[i] = (Token){ .inst = INST_VAR_USAGE }; 482 | program[i].val.data = stackframe_index; 483 | i++; 484 | continue; 485 | 486 | } 487 | PANIC_ON_ERR(true, ERR_SYNTAX_ERROR, "Syntax Error: Invalid Token '%s'.", word); 488 | } 489 | i++; 490 | } 491 | rewind(file); 492 | fclose(file); 493 | 494 | return program; 495 | } 496 | 497 | void 498 | crossreference_tokens(Token* program, uint32_t program_size) { 499 | uint32_t crossreferenced_whiles[program_size]; 500 | uint32_t crossreferenced_whiles_count = 0; 501 | for(uint32_t i = 0; i < program_size; i++) { 502 | if(program[i].inst == INST_RUN_WHILE) { 503 | if(int_array_contains((int32_t*)crossreferenced_whiles, crossreferenced_whiles_count, i)) 504 | continue; 505 | uint32_t while_index = 0; 506 | uint32_t end_while_index = 0; 507 | while_index++; 508 | for(uint32_t j = i + 1; j < program_size; j++) { 509 | if(program[j].inst == INST_END_WHILE && (while_index - 1) == end_while_index) { 510 | program[i].val.data = j; 511 | crossreferenced_whiles[crossreferenced_whiles_count++] = j; 512 | break; 513 | } else if(program[j].inst == INST_END_WHILE && (while_index - 1) != end_while_index) { 514 | end_while_index++; 515 | } 516 | if(program[j].inst == INST_RUN_WHILE) { 517 | while_index++; 518 | } 519 | } 520 | } 521 | if(program[i].inst == INST_ELSE) { 522 | for(uint32_t j = i; j < program_size; j++) { 523 | if(program[j].inst != INST_ENDIF) continue; 524 | program[i].val.data = j; 525 | break; 526 | } 527 | } 528 | if(program[i].inst == INST_IF || program[i].inst == INST_THEN) { 529 | program[i].val.data = -1; 530 | for(uint32_t j = i; j < program_size; j++) { 531 | if(program[j].inst != INST_ELIF) continue; 532 | program[i].val.data = j - 1; 533 | break; 534 | } 535 | if(program[i].val.data == (size_t)-1) { 536 | for(uint32_t j = i; j < program_size; j++) { 537 | if(program[j].inst != INST_ELSE) continue; 538 | program[i].val.data = j; 539 | break; 540 | } 541 | } 542 | if(program[i].val.data == (size_t)-1) { 543 | for(uint32_t j = i; j < program_size; j++) { 544 | if(program[j].inst != INST_ENDIF) continue; 545 | program[i].val.data = j; 546 | break; 547 | } 548 | } 549 | PANIC_ON_ERR(program[i].val.data == (size_t)-1, ERR_SYNTAX_ERROR, "If without endif"); 550 | } 551 | if(program[i].inst == INST_MACRO) { 552 | for(uint32_t j = i; j < program_size; j++) { 553 | if(program[j].inst != INST_END_MACRO) continue; 554 | program[i].val.data = j; 555 | break; 556 | } 557 | } 558 | } 559 | } 560 | void 561 | exec_program(ProgramState* state, Token* program, uint32_t program_size) { 562 | crossreference_tokens(program, program_size); 563 | while(state->inst_ptr < program_size) { 564 | //printf("instruction: %i\n", state->inst_ptr); 565 | Token* current_token = &program[state->inst_ptr]; 566 | if(current_token->inst == INST_RUN_WHILE) { 567 | PANIC_ON_ERR(state->stack_size < 1, ERR_STACK_UNDERFLOW, "No value for while condition specified."); 568 | PANIC_ON_ERR(stack_top(state).var_type != VAR_TYPE_INT, ERR_INVALID_DATA_TYPE, 569 | "Invalid data type for while condition."); 570 | 571 | int32_t cond = stack_pop(state).data; 572 | if(!cond) 573 | state->inst_ptr = current_token->val.data; 574 | else 575 | state->stackframe_index++; 576 | } 577 | if(current_token->inst == INST_END_WHILE) { 578 | uint32_t while_index = current_token->val.data; 579 | state->inst_ptr = while_index; 580 | clear_current_stackframe(state); 581 | } 582 | if(current_token->inst == INST_VAR_USAGE) { 583 | state->stack[state->stack_size++] = state->stackframe[current_token->val.data].val; 584 | } 585 | if(current_token->inst == INST_ADD_VAR_TO_STACKFRAME) { 586 | state->stackframe[state->stackframe_size] = (StackFrameValue){ .frame_index = state->stackframe_index }; 587 | state->stackframe[state->stackframe_size++].val = stack_pop(state); 588 | } 589 | if(current_token->inst == INST_VAR_REASSIGN) { 590 | state->stackframe[current_token->val.data].val = stack_pop(state); 591 | } 592 | if (current_token->inst == INST_STACK_PUSH) { 593 | PANIC_ON_ERR(state->stack_size >= STACK_CAP, ERR_STACK_OVERFLOW, "Stack is overflowed"); 594 | stack_push(state, current_token->val); 595 | } 596 | if(current_token->inst == INST_PLUS || current_token->inst == INST_MINUS || 597 | current_token->inst == INST_DIV || current_token->inst == INST_MUL || 598 | current_token->inst == INST_MOD) { 599 | PANIC_ON_ERR(state->stack_size < 2, ERR_STACK_UNDERFLOW, 600 | "Too few values on stack for arithmetic operator."); 601 | 602 | RuntimeValue val_a = stack_peak(state, 1); 603 | RuntimeValue val_b = stack_peak(state, 2); 604 | if(val_a.var_type == VAR_TYPE_INT && val_b.var_type == VAR_TYPE_INT) { 605 | int32_t a = stack_pop(state).data; 606 | int32_t b = stack_pop(state).data; 607 | if (current_token->inst == INST_PLUS) 608 | state->stack[state->stack_size].data = b + a; 609 | else if (current_token->inst == INST_MINUS) 610 | state->stack[state->stack_size].data = b - a; 611 | else if (current_token->inst == INST_MUL) 612 | state->stack[state->stack_size].data = b * a; 613 | else if (current_token->inst == INST_DIV) 614 | state->stack[state->stack_size].data = b / a; 615 | else if(current_token->inst == INST_MOD) 616 | state->stack[state->stack_size].data = b % a; 617 | state->stack[state->stack_size++].var_type = VAR_TYPE_INT; 618 | } else if(val_a.var_type == VAR_TYPE_STR && val_b.var_type == VAR_TYPE_STR) { 619 | if(current_token->inst == INST_PLUS) { 620 | char* a = state->heap[stack_pop(state).data].data; 621 | char* b = state->heap[stack_pop(state).data].data; 622 | state->heap[state->heap_size].data = strcat(b, a); 623 | state->heap[state->heap_size].var_type = VAR_TYPE_STR; 624 | stack_push(state, (RuntimeValue) { .heap_ptr = true, .data = state->heap_size, .var_type = VAR_TYPE_STR }); 625 | state->heap_size++; 626 | } 627 | } 628 | } 629 | if(current_token->inst == INST_PRINT || current_token->inst == INST_PRINTLN) { 630 | PANIC_ON_ERR(state->stack_size < 1, ERR_STACK_UNDERFLOW, "No value for print function on stack."); 631 | bool heap_ptr = stack_top(state).heap_ptr; 632 | if(!heap_ptr) { 633 | int32_t val = stack_pop(state).data; 634 | if(current_token->inst == INST_PRINTLN) 635 | printf("%i\n", val); 636 | else 637 | printf("%i", val); 638 | } else { 639 | if(state->heap[stack_top(state).data].var_type == VAR_TYPE_STR) { 640 | char* val = state->heap[stack_pop(state).data].data; 641 | if(current_token->inst == INST_PRINTLN) 642 | printf("%s\n", val); 643 | else 644 | printf("%s", val); 645 | } 646 | } 647 | } 648 | if(current_token->inst == INST_JUMP) { 649 | int32_t index = stack_pop(state).data; 650 | PANIC_ON_ERR(index >= (int32_t)program_size || 651 | index < 0, ERR_INVALID_JUMP, "Invalid index for jump specified."); 652 | state->inst_ptr = index; 653 | continue; 654 | } 655 | if(current_token->inst == INST_STACK_PREV) { 656 | state->stack_size--; 657 | int32_t index = (state->stack_size - 1) - current_token->val.data; 658 | PANIC_ON_ERR(index >= (int32_t)state->stack_size || 659 | index < 0, ERR_INVALID_STACK_ACCESS, "Invalid index for retrieving value from stack"); 660 | stack_push(state, state->stack[index]); 661 | } 662 | if(current_token->inst == INST_EQ) { 663 | PANIC_ON_ERR(state->stack_size < 2, ERR_STACK_UNDERFLOW, "Too few values for equality check specified."); 664 | 665 | RuntimeValue val_a = stack_peak(state, 1); 666 | RuntimeValue val_b = stack_peak(state, 2); 667 | if(val_a.var_type == VAR_TYPE_INT && val_b.var_type == VAR_TYPE_INT) { 668 | int32_t a = stack_pop(state).data; 669 | int32_t b = stack_pop(state).data; 670 | stack_push(state, (RuntimeValue){ .data = (int32_t)(a == b), .var_type = VAR_TYPE_INT }); 671 | } else if(val_a.var_type == VAR_TYPE_STR && val_b.var_type == VAR_TYPE_STR) { 672 | char* a = state->heap[stack_pop(state).data].data; 673 | char* b = state->heap[stack_pop(state).data].data; 674 | stack_push(state, (RuntimeValue){ .data = strcmp(a, b) == 0, .var_type = VAR_TYPE_INT }); 675 | } 676 | } 677 | if(current_token->inst == INST_NEQ) { 678 | PANIC_ON_ERR(state->stack_size < 2, ERR_STACK_UNDERFLOW, "Too few values for equality check specified."); 679 | RuntimeValue val_a = stack_peak(state, 1); 680 | RuntimeValue val_b = stack_peak(state, 2); 681 | if(val_a.var_type == VAR_TYPE_INT && val_b.var_type == VAR_TYPE_INT) { 682 | int32_t a = stack_pop(state).data; 683 | int32_t b = stack_pop(state).data; 684 | stack_push(state, (RuntimeValue){ .data = (int32_t)(a != b), .var_type = VAR_TYPE_INT }); 685 | } else if(val_a.var_type == VAR_TYPE_STR && val_b.var_type == VAR_TYPE_STR) { 686 | char* a = state->heap[stack_pop(state).data].data; 687 | char* b = state->heap[stack_pop(state).data].data; 688 | stack_push(state, (RuntimeValue){ .data = strcmp(a, b) != 0, .var_type = VAR_TYPE_INT }); 689 | } 690 | } 691 | if(current_token->inst == INST_GT) { 692 | PANIC_ON_ERR(state->stack_size < 2, ERR_STACK_UNDERFLOW, "Too few values for greather-than check specified."); 693 | if(stack_peak(state, 1).var_type == VAR_TYPE_INT && stack_peak(state, 2).var_type == VAR_TYPE_INT) { 694 | int32_t a = stack_pop(state).data; 695 | int32_t b = stack_pop(state).data; 696 | stack_push(state, (RuntimeValue){ .data = (int32_t)(b > a), .var_type = VAR_TYPE_INT }); 697 | } 698 | } 699 | if(current_token->inst == INST_LT) { 700 | PANIC_ON_ERR(state->stack_size < 2, ERR_STACK_UNDERFLOW, "Too few values for less-than check specified."); 701 | if(stack_peak(state, 1).var_type == VAR_TYPE_INT && stack_peak(state, 2).var_type == VAR_TYPE_INT) { 702 | int32_t a = stack_pop(state).data; 703 | int32_t b = stack_pop(state).data; 704 | stack_push(state, (RuntimeValue){ .data = (int32_t)(b < a), .var_type = VAR_TYPE_INT }); 705 | } 706 | } 707 | if(current_token->inst == INST_GEQ) { 708 | PANIC_ON_ERR(state->stack_size < 2, ERR_STACK_UNDERFLOW, "Too few values for greather-than-equal check specified."); 709 | if(stack_peak(state, 1).var_type == VAR_TYPE_INT && stack_peak(state, 2).var_type == VAR_TYPE_INT) { 710 | int32_t a = stack_pop(state).data; 711 | int32_t b = stack_pop(state).data; 712 | stack_push(state, (RuntimeValue){ .data = (int32_t)(b >= a), .var_type = VAR_TYPE_INT }); 713 | } 714 | } 715 | if(current_token->inst == INST_LEQ) { 716 | PANIC_ON_ERR(state->stack_size < 2, ERR_STACK_UNDERFLOW, "Too few values for less-than-equal check specified."); 717 | if(stack_peak(state, 1).var_type == VAR_TYPE_INT && stack_peak(state, 2).var_type == VAR_TYPE_INT) { 718 | int32_t a = stack_pop(state).data; 719 | int32_t b = stack_pop(state).data; 720 | stack_push(state, (RuntimeValue){ .data = (int32_t)(b <= a), .var_type = VAR_TYPE_INT }); 721 | } 722 | } 723 | if(current_token->inst == INST_LOGICAL_OR) { 724 | PANIC_ON_ERR(state->stack_size < 2, ERR_STACK_OVERFLOW, "Too few values for logical or operation."); 725 | if(stack_peak(state, 1).var_type == VAR_TYPE_INT && stack_peak(state, 2).var_type == VAR_TYPE_INT) { 726 | int32_t a = stack_pop(state).data; 727 | int32_t b = stack_pop(state).data; 728 | stack_push(state, (RuntimeValue){ .data = (int32_t)(b || a), .var_type = VAR_TYPE_INT }); 729 | } 730 | } 731 | if(current_token->inst == INST_LOGICAL_AND) { 732 | PANIC_ON_ERR(state->stack_size < 2, ERR_STACK_OVERFLOW, "Too few values for logical or operation."); 733 | if(stack_peak(state, 1).var_type == VAR_TYPE_INT && stack_peak(state, 2).var_type == VAR_TYPE_INT) { 734 | int32_t a = stack_pop(state).data; 735 | int32_t b = stack_pop(state).data; 736 | stack_push(state, (RuntimeValue){ .data = (int32_t)(b && a), .var_type = VAR_TYPE_INT }); 737 | } 738 | } 739 | if(current_token->inst == INST_ELSE) { 740 | state->inst_ptr = current_token->val.data; 741 | } 742 | 743 | if(current_token->inst == INST_ENDIF) { 744 | clear_current_stackframe(state); 745 | } 746 | 747 | if(current_token->inst == INST_IF || current_token->inst == INST_THEN) { 748 | PANIC_ON_ERR(state->stack_size < 1, ERR_STACK_UNDERFLOW, "No value for if check specified."); 749 | PANIC_ON_ERR(stack_top(state).var_type != VAR_TYPE_INT, ERR_INVALID_DATA_TYPE, 750 | "Invalid data type for if condition."); 751 | int32_t cond = stack_pop(state).data; 752 | if(!cond) { 753 | if(current_token->inst == INST_IF) 754 | state->found_solution_for_if_block = false; 755 | state->inst_ptr = current_token->val.data; 756 | } else { 757 | if(current_token->inst == INST_IF) 758 | state->found_solution_for_if_block = true; 759 | if(state->found_solution_for_if_block && current_token->inst == INST_THEN) { 760 | for(uint32_t j = state->inst_ptr; j <= program_size; j++) { 761 | if(program[j].inst != INST_ENDIF) continue; 762 | state->inst_ptr = j; 763 | break; 764 | } 765 | } else { 766 | state->stackframe_index++; 767 | if(current_token->inst == INST_THEN) { 768 | state->found_solution_for_if_block = true; 769 | } 770 | } 771 | } 772 | } 773 | if(current_token->inst == INST_HEAP_ALLOC) { 774 | PANIC_ON_ERR(state->stack_size < 1, ERR_STACK_UNDERFLOW, "No value for size of memory allocation specified."); 775 | PANIC_ON_ERR(program[state->inst_ptr - 1].inst != INST_STR_TYPE && 776 | program[state->inst_ptr - 1].inst != INST_INT_TYPE, ERR_INVALID_DATA_TYPE, "Invalid data type for allocating block"); 777 | 778 | VariableType type = VAR_TYPE_INT; 779 | if(program[state->inst_ptr - 1].inst == INST_INT_TYPE) 780 | type = VAR_TYPE_INT; 781 | else if(program[state->inst_ptr - 1].inst == INST_STR_TYPE) 782 | type = VAR_TYPE_STR; 783 | 784 | uint32_t heap_ptr = heap_alloc(state, stack_pop(state).data, type); 785 | stack_push(state, (RuntimeValue){ .data = heap_ptr, .heap_ptr = true, .var_type = VAR_TYPE_INT }); 786 | } 787 | if(current_token->inst == INST_HEAP_FREE) { 788 | PANIC_ON_ERR(state->stack_size < 1, ERR_STACK_UNDERFLOW, "No pointer for free operation specified."); 789 | PANIC_ON_ERR(!stack_top(state).heap_ptr, ERR_INVALID_PTR, "Trying to free stack based value."); 790 | PANIC_ON_ERR(stack_top(state).data > state->heap_size, ERR_INVALID_PTR, 791 | "Invalid pointer for free."); 792 | 793 | heap_free(state, stack_pop(state).data); 794 | } 795 | if(current_token->inst == INST_PTR_GET_I) { 796 | PANIC_ON_ERR(state->stack_size < 2, ERR_STACK_UNDERFLOW, "Not enough values for pget specified."); 797 | RuntimeValue heap_index = stack_pop(state); 798 | RuntimeValue data_index = stack_pop(state); 799 | PANIC_ON_ERR(!heap_index.heap_ptr, ERR_INVALID_PTR, "Trying to pget with stack based value."); 800 | PANIC_ON_ERR(heap_index.data > state->heap_size, ERR_INVALID_PTR, 801 | "Invalid pointer for pget."); 802 | 803 | switch (state->heap[heap_index.data].var_type) { 804 | case VAR_TYPE_INT: { 805 | size_t* heap_data = (size_t*)state->heap[heap_index.data].data; 806 | stack_push(state, (RuntimeValue) { 807 | .data = heap_data[data_index.data], 808 | .var_type = state->heap[heap_index.data].var_type, 809 | .heap_ptr = false }); 810 | break; 811 | } 812 | case VAR_TYPE_STR: { 813 | char** heap_data = (char**)state->heap[heap_index.data].data; 814 | char* data_at_index = heap_data[data_index.data]; 815 | state->heap[state->heap_size++] = (HeapValue){ .data = data_at_index, .var_type = VAR_TYPE_STR }; 816 | stack_push(state, (RuntimeValue) { 817 | .data = state->heap_size - 1, 818 | .heap_ptr = true, 819 | .var_type = VAR_TYPE_STR 820 | }); 821 | break; 822 | } 823 | } 824 | } 825 | if(current_token->inst == INST_PTR_SET_I) { 826 | PANIC_ON_ERR(state->stack_size < 1, ERR_STACK_UNDERFLOW, "Not enough values for pset specified."); 827 | 828 | RuntimeValue heap_index = stack_pop(state); 829 | RuntimeValue data_index = stack_pop(state); 830 | RuntimeValue val = stack_pop(state); 831 | 832 | PANIC_ON_ERR(!heap_index.heap_ptr, ERR_INVALID_PTR, "Trying to pset with stack based value."); 833 | PANIC_ON_ERR(heap_index.data > state->heap_size, ERR_INVALID_PTR, 834 | "Invalid pointer for pset."); 835 | PANIC_ON_ERR(val.var_type != state->heap[heap_index.data].var_type, 836 | ERR_INVALID_DATA_TYPE, "Assigning value of pointer to different data type"); 837 | 838 | switch (state->heap[heap_index.data].var_type) { 839 | case VAR_TYPE_INT: { 840 | size_t* heap_data = (size_t*)state->heap[heap_index.data].data; 841 | heap_data[data_index.data] = val.data; 842 | break; 843 | } 844 | case VAR_TYPE_STR: { 845 | char** heap_data = (char**)state->heap[heap_index.data].data; 846 | heap_data[data_index.data] = state->heap[val.data].data; 847 | break; 848 | } 849 | } 850 | } 851 | if(current_token->inst == INST_MACRO_USAGE) { 852 | state->call_positions[state->call_positions_count++] = state->inst_ptr; 853 | state->inst_ptr = current_token->val.data; 854 | } 855 | if(current_token->inst == INST_END_MACRO) { 856 | state->inst_ptr = state->call_positions[state->call_positions_count - 1]; 857 | state->call_positions_count--; 858 | } 859 | if(current_token->inst == INST_MACRO) { 860 | state->inst_ptr = current_token->val.data; 861 | } 862 | state->inst_ptr++; 863 | } 864 | } 865 | 866 | int main(int argc, char** argv) { 867 | if(argc < 2) { 868 | printf("Lantern: [Error]: Too few arguments specified. Usage: ./lantern \n"); 869 | return 1; 870 | } 871 | if(argc > 2) { 872 | printf("Lantern: [Error]: Too many arguments specified. Usage: ./lantern \n"); 873 | return 1; 874 | } 875 | uint32_t program_size; 876 | ProgramState program_state; 877 | program_state.stack_size = 0; 878 | program_state.heap_size = 0; 879 | program_state.stackframe_size = 0; 880 | program_state.inst_ptr = 0; 881 | program_state.heap = malloc(1024 * 1024 /* TODO: Dynamic Heap */); 882 | program_state.stackframe_index = 0; 883 | Token* program = load_program_from_file(argv[1], &program_size, &program_state); 884 | program_state.program_size = program_size; 885 | exec_program(&program_state, program, program_size); 886 | free(program_state.heap); 887 | free(program); 888 | return 0; 889 | } 890 | --------------------------------------------------------------------------------