diff --git a/COPYING3 b/COPYING3
deleted file mode 100644
index 94a9ed0..0000000
--- a/COPYING3
+++ /dev/null
@@ -1,674 +0,0 @@
- 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/frontend/ast.cc b/frontend/ast.cc
deleted file mode 100644
index e067937..0000000
--- a/frontend/ast.cc
+++ /dev/null
@@ -1,1178 +0,0 @@
-/* Abstract syntax tree representation.
- Copyright (C) 2025 Free Software Foundation, Inc.
-
-GCC 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, or (at your option)
-any later version.
-
-GCC 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 GCC; see the file COPYING3. If not see
-. */
-
-#include "elna/frontend/ast.h"
-
-namespace elna::frontend
-{
- void empty_visitor::not_implemented()
- {
- __builtin_unreachable();
- }
-
- void empty_visitor::visit(named_type_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(array_type_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(pointer_type_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(program *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(type_declaration *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(record_type_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(union_type_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(procedure_type_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(enumeration_type_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(variable_declaration *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(constant_declaration *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(procedure_declaration *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(assign_statement *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(if_statement *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(import_declaration *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(while_statement *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(return_statement *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(defer_statement *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(case_statement *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(procedure_call *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(unit *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(cast_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(traits_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(binary_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(unary_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(variable_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(array_access_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(field_access_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(dereference_expression *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(literal *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(literal *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(literal *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(literal *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(literal *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(literal *)
- {
- not_implemented();
- }
-
- void empty_visitor::visit(literal *)
- {
- not_implemented();
- }
-
- node::node(const struct position position)
- : source_position(position)
- {
- }
-
- node::~node()
- {
- }
-
- const struct position& node::position() const
- {
- return this->source_position;
- }
-
- cast_expression *expression::is_cast()
- {
- return nullptr;
- }
-
- traits_expression *expression::is_traits()
- {
- return nullptr;
- }
-
- binary_expression *expression::is_binary()
- {
- return nullptr;
- }
-
- unary_expression *expression::is_unary()
- {
- return nullptr;
- }
-
- designator_expression *expression::is_designator()
- {
- return nullptr;
- }
-
- procedure_call *expression::is_call_expression()
- {
- return nullptr;
- }
-
- literal_expression *expression::is_literal()
- {
- return nullptr;
- }
-
- type_expression::type_expression(const struct position position)
- : node(position)
- {
- }
-
- named_type_expression *type_expression::is_named()
- {
- return nullptr;
- }
-
- array_type_expression *type_expression::is_array()
- {
- return nullptr;
- }
-
- pointer_type_expression *type_expression::is_pointer()
- {
- return nullptr;
- }
-
- record_type_expression *type_expression::is_record()
- {
- return nullptr;
- }
-
- union_type_expression *type_expression::is_union()
- {
- return nullptr;
- }
-
- procedure_type_expression *type_expression::is_procedure()
- {
- return nullptr;
- }
-
- enumeration_type_expression *type_expression::is_enumeration()
- {
- return nullptr;
- }
-
- named_type_expression::named_type_expression(const struct position position, const std::string& name)
- : type_expression(position), name(name)
- {
- }
-
- void named_type_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- named_type_expression *named_type_expression::is_named()
- {
- return this;
- }
-
- array_type_expression::array_type_expression(const struct position position,
- type_expression *base, const std::uint32_t size)
- : type_expression(position), m_base(base), size(size)
- {
- }
-
- array_type_expression::~array_type_expression()
- {
- delete m_base;
- }
-
- void array_type_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- array_type_expression *array_type_expression::is_array()
- {
- return this;
- }
-
- type_expression& array_type_expression::base()
- {
- return *m_base;
- }
-
- pointer_type_expression::pointer_type_expression(const struct position position,
- type_expression *base)
- : type_expression(position), m_base(base)
- {
- }
-
- pointer_type_expression::~pointer_type_expression()
- {
- delete m_base;
- }
-
- void pointer_type_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- pointer_type_expression *pointer_type_expression::is_pointer()
- {
- return this;
- }
-
- type_expression& pointer_type_expression::base()
- {
- return *m_base;
- }
-
- record_type_expression::record_type_expression(const struct position position,
- std::vector&& fields)
- : type_expression(position), fields(std::move(fields))
- {
- }
-
- record_type_expression::~record_type_expression()
- {
- for (const field_declaration& field : this->fields)
- {
- delete field.second;
- }
- }
-
- void record_type_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- record_type_expression *record_type_expression::is_record()
- {
- return this;
- }
-
- union_type_expression::union_type_expression(const struct position position,
- std::vector&& fields)
- : type_expression(position), fields(std::move(fields))
- {
- }
-
- union_type_expression::~union_type_expression()
- {
- for (const field_declaration& field : this->fields)
- {
- delete field.second;
- }
- }
-
- void union_type_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- union_type_expression *union_type_expression::is_union()
- {
- return this;
- }
-
- variable_declaration::variable_declaration(const struct position position,
- std::vector&& identifier, std::shared_ptr variable_type,
- expression *body)
- : node(position), m_variable_type(variable_type), identifiers(std::move(identifier)), body(body)
- {
- }
-
- variable_declaration::variable_declaration(const struct position position,
- std::vector&& identifier, std::shared_ptr variable_type,
- std::monostate)
- : node(position), m_variable_type(variable_type), identifiers(std::move(identifier)), is_extern(true)
- {
- }
-
- void variable_declaration::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- bool variable_declaration::has_initializer() const
- {
- return this->is_extern || this->body != nullptr;
- }
-
- type_expression& variable_declaration::variable_type()
- {
- return *m_variable_type;
- }
-
- declaration::declaration(const struct position position, identifier_definition identifier)
- : node(position), identifier(identifier)
- {
- }
-
- constant_declaration::constant_declaration(const struct position position, identifier_definition identifier,
- expression *body)
- : declaration(position, identifier), m_body(body)
- {
- }
-
- void constant_declaration::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- expression& constant_declaration::body()
- {
- return *m_body;
- }
-
- constant_declaration::~constant_declaration()
- {
- delete m_body;
- }
-
- procedure_type_expression::procedure_type_expression(const struct position position, return_t return_type)
- : type_expression(position), return_type(return_type)
- {
- }
-
- procedure_type_expression::~procedure_type_expression()
- {
- if (return_type.proper_type != nullptr)
- {
- delete return_type.proper_type;
- }
- for (const type_expression *parameter : this->parameters)
- {
- delete parameter;
- }
- }
-
- void procedure_type_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- procedure_type_expression *procedure_type_expression::is_procedure()
- {
- return this;
- }
-
- enumeration_type_expression::enumeration_type_expression(const struct position position, std::vector&& members)
- : type_expression(position), members(members)
- {
- }
-
- void enumeration_type_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- enumeration_type_expression *enumeration_type_expression::is_enumeration()
- {
- return this;
- }
-
- procedure_declaration::procedure_declaration(const struct position position, identifier_definition identifier,
- procedure_type_expression *heading, block&& body)
- : declaration(position, identifier), m_heading(heading), body(std::move(body))
- {
- }
-
- procedure_declaration::procedure_declaration(const struct position position, identifier_definition identifier,
- procedure_type_expression *heading)
- : declaration(position, identifier), m_heading(heading), body(std::nullopt)
- {
- }
-
- void procedure_declaration::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- procedure_type_expression& procedure_declaration::heading()
- {
- return *m_heading;
- }
-
- procedure_declaration::~procedure_declaration()
- {
- delete m_heading;
- }
-
- type_declaration::type_declaration(const struct position position, identifier_definition identifier,
- type_expression *body)
- : declaration(position, identifier), m_body(body)
- {
- }
-
- type_declaration::~type_declaration()
- {
- delete m_body;
- }
-
- void type_declaration::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- type_expression& type_declaration::body()
- {
- return *m_body;
- }
-
- block::block(std::vector&& constants, std::vector&& variables,
- std::vector&& body)
- : m_variables(std::move(variables)), m_constants(std::move(constants)), m_body(std::move(body))
- {
- }
-
- block::block(block&& that)
- : m_variables(std::move(that.m_variables)), m_constants(std::move(that.m_constants)),
- m_body(std::move(that.m_body))
- {
- }
-
- block& block::operator=(block&& that)
- {
- std::swap(m_variables, that.m_variables);
- std::swap(m_constants, that.m_constants);
- std::swap(m_body, that.m_body);
-
- return *this;
- }
-
- const std::vector& block::variables()
- {
- return m_variables;
- }
-
- const std::vector& block::constants()
- {
- return m_constants;
- }
-
- const std::vector& block::body()
- {
- return m_body;
- }
-
- block::~block()
- {
- for (statement *body_statement : this->body())
- {
- delete body_statement;
- }
- for (variable_declaration *variable : this->variables())
- {
- delete variable;
- }
- for (constant_declaration *constant : this->constants())
- {
- delete constant;
- }
- }
-
- unit::unit(const struct position position)
- : node(position)
- {
- }
-
- void unit::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- unit::~unit()
- {
- for (procedure_declaration *procedure : this->procedures)
- {
- delete procedure;
- }
- for (variable_declaration *variable : this->variables)
- {
- delete variable;
- }
- for (type_declaration *type : this->types)
- {
- delete type;
- }
- for (constant_declaration *constant : this->constants)
- {
- delete constant;
- }
- for (import_declaration *declaration : this->imports)
- {
- delete declaration;
- }
- }
-
- program::program(const struct position position)
- : unit(position)
- {
- }
-
- void program::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- program::~program()
- {
- for (statement *body_statement : this->body)
- {
- delete body_statement;
- }
- }
-
- literal_expression::literal_expression()
- {
- }
-
- literal_expression *literal_expression::is_literal()
- {
- return this;
- }
-
- defer_statement::defer_statement(const struct position position, std::vector&& statements)
- : node(position), statements(std::move(statements))
- {
- }
-
- void defer_statement::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- defer_statement::~defer_statement()
- {
- for (statement *body_statement : statements)
- {
- delete body_statement;
- }
- }
-
- designator_expression::designator_expression()
- {
- }
-
- designator_expression::~designator_expression()
- {
- }
-
- designator_expression *designator_expression::is_designator()
- {
- return this;
- }
-
- void designator_expression::accept(parser_visitor *visitor)
- {
- if (variable_expression *node = is_variable())
- {
- return visitor->visit(node);
- }
- else if (array_access_expression *node = is_array_access())
- {
- return visitor->visit(node);
- }
- else if (field_access_expression *node = is_field_access())
- {
- return visitor->visit(node);
- }
- else if (dereference_expression *node = is_dereference())
- {
- return visitor->visit(node);
- }
- __builtin_unreachable();
- }
-
- variable_expression::variable_expression(const struct position position, const std::string& name)
- : node(position), name(name)
- {
- }
-
- void variable_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- variable_expression *variable_expression::is_variable()
- {
- return this;
- }
-
- array_access_expression::array_access_expression(const struct position position,
- expression *base, expression *index)
- : node(position), m_base(base), m_index(index)
- {
- }
-
- void array_access_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- expression& array_access_expression::index()
- {
- return *m_index;
- }
-
- expression& array_access_expression::base()
- {
- return *m_base;
- }
-
- array_access_expression *array_access_expression::is_array_access()
- {
- return this;
- }
-
- array_access_expression::~array_access_expression()
- {
- delete m_index;
- delete m_base;
- }
-
- field_access_expression::field_access_expression(const struct position position,
- expression *base, const std::string& field)
- : node(position), m_base(base), m_field(field)
- {
- }
-
- void field_access_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- expression& field_access_expression::base()
- {
- return *m_base;
- }
-
- std::string& field_access_expression::field()
- {
- return m_field;
- }
-
- field_access_expression *field_access_expression::is_field_access()
- {
- return this;
- }
-
- field_access_expression::~field_access_expression()
- {
- delete m_base;
- }
-
- dereference_expression::dereference_expression(const struct position position,
- expression *base)
- : node(position), m_base(base)
- {
- }
-
- void dereference_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- expression& dereference_expression::base()
- {
- return *m_base;
- }
-
- dereference_expression *dereference_expression::is_dereference()
- {
- return this;
- }
-
- dereference_expression::~dereference_expression()
- {
- delete m_base;
- }
-
- binary_expression::binary_expression(const struct position position, expression *lhs,
- expression *rhs, const binary_operator operation)
- : node(position), m_lhs(lhs), m_rhs(rhs), m_operator(operation)
- {
- }
-
- void binary_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- binary_expression *binary_expression::is_binary()
- {
- return this;
- }
-
- expression& binary_expression::lhs()
- {
- return *m_lhs;
- }
-
- expression& binary_expression::rhs()
- {
- return *m_rhs;
- }
-
- binary_operator binary_expression::operation() const
- {
- return m_operator;
- }
-
- binary_expression::~binary_expression()
- {
- delete m_lhs;
- delete m_rhs;
- }
-
- unary_expression::unary_expression(const struct position position, expression *operand,
- const unary_operator operation)
- : node(position), m_operand(std::move(operand)), m_operator(operation)
- {
- }
-
- void unary_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- unary_expression *unary_expression::is_unary()
- {
- return this;
- }
-
- expression& unary_expression::operand()
- {
- return *m_operand;
- }
-
- unary_operator unary_expression::operation() const
- {
- return this->m_operator;
- }
-
- unary_expression::~unary_expression()
- {
- delete m_operand;
- }
-
- procedure_call::procedure_call(const struct position position, designator_expression *callable)
- : node(position), m_callable(callable)
- {
- }
-
- void procedure_call::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- procedure_call *procedure_call::is_call_expression()
- {
- return this;
- }
-
- designator_expression& procedure_call::callable()
- {
- return *m_callable;
- }
-
- procedure_call::~procedure_call()
- {
- for (expression *const argument : arguments)
- {
- delete argument;
- }
- delete m_callable;
- }
-
- cast_expression::cast_expression(const struct position position, type_expression *target, expression *value)
- : node(position), m_target(target), m_value(value)
- {
- }
-
- void cast_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- cast_expression *cast_expression::is_cast()
- {
- return this;
- }
-
- type_expression& cast_expression::target()
- {
- return *m_target;
- }
-
- expression& cast_expression::value()
- {
- return *m_value;
- }
-
- cast_expression::~cast_expression()
- {
- delete m_target;
- delete m_value;
- }
-
- traits_expression::traits_expression(const struct position position, const std::string& name)
- : node(position), name(name)
- {
- }
-
- traits_expression::~traits_expression()
- {
- for (const type_expression *parameter : this->parameters)
- {
- delete parameter;
- }
- }
-
- void traits_expression::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- traits_expression *traits_expression::is_traits()
- {
- return this;
- }
-
- conditional_statements::conditional_statements(expression *prerequisite, std::vector&& statements)
- : m_prerequisite(prerequisite), statements(std::move(statements))
- {
- }
-
- expression& conditional_statements::prerequisite()
- {
- return *m_prerequisite;
- }
-
- conditional_statements::~conditional_statements()
- {
- delete m_prerequisite;
- for (auto statement : statements)
- {
- delete statement;
- }
- }
-
- return_statement::return_statement(const struct position position, expression *return_expression)
- : node(position), m_return_expression(return_expression)
- {
- }
-
- void return_statement::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- expression& return_statement::return_expression()
- {
- return *m_return_expression;
- }
-
- return_statement::~return_statement()
- {
- delete m_return_expression;
- }
-
- case_statement::case_statement(const struct position position,
- expression *condition, std::vector&& cases, std::vector *alternative)
- : node(position), m_condition(condition), cases(std::move(cases)), alternative(alternative)
- {
- }
-
- void case_statement::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- expression& case_statement::condition()
- {
- return *m_condition;
- }
-
- assign_statement::assign_statement(const struct position position, designator_expression *lvalue,
- expression *rvalue)
- : node(position), m_lvalue(lvalue), m_rvalue(rvalue)
- {
- }
-
- void assign_statement::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- variable_expression *designator_expression::is_variable()
- {
- return nullptr;
- }
-
- array_access_expression *designator_expression::is_array_access()
- {
- return nullptr;
- }
-
- field_access_expression *designator_expression::is_field_access()
- {
- return nullptr;
- }
-
- dereference_expression *designator_expression::is_dereference()
- {
- return nullptr;
- }
-
- designator_expression& assign_statement::lvalue()
- {
- return *m_lvalue;
- }
-
- expression& assign_statement::rvalue()
- {
- return *m_rvalue;
- }
-
- assign_statement::~assign_statement()
- {
- delete m_rvalue;
- }
-
- if_statement::if_statement(const struct position position, conditional_statements *body,
- std::vector&& branches,
- std::vector *alternative)
- : node(position), m_body(body), branches(std::move(branches)), alternative(alternative)
- {
- }
-
- void if_statement::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- conditional_statements& if_statement::body()
- {
- return *m_body;
- }
-
- if_statement::~if_statement()
- {
- delete m_body;
- for (const auto branch : branches)
- {
- delete branch;
- }
- delete this->alternative;
- }
-
- import_declaration::import_declaration(const struct position position, std::vector&& segments)
- : node(position), segments(std::move(segments))
- {
- }
-
- void import_declaration::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- while_statement::while_statement(const struct position position, conditional_statements *body,
- std::vector&& branches)
- : node(position), m_body(body), branches(std::move(branches))
- {
- }
-
- void while_statement::accept(parser_visitor *visitor)
- {
- visitor->visit(this);
- }
-
- conditional_statements& while_statement::body()
- {
- return *m_body;
- }
-
- while_statement::~while_statement()
- {
- delete m_body;
- for (const auto branch : branches)
- {
- delete branch;
- }
- }
-
- const char *print_binary_operator(const binary_operator operation)
- {
- switch (operation)
- {
- case binary_operator::sum:
- return "+";
- case binary_operator::subtraction:
- return "-";
- case binary_operator::multiplication:
- return "*";
- case binary_operator::division:
- return "/";
- case binary_operator::remainder:
- return "%";
- case binary_operator::equals:
- return "=";
- case binary_operator::not_equals:
- return "<>";
- case binary_operator::less:
- return "<";
- case binary_operator::less_equal:
- return "<=";
- case binary_operator::greater:
- return ">";
- case binary_operator::greater_equal:
- return ">=";
- case binary_operator::conjunction:
- return "and";
- case binary_operator::disjunction:
- return "or";
- case binary_operator::exclusive_disjunction:
- return "xor";
- case binary_operator::shift_left:
- return "<<";
- case binary_operator::shift_right:
- return ">>";
- }
- __builtin_unreachable();
- };
-}
diff --git a/frontend/driver.cc b/frontend/driver.cc
deleted file mode 100644
index 1c20d09..0000000
--- a/frontend/driver.cc
+++ /dev/null
@@ -1,124 +0,0 @@
-/* Parsing driver.
- Copyright (C) 2025 Free Software Foundation, Inc.
-
-GCC 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, or (at your option)
-any later version.
-
-GCC 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 GCC; see the file COPYING3. If not see
-. */
-
-#include "elna/frontend/driver.h"
-
-namespace elna::frontend
-{
- position make_position(const yy::location& location)
- {
- position result;
- result.line = static_cast(location.begin.line);
- result.column = static_cast(location.begin.column);
-
- return result;
- }
-
- syntax_error::syntax_error(const std::string& message,
- const char *input_file, const yy::location& location)
- : error(input_file, make_position(location)), message(message)
- {
- }
-
- std::string syntax_error::what() const
- {
- return message;
- }
-
- driver::driver(const char *input_file)
- : error_container(input_file)
- {
- }
-
- char escape_char(char escape)
- {
- switch (escape)
- {
- case 'n':
- return '\n';
- case 'a':
- return '\a';
- case 'b':
- return '\b';
- case 't':
- return '\t';
- case 'f':
- return '\f';
- case 'r':
- return '\r';
- case 'v':
- return '\v';
- case '\\':
- return '\\';
- case '\'':
- return '\'';
- case '"':
- return '"';
- case '?':
- return '\?';
- case '0':
- return '\0';
- default:
- return escape_invalid_char;
- }
- }
-
- std::optional escape_string(const char *escape)
- {
- std::string result;
- const char *current_position = escape + 1;
-
- while (*current_position != '\0')
- {
- if (*current_position == '\\' && *(current_position + 1) == 'x')
- {
- current_position += 2;
-
- std::size_t processed;
- char character = static_cast(std::stoi(current_position, &processed, 16));
- if (processed == 0)
- {
- return std::nullopt;
- }
- else
- {
- current_position += processed - 1;
- result.push_back(character);
- }
- }
- else if (*current_position == '\\')
- {
- ++current_position;
-
- char escape = escape_char(*current_position);
- if (escape == escape_invalid_char)
- {
- return std::nullopt;
- }
- result.push_back(escape);
- }
- else
- {
- result.push_back(*current_position);
- }
- ++current_position;
- }
- result.pop_back(); // Remove the terminating quote character.
-
- return result;
- }
-}
diff --git a/frontend/lexer.ll b/frontend/lexer.ll
deleted file mode 100644
index f14497b..0000000
--- a/frontend/lexer.ll
+++ /dev/null
@@ -1,320 +0,0 @@
-/* Lexical analyzer.
- Copyright (C) 2025 Free Software Foundation, Inc.
-
-GCC 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, or (at your option)
-any later version.
-
-GCC 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 GCC; see the file COPYING3. If not see
-. */
-
-%{
-#define YY_NO_UNISTD_H
-#define YY_USER_ACTION this->location.columns(yyleng);
-
-#include
-#include "parser.hh"
-
-#undef YY_DECL
-#define YY_DECL yy::parser::symbol_type elna::frontend::lexer::lex(driver& driver)
-#define yyterminate() return yy::parser::make_YYEOF(this->location)
-%}
-
-%option c++ noyywrap never-interactive
-%option yyclass="lexer"
-
-%x IN_COMMENT
-
-ID1 [A-Za-z_]
-ID2 [A-Za-z0-9_]
-HIGIT [0-9a-fA-F]
-BIGIT [01]
-
-%%
-%{
- this->location.step();
-%}
-
-{
- \*\) BEGIN(INITIAL);
- [^*\n]+ ; /* Eat comment in chunks. */
- \* ; /* Eat the lone star. */
- \n+ {
- this->location.lines(yyleng);
- this->location.step();
- }
-}
-\(\* BEGIN(IN_COMMENT);
-[ \t\r] {
- this->location.step();
-}
-\n+ {
- this->location.lines(yyleng);
-}
-if {
- return yy::parser::make_IF(this->location);
-}
-then {
- return yy::parser::make_THEN(this->location);
-}
-else {
- return yy::parser::make_ELSE(this->location);
-}
-elsif {
- return yy::parser::make_ELSIF(this->location);
-}
-while {
- return yy::parser::make_WHILE(this->location);
-}
-do {
- return yy::parser::make_DO(this->location);
-}
-proc {
- return yy::parser::make_PROCEDURE(this->location);
-}
-begin {
- return yy::parser::make_BEGIN_BLOCK(this->location);
- }
-end {
- return yy::parser::make_END_BLOCK(this->location);
-}
-extern {
- return yy::parser::make_EXTERN(this->location);
-}
-const {
- return yy::parser::make_CONST(this->location);
-}
-var {
- return yy::parser::make_VAR(this->location);
-}
-type {
- return yy::parser::make_TYPE(this->location);
-}
-record {
- return yy::parser::make_RECORD(this->location);
-}
-union {
- return yy::parser::make_UNION(this->location);
-}
-true {
- return yy::parser::make_BOOLEAN(true, this->location);
-}
-false {
- return yy::parser::make_BOOLEAN(false, this->location);
-}
-nil {
- return yy::parser::make_NIL(this->location);
-}
-\& {
- return yy::parser::make_AND(this->location);
-}
-xor {
- return yy::parser::make_XOR(this->location);
-}
-or {
- return yy::parser::make_OR(this->location);
-}
-\| {
- return yy::parser::make_PIPE(this->location);
-}
-\~ {
- return yy::parser::make_NOT(this->location);
-}
-return {
- return yy::parser::make_RETURN(this->location);
-}
-module {
- return yy::parser::make_MODULE(this->location);
-}
-program {
- return yy::parser::make_PROGRAM(this->location);
-}
-import {
- return yy::parser::make_IMPORT(this->location);
-}
-cast {
- return yy::parser::make_CAST(this->location);
-}
-defer {
- return yy::parser::make_DEFER(this->location);
-}
-case {
- return yy::parser::make_CASE(this->location);
-}
-of {
- return yy::parser::make_OF(this->location);
-}
-{ID1}{ID2}* {
- return yy::parser::make_IDENTIFIER(yytext, this->location);
-}
-#{ID1}{ID2}* {
- return yy::parser::make_TRAIT(yytext + 1, this->location);
-}
-[[:digit:]]+u {
- unsigned long result = strtoul(yytext, NULL, 10);
-
- if (errno == ERANGE)
- {
- REJECT;
- }
- else
- {
- return yy::parser::make_WORD(result, this->location);
- }
-}
-[[:digit:]]+ {
- long result = strtol(yytext, NULL, 10);
-
- if (errno == ERANGE)
- {
- REJECT;
- }
- else
- {
- return yy::parser::make_INTEGER(result, this->location);
- }
-}
-0x{HIGIT}+ {
- unsigned long result = strtoul(yytext, NULL, 16);
-
- if (errno == ERANGE)
- {
- REJECT;
- }
- else
- {
- return yy::parser::make_WORD(result, this->location);
- }
-}
-0b{BIGIT}+ {
- unsigned long result = strtoul(yytext, NULL, 2);
-
- if (errno == ERANGE)
- {
- REJECT;
- }
- else
- {
- return yy::parser::make_WORD(result, this->location);
- }
-}
-[[:digit:]]+\.[[:digit:]]+ {
- float result = strtof(yytext, NULL);
-
- if (errno == ERANGE)
- {
- REJECT;
- }
- else
- {
- return yy::parser::make_FLOAT(result, this->location);
- }
-}
-'[[:print:]]+' {
- std::optional result = escape_string(yytext);
- if (!result.has_value() || result.value().size() != 1)
- {
- REJECT;
- }
- return yy::parser::make_CHARACTER(result.value(), this->location);
-}
-\"[[:print:]]*\" {
- std::optional result = escape_string(yytext);
- if (!result.has_value())
- {
- REJECT;
- }
- return yy::parser::make_STRING(result.value(), this->location);
-}
-\( {
- return yy::parser::make_LEFT_PAREN(this->location);
-}
-\) {
- return yy::parser::make_RIGHT_PAREN(this->location);
-}
-\[ {
- return yy::parser::make_LEFT_SQUARE(this->location);
-}
-\] {
- return yy::parser::make_RIGHT_SQUARE(this->location);
-}
-\<\< {
- return yy::parser::make_SHIFT_LEFT(this->location);
-}
-\>\> {
- return yy::parser::make_SHIFT_RIGHT(this->location);
-}
-\>= {
- return yy::parser::make_GREATER_EQUAL(this->location);
-}
-\<= {
- return yy::parser::make_LESS_EQUAL(this->location);
-}
-\> {
- return yy::parser::make_GREATER_THAN(this->location);
-}
-\< {
- return yy::parser::make_LESS_THAN(this->location);
-}
-\<\> {
- return yy::parser::make_NOT_EQUAL(this->location);
-}
-= {
- return yy::parser::make_EQUALS(this->location);
-}
-; {
- return yy::parser::make_SEMICOLON(this->location);
-}
-\. {
- return yy::parser::make_DOT(this->location);
-}
-, {
- return yy::parser::make_COMMA(this->location);
-}
-\+ {
- return yy::parser::make_PLUS(this->location);
-}
-\-> {
- return yy::parser::make_ARROW(this->location);
-}
-\- {
- return yy::parser::make_MINUS(this->location);
-}
-\* {
- return yy::parser::make_MULTIPLICATION(this->location);
-}
-\/ {
- return yy::parser::make_DIVISION(this->location);
-}
-% {
- return yy::parser::make_REMAINDER(this->location);
-}
-:= {
- return yy::parser::make_ASSIGNMENT(this->location);
-}
-: {
- return yy::parser::make_COLON(this->location);
-}
-\^ {
- return yy::parser::make_HAT(this->location);
-}
-@ {
- return yy::parser::make_AT(this->location);
-}
-! {
- return yy::parser::make_EXCLAMATION(this->location);
-}
-. {
- std::stringstream ss;
-
- ss << "Illegal character 0x" << std::hex << static_cast(yytext[0]);
- driver.add_error(ss.str(), driver.input_file, this->location);
-}
-%%
diff --git a/frontend/parser.yy b/frontend/parser.yy
deleted file mode 100644
index bace8d7..0000000
--- a/frontend/parser.yy
+++ /dev/null
@@ -1,594 +0,0 @@
-/* Syntax analyzer.
- Copyright (C) 2025 Free Software Foundation, Inc.
-
-GCC 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, or (at your option)
-any later version.
-
-GCC 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 GCC; see the file COPYING3. If not see
-. */
-
-%require "3.4"
-%language "c++"
-
-%code {
- using namespace elna;
-}
-
-%code requires {
- #include
- #include
- #include "elna/frontend/driver.h"
-
- #if !defined(yyFlexLexerOnce)
- #include
- #endif
-
- namespace elna::frontend
- {
- class lexer;
- }
-}
-
-%code provides {
- namespace elna::frontend
- {
-
- class lexer: public yyFlexLexer
- {
- public:
- yy::location location;
-
- lexer(std::istream& arg_yyin)
- : yyFlexLexer(&arg_yyin)
- {
- }
-
- yy::parser::symbol_type lex(driver& driver);
- };
-
- }
-}
-
-%define api.token.raw
-%define api.token.constructor
-%define api.value.type variant
-
-%parse-param {elna::frontend::lexer& lexer}
-%param {elna::frontend::driver& driver}
-%locations
-
-%header
-
-%code {
- #define yylex lexer.lex
-}
-%start program;
-
-%token IDENTIFIER
-%token TRAIT
-%token INTEGER
-%token WORD
-%token FLOAT
-%token CHARACTER
-%token STRING
-%token BOOLEAN
-%token LEFT_PAREN "(" RIGHT_PAREN ")" LEFT_SQUARE "[" RIGHT_SQUARE "]"
-%token ASSIGNMENT ":="
- ARROW "->" EXCLAMATION "!"
- AT "@" HAT "^"
- COLON ":" SEMICOLON ";" DOT "." COMMA ","
-%token NOT "~"
- CAST "cast"
- NIL "nil"
- CONST "const"
- VAR "var"
- PROCEDURE "proc"
- TYPE "type"
- RECORD "record"
- UNION "union"
- EXTERN "extern"
- IF "if"
- WHILE "while"
- DO "do"
- THEN "then"
- ELSE "else"
- ELSIF "elsif"
- RETURN "return"
- PROGRAM "program"
- MODULE "module"
- IMPORT "import"
- BEGIN_BLOCK "begin"
- END_BLOCK "end"
- DEFER "defer"
- CASE "case"
- OF "of"
- PIPE "|"
-%token OR "or" AND "&" XOR "xor"
- EQUALS "=" NOT_EQUAL "<>" LESS_THAN "<" GREATER_THAN ">" LESS_EQUAL "<=" GREATER_EQUAL ">="
- SHIFT_LEFT "<<" SHIFT_RIGHT ">>"
- PLUS "+" MINUS "-"
- MULTIPLICATION "*" DIVISION "/" REMAINDER "%"
-
-%left "or" "&" "xor"
-%left "=" "<>" "<" ">" "<=" ">="
-%left "<<" ">>"
-%left "+" "-"
-%left "*" "/" "%"
-
-%type literal;
-%type > case_labels;
-%type switch_case;
-%type > switch_cases;
-%type constant_declaration;
-%type > constant_part constant_declarations;
-%type variable_declaration;
-%type > variable_declarations variable_part;
-%type type_expression;
-%type > type_expressions;
-%type traits_expression;
-%type expression operand simple_expression;
-%type unary_expression;
-%type binary_expression;
-%type > expressions actual_parameter_list;
-%type designator_expression;
-%type call_expression;
-%type return_statement;
-%type statement;
-%type > required_statements optional_statements statement_part;
-%type procedure_declaration;
-%type , elna::frontend::procedure_type_expression *>> procedure_heading;
-%type return_declaration;
-%type > procedure_declarations procedure_part;
-%type type_declaration;
-%type > type_declarations type_part;
-%type > block;
-%type field_declaration formal_parameter;
-%type >>
- optional_fields required_fields formal_parameters formal_parameter_list;
-%type > elsif_then_statements elsif_do_statements;
-%type *> else_statements;
-%type cast_expression;
-%type identifier_definition;
-%type > identifier_definitions;
-%type > identifiers import_declaration;
-%type > import_declarations import_part;
-%%
-program:
- "program" ";" import_part constant_part type_part variable_part procedure_part statement_part "end" "."
- {
- auto tree = new frontend::program(frontend::make_position(@1));
-
- std::swap(tree->imports, $3);
- std::swap(tree->constants, $4);
- std::swap(tree->types , $5);
- std::swap(tree->variables, $6);
- std::swap(tree->procedures, $7);
- std::swap(tree->body, $8);
-
- driver.tree.reset(tree);
- }
- | "module" ";" import_part constant_part type_part variable_part procedure_part "end" "."
- {
- auto tree = new frontend::unit(frontend::make_position(@1));
-
- std::swap(tree->imports, $3);
- std::swap(tree->constants, $4);
- std::swap(tree->types , $5);
- std::swap(tree->variables, $6);
- std::swap(tree->procedures, $7);
-
- driver.tree.reset(tree);
- }
-block: constant_part variable_part statement_part "end"
- {
- $$ = std::make_unique(std::move($1), std::move($2), std::move($3));
- }
-statement_part:
- /* no statements */ {}
- | "begin" required_statements { std::swap($$, $2); }
- | return_statement { $$.push_back($1); }
- | "begin" required_statements ";" return_statement
- {
- std::swap($$, $2);
- $$.push_back($4);
- }
-identifier_definition:
- IDENTIFIER "*" { $$ = frontend::identifier_definition{ $1, true }; }
- | IDENTIFIER { $$ = frontend::identifier_definition{ $1, false }; }
-identifier_definitions:
- identifier_definition "," identifier_definitions
- {
- std::swap($$, $3);
- $$.emplace($$.cbegin(), $1);
- }
- | identifier_definition { $$.emplace_back(std::move($1)); }
-return_declaration:
- /* proper procedure */ {}
- | "->" "!" { $$ = frontend::procedure_type_expression::return_t(std::monostate{}); }
- | "->" type_expression { $$ = frontend::procedure_type_expression::return_t($2); }
-procedure_heading: formal_parameter_list return_declaration
- {
- $$.second = new frontend::procedure_type_expression(frontend::make_position(@1), std::move($2));
- for (auto& [name, type] : $1)
- {
- $$.first.emplace_back(std::move(name));
- $$.second->parameters.push_back(type);
- }
- }
-procedure_declaration:
- "proc" identifier_definition procedure_heading ";" block ";"
- {
- $$ = new frontend::procedure_declaration(frontend::make_position(@1), std::move($2), $3.second, std::move(*$5));
- std::swap($3.first, $$->parameter_names);
- }
- | "proc" identifier_definition procedure_heading ";" "extern" ";"
- {
- $$ = new frontend::procedure_declaration(frontend::make_position(@1), std::move($2), $3.second);
- std::swap($3.first, $$->parameter_names);
- }
-procedure_declarations:
- procedure_declaration procedure_declarations
- {
- std::swap($$, $2);
- $$.emplace($$.cbegin(), std::move($1));
- }
- | procedure_declaration { $$.emplace_back(std::move($1)); }
-procedure_part:
- /* no procedure definitions */ {}
- | procedure_declarations { std::swap($$, $1); }
-call_expression: designator_expression actual_parameter_list
- {
- $$ = new frontend::procedure_call(frontend::make_position(@1), $1);
- std::swap($$->arguments, $2);
- }
-cast_expression: "cast" "(" expression ":" type_expression ")"
- { $$ = new frontend::cast_expression(frontend::make_position(@1), $5, $3); }
-elsif_do_statements:
- "elsif" expression "do" optional_statements elsif_do_statements
- {
- frontend::conditional_statements *branch = new frontend::conditional_statements($2, std::move($4));
- std::swap($5, $$);
- $$.emplace($$.begin(), branch);
- }
- | {}
-else_statements:
- "else" optional_statements { $$ = new std::vector(std::move($2)); }
- | { $$ = nullptr; }
-elsif_then_statements:
- "elsif" expression "then" optional_statements elsif_then_statements
- {
- frontend::conditional_statements *branch = new frontend::conditional_statements($2, std::move($4));
- std::swap($5, $$);
- $$.emplace($$.begin(), branch);
- }
- | {}
-return_statement: "return" expression
- { $$ = new frontend::return_statement(frontend::make_position(@1), $2); }
-literal:
- INTEGER { $$ = new frontend::literal(frontend::make_position(@1), $1); }
- | WORD { $$ = new frontend::literal(frontend::make_position(@1), $1); }
- | FLOAT { $$ = new frontend::literal(frontend::make_position(@1), $1); }
- | BOOLEAN { $$ = new frontend::literal(frontend::make_position(@1), $1); }
- | CHARACTER { $$ = new frontend::literal(frontend::make_position(@1), $1.at(0)); }
- | "nil" { $$ = new frontend::literal(frontend::make_position(@1), nullptr); }
- | STRING { $$ = new frontend::literal(frontend::make_position(@1), $1); }
-traits_expression:
- TRAIT "(" type_expressions ")"
- {
- $$ = new frontend::traits_expression(frontend::make_position(@1), $1);
- std::swap($3, $$->parameters);
- }
-simple_expression:
- literal { $$ = $1; }
- | designator_expression { $$ = $1; }
- | traits_expression { $$ = $1; }
- | cast_expression { $$ = $1; }
- | call_expression { $$ = $1; }
- | "(" expression ")" { $$ = $2; }
-operand:
- unary_expression { $$ = $1; }
- | simple_expression { $$ = $1; }
-expression:
- binary_expression { $$ = $1; }
- | operand { $$ = $1; }
-binary_expression:
- expression "*" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::multiplication);
- }
- | expression "/" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::division);
- }
- | expression "%" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::remainder);
- }
- | expression "+" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::sum);
- }
- | expression "-" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::subtraction);
- }
- | expression "=" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::equals);
- }
- | expression "<>" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::not_equals);
- }
- | expression "<" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::less);
- }
- | expression ">" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::greater);
- }
- | expression "<=" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3,
- frontend::binary_operator::less_equal);
- }
- | expression ">=" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::greater_equal);
- }
- | expression "&" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::conjunction);
- }
- | expression "or" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::disjunction);
- }
- | expression "xor" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3,
- frontend::binary_operator::exclusive_disjunction);
- }
- | expression "<<" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::shift_left);
- }
- | expression ">>" expression
- {
- $$ = new frontend::binary_expression(frontend::make_position(@2), $1, $3, frontend::binary_operator::shift_right);
- }
-unary_expression:
- "@" operand
- {
- $$ = new frontend::unary_expression(frontend::make_position(@1), $2, frontend::unary_operator::reference);
- }
- | "~" operand
- {
- $$ = new frontend::unary_expression(frontend::make_position(@1), $2, frontend::unary_operator::negation);
- }
- | "-" operand
- {
- $$ = new frontend::unary_expression(frontend::make_position(@1), $2, frontend::unary_operator::minus);
- }
-expressions:
- expression "," expressions
- {
- std::swap($$, $3);
- $$.emplace($$.cbegin(), $1);
- }
- | expression { $$.push_back($1); }
-type_expressions:
- type_expression "," type_expressions
- {
- std::swap($$, $3);
- $$.emplace($$.cbegin(), $1);
- }
- | type_expression { $$.push_back($1); }
-designator_expression:
- simple_expression "[" expression "]"
- { $$ = new frontend::array_access_expression(frontend::make_position(@2), $1, $3); }
- | simple_expression "." IDENTIFIER
- { $$ = new frontend::field_access_expression(frontend::make_position(@2), $1, $3); }
- | simple_expression "^"
- { $$ = new frontend::dereference_expression(frontend::make_position(@1), $1); }
- | IDENTIFIER
- { $$ = new frontend::variable_expression(frontend::make_position(@1), $1); }
-statement:
- designator_expression ":=" expression
- { $$ = new frontend::assign_statement(frontend::make_position(@1), $1, $3); }
- | "while" expression "do" optional_statements elsif_do_statements "end"
- {
- frontend::conditional_statements *body = new frontend::conditional_statements($2, std::move($4));
- $$ = new frontend::while_statement(frontend::make_position(@1), body, std::move($5));
- }
- | "if" expression "then" optional_statements elsif_then_statements else_statements "end"
- {
- frontend::conditional_statements *then = new frontend::conditional_statements($2, std::move($4));
- $$ = new frontend::if_statement(frontend::make_position(@1), then, std::move($5), $6);
- }
- | call_expression { $$ = $1; }
- | "defer" optional_statements "end"
- { $$ = new frontend::defer_statement(frontend::make_position(@1), std::move($2)); }
- | "case" expression "of" switch_cases else_statements "end"
- { $$ = new frontend::case_statement(frontend::make_position(@1), $2, std::move($4), $5); }
-switch_case: case_labels ":" optional_statements
- { $$ = { .labels = std::move($1), .statements = std::move($3) }; }
-switch_cases:
- switch_case "|" switch_cases
- {
- std::swap($$, $3);
- $$.emplace($$.cbegin(), $1);
- }
- | switch_case { $$.push_back($1); }
-case_labels:
- expression "," case_labels
- {
- std::swap($$, $3);
- $$.emplace($$.cbegin(), $1);
- }
- | expression { $$.push_back($1); }
-required_statements:
- required_statements ";" statement
- {
- std::swap($$, $1);
- $$.insert($$.cend(), $3);
- }
- | statement { $$.push_back($1); }
-optional_statements:
- required_statements { std::swap($$, $1); }
- | /* no statements */ {}
-field_declaration:
- IDENTIFIER ":" type_expression { $$ = std::make_pair($1, $3); }
-required_fields:
- field_declaration ";" required_fields
- {
- std::swap($$, $3);
- $$.emplace($$.cbegin(), $1);
- }
- | field_declaration { $$.emplace_back($1); }
-optional_fields:
- required_fields { std::swap($$, $1); }
- | /* no fields */ {}
-type_expression:
- "[" INTEGER "]" type_expression
- {
- $$ = new frontend::array_type_expression(frontend::make_position(@1), $4, $2);
- }
- | "^" type_expression
- {
- $$ = new frontend::pointer_type_expression(frontend::make_position(@1), $2);
- }
- | "record" optional_fields "end"
- {
- $$ = new frontend::record_type_expression(frontend::make_position(@1), std::move($2));
- }
- | "union" required_fields "end"
- {
- $$ = new frontend::union_type_expression(frontend::make_position(@1), std::move($2));
- }
- | "proc" "(" type_expressions ")" return_declaration
- {
- auto result = new frontend::procedure_type_expression(frontend::make_position(@1), std::move($5));
- std::swap(result->parameters, $3);
- $$ = result;
- }
- | "(" identifiers ")"
- {
- $$ = new frontend::enumeration_type_expression(frontend::make_position(@1), std::move($2));
- }
- | IDENTIFIER
- {
- $$ = new frontend::named_type_expression(frontend::make_position(@1), $1);
- }
-identifiers:
- IDENTIFIER "," identifiers
- {
- std::swap($$, $3);
- $$.emplace($$.cbegin(), std::move($1));
- }
- | IDENTIFIER { $$.emplace_back(std::move($1)); }
-variable_declaration:
- identifier_definitions ":" type_expression ";"
- {
- std::shared_ptr shared_type{ $3 };
- $$ = new frontend::variable_declaration( frontend::make_position(@2), std::move($1), shared_type);
- }
- | identifier_definitions ":" type_expression ":=" "extern" ";"
- {
- std::shared_ptr shared_type{ $3 };
- $$ = new frontend::variable_declaration( frontend::make_position(@2), std::move($1), shared_type,
- std::monostate{});
- }
- | identifier_definitions ":" type_expression ":=" expression ";"
- {
- std::shared_ptr shared_type{ $3 };
- $$ = new frontend::variable_declaration( frontend::make_position(@2), std::move($1), shared_type, $5);
- }
-variable_declarations:
- /* no variable declarations */ {}
- | variable_declaration variable_declarations
- {
- std::swap($$, $2);
- $$.insert(std::cbegin($$), $1);
- }
-variable_part:
- /* no variable declarations */ {}
- | "var" variable_declarations { std::swap($$, $2); }
-constant_declaration: identifier_definition ":=" expression ";"
- {
- $$ = new frontend::constant_declaration(frontend::make_position(@1), std::move($1), $3);
- }
-constant_declarations:
- constant_declaration constant_declarations
- {
- std::swap($$, $2);
- $$.insert(std::cbegin($$), $1);
- }
- | /* no constant definitions */ {}
-constant_part:
- /* no constant definitions */ {}
- | "const" constant_declarations { std::swap($$, $2); }
-import_declaration:
- IDENTIFIER "." import_declaration
- {
- std::swap($$, $3);
- $$.emplace($$.cbegin(), std::move($1));
- }
- | IDENTIFIER { $$.emplace_back(std::move($1)); }
-import_declarations:
- import_declaration "," import_declarations
- {
- std::swap($$, $3);
- $$.emplace($$.cbegin(), new frontend::import_declaration(frontend::make_position(@1), std::move($1)));
- }
- | import_declaration
- {
- $$.emplace_back(new frontend::import_declaration(frontend::make_position(@1), std::move($1)));
- }
-import_part:
- /* no import declarations */ {}
- | "import" import_declarations ";" { std::swap($$, $2); }
-type_declaration: identifier_definition "=" type_expression ";"
- {
- $$ = new frontend::type_declaration(frontend::make_position(@1), std::move($1), $3);
- }
-type_declarations:
- type_declaration type_declarations
- {
- std::swap($$, $2);
- $$.insert($$.cbegin(), $1);
- }
- | /* no type definitions */ {}
-type_part:
- /* no type definitions */ {}
- | "type" type_declarations { std::swap($$, $2); }
-formal_parameter:
- IDENTIFIER ":" type_expression { $$ = std::make_pair($1, $3); }
-formal_parameter_list:
- "(" ")" {}
- | "(" formal_parameters ")" { std::swap($$, $2); }
-formal_parameters:
- formal_parameter "," formal_parameters
- {
- std::swap($$, $3);
- $$.emplace($$.cbegin(), std::move($1));
- }
- | formal_parameter { $$.emplace_back(std::move($1)); }
-actual_parameter_list:
- "(" ")" {}
- | "(" expressions ")" { std::swap($$, $2); }
-%%
-
-void yy::parser::error(const location_type& loc, const std::string& message)
-{
- driver.add_error(message, driver.input_file, loc);
-}
diff --git a/frontend/result.cc b/frontend/result.cc
deleted file mode 100644
index aca9c5e..0000000
--- a/frontend/result.cc
+++ /dev/null
@@ -1,67 +0,0 @@
-/* Miscellaneous types used across stage boundaries.
- Copyright (C) 2025 Free Software Foundation, Inc.
-
-GCC 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, or (at your option)
-any later version.
-
-GCC 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 GCC; see the file COPYING3. If not see
-. */
-
-#include "elna/frontend/result.h"
-
-namespace elna::frontend
-{
- error::error(const char *path, const struct position position)
- : position(position), path(path)
- {
- }
-
- std::size_t error::line() const noexcept
- {
- return this->position.line;
- }
-
- std::size_t error::column() const noexcept
- {
- return this->position.column;
- }
-
- error_container::error_container(const char *input_file)
- : input_file(input_file)
- {
- }
-
- std::deque>& error_container::errors()
- {
- return m_errors;
- }
-
- bool error_container::has_errors() const
- {
- return !m_errors.empty();
- }
-
- bool identifier_definition::operator==(const identifier_definition& that) const
- {
- return *this == that.name;
- }
-
- bool identifier_definition::operator==(const std::string& that) const
- {
- return this->name == that;
- }
-}
-
-std::size_t std::hash::operator()(
- const elna::frontend::identifier_definition& key) const
-{
- return std::hash{}(key.name);
-}
diff --git a/frontend/symbol.cc b/frontend/symbol.cc
deleted file mode 100644
index bfecbd4..0000000
--- a/frontend/symbol.cc
+++ /dev/null
@@ -1,427 +0,0 @@
-/* Symbol definitions.
- Copyright (C) 2025 Free Software Foundation, Inc.
-
-GCC 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, or (at your option)
-any later version.
-
-GCC 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 GCC; see the file COPYING3. If not see
-. */
-
-#include "elna/frontend/symbol.h"
-
-namespace elna::frontend
-{
- type::type()
- {
- }
-
- type::type(std::shared_ptr alias)
- : tag(type_tag::alias), alias(alias)
- {
- }
-
- type::type(std::shared_ptr primitive)
- : tag(type_tag::primitive), primitive(primitive)
- {
- }
-
- type::type(std::shared_ptr record)
- : tag(type_tag::record), record(record)
- {
- }
-
- type::type(std::shared_ptr _union)
- : tag(type_tag::_union), _union(_union)
- {
- }
-
- type::type(std::shared_ptr pointer)
- : tag(type_tag::pointer), pointer(pointer)
- {
- }
-
- type::type(std::shared_ptr array)
- : tag(type_tag::array), array(array)
- {
- }
-
- type::type(std::shared_ptr procedure)
- : tag(type_tag::procedure), procedure(procedure)
- {
- }
-
- type::type(std::shared_ptr enumeration)
- : tag(type_tag::enumeration), enumeration(enumeration)
- {
- }
-
- void type::copy(const type& other)
- {
- switch (other.tag)
- {
- case type_tag::empty:
- break;
- case type_tag::alias:
- new (&alias) std::weak_ptr(other.alias);
- break;
- case type_tag::primitive:
- new (&primitive) std::shared_ptr(other.primitive);
- break;
- case type_tag::record:
- new (&record) std::shared_ptr(other.record);
- break;
- case type_tag::_union:
- new (&_union) std::shared_ptr(other._union);
- break;
- case type_tag::pointer:
- new (&pointer) std::shared_ptr(other.pointer);
- break;
- case type_tag::array:
- new (&array) std::shared_ptr(other.array);
- break;
- case type_tag::procedure:
- new (&procedure) std::shared_ptr(other.procedure);
- break;
- case type_tag::enumeration:
- new (&enumeration) std::shared_ptr(other.enumeration);
- break;
- }
- }
-
- type::type(const type& other)
- : tag(other.tag)
- {
- copy(other);
- }
-
- void type::move(type&& other)
- {
- switch (other.tag)
- {
- case type_tag::empty:
- break;
- case type_tag::alias:
- new (&alias) std::weak_ptr(std::move(other.alias));
- break;
- case type_tag::primitive:
- new (&primitive) std::shared_ptr(std::move(other.primitive));
- break;
- case type_tag::record:
- new (&record) std::shared_ptr(std::move(other.record));
- break;
- case type_tag::_union:
- new (&_union) std::shared_ptr(std::move(other._union));
- break;
- case type_tag::pointer:
- new (&pointer) std::shared_ptr(std::move(other.pointer));
- break;
- case type_tag::array:
- new (&array) std::shared_ptr(std::move(other.array));
- break;
- case type_tag::procedure:
- new (&procedure) std::shared_ptr(std::move(other.procedure));
- break;
- case type_tag::enumeration:
- new (&enumeration) std::shared_ptr(std::move(other.enumeration));
- break;
- }
- }
-
- type& type::operator=(const type& other)
- {
- this->~type();
- this->tag = other.tag;
- copy(other);
- return *this;
- }
-
- type::type(type&& other)
- : tag(other.tag)
- {
- move(std::move(other));
- }
-
- type& type::operator=(type&& other)
- {
- this->~type();
- this->tag = other.tag;
- move(std::move(other));
- return *this;
- }
-
- bool type::operator==(const std::nullptr_t&)
- {
- return empty();
- }
-
- type::~type()
- {
- switch (tag)
- {
- case type_tag::empty:
- break;
- case type_tag::alias:
- this->alias.~weak_ptr();
- break;
- case type_tag::primitive:
- this->primitive.~shared_ptr();
- break;
- case type_tag::record:
- this->record.~shared_ptr();
- break;
- case type_tag::_union:
- this->_union.~shared_ptr();
- break;
- case type_tag::pointer:
- this->pointer.~shared_ptr();
- break;
- case type_tag::array:
- this->array.~shared_ptr();
- break;
- case type_tag::procedure:
- this->procedure.~shared_ptr();
- break;
- case type_tag::enumeration:
- this->enumeration.~shared_ptr();
- break;
- }
- }
-
- template<>
- std::shared_ptr type::get() const
- {
- return tag == type_tag::alias ? this->alias.lock() : nullptr;
- }
-
- template<>
- std::shared_ptr type::get() const
- {
- return tag == type_tag::primitive ? this->primitive : nullptr;
- }
-
- template<>
- std::shared_ptr type::get() const
- {
- return tag == type_tag::record ? this->record : nullptr;
- }
-
- template<>
- std::shared_ptr type::get() const
- {
- return tag == type_tag::_union ? this->_union : nullptr;
- }
-
- template<>
- std::shared_ptr type::get() const
- {
- return tag == type_tag::pointer ? this->pointer : nullptr;
- }
-
- template<>
- std::shared_ptr type::get() const
- {
- return tag == type_tag::array ? this->array : nullptr;
- }
-
- template<>
- std::shared_ptr type::get() const
- {
- return tag == type_tag::procedure ? this->procedure : nullptr;
- }
-
- template<>
- std::shared_ptr type::get() const
- {
- return tag == type_tag::enumeration ? this->enumeration : nullptr;
- }
-
- bool type::empty() const
- {
- return tag == type_tag::empty;
- }
-
- alias_type::alias_type(const std::string& name)
- : name(name), reference()
- {
- }
-
- pointer_type::pointer_type(type base)
- : base(base)
- {
- }
-
- array_type::array_type(type base, std::uint64_t size)
- : base(base), size(size)
- {
- }
-
- primitive_type::primitive_type(const std::string& identifier)
- : identifier(identifier)
- {
- }
-
- procedure_type::procedure_type(return_t return_type)
- : return_type(return_type)
- {
- }
-
- enumeration_type::enumeration_type(const std::vector& members)
- : members(members)
- {
- }
-
- info::~info()
- {
- }
-
- std::shared_ptr info::is_type()
- {
- return nullptr;
- }
-
- std::shared_ptr info::is_procedure()
- {
- return nullptr;
- }
-
- std::shared_ptr info::is_constant()
- {
- return nullptr;
- }
-
- std::shared_ptr info::is_variable()
- {
- return nullptr;
- }
-
- type_info::type_info(const type symbol)
- : symbol(symbol)
- {
- }
-
- std::shared_ptr type_info::is_type()
- {
- return std::static_pointer_cast(shared_from_this());
- }
-
- procedure_info::procedure_info(const procedure_type symbol, const std::vector names,
- std::shared_ptr scope)
- : symbol(symbol), names(names), scope(scope)
- {
- }
-
- std::shared_ptr procedure_info::is_procedure()
- {
- return std::static_pointer_cast(shared_from_this());
- }
-
- bool procedure_info::is_extern() const
- {
- return this->scope == nullptr;
- }
-
- constant_info::constant_info(const variant& symbol)
- : symbol(symbol)
- {
- }
-
- std::shared_ptr constant_info::is_constant()
- {
- return std::static_pointer_cast(shared_from_this());
- }
-
- variable_info::variable_info(const type symbol, bool is_extern)
- : symbol(symbol), is_extern(is_extern)
- {
- }
-
- std::shared_ptr variable_info::is_variable()
- {
- return std::static_pointer_cast(shared_from_this());
- }
-
- std::shared_ptr builtin_symbol_table()
- {
- auto result = std::make_shared();
-
- result->enter("Int", std::make_shared(type(std::make_shared("Int"))));
- result->enter("Word", std::make_shared(type(std::make_shared("Word"))));
- result->enter("Char", std::make_shared(type(std::make_shared("Char"))));
- result->enter("Bool", std::make_shared(type(std::make_shared("Bool"))));
- result->enter("Pointer", std::make_shared(type(std::make_shared("Pointer"))));
- result->enter("Float", std::make_shared(type(std::make_shared("Float"))));
- result->enter("String", std::make_shared(type(std::make_shared("String"))));
-
- return result;
- }
-
- symbol_bag::symbol_bag(forward_table&& unresolved, std::shared_ptr global_table)
- : unresolved(unresolved)
- {
- this->symbols = std::make_shared(global_table);
- }
-
- std::shared_ptr symbol_bag::lookup(const std::string& name)
- {
- for (auto import_bag : this->imports)
- {
- if (auto result = import_bag->lookup(name))
- {
- return result;
- }
- }
- return this->symbols->lookup(name);
- }
-
- bool symbol_bag::enter(const std::string& name, std::shared_ptr entry)
- {
- return this->symbols->enter(name, entry);
- }
-
- std::shared_ptr symbol_bag::enter()
- {
- this->symbols = std::make_shared(this->symbols);
- return this->symbols;
- }
-
- void symbol_bag::enter(std::shared_ptr child)
- {
- this->symbols = child;
- }
-
- std::shared_ptr symbol_bag::leave()
- {
- std::shared_ptr result = this->symbols;
-
- this->symbols = result->scope();
- return result;
- }
-
- std::shared_ptr symbol_bag::declared(const std::string& symbol_name)
- {
- auto unresolved_alias = this->unresolved.find(symbol_name);
-
- return unresolved_alias == this->unresolved.end() ? std::shared_ptr() : unresolved_alias->second;
- }
-
- std::shared_ptr symbol_bag::resolve(const std::string& symbol_name, type& resolution)
- {
- auto unresolved_declaration = this->unresolved.at(symbol_name);
-
- unresolved_declaration->reference = resolution;
- return unresolved_declaration;
- }
-
- void symbol_bag::add_import(const symbol_bag& bag)
- {
- this->imports.push_front(bag.symbols);
- }
-}
diff --git a/include/elna/frontend/ast.h b/include/elna/frontend/ast.h
deleted file mode 100644
index bbb8a36..0000000
--- a/include/elna/frontend/ast.h
+++ /dev/null
@@ -1,815 +0,0 @@
-/* Abstract syntax tree representation.
- Copyright (C) 2025 Free Software Foundation, Inc.
-
-GCC 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, or (at your option)
-any later version.
-
-GCC 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 GCC; see the file COPYING3. If not see
-. */
-
-#pragma once
-
-#include
-#include
-#include
-#include
-#include
-#include "elna/frontend/symbol.h"
-#include "elna/frontend/result.h"
-
-namespace elna::frontend
-{
- enum class binary_operator
- {
- sum,
- subtraction,
- multiplication,
- division,
- remainder,
- equals,
- not_equals,
- less,
- greater,
- less_equal,
- greater_equal,
- disjunction,
- conjunction,
- exclusive_disjunction,
- shift_left,
- shift_right
- };
-
- enum class unary_operator
- {
- reference,
- negation,
- minus
- };
-
- class variable_declaration;
- class constant_declaration;
- class procedure_declaration;
- class type_declaration;
- class procedure_call;
- class cast_expression;
- class assign_statement;
- class if_statement;
- class import_declaration;
- class while_statement;
- class return_statement;
- class case_statement;
- class traits_expression;
- class unit;
- class program;
- class binary_expression;
- class unary_expression;
- class named_type_expression;
- class array_type_expression;
- class pointer_type_expression;
- class record_type_expression;
- class union_type_expression;
- class procedure_type_expression;
- class enumeration_type_expression;
- class variable_expression;
- class array_access_expression;
- class field_access_expression;
- class dereference_expression;
- class designator_expression;
- class literal_expression;
- template
- class literal;
- class defer_statement;
-
- /**
- * Interface for AST visitors.
- */
- struct parser_visitor
- {
- virtual void visit(variable_declaration *) = 0;
- virtual void visit(constant_declaration *) = 0;
- virtual void visit(procedure_declaration *) = 0;
- virtual void visit(type_declaration *) = 0;
- virtual void visit(procedure_call *) = 0;
- virtual void visit(cast_expression *) = 0;
- virtual void visit(traits_expression *) = 0;
- virtual void visit(assign_statement *) = 0;
- virtual void visit(if_statement *) = 0;
- virtual void visit(import_declaration *) = 0;
- virtual void visit(while_statement *) = 0;
- virtual void visit(return_statement *) = 0;
- virtual void visit(defer_statement *) = 0;
- virtual void visit(case_statement *) = 0;
- virtual void visit(unit *) = 0;
- virtual void visit(program *) = 0;
- virtual void visit(binary_expression *) = 0;
- virtual void visit(unary_expression *) = 0;
- virtual void visit(named_type_expression *) = 0;
- virtual void visit(array_type_expression *) = 0;
- virtual void visit(pointer_type_expression *) = 0;
- virtual void visit(record_type_expression *) = 0;
- virtual void visit(union_type_expression *) = 0;
- virtual void visit(procedure_type_expression *) = 0;
- virtual void visit(enumeration_type_expression *) = 0;
- virtual void visit(variable_expression *) = 0;
- virtual void visit(array_access_expression *) = 0;
- virtual void visit(field_access_expression *) = 0;
- virtual void visit(dereference_expression *) = 0;
- virtual void visit(literal *) = 0;
- virtual void visit(literal *) = 0;
- virtual void visit(literal *) = 0;
- virtual void visit(literal *) = 0;
- virtual void visit(literal *) = 0;
- virtual void visit(literal *) = 0;
- virtual void visit(literal *) = 0;
- };
-
- /**
- * Abstract visitor that doesn't visit any nodes by default.
- */
- class empty_visitor : public parser_visitor
- {
- [[noreturn]] void not_implemented();
-
- public:
- [[noreturn]] virtual void visit(named_type_expression *) override;
- [[noreturn]] virtual void visit(array_type_expression *) override;
- [[noreturn]] virtual void visit(pointer_type_expression *) override;
- [[noreturn]] virtual void visit(program *) override;
- [[noreturn]] virtual void visit(type_declaration *) override;
- [[noreturn]] virtual void visit(record_type_expression *) override;
- [[noreturn]] virtual void visit(union_type_expression *) override;
- [[noreturn]] virtual void visit(procedure_type_expression *) override;
- [[noreturn]] virtual void visit(enumeration_type_expression *) override;
-
- [[noreturn]] virtual void visit(variable_declaration *) override;
- [[noreturn]] virtual void visit(constant_declaration *) override;
- [[noreturn]] virtual void visit(procedure_declaration *) override;
- [[noreturn]] virtual void visit(assign_statement *) override;
- [[noreturn]] virtual void visit(if_statement *) override;
- [[noreturn]] virtual void visit(import_declaration *) override;
- [[noreturn]] virtual void visit(while_statement *) override;
- [[noreturn]] virtual void visit(return_statement *) override;
- [[noreturn]] virtual void visit(defer_statement *) override;
- [[noreturn]] virtual void visit(case_statement *) override;
- [[noreturn]] virtual void visit(procedure_call *) override;
- [[noreturn]] virtual void visit(unit *) override;
- [[noreturn]] virtual void visit(cast_expression *) override;
- [[noreturn]] virtual void visit(traits_expression *) override;
- [[noreturn]] virtual void visit(binary_expression *) override;
- [[noreturn]] virtual void visit(unary_expression *) override;
- [[noreturn]] virtual void visit(variable_expression *) override;
- [[noreturn]] virtual void visit(array_access_expression *) override;
- [[noreturn]] virtual void visit(field_access_expression *) override;
- [[noreturn]] virtual void visit(dereference_expression *) override;
- [[noreturn]] virtual void visit(literal *) override;
- [[noreturn]] virtual void visit(literal *) override;
- [[noreturn]] virtual void visit(literal *) override;
- [[noreturn]] virtual void visit(literal *) override;
- [[noreturn]] virtual void visit(literal *) override;
- [[noreturn]] virtual void visit(literal *) override;
- [[noreturn]] virtual void visit(literal *) override;
- };
-
- /**
- * AST node.
- */
- class node
- {
- const struct position source_position;
-
- protected:
- /**
- * \param position Source code position.
- */
- explicit node(const position position);
-
- public:
- virtual void accept(parser_visitor *visitor) = 0;
- virtual ~node() = 0;
-
- /**
- * \return Node position in the source code.
- */
- const struct position& position() const;
- };
-
- class statement : public virtual node
- {
- };
-
- class expression : public virtual node
- {
- public:
- virtual cast_expression *is_cast();
- virtual traits_expression *is_traits();
- virtual binary_expression *is_binary();
- virtual unary_expression *is_unary();
- virtual designator_expression *is_designator();
- virtual procedure_call *is_call_expression();
- virtual literal_expression *is_literal();
- };
-
- /**
- * Symbol definition.
- */
- class declaration : public node
- {
- protected:
- declaration(const struct position position, identifier_definition identifier);
-
- public:
- const identifier_definition identifier;
- };
-
- /**
- * Some type expression.
- */
- class type_expression : public node
- {
- public:
- virtual named_type_expression *is_named();
- virtual array_type_expression *is_array();
- virtual pointer_type_expression *is_pointer();
- virtual record_type_expression *is_record();
- virtual union_type_expression *is_union();
- virtual procedure_type_expression *is_procedure();
- virtual enumeration_type_expression *is_enumeration();
-
- protected:
- type_expression(const struct position position);
- };
-
- /**
- * Expression refering to a type by its name.
- */
- class named_type_expression : public type_expression
- {
- public:
- const std::string name;
-
- named_type_expression(const struct position position, const std::string& name);
- void accept(parser_visitor *visitor) override;
- named_type_expression *is_named() override;
- };
-
- class array_type_expression : public type_expression
- {
- type_expression *m_base;
-
- public:
- const std::uint32_t size;
-
- array_type_expression(const struct position position,
- type_expression *base, const std::uint32_t size);
- ~array_type_expression();
-
- void accept(parser_visitor *visitor) override;
- array_type_expression *is_array() override;
-
- type_expression& base();
- };
-
- class pointer_type_expression : public type_expression
- {
- type_expression *m_base;
-
- public:
- pointer_type_expression(const struct position position, type_expression *base);
- ~pointer_type_expression();
-
- void accept(parser_visitor *visitor) override;
- pointer_type_expression *is_pointer() override;
-
- type_expression& base();
- };
-
- using field_declaration = std::pair;
-
- class record_type_expression : public type_expression
- {
- public:
- const std::vector fields;
-
- record_type_expression(const struct position position, std::vector&& fields);
- ~record_type_expression();
-
- void accept(parser_visitor *visitor) override;
- record_type_expression *is_record() override;
- };
-
- class union_type_expression : public type_expression
- {
- public:
- std::vector fields;
-
- union_type_expression(const struct position position, std::vector&& fields);
- ~union_type_expression();
-
- void accept(parser_visitor *visitor) override;
- union_type_expression *is_union() override;
- };
-
- /**
- * Enumeration type.
- */
- class enumeration_type_expression : public type_expression
- {
- public:
- const std::vector members;
-
- enumeration_type_expression(const struct position, std::vector&& members);
-
- void accept(parser_visitor *visitor) override;
- enumeration_type_expression *is_enumeration() override;
- };
-
- /**
- * Variable declaration.
- */
- class variable_declaration : public node
- {
- std::shared_ptr m_variable_type;
-
- public:
- variable_declaration(const struct position position,
- std::vector&& identifier, std::shared_ptr variable_type,
- expression *body = nullptr);
- variable_declaration(const struct position position,
- std::vector&& identifier, std::shared_ptr variable_type,
- std::monostate);
-
- void accept(parser_visitor *visitor) override;
-
- bool has_initializer() const;
-
- const std::vector identifiers;
- type_expression& variable_type();
- expression *const body{ nullptr };
- const bool is_extern{ false };
- };
-
- /**
- * Literal expression.
- */
- class literal_expression : public expression
- {
- public:
- literal_expression *is_literal() override;
-
- protected:
- literal_expression();
- };
-
- /**
- * Constant definition.
- */
- class constant_declaration : public declaration
- {
- expression *m_body;
-
- public:
- constant_declaration(const struct position position, identifier_definition identifier,
- expression *body);
- void accept(parser_visitor *visitor) override;
-
- expression& body();
-
- virtual ~constant_declaration() override;
- };
-
- /**
- * Procedure type.
- */
- class procedure_type_expression : public type_expression
- {
- public:
- using return_t = return_declaration;
-
- const return_t return_type;
- std::vector parameters;
-
- procedure_type_expression(const struct position position, return_t return_type = return_t());
- ~procedure_type_expression();
-
- void accept(parser_visitor *visitor) override;
- procedure_type_expression *is_procedure() override;
- };
-
- struct block
- {
- block(std::vector&& constants, std::vector&& variables,
- std::vector&& body);
- block(const block&) = delete;
- block(block&& that);
-
- block& operator=(const block&) = delete;
- block& operator=(block&& that);
-
- const std::vector& variables();
- const std::vector& constants();
- const std::vector& body();
-
- virtual ~block();
-
- private:
- std::vector m_variables;
- std::vector m_constants;
- std::vector m_body;
-
- };
-
- /**
- * Procedure definition.
- */
- class procedure_declaration : public declaration
- {
- procedure_type_expression *m_heading;
-
- public:
- std::optional body;
- std::vector parameter_names;
-
- procedure_declaration(const struct position position, identifier_definition identifier,
- procedure_type_expression *heading, block&& body);
- procedure_declaration(const struct position position, identifier_definition identifier,
- procedure_type_expression *heading);
- void accept(parser_visitor *visitor) override;
-
- procedure_type_expression& heading();
-
- virtual ~procedure_declaration() override;
- };
-
- /**
- * Type definition.
- */
- class type_declaration : public declaration
- {
- type_expression *m_body;
-
- public:
- type_declaration(const struct position position, identifier_definition identifier,
- type_expression *expression);
- ~type_declaration();
-
- void accept(parser_visitor *visitor) override;
-
- type_expression& body();
- };
-
- /**
- * Cast expression.
- */
- class cast_expression : public expression
- {
- type_expression *m_target;
- expression *m_value;
-
- public:
- type expression_type;
-
- cast_expression(const struct position position, type_expression *target, expression *value);
- void accept(parser_visitor *visitor) override;
- cast_expression *is_cast() override;
-
- type_expression& target();
- expression& value();
-
- virtual ~cast_expression() override;
- };
-
- class traits_expression : public expression
- {
- public:
- std::vector parameters;
- const std::string name;
- std::vector types;
-
- traits_expression(const struct position position, const std::string& name);
- ~traits_expression();
-
- void accept(parser_visitor *visitor) override;
- traits_expression *is_traits() override;
- };
-
- /**
- * List of statements paired with a condition.
- */
- class conditional_statements
- {
- expression *m_prerequisite;
-
- public:
- const std::vector statements;
-
- conditional_statements(expression *prerequisite, std::vector&& statements);
-
- expression& prerequisite();
-
- virtual ~conditional_statements();
- };
-
- class return_statement : public statement
- {
- public:
- expression *m_return_expression;
-
- return_statement(const struct position position, expression *return_expression);
- void accept(parser_visitor *visitor) override;
-
- expression& return_expression();
-
- virtual ~return_statement() override;
- };
-
- struct switch_case
- {
- std::vector labels;
- std::vector statements;
- };
-
- class case_statement : public statement
- {
- expression *m_condition;
-
- public:
- const std::vector cases;
- const std::vector *alternative;
-
- case_statement(const struct position position, expression *condition,
- std::vector