diff options
| -rw-r--r-- | LICENSE | 674 | ||||
| -rw-r--r-- | README.md | 118 | ||||
| -rw-r--r-- | internal/ast/processor.go | 18 | ||||
| -rw-r--r-- | internal/parser/parser.go | 1286 | ||||
| -rw-r--r-- | loader.go | 4 | ||||
| -rw-r--r-- | loader_test.go | 30 | ||||
| -rw-r--r-- | model/assignment.go | 6 | ||||
| -rw-r--r-- | model/command.go | 9 | ||||
| -rw-r--r-- | model/doc.go | 43 | ||||
| -rw-r--r-- | model/lookup.go | 49 | ||||
| -rw-r--r-- | model/value.go | 42 |
11 files changed, 1777 insertions, 502 deletions
@@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/> + 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. + + <one line to give the program's name and a brief idea of what it does.> + Copyright (C) <year> <name of author> + + 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 <https://www.gnu.org/licenses/>. + +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: + + <program> Copyright (C) <year> <name of author> + 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 +<https://www.gnu.org/licenses/>. + + 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 +<https://www.gnu.org/licenses/why-not-lgpl.html>. diff --git a/README.md b/README.md new file mode 100644 index 0000000..1c0eb9e --- /dev/null +++ b/README.md @@ -0,0 +1,118 @@ +# conf + +Go библиотека для чтения конфигурационных файлов в формате `.conf`. + +## Установка + +```bash +go get go.neonxp.ru/conf +``` + +## Особенности формата + +- Простые присваивания: `key = value;` +- Строковые значения: `"text"` или `'text'` +- Многострочные строки: ``` `text` ``` +- Числовые значения: целые и дробные, включая отрицательные +- Булевы значения: `true` / `false` +- Директивы/команды: `directive arg1 arg2;` +- Групповые директивы с блоками кода: `directive { ... }` +- Комментарии от `#` до конца строки +- Поддержка кириллицы и UTF-8 + +## Пример использования + +```go +package main + +import ( + "fmt" + "go.neonxp.ru/conf" +) + +func main() { + doc, err := conf.LoadFile("./config.conf") + if err != nil { + panic(err) + } + + // Получение значения по ключу + values := doc.Get("my_key") + fmt.Println(values) + + // Получение команд по имени + commands := doc.Commands("directivename") + fmt.Println(commands) + + // Все переменные + vars := doc.Vars() + + // Все элементы документа + items := doc.Items() +} +``` + +## Пример конфигурационного файла + +```conf +# Пример конфигурации + +# Простое присваивание +simple_key = value; + +# Многострочное присваивание +string_key = + "value" + 'string'; + +# Многострочные строки (backticks) +multiline_string = ` + multiline + string + 123 +`; + +# Числа и булевы значения +int_key = -123.456; +bool_key = true; + +# Директивы +expression1 argument1 "argument2" 123; + +# Групповая директива +group_directive_without_arguments { + expression1 argument2 "string" 123 true; + expression2 argument3 "string111" 123321 false; + + children_group "some argument" { + # Вложенная группа + } +} + +# Групповая директива с аргументами +group_directive_with_argument "argument1" 'argument2' { + child_val = "children value"; +} +``` + +## API + +### Функции + +- `LoadFile(filename string) (*model.Doc, error)` - загрузка конфигурации из файла +- `Load(name string, input []byte) (*model.Doc, error)` - парсинг конфигурации из байтов + +### Методы `*model.Doc` + +- `Get(key string) Values` - получить значения по ключу +- `Commands(name string) Commands` - получить команды по имени +- `Vars() map[string]Values` - получить все переменные +- `Items() []any` - получить все элементы документа + +## Требования + +- Go 1.25+ + +## Лицензия + +См. файл [LICENSE](LICENSE) diff --git a/internal/ast/processor.go b/internal/ast/processor.go index 89ffbff..783dbbe 100644 --- a/internal/ast/processor.go +++ b/internal/ast/processor.go @@ -8,7 +8,7 @@ import ( "go.neonxp.ru/conf/model" ) -func ToDoc(config *Node) (model.Doc, error) { +func ToDoc(config *Node) (*model.Doc, error) { if len(config.Children) < 1 { return nil, fmt.Errorf("invalid ast tree") } @@ -18,24 +18,22 @@ func ToDoc(config *Node) (model.Doc, error) { return processDoc(doc), nil } -func processDoc(docNode *Node) model.Doc { - doc := make(model.Doc, len(docNode.Children)) - for i, stmt := range docNode.Children { - doc[i] = processStmt(stmt) +func processDoc(docNode *Node) *model.Doc { + doc := model.New(len(docNode.Children)) + for _, stmt := range docNode.Children { + processStmt(doc, stmt) } return doc } -func processStmt(stmt *Node) any { +func processStmt(doc *model.Doc, stmt *Node) { ident := extractIdent(stmt.Children[0]) nodeBody := stmt.Children[1] switch nodeBody.Symbol { case parser.Command: - return processCommand(ident, nodeBody) + doc.AppendCommand(processCommand(ident, nodeBody)) case parser.Assignment: - return processAssignment(ident, nodeBody) - default: - return nil + doc.AppendAssignment(processAssignment(ident, nodeBody)) } } diff --git a/internal/parser/parser.go b/internal/parser/parser.go index c1785f6..519e767 100644 --- a/internal/parser/parser.go +++ b/internal/parser/parser.go @@ -17,40 +17,35 @@ import ( var _ = unicode.MaxRune - - - - // Symbols const ( - TOK_EOF = Symbol(0) // EOF - TOK_003d = Symbol(1) // '=' - boolean = Symbol(2) // boolean - br = Symbol(3) // br - lbrace = Symbol(4) // lbrace - number = Symbol(5) // number - rbrace = Symbol(6) // rbrace - str = Symbol(7) // str - white_space = Symbol(8) // white_space - word = Symbol(9) // word - Config = Symbol(10) // Config - Doc = Symbol(11) // Doc - Stmt = Symbol(12) // Stmt - Assignment = Symbol(13) // Assignment - Command = Symbol(14) // Command - Values = Symbol(15) // Values - Value = Symbol(16) // Value - Body = Symbol(17) // Body - Word = Symbol(18) // Word - Number = Symbol(19) // Number - Boolean = Symbol(20) // Boolean - String = Symbol(21) // String + TOK_EOF = Symbol(0) // EOF + TOK_003d = Symbol(1) // '=' + boolean = Symbol(2) // boolean + br = Symbol(3) // br + lbrace = Symbol(4) // lbrace + number = Symbol(5) // number + rbrace = Symbol(6) // rbrace + str = Symbol(7) // str + white_space = Symbol(8) // white_space + word = Symbol(9) // word + Config = Symbol(10) // Config + Doc = Symbol(11) // Doc + Stmt = Symbol(12) // Stmt + Assignment = Symbol(13) // Assignment + Command = Symbol(14) // Command + Values = Symbol(15) // Values + Value = Symbol(16) // Value + Body = Symbol(17) // Body + Word = Symbol(18) // Word + Number = Symbol(19) // Number + Boolean = Symbol(20) // Boolean + String = Symbol(21) // String ) const SymbolNames = "EOF'='booleanbrlbracenumberrbracestrwhite_spacewordConfigDocStmtAssignmentCommandValuesValueBodyWordNumberBooleanString" -var SymbolIndex = [...]uint8{0, 3, 6, 13, 15, 21, 27, 33, 36, 47, 51, 57, 60, 64, 74, 81, 87, 92, 96, 100, 106, 113, 119, } - +var SymbolIndex = [...]uint8{0, 3, 6, 13, 15, 21, 27, 33, 36, 47, 51, 57, 60, 64, 74, 81, 87, 92, 96, 100, 106, 113, 119} func (s Symbol) String() string { idx := int(s) - 0 @@ -61,43 +56,40 @@ func (s Symbol) String() string { } var errorSets = [...][]Symbol{ -{String, Boolean, Number, Word, Body, Value, Values, word, str, number, lbrace, br, boolean, TOK_003d}, -{TOK_003d}, -{String, Boolean, Number, Word, Value, word, str, number, lbrace, br, boolean}, -{String, Boolean, Number, Word, Value, word, str, number, boolean}, -{String, Boolean, Number, Word, word, str, number, boolean}, -{word, str, number, boolean}, -{boolean}, -{lbrace, br}, -{br}, -{lbrace}, -{number}, -{Word, Stmt, word, rbrace}, -{rbrace}, -{str}, -{Word, Stmt, word}, -{Word, word}, -{word}, + {String, Boolean, Number, Word, Body, Value, Values, word, str, number, lbrace, br, boolean, TOK_003d}, + {TOK_003d}, + {String, Boolean, Number, Word, Value, word, str, number, lbrace, br, boolean}, + {String, Boolean, Number, Word, Value, word, str, number, boolean}, + {String, Boolean, Number, Word, word, str, number, boolean}, + {word, str, number, boolean}, + {boolean}, + {lbrace, br}, + {br}, + {lbrace}, + {number}, + {Word, Stmt, word, rbrace}, + {rbrace}, + {str}, + {Word, Stmt, word}, + {Word, word}, + {word}, } - - -type Parser struct{ +type Parser struct { cache [][]int32 eof bool errBudget int - id rune // from scanSep, valid if .n != 0 - n int // from scanSep, valid if != 0 + id rune // from scanSep, valid if .n != 0 + n int // from scanSep, valid if != 0 off int sc *scanner.RecScanner src []byte tok scanner.Token // current lookahead - tokIndex int32 // For scanner.Token(tokIndex) + tokIndex int32 // For scanner.Token(tokIndex) } type Symbol int32 - // scan recognizes longest UTF-8 lexemes. Lower IDs take precedence on same length. // // id 0: $ @@ -121,45 +113,127 @@ func (*Parser) scan(s []byte) (id, length int) { _ = r _ = r1 _ = width1 - step := func(pos int) (r rune, n int) { if pos < len(s) { c := s[pos]; if c < utf8.RuneSelf { return rune(c), 1 }; return utf8.DecodeRune(s[pos:]) }; return endOfText, 0 } - move := func() { pos += width; if r, width = r1, width1; r != endOfText { r1, width1 = step(pos+width); }; } - accept := func(x rune) bool { if r == x { move(); return true }; return false } -_ = accept - accept2 := func(x rune) bool { if r <= x { move(); return true }; return false } -_ = accept2 + step := func(pos int) (r rune, n int) { + if pos < len(s) { + c := s[pos] + if c < utf8.RuneSelf { + return rune(c), 1 + } + return utf8.DecodeRune(s[pos:]) + } + return endOfText, 0 + } + move := func() { + pos += width + if r, width = r1, width1; r != endOfText { + r1, width1 = step(pos + width) + } + } + accept := func(x rune) bool { + if r == x { + move() + return true + } + return false + } + _ = accept + accept2 := func(x rune) bool { + if r <= x { + move() + return true + } + return false + } + _ = accept2 r, r1 = endOfText, endOfText width, width1 = 0, 0 - r, width = step(pos); if r != endOfText { - r1, width1 = step(pos+width); } - if accept('\t') { goto l37 } - if accept('\n') { goto l39 } - if accept('\r') { goto l41 } - if accept(' ') { goto l43 } - if accept('"') { goto l45 } - if accept('#') { goto l57 } - if accept('\'') { goto l65 } - if accept('-') { goto l77 } - if accept(';') { goto l93 } - if accept('=') { goto l95 } - if accept('`') { goto l105 } - if accept('f') { goto l117 } - if accept('t') { goto l145 } - if accept('{') { goto l167 } - if accept('}') { goto l169 } - if r < '0' { goto l30out } - if accept2('9') { goto l80 } + r, width = step(pos) + if r != endOfText { + r1, width1 = step(pos + width) + } + if accept('\t') { + goto l37 + } + if accept('\n') { + goto l39 + } + if accept('\r') { + goto l41 + } + if accept(' ') { + goto l43 + } + if accept('"') { + goto l45 + } + if accept('#') { + goto l57 + } + if accept('\'') { + goto l65 + } + if accept('-') { + goto l77 + } + if accept(';') { + goto l93 + } + if accept('=') { + goto l95 + } + if accept('`') { + goto l105 + } + if accept('f') { + goto l117 + } + if accept('t') { + goto l145 + } + if accept('{') { + goto l167 + } + if accept('}') { + goto l169 + } + if r < '0' { + goto l30out + } + if accept2('9') { + goto l80 + } l30out: - if r < 'A' { goto l32out } - if accept2('Z') { goto l97 } - if accept('_') { goto l97 } - if r < 'a' { goto l32out } - if accept2('e') { goto l97 } - if r < 'g' { goto l32out } - if accept2('s') { goto l97 } - if r < 'u' { goto l32out } - if accept2('z') { goto l97 } + if r < 'A' { + goto l32out + } + if accept2('Z') { + goto l97 + } + if accept('_') { + goto l97 + } + if r < 'a' { + goto l32out + } + if accept2('e') { + goto l97 + } + if r < 'g' { + goto l32out + } + if accept2('s') { + goto l97 + } + if r < 'u' { + goto l32out + } + if accept2('z') { + goto l97 + } l32out: - if r == endOfText { goto l171 } + if r == endOfText { + goto l171 + } return id, length l37: id, length = 8, pos @@ -174,74 +248,136 @@ l43: id, length = 8, pos return id, length l45: - if accept('"') { goto l50 } - if accept2('!') { goto l52 } - if r < '#' { goto l47out } - if accept2('\U0010ffff') { goto l52 } + if accept('"') { + goto l50 + } + if accept2('!') { + goto l52 + } + if r < '#' { + goto l47out + } + if accept2('\U0010ffff') { + goto l52 + } l47out: return id, length l50: id, length = 7, pos return id, length l52: - if accept('"') { goto l50 } - if accept2('!') { goto l52 } - if r < '#' { goto l54out } - if accept2('\U0010ffff') { goto l52 } + if accept('"') { + goto l50 + } + if accept2('!') { + goto l52 + } + if r < '#' { + goto l54out + } + if accept2('\U0010ffff') { + goto l52 + } l54out: return id, length l57: id, length = 8, pos - if accept2('\t') { goto l61 } - if r < '\v' { goto l58out } - if accept2('\U0010ffff') { goto l61 } + if accept2('\t') { + goto l61 + } + if r < '\v' { + goto l58out + } + if accept2('\U0010ffff') { + goto l61 + } l58out: return id, length l61: id, length = 8, pos - if accept2('\t') { goto l61 } - if r < '\v' { goto l62out } - if accept2('\U0010ffff') { goto l61 } + if accept2('\t') { + goto l61 + } + if r < '\v' { + goto l62out + } + if accept2('\U0010ffff') { + goto l61 + } l62out: return id, length l65: - if accept('\'') { goto l70 } - if accept2('&') { goto l72 } - if r < '(' { goto l67out } - if accept2('\U0010ffff') { goto l72 } + if accept('\'') { + goto l70 + } + if accept2('&') { + goto l72 + } + if r < '(' { + goto l67out + } + if accept2('\U0010ffff') { + goto l72 + } l67out: return id, length l70: id, length = 7, pos return id, length l72: - if accept('\'') { goto l70 } - if accept2('&') { goto l72 } - if r < '(' { goto l74out } - if accept2('\U0010ffff') { goto l72 } + if accept('\'') { + goto l70 + } + if accept2('&') { + goto l72 + } + if r < '(' { + goto l74out + } + if accept2('\U0010ffff') { + goto l72 + } l74out: return id, length l77: - if r < '0' { goto l77out } - if accept2('9') { goto l80 } + if r < '0' { + goto l77out + } + if accept2('9') { + goto l80 + } l77out: return id, length l80: id, length = 5, pos - if accept('.') { goto l86 } - if r < '0' { goto l83out } - if accept2('9') { goto l80 } + if accept('.') { + goto l86 + } + if r < '0' { + goto l83out + } + if accept2('9') { + goto l80 + } l83out: return id, length l86: - if r < '0' { goto l86out } - if accept2('9') { goto l89 } + if r < '0' { + goto l86out + } + if accept2('9') { + goto l89 + } l86out: return id, length l89: id, length = 5, pos - if r < '0' { goto l90out } - if accept2('9') { goto l89 } + if r < '0' { + goto l90out + } + if accept2('9') { + goto l89 + } l90out: return id, length l93: @@ -252,159 +388,367 @@ l95: return id, length l97: id, length = 9, pos - if r < '0' { goto l98out } - if accept2('9') { goto l101 } - if r < 'A' { goto l98out } - if accept2('Z') { goto l101 } - if accept('_') { goto l101 } - if r < 'a' { goto l98out } - if accept2('z') { goto l101 } + if r < '0' { + goto l98out + } + if accept2('9') { + goto l101 + } + if r < 'A' { + goto l98out + } + if accept2('Z') { + goto l101 + } + if accept('_') { + goto l101 + } + if r < 'a' { + goto l98out + } + if accept2('z') { + goto l101 + } l98out: return id, length l101: id, length = 9, pos - if r < '0' { goto l102out } - if accept2('9') { goto l101 } - if r < 'A' { goto l102out } - if accept2('Z') { goto l101 } - if accept('_') { goto l101 } - if r < 'a' { goto l102out } - if accept2('z') { goto l101 } + if r < '0' { + goto l102out + } + if accept2('9') { + goto l101 + } + if r < 'A' { + goto l102out + } + if accept2('Z') { + goto l101 + } + if accept('_') { + goto l101 + } + if r < 'a' { + goto l102out + } + if accept2('z') { + goto l101 + } l102out: return id, length l105: - if accept('`') { goto l110 } - if accept2('_') { goto l112 } - if r < 'a' { goto l107out } - if accept2('\U0010ffff') { goto l112 } + if accept('`') { + goto l110 + } + if accept2('_') { + goto l112 + } + if r < 'a' { + goto l107out + } + if accept2('\U0010ffff') { + goto l112 + } l107out: return id, length l110: id, length = 7, pos return id, length l112: - if accept('`') { goto l110 } - if accept2('_') { goto l112 } - if r < 'a' { goto l114out } - if accept2('\U0010ffff') { goto l112 } + if accept('`') { + goto l110 + } + if accept2('_') { + goto l112 + } + if r < 'a' { + goto l114out + } + if accept2('\U0010ffff') { + goto l112 + } l114out: return id, length l117: id, length = 9, pos - if accept('a') { goto l123 } - if r < '0' { goto l120out } - if accept2('9') { goto l101 } - if r < 'A' { goto l120out } - if accept2('Z') { goto l101 } - if accept('_') { goto l101 } - if r < 'b' { goto l120out } - if accept2('z') { goto l101 } + if accept('a') { + goto l123 + } + if r < '0' { + goto l120out + } + if accept2('9') { + goto l101 + } + if r < 'A' { + goto l120out + } + if accept2('Z') { + goto l101 + } + if accept('_') { + goto l101 + } + if r < 'b' { + goto l120out + } + if accept2('z') { + goto l101 + } l120out: return id, length l123: id, length = 9, pos - if accept('l') { goto l129 } - if r < '0' { goto l126out } - if accept2('9') { goto l101 } - if r < 'A' { goto l126out } - if accept2('Z') { goto l101 } - if accept('_') { goto l101 } - if r < 'a' { goto l126out } - if accept2('k') { goto l101 } - if r < 'm' { goto l126out } - if accept2('z') { goto l101 } + if accept('l') { + goto l129 + } + if r < '0' { + goto l126out + } + if accept2('9') { + goto l101 + } + if r < 'A' { + goto l126out + } + if accept2('Z') { + goto l101 + } + if accept('_') { + goto l101 + } + if r < 'a' { + goto l126out + } + if accept2('k') { + goto l101 + } + if r < 'm' { + goto l126out + } + if accept2('z') { + goto l101 + } l126out: return id, length l129: id, length = 9, pos - if accept('s') { goto l135 } - if r < '0' { goto l132out } - if accept2('9') { goto l101 } - if r < 'A' { goto l132out } - if accept2('Z') { goto l101 } - if accept('_') { goto l101 } - if r < 'a' { goto l132out } - if accept2('r') { goto l101 } - if r < 't' { goto l132out } - if accept2('z') { goto l101 } + if accept('s') { + goto l135 + } + if r < '0' { + goto l132out + } + if accept2('9') { + goto l101 + } + if r < 'A' { + goto l132out + } + if accept2('Z') { + goto l101 + } + if accept('_') { + goto l101 + } + if r < 'a' { + goto l132out + } + if accept2('r') { + goto l101 + } + if r < 't' { + goto l132out + } + if accept2('z') { + goto l101 + } l132out: return id, length l135: id, length = 9, pos - if accept('e') { goto l141 } - if r < '0' { goto l138out } - if accept2('9') { goto l101 } - if r < 'A' { goto l138out } - if accept2('Z') { goto l101 } - if accept('_') { goto l101 } - if r < 'a' { goto l138out } - if accept2('d') { goto l101 } - if r < 'f' { goto l138out } - if accept2('z') { goto l101 } + if accept('e') { + goto l141 + } + if r < '0' { + goto l138out + } + if accept2('9') { + goto l101 + } + if r < 'A' { + goto l138out + } + if accept2('Z') { + goto l101 + } + if accept('_') { + goto l101 + } + if r < 'a' { + goto l138out + } + if accept2('d') { + goto l101 + } + if r < 'f' { + goto l138out + } + if accept2('z') { + goto l101 + } l138out: return id, length l141: id, length = 2, pos - if r < '0' { goto l142out } - if accept2('9') { goto l101 } - if r < 'A' { goto l142out } - if accept2('Z') { goto l101 } - if accept('_') { goto l101 } - if r < 'a' { goto l142out } - if accept2('z') { goto l101 } + if r < '0' { + goto l142out + } + if accept2('9') { + goto l101 + } + if r < 'A' { + goto l142out + } + if accept2('Z') { + goto l101 + } + if accept('_') { + goto l101 + } + if r < 'a' { + goto l142out + } + if accept2('z') { + goto l101 + } l142out: return id, length l145: id, length = 9, pos - if accept('r') { goto l151 } - if r < '0' { goto l148out } - if accept2('9') { goto l101 } - if r < 'A' { goto l148out } - if accept2('Z') { goto l101 } - if accept('_') { goto l101 } - if r < 'a' { goto l148out } - if accept2('q') { goto l101 } - if r < 's' { goto l148out } - if accept2('z') { goto l101 } + if accept('r') { + goto l151 + } + if r < '0' { + goto l148out + } + if accept2('9') { + goto l101 + } + if r < 'A' { + goto l148out + } + if accept2('Z') { + goto l101 + } + if accept('_') { + goto l101 + } + if r < 'a' { + goto l148out + } + if accept2('q') { + goto l101 + } + if r < 's' { + goto l148out + } + if accept2('z') { + goto l101 + } l148out: return id, length l151: id, length = 9, pos - if accept('u') { goto l157 } - if r < '0' { goto l154out } - if accept2('9') { goto l101 } - if r < 'A' { goto l154out } - if accept2('Z') { goto l101 } - if accept('_') { goto l101 } - if r < 'a' { goto l154out } - if accept2('t') { goto l101 } - if r < 'v' { goto l154out } - if accept2('z') { goto l101 } + if accept('u') { + goto l157 + } + if r < '0' { + goto l154out + } + if accept2('9') { + goto l101 + } + if r < 'A' { + goto l154out + } + if accept2('Z') { + goto l101 + } + if accept('_') { + goto l101 + } + if r < 'a' { + goto l154out + } + if accept2('t') { + goto l101 + } + if r < 'v' { + goto l154out + } + if accept2('z') { + goto l101 + } l154out: return id, length l157: id, length = 9, pos - if accept('e') { goto l163 } - if r < '0' { goto l160out } - if accept2('9') { goto l101 } - if r < 'A' { goto l160out } - if accept2('Z') { goto l101 } - if accept('_') { goto l101 } - if r < 'a' { goto l160out } - if accept2('d') { goto l101 } - if r < 'f' { goto l160out } - if accept2('z') { goto l101 } + if accept('e') { + goto l163 + } + if r < '0' { + goto l160out + } + if accept2('9') { + goto l101 + } + if r < 'A' { + goto l160out + } + if accept2('Z') { + goto l101 + } + if accept('_') { + goto l101 + } + if r < 'a' { + goto l160out + } + if accept2('d') { + goto l101 + } + if r < 'f' { + goto l160out + } + if accept2('z') { + goto l101 + } l160out: return id, length l163: id, length = 2, pos - if r < '0' { goto l164out } - if accept2('9') { goto l101 } - if r < 'A' { goto l164out } - if accept2('Z') { goto l101 } - if accept('_') { goto l101 } - if r < 'a' { goto l164out } - if accept2('z') { goto l101 } + if r < '0' { + goto l164out + } + if accept2('9') { + goto l101 + } + if r < 'A' { + goto l164out + } + if accept2('Z') { + goto l101 + } + if accept('_') { + goto l101 + } + if r < 'a' { + goto l164out + } + if accept2('z') { + goto l101 + } l164out: return id, length l167: @@ -418,10 +762,9 @@ l171: return id, length } - // Scan is used internally from Parse. -func(p *Parser) Scan() (r scanner.Token) { - return p.sc.Scan() +func (p *Parser) Scan() (r scanner.Token) { + return p.sc.Scan() } // init initalizes 'p' with content in 'src', assuming it comes from 'name'. @@ -439,12 +782,8 @@ func (p *Parser) init(name string, src []byte) (err error) { return nil } - - // Assignment grammar: // -// -// // # Statements // Assignment = "=" Values br . // @@ -459,43 +798,42 @@ func (p *Parser) init(name string, src []byte) (err error) { // shift and goto state 3 // State 3 // Accept +// // Assignment is used internally from Parse. func (p *Parser) Assignment() (r []int32) { - accept, errorSet := false, 0 - r = append(p.get(), -int32(Assignment), 0) -// state0: -accept, errorSet = false, 1 -switch Symbol(p.tok.Ch) { - case TOK_003d: -r = append(r, p.shift()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet := false, 0 + r = append(p.get(), -int32(Assignment), 0) + // state0: + accept, errorSet = false, 1 + switch Symbol(p.tok.Ch) { + case TOK_003d: + r = append(r, p.shift()) + goto state1 + } + return p.stop(r, accept, errorSet) state1: -accept, errorSet = false, 3 -switch Symbol(p.tok.Ch) { - case boolean, number, str, word, Value, Word, Number, Boolean, String: -r = p.add(r, p.Values()) -goto state2 -} -return p.stop(r, accept, errorSet) + accept, errorSet = false, 3 + switch Symbol(p.tok.Ch) { + case boolean, number, str, word, Value, Word, Number, Boolean, String: + r = p.add(r, p.Values()) + goto state2 + } + return p.stop(r, accept, errorSet) state2: -accept, errorSet = false, 8 -switch Symbol(p.tok.Ch) { - case br: -r = append(r, p.shift()) -goto state3 -} -return p.stop(r, accept, errorSet) + accept, errorSet = false, 8 + switch Symbol(p.tok.Ch) { + case br: + r = append(r, p.shift()) + goto state3 + } + return p.stop(r, accept, errorSet) state3: -accept, errorSet = true, 0 -return p.stop(r, accept, errorSet) + accept, errorSet = true, 0 + return p.stop(r, accept, errorSet) } - // Body grammar: // -// // Body = lbrace [ Doc ] rbrace . // // State 0 @@ -511,46 +849,45 @@ return p.stop(r, accept, errorSet) // State 3 // on rbrace // shift and goto state 2 +// // Body is used internally from Parse. func (p *Parser) Body() (r []int32) { - accept, errorSet := false, 0 - r = append(p.get(), -int32(Body), 0) -// state0: -accept, errorSet = false, 9 -switch Symbol(p.tok.Ch) { - case lbrace: -r = append(r, p.shift()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet := false, 0 + r = append(p.get(), -int32(Body), 0) + // state0: + accept, errorSet = false, 9 + switch Symbol(p.tok.Ch) { + case lbrace: + r = append(r, p.shift()) + goto state1 + } + return p.stop(r, accept, errorSet) state1: -accept, errorSet = false, 11 -switch Symbol(p.tok.Ch) { - case rbrace: -r = append(r, p.shift()) -goto state2 - case word, Stmt, Word: -r = p.add(r, p.Doc()) -goto state3 -} -return p.stop(r, accept, errorSet) + accept, errorSet = false, 11 + switch Symbol(p.tok.Ch) { + case rbrace: + r = append(r, p.shift()) + goto state2 + case word, Stmt, Word: + r = p.add(r, p.Doc()) + goto state3 + } + return p.stop(r, accept, errorSet) state2: -accept, errorSet = true, 0 -return p.stop(r, accept, errorSet) + accept, errorSet = true, 0 + return p.stop(r, accept, errorSet) state3: -accept, errorSet = false, 12 -switch Symbol(p.tok.Ch) { - case rbrace: -r = append(r, p.shift()) -goto state2 -} -return p.stop(r, accept, errorSet) + accept, errorSet = false, 12 + switch Symbol(p.tok.Ch) { + case rbrace: + r = append(r, p.shift()) + goto state2 + } + return p.stop(r, accept, errorSet) } - // Boolean grammar: // -// // Boolean = boolean . // // State 0 @@ -558,27 +895,26 @@ return p.stop(r, accept, errorSet) // shift and goto state 1 // State 1 // Accept +// // Boolean is used internally from Parse. func (p *Parser) Boolean() (r []int32) { - accept, errorSet := false, 0 - r = append(p.get(), -int32(Boolean), 0) -// state0: -accept, errorSet = false, 6 -switch Symbol(p.tok.Ch) { - case boolean: -r = append(r, p.shift()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet := false, 0 + r = append(p.get(), -int32(Boolean), 0) + // state0: + accept, errorSet = false, 6 + switch Symbol(p.tok.Ch) { + case boolean: + r = append(r, p.shift()) + goto state1 + } + return p.stop(r, accept, errorSet) state1: -accept, errorSet = true, 0 -return p.stop(r, accept, errorSet) + accept, errorSet = true, 0 + return p.stop(r, accept, errorSet) } - // Command grammar: // -// // Command = [Values] ( Body | br ) . // // State 0 @@ -595,41 +931,41 @@ return p.stop(r, accept, errorSet) // shift and goto state 1 // on lbrace // call Body and goto state 1 +// // Command is used internally from Parse. func (p *Parser) Command() (r []int32) { - accept, errorSet := false, 0 - r = append(p.get(), -int32(Command), 0) -// state0: -accept, errorSet = false, 2 -switch Symbol(p.tok.Ch) { - case br: -r = append(r, p.shift()) -goto state1 - case boolean, number, str, word, Value, Word, Number, Boolean, String: -r = p.add(r, p.Values()) -goto state2 - case lbrace: -r = p.add(r, p.Body()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet := false, 0 + r = append(p.get(), -int32(Command), 0) + // state0: + accept, errorSet = false, 2 + switch Symbol(p.tok.Ch) { + case br: + r = append(r, p.shift()) + goto state1 + case boolean, number, str, word, Value, Word, Number, Boolean, String: + r = p.add(r, p.Values()) + goto state2 + case lbrace: + r = p.add(r, p.Body()) + goto state1 + } + return p.stop(r, accept, errorSet) state1: -accept, errorSet = true, 0 -return p.stop(r, accept, errorSet) + accept, errorSet = true, 0 + return p.stop(r, accept, errorSet) state2: -accept, errorSet = false, 7 -switch Symbol(p.tok.Ch) { - case br: -r = append(r, p.shift()) -goto state1 - case lbrace: -r = p.add(r, p.Body()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet = false, 7 + switch Symbol(p.tok.Ch) { + case br: + r = append(r, p.shift()) + goto state1 + case lbrace: + r = p.add(r, p.Body()) + goto state1 + } + return p.stop(r, accept, errorSet) } - // Config grammar: // // Config = Doc . @@ -639,34 +975,33 @@ return p.stop(r, accept, errorSet) // call Doc and goto state 1 // State 1 // Accept +// // Config is used internally from Parse. func (p *Parser) Config() (r []int32) { - accept, errorSet := false, 0 - r = append(p.get(), -int32(Config), 0) -// state0: -accept, errorSet = false, 14 -switch Symbol(p.tok.Ch) { - case word, Stmt, Word: -r = p.add(r, p.Doc()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet := false, 0 + r = append(p.get(), -int32(Config), 0) + // state0: + accept, errorSet = false, 14 + switch Symbol(p.tok.Ch) { + case word, Stmt, Word: + r = p.add(r, p.Doc()) + goto state1 + } + return p.stop(r, accept, errorSet) state1: -accept, errorSet = true, 0 + accept, errorSet = true, 0 if accept = accept && p.eof; accept { - r = append(r, p.shift()) - } - r[1] = int32(len(r)-2) - if !accept { - p.err(p.tok.Position(), "%q [%s]: expected %v", p.tok.Src(), Symbol(p.tok.Ch), errorSets[errorSet]) - } -return r + r = append(r, p.shift()) + } + r[1] = int32(len(r) - 2) + if !accept { + p.err(p.tok.Position(), "%q [%s]: expected %v", p.tok.Src(), Symbol(p.tok.Ch), errorSets[errorSet]) + } + return r } - // Doc grammar: // -// // Doc = Stmt { Stmt } . // // State 0 @@ -676,32 +1011,31 @@ return r // Accept // on word, Word // call Stmt and goto state 1 +// // Doc is used internally from Parse. func (p *Parser) Doc() (r []int32) { - accept, errorSet := false, 0 - r = append(p.get(), -int32(Doc), 0) -// state0: -accept, errorSet = false, 15 -switch Symbol(p.tok.Ch) { - case word, Word: -r = p.add(r, p.Stmt()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet := false, 0 + r = append(p.get(), -int32(Doc), 0) + // state0: + accept, errorSet = false, 15 + switch Symbol(p.tok.Ch) { + case word, Word: + r = p.add(r, p.Stmt()) + goto state1 + } + return p.stop(r, accept, errorSet) state1: -accept, errorSet = true, 15 -switch Symbol(p.tok.Ch) { - case word, Word: -r = p.add(r, p.Stmt()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet = true, 15 + switch Symbol(p.tok.Ch) { + case word, Word: + r = p.add(r, p.Stmt()) + goto state1 + } + return p.stop(r, accept, errorSet) } - // Number grammar: // -// // Number = number . // // State 0 @@ -709,27 +1043,26 @@ return p.stop(r, accept, errorSet) // shift and goto state 1 // State 1 // Accept +// // Number is used internally from Parse. func (p *Parser) Number() (r []int32) { - accept, errorSet := false, 0 - r = append(p.get(), -int32(Number), 0) -// state0: -accept, errorSet = false, 10 -switch Symbol(p.tok.Ch) { - case number: -r = append(r, p.shift()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet := false, 0 + r = append(p.get(), -int32(Number), 0) + // state0: + accept, errorSet = false, 10 + switch Symbol(p.tok.Ch) { + case number: + r = append(r, p.shift()) + goto state1 + } + return p.stop(r, accept, errorSet) state1: -accept, errorSet = true, 0 -return p.stop(r, accept, errorSet) + accept, errorSet = true, 0 + return p.stop(r, accept, errorSet) } - // Stmt grammar: // -// // Stmt = Word (Assignment | Command) . // // State 0 @@ -742,38 +1075,37 @@ return p.stop(r, accept, errorSet) // call Command and goto state 2 // State 2 // Accept +// // Stmt is used internally from Parse. func (p *Parser) Stmt() (r []int32) { - accept, errorSet := false, 0 - r = append(p.get(), -int32(Stmt), 0) -// state0: -accept, errorSet = false, 16 -switch Symbol(p.tok.Ch) { - case word: -r = p.add(r, p.Word()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet := false, 0 + r = append(p.get(), -int32(Stmt), 0) + // state0: + accept, errorSet = false, 16 + switch Symbol(p.tok.Ch) { + case word: + r = p.add(r, p.Word()) + goto state1 + } + return p.stop(r, accept, errorSet) state1: -accept, errorSet = false, 0 -switch Symbol(p.tok.Ch) { - case TOK_003d: -r = p.add(r, p.Assignment()) -goto state2 - case boolean, br, lbrace, number, str, word, Values, Value, Body, Word, Number, Boolean, String: -r = p.add(r, p.Command()) -goto state2 -} -return p.stop(r, accept, errorSet) + accept, errorSet = false, 0 + switch Symbol(p.tok.Ch) { + case TOK_003d: + r = p.add(r, p.Assignment()) + goto state2 + case boolean, br, lbrace, number, str, word, Values, Value, Body, Word, Number, Boolean, String: + r = p.add(r, p.Command()) + goto state2 + } + return p.stop(r, accept, errorSet) state2: -accept, errorSet = true, 0 -return p.stop(r, accept, errorSet) + accept, errorSet = true, 0 + return p.stop(r, accept, errorSet) } - // String grammar: // -// // String = str . // // State 0 @@ -781,27 +1113,26 @@ return p.stop(r, accept, errorSet) // shift and goto state 1 // State 1 // Accept +// // String is used internally from Parse. func (p *Parser) String() (r []int32) { - accept, errorSet := false, 0 - r = append(p.get(), -int32(String), 0) -// state0: -accept, errorSet = false, 13 -switch Symbol(p.tok.Ch) { - case str: -r = append(r, p.shift()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet := false, 0 + r = append(p.get(), -int32(String), 0) + // state0: + accept, errorSet = false, 13 + switch Symbol(p.tok.Ch) { + case str: + r = append(r, p.shift()) + goto state1 + } + return p.stop(r, accept, errorSet) state1: -accept, errorSet = true, 0 -return p.stop(r, accept, errorSet) + accept, errorSet = true, 0 + return p.stop(r, accept, errorSet) } - // Value grammar: // -// // Value = Word | String | Number | Boolean . // // State 0 @@ -815,37 +1146,35 @@ return p.stop(r, accept, errorSet) // call String and goto state 1 // State 1 // Accept +// // Value is used internally from Parse. func (p *Parser) Value() (r []int32) { - accept, errorSet := false, 0 - r = append(p.get(), -int32(Value), 0) -// state0: -accept, errorSet = false, 5 -switch Symbol(p.tok.Ch) { - case word: -r = p.add(r, p.Word()) -goto state1 - case number: -r = p.add(r, p.Number()) -goto state1 - case boolean: -r = p.add(r, p.Boolean()) -goto state1 - case str: -r = p.add(r, p.String()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet := false, 0 + r = append(p.get(), -int32(Value), 0) + // state0: + accept, errorSet = false, 5 + switch Symbol(p.tok.Ch) { + case word: + r = p.add(r, p.Word()) + goto state1 + case number: + r = p.add(r, p.Number()) + goto state1 + case boolean: + r = p.add(r, p.Boolean()) + goto state1 + case str: + r = p.add(r, p.String()) + goto state1 + } + return p.stop(r, accept, errorSet) state1: -accept, errorSet = true, 0 -return p.stop(r, accept, errorSet) + accept, errorSet = true, 0 + return p.stop(r, accept, errorSet) } - // Values grammar: // -// -// // # Value types // Values = Value {Value} . // @@ -856,33 +1185,31 @@ return p.stop(r, accept, errorSet) // Accept // on boolean, number, str, word, Word, Number, Boolean, String // call Value and goto state 1 +// // Values is used internally from Parse. func (p *Parser) Values() (r []int32) { - accept, errorSet := false, 0 - r = append(p.get(), -int32(Values), 0) -// state0: -accept, errorSet = false, 4 -switch Symbol(p.tok.Ch) { - case boolean, number, str, word, Word, Number, Boolean, String: -r = p.add(r, p.Value()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet := false, 0 + r = append(p.get(), -int32(Values), 0) + // state0: + accept, errorSet = false, 4 + switch Symbol(p.tok.Ch) { + case boolean, number, str, word, Word, Number, Boolean, String: + r = p.add(r, p.Value()) + goto state1 + } + return p.stop(r, accept, errorSet) state1: -accept, errorSet = true, 4 -switch Symbol(p.tok.Ch) { - case boolean, number, str, word, Word, Number, Boolean, String: -r = p.add(r, p.Value()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet = true, 4 + switch Symbol(p.tok.Ch) { + case boolean, number, str, word, Word, Number, Boolean, String: + r = p.add(r, p.Value()) + goto state1 + } + return p.stop(r, accept, errorSet) } - // Word grammar: // -// -// // # Atoms // Word = word . // @@ -891,24 +1218,24 @@ return p.stop(r, accept, errorSet) // shift and goto state 1 // State 1 // Accept +// // Word is used internally from Parse. func (p *Parser) Word() (r []int32) { - accept, errorSet := false, 0 - r = append(p.get(), -int32(Word), 0) -// state0: -accept, errorSet = false, 16 -switch Symbol(p.tok.Ch) { - case word: -r = append(r, p.shift()) -goto state1 -} -return p.stop(r, accept, errorSet) + accept, errorSet := false, 0 + r = append(p.get(), -int32(Word), 0) + // state0: + accept, errorSet = false, 16 + switch Symbol(p.tok.Ch) { + case word: + r = append(r, p.shift()) + goto state1 + } + return p.stop(r, accept, errorSet) state1: -accept, errorSet = true, 0 -return p.stop(r, accept, errorSet) + accept, errorSet = true, 0 + return p.stop(r, accept, errorSet) } - func (p *Parser) shift() (r int32) { r = p.tokIndex if !p.eof { @@ -989,4 +1316,3 @@ func (p *Parser) err(pos token.Position, s string, args ...any) { panic(p.sc.Err()) } } - @@ -9,7 +9,7 @@ import ( "go.neonxp.ru/conf/model" ) -func LoadFile(filename string) (model.Doc, error) { +func LoadFile(filename string) (*model.Doc, error) { content, err := os.ReadFile(filename) if err != nil { return nil, fmt.Errorf("failed load file: %w", err) @@ -18,7 +18,7 @@ func LoadFile(filename string) (model.Doc, error) { return Load(filename, content) } -func Load(name string, input []byte) (model.Doc, error) { +func Load(name string, input []byte) (*model.Doc, error) { p := &parser.Parser{} astSlice, err := p.Parse(name, input) if err != nil { diff --git a/loader_test.go b/loader_test.go new file mode 100644 index 0000000..acd689d --- /dev/null +++ b/loader_test.go @@ -0,0 +1,30 @@ +package conf_test + +import ( + "fmt" + + "go.neonxp.ru/conf" +) + +func ExampleLoad() { + config := ` + key = "value"; + group "test" { + key = 123; + } + ` + + cfg, err := conf.Load("example", []byte(config)) + if err != nil { + panic(err) + } + + fmt.Println("key =", cfg.Get("key")[0]) + group := cfg.Commands("group") + for _, gr := range group { + fmt.Println("key =", gr.Body.Get("key")[0]) + } + // Output: + // key = value + // key = 123 +} diff --git a/model/assignment.go b/model/assignment.go new file mode 100644 index 0000000..746e2b3 --- /dev/null +++ b/model/assignment.go @@ -0,0 +1,6 @@ +package model + +type Assignment struct { + Key string + Value Values +} diff --git a/model/command.go b/model/command.go new file mode 100644 index 0000000..237e94f --- /dev/null +++ b/model/command.go @@ -0,0 +1,9 @@ +package model + +type Command struct { + Name string + Arguments Values + Body *Doc +} + +type Commands []*Command diff --git a/model/doc.go b/model/doc.go index 76f03e4..9c13a4c 100644 --- a/model/doc.go +++ b/model/doc.go @@ -1,18 +1,41 @@ package model -type Doc []any +type Doc struct { + items []any + vars map[string]Values + commands map[string]Commands +} -type Assignment struct { - Key string - Value []Value +func New(cap int) *Doc { + return &Doc{ + items: make([]any, 0, cap), + vars: make(map[string]Values, cap), + commands: make(map[string]Commands, cap), + } } -type Command struct { - Name string - Arguments []Value - Body Doc +func (d *Doc) AppendAssignment(e *Assignment) { + d.items = append(d.items, e) + d.vars[e.Key] = append(d.vars[e.Key], e.Value...) } -type Value any +func (d *Doc) AppendCommand(c *Command) { + d.items = append(d.items, c) + d.commands[c.Name] = append(d.commands[c.Name], c) +} -type Word string +func (d *Doc) Vars() map[string]Values { + return d.vars +} + +func (d *Doc) Get(key string) Values { + return d.vars[key] +} + +func (d *Doc) Commands(name string) Commands { + return d.commands[name] +} + +func (d *Doc) Items() []any { + return d.items +} diff --git a/model/lookup.go b/model/lookup.go new file mode 100644 index 0000000..e8cc8bf --- /dev/null +++ b/model/lookup.go @@ -0,0 +1,49 @@ +package model + +import ( + "os" + "strings" +) + +// WordLookup тип определяющий функцию поиска замены слов при +// стрингификации Values. +type WordLookup func(word Word) string + +// chainLookup утилитарная функция для последовательных применений функций +// поиска до первого нахождения подстановки. Если returnOrigin == true, +// то в случае неудачи вернёт имя слова. +func chainLookup(lookups ...WordLookup) WordLookup { + return func(word Word) string { + for _, lookup := range lookups { + if v := lookup(word); v != "" { + return v + } + } + return string(word) + } +} + +// LookupEnv функция типа WordLookup которая пытается подставить вместо word +// соответствующую ему переменную окружения ОС. При этом он срабатывает только +// если слово начинается со знака `$`. +func LookupEnv(word Word) string { + if !strings.HasPrefix(string(word), "$") { + return "" + } + varName := strings.TrimPrefix(string(word), "$") + if result, ok := os.LookupEnv(varName); ok { + return result + } + return "" +} + +// LookupSubst функция типа WordLookup которая пытается подставить вместо word +// значение из словаря подстановок по соответствующему ключу. +func LookupSubst(subst map[Word]string) WordLookup { + return func(word Word) string { + if result, ok := subst[word]; ok { + return result + } + return "" + } +} diff --git a/model/value.go b/model/value.go new file mode 100644 index 0000000..4ec7344 --- /dev/null +++ b/model/value.go @@ -0,0 +1,42 @@ +package model + +import ( + "strconv" + "strings" +) + +type Value any + +type Values []Value + +// BuildString собирает из значений Value цельную строку, при этом приводя все +// значения к типу string. Так же принимает функции типа WordLookup, которые +// последовательно будут пытаться привести значения типа Word к +// контекстозависимым значениям. Например, пытаться находить по имени переменную +// окружения ОС. +func (v Values) BuildString(lookups ...WordLookup) string { + sw := strings.Builder{} + + for _, v := range v { + switch v := v.(type) { + case string: + sw.WriteString(v) + case float64: + sw.WriteString(strconv.FormatFloat(v, 'f', 5, 64)) + case int: + sw.WriteString(strconv.Itoa(v)) + case bool: + if v { + sw.WriteString("true") + continue + } + sw.WriteString("false") + case Word: + sw.WriteString(chainLookup(lookups...)(v)) + } + } + + return sw.String() +} + +type Word string |