From 2bc20abe34620de909873a4d87b08c18d233c70a Mon Sep 17 00:00:00 2001 From: night0721 Date: Mon, 6 Jan 2025 02:00:01 +0000 Subject: [PATCH] Initial commit --- .gitignore | 3 + LICENSE | 674 ++++++++++++++++++++++++++++++++++++++++++ Makefile | 37 +++ README.md | 29 ++ include/ast.h | 70 +++++ include/interpreter.h | 9 + include/lexer.h | 48 +++ include/parser.h | 22 ++ include/stmt.h | 65 ++++ src/ast.c | 125 ++++++++ src/interpreter.c | 233 +++++++++++++++ src/lexer.c | 312 +++++++++++++++++++ src/parser.c | 212 +++++++++++++ src/rd.c | 50 ++++ 14 files changed, 1889 insertions(+) create mode 100644 .gitignore create mode 100644 LICENSE create mode 100644 Makefile create mode 100644 README.md create mode 100644 include/ast.h create mode 100644 include/interpreter.h create mode 100644 include/lexer.h create mode 100644 include/parser.h create mode 100644 include/stmt.h create mode 100644 src/ast.c create mode 100644 src/interpreter.c create mode 100644 src/lexer.c create mode 100644 src/parser.c create mode 100644 src/rd.c diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..374689f --- /dev/null +++ b/.gitignore @@ -0,0 +1,3 @@ +rd +*.o +*.tar.gz diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..f288702 --- /dev/null +++ b/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/Makefile b/Makefile new file mode 100644 index 0000000..94c510e --- /dev/null +++ b/Makefile @@ -0,0 +1,37 @@ +.POSIX: +.SUFFIXES: + +VERSION = 1.0 +TARGET = rd +PREFIX ?= /usr/local +BINDIR = $(PREFIX)/bin + +CFLAGS = -Os -march=native -mtune=native -pipe -s -std=c99 -pedantic -Wall -D_DEFAULT_SOURCE + +SRC != find src -name "*.c" + +$(TARGET): $(SRC) + $(CC) $(SRC) -Iinclude -o $@ $(CFLAGS) + +dist: + mkdir -p $(TARGET)-$(VERSION) + cp -R README.md $(TARGET) $(TARGET)-$(VERSION) + tar -cf $(TARGET)-$(VERSION).tar $(TARGET)-$(VERSION) + gzip $(TARGET)-$(VERSION).tar + rm -rf $(TARGET)-$(VERSION) + +install: $(TARGET) + mkdir -p $(DESTDIR)$(BINDIR) + mkdir -p $(DESTDIR)$(MANDIR) + cp -p $(TARGET) $(DESTDIR)$(BINDIR)/$(TARGET) + chmod 755 $(DESTDIR)$(BINDIR)/$(TARGET) + +uninstall: + rm $(DESTDIR)$(BINDIR)/$(TARGET) + +clean: + rm $(TARGET) + +all: $(TARGET) + +.PHONY: all dist install uninstall clean diff --git a/README.md b/README.md new file mode 100644 index 0000000..2effbe1 --- /dev/null +++ b/README.md @@ -0,0 +1,29 @@ +# Radish +Programming language. + +# Usage +```sh +rd run # interpreter +rd build # compiler +rd add # dependency manager +rd test # test suite +rd ci # ci +rd lsp # lsp server +rd packager # create package +``` + +# Depedencies +None + +# Building +You will need to run these with elevated privilages. +``` +$ make +# make install +``` + +# Contributions +Contributions are welcomed, feel free to open a pull request. + +# License +This project is licensed under the GNU Public License v3.0. See [LICENSE](https://github.com/night0721/radish/blob/master/LICENSE) for more information. diff --git a/include/ast.h b/include/ast.h new file mode 100644 index 0000000..382cf3f --- /dev/null +++ b/include/ast.h @@ -0,0 +1,70 @@ +#ifndef AST_H +#define AST_H + +#include "lexer.h" + +/* +expression → literal + | unary + | binary + | grouping ; +literal → NUMBER | STRING | "true" | "false" | "nil" ; +grouping → "(" expression ")" ; +unary → ( "-" | "!" ) expression ; +binary → expression operator expression ; +operator → "==" | "!=" | "<" | "<=" | ">" | ">=" + | "+" | "-" | "*" | "/" ; +*/ + +typedef enum { + BINARY, + UNARY, + LITERAL, + GROUPING, +} expr_type; + +typedef enum { + VAL_BOOL, + VAL_NIL, + VAL_NUMBER, + VAL_STRING, +} value_type_t; + +typedef struct { + value_type_t type; + union { + int boolean; + double number; + char *string; + } as; +} value_t; + +typedef struct expr_t { + expr_type type; + int line; + union { + struct { + token_t binary_op; + struct expr_t *left; + struct expr_t *right; + } binary; + struct { + token_t unary_op; + struct expr_t *right; + } unary; + struct { + value_t value; + } literal; + struct { + struct expr_t *expression; + } grouping; + } as; +} expr_t; + +expr_t *create_binary_expr(token_t *binary_op, expr_t *left, expr_t *right); +expr_t *create_unary_expr(token_t *unary_op, expr_t *right); +expr_t *create_literal_expr(token_t *token); +expr_t *create_grouping_expr(expr_t *expression); +void print_ast(expr_t *expr); + +#endif diff --git a/include/interpreter.h b/include/interpreter.h new file mode 100644 index 0000000..230537f --- /dev/null +++ b/include/interpreter.h @@ -0,0 +1,9 @@ +#ifndef INTERPRETER_H +#define INTERPRETER_H + +#include "ast.h" + +value_t evaluate(expr_t *expr); +void print_value(value_t *value); + +#endif diff --git a/include/lexer.h b/include/lexer.h new file mode 100644 index 0000000..b064980 --- /dev/null +++ b/include/lexer.h @@ -0,0 +1,48 @@ +#ifndef LEXER_H +#define LEXER_H + +#define DEFAULT_TOKENS_SIZE 512 + +typedef enum { + // Single-character tokens + LEFT_PAREN, RIGHT_PAREN, LEFT_BRACE, RIGHT_BRACE, + COMMA, DOT, MINUS, PLUS, SEMICOLON, SLASH, STAR, + + // One or two character tokens + BANG, BANG_EQUAL, + EQUAL, EQUAL_EQUAL, + GREATER, GREATER_EQUAL, + LESS, LESS_EQUAL, + + // Literals + IDENTIFIER, STRING, NUMBER, + + // Keywords + AND, CLASS, ELSE, FALSE, FUN, FOR, IF, NIL, OR, + PRINT, RETURN, SUPER, THIS, TRUE, VAR, WHILE, + + END_OF_FILE +} token_type_t; + +typedef struct { + char *keyword; + token_type_t token_type; +} keyword_map; + +typedef struct { + token_type_t type; + char *value; + int line; +} token_t; + +typedef struct { + token_t *tokens; + int length; + int capacity; +} array_t; + +array_t *tokenize(char *filename); +void print_tokens(token_t *tokens); +void free_array(array_t *array); + +#endif diff --git a/include/parser.h b/include/parser.h new file mode 100644 index 0000000..78e91ce --- /dev/null +++ b/include/parser.h @@ -0,0 +1,22 @@ +#ifndef PARSER_H +#define PARSER_H + +/* +expression → equality ; +equality → comparison ( ( "!=" | "==" ) comparison )* ; +comparison → term ( ( ">" | ">=" | "<" | "<=" ) term )* ; +term → factor ( ( "-" | "+" ) factor )* ; +factor → unary ( ( "/" | "*" ) unary )* ; +unary → ( "!" | "-" ) unary + | primary ; +primary → NUMBER | STRING | "true" | "false" | "nil" + | "(" expression ")" ; +*/ + +#include "ast.h" +#include "lexer.h" + +expr_t *parse(token_t *tks); +void free_expr(expr_t *expr); + +#endif diff --git a/include/stmt.h b/include/stmt.h new file mode 100644 index 0000000..957f3d7 --- /dev/null +++ b/include/stmt.h @@ -0,0 +1,65 @@ +#ifndef STMT_H +#define STMT_H + +#include "ast.h" +#include "scanner.h" +typedef enum { + STMT_BLOCK, + STMT_CLASS, + STMT_EXPR, + STMT_FUN, + STMT_IF, + STMT_PRINT, + STMT_VAR, + STMT_WHILE, + STMT_COUNT, +} StmtType; +typedef struct Stmt Stmt; +struct Stmt{ + StmtType type; + union { + struct { + Stmt **statements; + } block; + struct { + Token name; + Token superclass; + Stmt **methods; + } class; + struct { + Expr *expression; + } expr; + struct { + Token name; + TokenArray params; + Stmt **body; + } function; + struct { + Expr *condition; + Stmt *thenBranch; + Stmt *elseBranch; + } _if; + struct { + Expr *expression; + } print; + struct { + Token keyword; + Expr *value; + } _return; + struct { + Token name; + Expr *initializer; + } variable; + struct { + Expr *condition; + Stmt *body; + } _while; + } as; +}; +typedef struct { + Stmt *statements; + int count; + int capacity; + bool hadError; +} StmtArray; +#endif diff --git a/src/ast.c b/src/ast.c new file mode 100644 index 0000000..98601f4 --- /dev/null +++ b/src/ast.c @@ -0,0 +1,125 @@ +#include +#include +#include + +#include "ast.h" +#include "lexer.h" + +expr_t *create_binary_expr(token_t *binary_op, expr_t *left, expr_t *right) +{ + expr_t *expr = malloc(sizeof(expr_t)); + expr->type = BINARY; + expr->line = binary_op->line; + expr->as.binary.left = left; + expr->as.binary.right = right; + expr->as.binary.binary_op.type = binary_op->type; + char *bin_op_val = strdup(binary_op->value); + expr->as.binary.binary_op.value = bin_op_val; + expr->as.binary.binary_op.line = binary_op->line; + return expr; +} + +expr_t *create_unary_expr(token_t *unary_op, expr_t *right) +{ + expr_t *expr = malloc(sizeof(expr_t)); + expr->type = UNARY; + expr->line = unary_op->line; + expr->as.unary.unary_op.type = unary_op->type; + char *u_op_val = strdup(unary_op->value); + expr->as.unary.unary_op.value = u_op_val; + expr->as.unary.unary_op.line = unary_op->line; + expr->as.unary.right = right; + return expr; +} + +expr_t *create_literal_expr(token_t *token) +{ + expr_t *expr = malloc(sizeof(expr_t)); + expr->type = LITERAL; + expr->line = token->line; + switch (token->type) { + case NUMBER: + expr->as.literal.value.type = VAL_NUMBER; + double num; + sscanf(token->value, "%lf", &num); + expr->as.literal.value.as.number = num; + break; + + case NIL: + expr->as.literal.value.type = VAL_NIL; + expr->as.literal.value.as.number = 0; + break; + + case TRUE: + case FALSE: + expr->as.literal.value.type = VAL_BOOL; + expr->as.literal.value.as.boolean = token->type == TRUE; + break; + + case STRING: + expr->as.literal.value.type = VAL_STRING; + char *tkvalue = strdup(token->value); + expr->as.literal.value.as.string = tkvalue; + break; + + default: + break; + } + return expr; +} + +expr_t *create_grouping_expr(expr_t *expression) +{ + if (!expression) { + return NULL; + } + expr_t *expr = malloc(sizeof(expr_t)); + expr->type = GROUPING; + expr->line = expression->line; + expr->as.grouping.expression = expression; + return expr; +} + +void print_ast(expr_t *expr) +{ + if (!expr) + return; + if (expr->type == LITERAL) { + switch (expr->as.literal.value.type) { + case VAL_BOOL: + printf("%s", expr->as.literal.value.as.boolean ? "true" : "false"); + break; + + case VAL_NIL: + printf("nil"); + break; + + case VAL_NUMBER:; + double value = expr->as.literal.value.as.number; + if (value == (int) value) { + printf("%.1f", value); + } else { + printf("%g", value); + } + break; + + case VAL_STRING: + printf("%s", expr->as.literal.value.as.string); + break; + } + } else if (expr->type == BINARY) { + printf("(%s ", expr->as.binary.binary_op.value); + print_ast(expr->as.binary.left); + printf(" "); + print_ast(expr->as.binary.right); + printf(")"); + } else if (expr->type == UNARY) { + printf("(%s ", expr->as.unary.unary_op.value); + print_ast(expr->as.unary.right); + printf(")"); + } else if (expr->type == GROUPING) { + printf("(group "); + print_ast(expr->as.grouping.expression); + printf(")"); + } +} diff --git a/src/interpreter.c b/src/interpreter.c new file mode 100644 index 0000000..1dec5c2 --- /dev/null +++ b/src/interpreter.c @@ -0,0 +1,233 @@ +#include +#include +#include +#include + +#include "ast.h" +#include "interpreter.h" +#include "lexer.h" + +value_t visit_literal(expr_t *expr); +value_t visit_grouping(expr_t *expr); +value_t visit_binary(expr_t *expr); +value_t visit_unary(expr_t *expr); + +value_t visit_literal(expr_t *expr) +{ + return expr->as.literal.value; +} + +value_t visit_grouping(expr_t *expr) +{ + return evaluate(expr->as.grouping.expression); +} + +void runtime_error(const char *message, int line) +{ + fprintf(stderr, "%s\n[line %d]\n", message, line); + errno = 70; + exit(70); +} + +value_t visit_binary(expr_t *expr) +{ + token_type_t op_type = expr->as.binary.binary_op.type; + value_t right = evaluate(expr->as.binary.right); + value_t left = evaluate(expr->as.binary.left); + + // Arithmetic + if (left.type == VAL_NUMBER && right.type == VAL_NUMBER) { + value_t result = {.type = VAL_NUMBER}; + switch (op_type) { + case PLUS: + result.as.number = left.as.number + right.as.number; + return result; + + case MINUS: + result.as.number = left.as.number - right.as.number; + return result; + + case STAR: + result.as.number = left.as.number * right.as.number; + return result; + + case SLASH: + if (right.as.number == 0) { + runtime_error("Division by zero.", expr->line); + } + result.as.number = left.as.number / right.as.number; + return result; + default: + break; + } + } + + // Comparison + if (op_type == EQUAL_EQUAL || op_type == BANG_EQUAL) { + int is_equal; + if (left.type != right.type) { + is_equal = 0; + } else { + switch (left.type) { + case VAL_NUMBER: + is_equal = left.as.number == right.as.number; + break; + + case VAL_BOOL: + is_equal = left.as.boolean == right.as.boolean; + break; + + case VAL_STRING: + is_equal = strcmp(left.as.string, right.as.string) == 0; + break; + + case VAL_NIL: + is_equal = 1; // nil == nil + break; + + default: + is_equal = 0; + break; + } + } + value_t result = {.type = VAL_BOOL}; + result.as.boolean = op_type == EQUAL_EQUAL ? is_equal : !is_equal; + return result; + } + + // Number Comparison + if (left.type == VAL_NUMBER && right.type == VAL_NUMBER) { + value_t result = {.type = VAL_BOOL }; + switch (op_type) { + case GREATER: + result.as.boolean= left.as.number > right.as.number; + return result; + + case GREATER_EQUAL: + result.as.boolean = left.as.number >= right.as.number; + return result; + + case LESS: + result.as.boolean = left.as.number < right.as.number; + return result; + + case LESS_EQUAL: + result.as.boolean = left.as.number <= right.as.number; + return result; + + default: break; + } + } + + // String concatenation + if (left.type == VAL_STRING && right.type == VAL_STRING) { + if (op_type == PLUS) { + value_t result = {.type = VAL_STRING}; + size_t left_len = strlen(left.as.string); + size_t right_len = strlen(right.as.string); + result.as.string = malloc(left_len + right_len + 1); + strcpy(result.as.string, left.as.string); + strcat(result.as.string, right.as.string); + return result; + } + } + + // String/number comparisons + if ((left.type == VAL_STRING && right.type == VAL_NUMBER) || (left.type == VAL_NUMBER && right.type == VAL_STRING)) { + runtime_error("Operands must be numbers.", expr->line); + } + + runtime_error("Operands must be two numbers or two strings.", expr->line); + return (value_t){.type = VAL_NIL}; + +} + +int is_truthy(value_t *value) +{ + switch (value->type) { + case VAL_NIL: + return 0; + + case VAL_BOOL: + return value->as.boolean; + + case VAL_NUMBER: + if (value->as.number == 0) + return 0; + return 1; + + case VAL_STRING: + return 1; + + default: + return 0; + } +} + +value_t visit_unary(expr_t *expr) +{ + value_t operand = evaluate(expr->as.unary.right); + + if (expr->as.unary.unary_op.type == MINUS) { + if (operand.type == VAL_NUMBER) { + value_t result = {.type = VAL_NUMBER, .as.number = -operand.as.number}; + return result; + } else { + runtime_error("Operand must be a number.", expr->line); + } + } else if (expr->as.unary.unary_op.type == BANG) { + value_t result = {.type = VAL_BOOL, .as.boolean = !is_truthy(&operand)}; + return result; + } + + return (value_t){.type = VAL_NIL}; +} + +value_t evaluate(expr_t *expr) +{ + if (!expr) { + value_t nil_value = {.type = VAL_NIL }; + return nil_value; + } + switch (expr->type) { + case LITERAL: + return visit_literal(expr); + case BINARY: + return visit_binary(expr); + case UNARY: + return visit_unary(expr); + case GROUPING: + return visit_grouping(expr); + default: + errno = 65; + break; + } +} + +void print_value(value_t *value) +{ + switch (value->type) { + case VAL_BOOL: + printf("%s\n", value->as.boolean == 1 ? "true" : "false"); + break; + + case VAL_NIL: + printf("nil\n"); + break; + + case VAL_STRING: + printf("%s\n", value->as.string); + break; + + case VAL_NUMBER: + if (value->as.number == (int) value->as.number) { + printf("%d\n", (int) value->as.number); + } else { + printf("%g\n", value->as.number); + } + break; + + default: + break; + } +} diff --git a/src/lexer.c b/src/lexer.c new file mode 100644 index 0000000..6495b63 --- /dev/null +++ b/src/lexer.c @@ -0,0 +1,312 @@ +#include +#include +#include +#include +#include + +#include "lexer.h" + +const keyword_map reserved_keywords[] = { + {"and", AND}, {"class", CLASS}, {"else", ELSE}, + {"false", FALSE}, {"fun", FUN}, {"for", FOR}, + {"if", IF}, {"nil", NIL}, {"or", OR}, + {"print", PRINT}, {"return", RETURN}, + {"super", SUPER}, {"this", THIS}, {"true", TRUE}, + {"var", VAR}, {"while", WHILE} +}; + +const keyword_map regular_tokens[] = { + {"LEFT_PAREN", LEFT_PAREN}, {"RIGHT_PAREN", RIGHT_PAREN}, + {"LEFT_BRACE", LEFT_BRACE}, {"RIGHT_BRACE", RIGHT_BRACE}, + {"COMMA", COMMA}, {"DOT", DOT}, {"MINUS", MINUS}, + {"PLUS", PLUS}, {"SEMICOLON", SEMICOLON}, {"SLASH", SLASH}, + {"STAR", STAR}, {"BANG", BANG}, {"BANG_EQUAL", BANG_EQUAL}, + {"EQUAL", EQUAL}, {"EQUAL_EQUAL", EQUAL_EQUAL}, {"GREATER", GREATER}, + {"GREATER_EQUAL", GREATER_EQUAL}, {"LESS", LESS}, {"LESS_EQUAL", LESS_EQUAL}, + {"IDENTIFIER", IDENTIFIER}, {"STRING", STRING}, {"NUMBER", NUMBER}, + {"AND", AND}, {"CLASS", CLASS}, {"ELSE", ELSE}, {"FALSE", FALSE}, + {"FUN", FUN}, {"FOR", FOR}, {"IF", IF}, {"NIL", NIL}, + {"OR", OR}, {"PRINT", PRINT}, {"RETURN", RETURN}, + {"SUPER", SUPER}, {"THIS", THIS}, {"TRUE", TRUE}, + {"VAR", VAR}, {"WHILE", WHILE}, {"END_OF_FILE", END_OF_FILE} +}; + +char *read_source(const char *filename) +{ + FILE *file = fopen(filename, "r"); + if (file == NULL) { + fprintf(stderr, "rd: Error reading file: %s\n", filename); + return NULL; + } + + fseek(file, 0, SEEK_END); + long file_size = ftell(file); + rewind(file); + + char *source = malloc(file_size + 1); + if (source == NULL) { + fprintf(stderr, "rd: Error allocating memory\n"); + fclose(file); + return NULL; + } + + size_t bytes_read = fread(source, 1, file_size, file); + if (bytes_read < file_size) { + fprintf(stderr, "rd: Error reading file contents\n"); + free(source); + fclose(file); + return NULL; + } + + source[file_size] = '\0'; + fclose(file); + + return source; +} + +int is_digit(char c) +{ + return c >= '0' && c <= '9'; +} + +int is_alpha(char c) +{ + return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '_'; +} + +void token_add(array_t *array, token_t token) +{ + if (array->length == array->capacity) { + array->capacity *= 2; + array->tokens = realloc(array->tokens, array->capacity * sizeof(token_t)); + } + array->tokens[array->length++] = token; +} + +token_t token_gen(token_type_t type, char *value, int line) +{ + token_t token; + token.type = type; + char *val = strdup(value); + token.value = val; + token.line = line; + return token; +} + +char *type_str(token_type_t type) +{ + for (int i = 0; i < sizeof(regular_tokens) / sizeof(regular_tokens[0]); i++) { + if (regular_tokens[i].token_type == type) { + return regular_tokens[i].keyword; + } + } + return NULL; +} + +void print_tokens(token_t *tokens) +{ + for (int i = 0; tokens[i].type != END_OF_FILE; i++) { + token_t token = tokens[i]; + if (token.type == STRING) { + printf("STRING \"%s\" %s\n", token.value, token.value); + } else if (token.type == NUMBER) { + double value = strtod(token.value, NULL); + if (value == (int) value) { + printf("NUMBER %s %d.0\n", token.value, (int) value); + } else { + printf("NUMBER %s %g\n", token.value, value); + } + } else { + printf("%s %s null\n", type_str(token.type), token.value); + } + } + printf("EOF null\n"); +} + +void free_array(array_t *array) +{ + for (int i = 0; i < array->length; i++) { + if (array->tokens[i].value) { + free(array->tokens[i].value); + } + } + free(array->tokens); + free(array); +} + +array_t *tokenize(char *filename) +{ + array_t *tokens = malloc(sizeof(array_t)); + tokens->tokens = malloc(DEFAULT_TOKENS_SIZE * sizeof(token_t)); + tokens->length = 0; + tokens->capacity = DEFAULT_TOKENS_SIZE; + + char *source = read_source(filename); + if (!source) { + return NULL; + } + int line = 1; + size_t source_len = strlen(source); + if (source_len > 0) { + for (int i = 0; i < source_len; i++) { + switch (source[i]) { + case '(': + token_add(tokens, token_gen(LEFT_PAREN, "(", line)); + break; + case ')': + token_add(tokens, token_gen(RIGHT_PAREN, ")", line)); + break; + case '{': + token_add(tokens, token_gen(LEFT_BRACE, "{", line)); + break; + case '}': + token_add(tokens, token_gen(RIGHT_BRACE, "}", line)); + break; + case '*': + token_add(tokens, token_gen(STAR, "*", line)); + break; + case '.': + token_add(tokens, token_gen(DOT, ".", line)); + break; + case ',': + token_add(tokens, token_gen(COMMA, ",", line)); + break; + case '+': + token_add(tokens, token_gen(PLUS, "+", line)); + break; + case '-': + token_add(tokens, token_gen(MINUS, "-", line)); + break; + case ';': + token_add(tokens, token_gen(SEMICOLON, ";", line)); + break; + case '=': + if (source[i + 1] == '=') { + token_add(tokens, token_gen(EQUAL_EQUAL, "==", line)); + i++; + } else { + token_add(tokens, token_gen(EQUAL, "=", line)); + } + break; + case '!': + if (source[i + 1] == '=') { + token_add(tokens, token_gen(BANG_EQUAL, "!=", line)); + i++; + } else { + token_add(tokens, token_gen(BANG, "!", line)); + } + break; + case '>': + if (source[i + 1] == '=') { + token_add(tokens, token_gen(GREATER_EQUAL, ">=", line)); + i++; + } else { + token_add(tokens, token_gen(GREATER, ">", line)); + } + break; + case '<': + if (source[i + 1] == '=') { + token_add(tokens, token_gen(LESS_EQUAL, "<=", line)); + i++; + } else { + token_add(tokens, token_gen(LESS, "<", line)); + } + break; + case '/': + if (source[i + 1] == '/') { + i += 2; // Skip both forward slashes + while (i < strlen(source) && source[i] != '\n') { + i++; + } + i--; + } else { + token_add(tokens, token_gen(SLASH, "/", line)); + } + break; + case ' ': + break; + case '\t': + break; + case '\n': + line++; + break; + case '"': + i++; + int str_start = i; + while (source[i] != '"' && source[i] != '\0') { + if (source[i] == '\n') + line++; + i++; + } + if (source[i] == '\0') { + fprintf(stderr, "[line %d] Error: Unterminated string.\n", line); + errno = 65; + } else { + int len = i - str_start; + char str[len + 1]; + strncpy(str, &source[str_start], len); + str[len] = 0; + token_add(tokens, token_gen(STRING, str, line)); + } + break; + + default: + if (is_alpha(source[i])) { + int id_start = i; + while (source[i] == '_' || (source[i] >= 'a' && source[i] <= 'z') || + (source[i] >= 'A' && source[i] <= 'Z') || + (source[i] >= '0' && source[i] <= '9')) { + i++; + } + int len = i - id_start; + char id[len + 1]; + strncpy(id, &source[i-len], len); + id[len] = 0; + + int found = 0; + for (int i = 0; i < sizeof(reserved_keywords) / sizeof(reserved_keywords[0]); i++) { + if (strcmp(id, reserved_keywords[i].keyword) == 0) { + char upper_id[len + 1]; + for (int i = 0; i < len; i++) { + upper_id[i] = toupper(id[i]); + } + upper_id[len] = 0; + token_add(tokens, token_gen(reserved_keywords[i].token_type, id, line)); + + found = 1; + } + } + if (!found) { + token_add(tokens, token_gen(IDENTIFIER, id, line)); + } + i--; + break; + + } else if (is_digit(source[i])) { + int int_start = i; + while (isdigit(source[i])) + i++; + if (source[i] == '.' && isdigit(source[i + 1])) { + i++; + while (isdigit(source[i])) + i++; + } + int len = i - int_start; + char *iend = source + int_start; + char integer[len + 1]; + strncpy(integer, iend, len); + integer[len] = 0; + token_add(tokens, token_gen(NUMBER, integer, line)); + i--; + + } else { + fprintf(stderr, "[line %d] Error: Unexpected character: %c\n", line, source[i]); + errno = 65; + } + } + } + } + token_add(tokens, token_gen(END_OF_FILE, "EOF", line)); + free(source); + return tokens; +} diff --git a/src/parser.c b/src/parser.c new file mode 100644 index 0000000..ecf5357 --- /dev/null +++ b/src/parser.c @@ -0,0 +1,212 @@ +#include +#include +#include + +#include "ast.h" +#include "lexer.h" +#include "parser.h" + +int current = 0; +token_t *tokens; + +expr_t *expression(void); + +void error(token_t *token, char *message) +{ + if (token->type == END_OF_FILE) { + fprintf(stderr, "[line %d] at end: %s\n", token->line, message); + } else { + fprintf(stderr, "[line %d] at '%s': %s\n", token->line, token->value, message); + } + errno = 65; +} + +void free_expr(expr_t *expr) +{ + if (!expr) + return; + switch (expr->type) { + case BINARY: + free(expr->as.binary.binary_op.value); + free_expr(expr->as.binary.left); + free_expr(expr->as.binary.right); + free(expr); + break; + + case GROUPING: + free_expr(expr->as.grouping.expression); + free(expr); + break; + + case UNARY: + free(expr->as.unary.unary_op.value); + free_expr(expr->as.unary.right); + free(expr); + break; + + case LITERAL: + if (expr->as.literal.value.type == VAL_STRING) { + free(expr->as.literal.value.as.string); + } + free(expr); + break; + + default: + break; + } +} + +expr_t *parse(token_t *tks) +{ + tokens = tks; + if (errno == 65) { + return NULL; + } else { + return expression(); + } +} + +token_t *peek(void) +{ + return &tokens[current]; +} + +int isAtEnd(void) +{ + return tokens[current].type == END_OF_FILE; +} + +token_t *previous(void) +{ + return &tokens[current - 1]; +} + +void advance(void) +{ + if (!isAtEnd()) + current++; +} + + +int check(token_type_t type) +{ + if (tokens[current].type == type) { + advance(); + return 1; + } else { + return 0; + } +} + +void consume(token_type_t type, char *message) { + if (!check(type)) { + error(peek(), message); + } +} + +expr_t *primary(void) +{ + if (check(FALSE) || check(TRUE) || check(NIL) || check(NUMBER) || check(STRING)) { + return create_literal_expr(previous()); + } + if (check(LEFT_PAREN)) { + expr_t *expr = expression(); + consume(RIGHT_PAREN, "Expect ')' after expression."); + return create_grouping_expr(expr); + } + error(peek(), "Expect expression."); + return NULL; +} + +expr_t *unary(void) +{ + if (check(BANG) || check(MINUS)) { + token_t *operator = previous(); + expr_t *right = unary(); + return create_unary_expr(operator, right); + } + + return primary(); +} + +expr_t *factor(void) +{ + expr_t *expr = unary(); + + while (check(SLASH) || check(STAR)) { + token_t *operator = previous(); + expr_t *right = unary(); + expr = create_binary_expr(operator, expr, right); + } + + return expr; +} + +expr_t *term(void) +{ + expr_t *expr = factor(); + + while (check(MINUS) || check(PLUS)) { + token_t *operator = previous(); + expr_t *right = factor(); + expr = create_binary_expr(operator, expr, right); + } + + return expr; +} + +expr_t *comparison(void) +{ + expr_t *expr = term(); + + while (check(GREATER) || check(GREATER_EQUAL) || check(LESS) || check(LESS_EQUAL)) { + token_t *operator = previous(); + expr_t *right = term(); + expr = create_binary_expr(operator, expr, right); + } + + return expr; +} + +expr_t *equality(void) +{ + expr_t *expr = comparison(); + + while (check(BANG_EQUAL) || check(EQUAL_EQUAL)) { + token_t *operator = previous(); + expr_t *right = comparison(); + expr = create_binary_expr(operator, expr, right); + } + + return expr; +} + +expr_t *expression(void) +{ + return equality(); +} + +void synchronize(void) +{ + advance(); + + while (!isAtEnd()) { + if (previous()->type == SEMICOLON) return; + + switch (peek()->type) { + case CLASS: + case FUN: + case VAR: + case FOR: + case IF: + case WHILE: + case PRINT: + case RETURN: + return; + default: + return; + } + + advance(); + } +} diff --git a/src/rd.c b/src/rd.c new file mode 100644 index 0000000..a2f1567 --- /dev/null +++ b/src/rd.c @@ -0,0 +1,50 @@ +#include +#include +#include +#include + +#include "ast.h" +#include "interpreter.h" +#include "lexer.h" +#include "parser.h" + +int main(int argc, char **argv) +{ + if (argc < 3) { + fprintf(stderr, "Usage: rd tokenize|parse|evaluate \n"); + return 1; + } + + const char *command = argv[1]; + + if (!strcmp(command, "tokenize")) { + array_t *array = tokenize(argv[2]); + if (array) { + print_tokens(array->tokens); + free_array(array); + } + } else if (!strcmp(command, "parse")) { + array_t *array = tokenize(argv[2]); + expr_t *expr = parse(array->tokens); + if (errno != 65) { + print_ast(expr); + printf("\n"); + } + free_array(array); + free_expr(expr); + } else if (!strcmp(command, "evaluate")) { + array_t *array = tokenize(argv[2]); + expr_t *expr = parse(array->tokens); + value_t val = evaluate(expr); + print_value(&val); + } else { + fprintf(stderr, "Unknown command: %s\n", command); + return 1; + } + if (errno == 65) { + return 65; + } else if (errno == 70) { + return 70; + } + return 0; +}