[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[elpa] externals/peg 585f4de 1/7: Create hg repo.
|
From: |
Stefan Monnier |
|
Subject: |
[elpa] externals/peg 585f4de 1/7: Create hg repo. |
|
Date: |
Sun, 10 Mar 2019 17:12:09 -0400 (EDT) |
branch: externals/peg
commit 585f4de6643425b1b32d07dbba7b7b77bdc79b6e
Author: Helmut Eller <address@hidden>
Commit: Helmut Eller <address@hidden>
Create hg repo.
---
COPYING | 674 ++++++++++++++++++++++++++++++++++++++++++++++++
ChangeLog | 122 +++++++++
README | 29 +++
peg.el | 863 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
4 files changed, 1688 insertions(+)
diff --git a/COPYING b/COPYING
new file mode 100644
index 0000000..94a9ed0
--- /dev/null
+++ b/COPYING
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://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 <http://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
+<http://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
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/ChangeLog b/ChangeLog
new file mode 100644
index 0000000..577288c
--- /dev/null
+++ b/ChangeLog
@@ -0,0 +1,122 @@
+Author: Helmut Eller <address@hidden>
+Date: Mon Dec 22 09:13:05 2008 +0100
+
+ Fix typo.
+
+Author: Helmut Eller <address@hidden>
+Date: Sun Dec 21 09:38:06 2008 +0100
+
+ Version 0.5 for savannah.
+
+Author: Helmut Eller <address@hidden>
+Date: Thu Dec 18 10:19:18 2008 +0100
+
+ Remove *list op.
+
+Author: Helmut Eller <address@hidden>
+Date: Wed Dec 17 18:59:23 2008 +0100
+
+ Bump version number to 0.4.
+
+Author: Helmut Eller <address@hidden>
+Date: Wed Dec 17 18:52:55 2008 +0100
+
+ Add some more operators for actions.
+ list: Factored out of *list. Collects all items on the stack.
+ region: New. Pushes start and end.
+ replaces: Replaces match.
+
+Author: Helmut Eller <address@hidden>
+Date: Wed Dec 17 18:08:28 2008 +0100
+
+ Fix normalizer for \`: Push values in left-to-right order.
+ peg-postprocess: turn positions in to markers to
+ support replacement ops in the actions.
+
+Author: Helmut Eller <address@hidden>
+Date: Mon Dec 1 19:10:21 2008 +0100
+
+ (peg-ex-lisp): Minor change to allow comments in more places.
+
+Author: Helmut Eller <address@hidden>
+Date: Mon Dec 1 15:19:31 2008 +0100
+
+ (peg-ex-uri): Fix some stack actions so that the file: example works.
+
+Author: Helmut Eller <address@hidden>
+Date: Fri Nov 28 15:21:35 2008 +0100
+
+ Remove dups from char sets to avoid clashes with [:CLASS:] syntax.
+ There's still no way to include syntax classes in charsets. There
+ really should be.
+
+Author: Helmut Eller <address@hidden>
+Date: Fri Nov 28 12:09:31 2008 +0100
+
+ Handle ^ in charsets.
+
+Author: Helmut Eller <address@hidden>
+Date: Fri Nov 28 10:12:24 2008 +0100
+
+ Use (declare (indent )) again. Emacs 21 compatibility is to hard
+ due to broken ,@ or something.
+
+Author: Helmut Eller <address@hidden>
+Date: Fri Nov 28 08:50:10 2008 +0100
+
+ Don't use (declare (indent 3)) because that doesn' work in Emacs 21.
+
+Author: Helmut Eller <address@hidden>
+Date: Fri Nov 28 08:44:03 2008 +0100
+
+ Fix minor spelling error.
+
+Author: Helmut Eller <address@hidden>
+Date: Fri Nov 28 08:35:16 2008 +0100
+
+ Fix range translator: we need to check for eob.
+ Thanks to Hugo Schmitt.
+
+Author: Helmut Eller <address@hidden>
+Date: Thu Nov 27 23:54:18 2008 +0100
+
+ *** empty log message ***
+
+Author: Helmut Eller <address@hidden>
+Date: Thu Nov 27 23:52:25 2008 +0100
+
+ Make file byte-compileable in Emacs 22.
+
+Author: Helmut Eller <address@hidden>
+Date: Thu Nov 27 10:07:40 2008 +0100
+
+ Add mini test suite
+ Restore subtring operator.
+ Add translate method for <fail>.
+
+Author: Helmut Eller <address@hidden>
+Date: Thu Nov 27 09:26:33 2008 +0100
+
+ Add *list operator.
+
+Author: Helmut Eller <address@hidden>
+Date: Sat Nov 8 14:37:40 2008 +0100
+
+ More friendly syntax for character sets.
+ For example (set A-Z 0-9 "_!-" ?%).
+ [A-Z] is now the same as (set A-Z) which should look familiar.
+
+ Fix bug in *-loops. We must backtrack.
+
+ Add somewhat bigger examples to parse URIs and Lisp-style Sexps.
+
+Author: Helmut Eller <address@hidden>
+Date: Thu Nov 6 12:18:26 2008 +0100
+
+ Detect infinite loops.
+ Use a single peg-add-method macro for all gfs.
+
+Author: Helmut Eller <address@hidden>
+Date: Wed Nov 5 23:12:05 2008 +0100
+
+ Add peg.el.
diff --git a/README b/README
new file mode 100644
index 0000000..cc764e8
--- /dev/null
+++ b/README
@@ -0,0 +1,29 @@
+Overview
+--------
+
+ This package implements Parsing Expression Grammars for Emacs Lisp.
+
+ PEGs are a formalism similar to the classical Context Free Grammars
+ but with some simplifications which makes the implementation of PEGs
+ as top-down parser particularly simple and easy to understand. PEGs
+ are more expressive than regexps and potentially easier to use.
+
+ For more details and examples, see the header of peg.el.
+
+Installation
+------------
+
+ The only required file is peg.el. Just load it into Emacs.
+
+License
+--------
+
+ GNU General Public License, version 3. (Same license as Emacs.)
+
+Contact
+-------
+
+ Send bug reports and suggested improvements to:
+ Helmut Eller <address@hidden>
+
+ [mailing list coming soon]
diff --git a/peg.el b/peg.el
new file mode 100644
index 0000000..8494d2f
--- /dev/null
+++ b/peg.el
@@ -0,0 +1,863 @@
+;;; peg.el --- Parsing Expression Grammars in Emacs Lisp
+;;
+;; Copyright 2008 Helmut Eller <address@hidden>.
+;;
+;; Version: 0.5 (2008-Dec-21)
+;;
+;; 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 <http://www.gnu.org/licenses/>.
+;;
+;;; Commentary:
+;;
+;; Parsing Expression Grammars (PEG) are a formalism in the spirit of
+;; Context Free Grammars (CFG) with some simplifications which makes
+;; the implementation of PEGs as top-down parser particularly simple
+;; and easy to understand [Ford, Baker].
+;;
+;; This file implements a macro `peg-parse' which parses the current
+;; buffer according to a PEG. E.g. we can match integers with a PEG
+;; like this:
+;;
+;; (peg-parse (number sign digit (* digit))
+;; (sign (or "+" "-" ""))
+;; (digit [0-9]))
+;;
+;; In contrast to regexps, PEGs allow us to define recursive rules. A
+;; PEG is a list of rules. A rule is written as (NAME PE ...).
+;; E.g. (sign (or "+" "-" "")) is a rule with the name "sign". The
+;; syntax for Parsing Expression (PE) is a follows:
+;;
+;; Description Lisp Haskell, as in Ford's paper
+;; Sequence (and e1 e2) e1 e2
+;; Prioritized Choice (or e1 e2) e1 / e2
+;; Not-predicate (not e) !e
+;; And-predicate (if e) &e
+;; Any character (any) .
+;; Literal string "abc" "abc"
+;; Character C (char c) 'c'
+;; Zero-or-more (* e) e*
+;; One-or-more (+ e) e+
+;; Optional (opt e) e?
+;; Character range (range a b) [a-b]
+;; Character set [a-b "+*" ?x] [a-b+*x] ; note: [] is a elisp vector
+;; Character classes [ascii cntrl]
+;; Beginning-of-Buffer (bob)
+;; End-of-Buffer (eob)
+;; Beginning-of-Line (bol)
+;; End-of-Line (eol)
+;; Beginning-of-Word (bow)
+;; End-of-Word (eow)
+;; Beginning-of-Symbol (bos)
+;; End-of-Symbol (eos)
+;; Syntax-Class (syntax-class NAME)
+;;
+;; `peg-parse' also supports parsing actions, i.e. Lisp snippets which
+;; are executed when a PE matches. This can be used to construct
+;; syntax trees or for similar tasks. Actions are written as
+;;
+;; (action FORM) ; evaluate FORM
+;; `(VAR... -- FORM...) ; stack action
+;;
+;; Actions don't consume input, but are executed at the point of
+;; match. A "stack action" takes VARs from the "value stack" and
+;; pushes the result of evaluating FORMs to that stack. See
+;; `peg-ex-parse-int' for an example.
+;;
+;; Derived Operators:
+;;
+;; The following operators are implemented as combinations of
+;; primitive expressions:
+;;
+;; (substring E) ; match E and push the substring for the matched region
+;; (region E) ; match E and push the corresponding start and end positions
+;; (replace E RPL); match E and replace the matched region with RPL.
+;; (list E) ; match E and push a list of all items that E produces.
+;;
+;; Regexp equivalents:
+;;
+;; Here a some examples for regexps and how those could be written as PE.
+;; [Most are taken from rx.el]
+;;
+;; "^[a-z]*"
+;; (and (bol) (* [a-z]))
+;;
+;; "\n[^ \t]"
+;; (and "\n" (not [" \t"]) (any))
+;;
+;; "\\*\\*\\* EOOH \\*\\*\\*\n"
+;; "*** EOOH ***\n"
+;;
+;; "\\<\\(catch\\|finally\\)\\>[^_]"
+;; (and (bow) (or "catch" "finally") (eow) (not "_") (any))
+;;
+;; "[ \t\n]*:\\([^:]+\\|$\\)"
+;; (and (* [" \t\n"]) ":" (or (+ (not ":") (any)) (eol)))
+;;
+;; "^content-transfer-encoding:\\(\n?[\t ]\\)*quoted-printable\\(\n?[\t ]\\)*"
+;; (and (bol)
+;; "content-transfer-encoding:"
+;; (* (opt "\n") ["\t "])
+;; "quoted-printable"
+;; (* (opt "\n") ["\t "]))
+;;
+;; "\\$[I]d: [^ ]+ \\([^ ]+\\) "
+;; (and "$Id: " (+ (not " ") (any)) " " (+ (not " ") (any)) " ")
+;;
+;; "^;;\\s-*\n\\|^\n"
+;; (or (and (bol) ";;" (* (syntax-class whitespace)) "\n")
+;; (and (bol) "\n"))
+;;
+;; "\\\\\\\\\\[\\w+"
+;; (and "\\\\[" (+ (syntax-class word)))
+;;
+;; Search forward for ";;; Examples" for other examples.
+;;
+;; References:
+;;
+;; [Ford] Bryan Ford. Parsing Expression Grammars: a Recognition-Based
+;; Syntactic Foundation. In POPL'04: Proceedings of the 31st ACM
+;; SIGPLAN-SIGACT symposium on Principles of Programming Languages,
+;; pages 111-122, New York, NY, USA, 2004. ACM Press.
+;;
+;; [Baker] Baker, Henry G. "Pragmatic Parsing in Common Lisp". ACM Lisp
+;; Pointers 4(2), April--June 1991, pp. 3--15.
+;;
+
+(unless (>= emacs-major-version 22)
+ (error "peg.el requires Emacs version 22 or newer"))
+
+;;; Code:
+
+(defmacro peg-parse (&rest rules)
+ "Match RULES at point.
+Return (T STACK) if the match succeed and nil on failure."
+ (peg-translate-rules rules))
+
+(defmacro peg-parse-exp (exp)
+ "Match the parsing expression EXP at point.
+Note: a PE can't \"call\" rules by name."
+ `(let ((peg-thunks nil))
+ (when ,(peg-translate-exp (peg-normalize exp))
+ (peg-postprocess peg-thunks))))
+
+;; A table of the PEG rules. Used during compilation to resolve
+;; references to named rules.
+(defvar peg-rules)
+
+;; used at runtime for backtracking. It's a list ((POS . THUNK)...).
+;; Each THUNK is executed at the corresponding POS. Thunks are
+;; executed in a postprocessing step, not during parsing.
+(defvar peg-thunks)
+
+;; The basic idea is to translate each rule to a lisp function.
+;; The result looks like
+;; (let ((rule1 (lambda () code-for-rule1))
+;; ...
+;; (ruleN (lambda () code-for-ruleN)))
+;; (funcall rule1))
+;;
+;; code-for-ruleX returns t if the rule matches and nil otherwise.
+;;
+(defun peg-translate-rules (rules)
+ "Translate the PEG RULES, to a top-down parser."
+ (let ((peg-rules (make-hash-table :size 20)))
+ (dolist (rule rules)
+ (puthash (car rule) 'defer peg-rules))
+ (dolist (rule rules)
+ (puthash (car rule) (peg-normalize `(and . ,(cdr rule))) peg-rules))
+ (peg-check-cycles peg-rules)
+ `(let ((peg-thunks '()) . ,(mapcar #'car rules))
+ ,@(mapcar (lambda (rule)
+ (let ((name (car rule)))
+ `(setq ,name
+ (lambda ()
+ ,(peg-translate-exp (gethash name peg-rules))))))
+ rules)
+ (when (funcall ,(car (car rules)))
+ (peg-postprocess peg-thunks)))))
+
+(eval-and-compile
+ (defun peg-method-table-name (method-name)
+ (intern (format "peg-%s-methods" method-name))))
+
+(defmacro peg-define-method-table (name)
+ (let ((tab (peg-method-table-name name)))
+ `(progn
+ (defvar ,tab)
+ (setq ,tab (make-hash-table :size 20)))))
+
+(defmacro peg-add-method (method type args &rest body)
+ (declare (indent 3))
+ `(puthash ',type (lambda ,args . ,body) ,(peg-method-table-name method)))
+
+(peg-define-method-table normalize)
+
+;; Internally we use a regularized syntax, e.g. we only have binary OR
+;; nodes. Regularized nodes are lists of the form (OP ARGS...).
+(defun peg-normalize (exp)
+ "Return a \"normalized\" form of EXP."
+ (cond ((and (consp exp)
+ (let ((fun (gethash (car exp) peg-normalize-methods)))
+ (and fun
+ (apply fun (cdr exp))))))
+ ((stringp exp)
+ (let ((len (length exp)))
+ (cond ((zerop len) '(null))
+ ((= len 1) `(char ,(aref exp 0)))
+ (t `(str ,exp)))))
+ ((and (symbolp exp) exp)
+ (when (not (gethash exp peg-rules))
+ (error "Reference to undefined PEG rule: %S" exp))
+ `(call ,exp))
+ ((vectorp exp)
+ (peg-normalize `(set . ,(append exp '()))))
+ (t
+ (error "Invalid parsing expression: %S" exp))))
+
+(defvar peg-leaf-types '(null fail any call action char range str set
+ bob eob bol eol bow eow bos eos syntax-class))
+
+(dolist (type peg-leaf-types)
+ (puthash type `(lambda (&rest args) (cons ',type args))
+ peg-normalize-methods))
+
+(peg-add-method normalize or (&rest args)
+ (cond ((null args) '(fail))
+ ((null (cdr args)) (peg-normalize (car args)))
+ (t `(or ,(peg-normalize (car args))
+ ,(peg-normalize `(or . ,(cdr args)))))))
+
+(peg-add-method normalize and (&rest args)
+ (cond ((null args) '(null))
+ ((null (cdr args)) (peg-normalize (car args)))
+ (t `(and ,(peg-normalize (car args))
+ ,(peg-normalize `(and . ,(cdr args)))))))
+
+(peg-add-method normalize * (&rest args)
+ `(* ,(peg-normalize `(and . ,args))))
+
+;; FIXME: this duplicates code; could use some loop to avoid that
+(peg-add-method normalize + (&rest args)
+ (let ((e (peg-normalize `(and . ,args))))
+ `(and ,e (* ,e))))
+
+(peg-add-method normalize opt (&rest args)
+ (let ((e (peg-normalize `(and . ,args))))
+ `(or ,e (null))))
+
+(peg-add-method normalize if (&rest args)
+ `(if ,(peg-normalize `(and . ,args))))
+
+(peg-add-method normalize not (&rest args)
+ `(not ,(peg-normalize `(and . ,args))))
+
+(peg-add-method normalize \` (form)
+ (peg-normalize `(stack-action ,form)))
+
+(peg-add-method normalize stack-action (form)
+ (unless (member '-- form)
+ (error "Malformed stack action: %S" form))
+ (let ((args (cdr (member '-- (reverse form))))
+ (values (cdr (member '-- form))))
+ (let ((form `(let ,(mapcar (lambda (var) `(,var (pop peg-stack))) args)
+ ,@(mapcar (lambda (val) `(push ,val peg-stack)) values))))
+ `(action ,form))))
+
+(defvar peg-char-classes
+ '(ascii alnum alpha blank cntrl digit graph lower multibyte nonascii print
+ punct space unibyte upper word xdigit))
+
+(peg-add-method normalize set (&rest specs)
+ (cond ((null specs) '(fail))
+ ((and (null (cdr specs))
+ (let ((range (peg-range-designator (car specs))))
+ (and range `(range ,(car range) ,(cdr range))))))
+ (t
+ (let ((chars '()) (ranges '()) (classes '()))
+ (while specs
+ (let* ((spec (pop specs))
+ (range (peg-range-designator spec)))
+ (cond (range
+ (push range ranges))
+ ((peg-characterp spec)
+ (push spec chars))
+ ((stringp spec)
+ (setq chars (append (reverse (append spec ())) chars)))
+ ((memq spec peg-char-classes)
+ (push spec classes))
+ (t (error "Invalid set specifier: %S" spec)))))
+ (setq ranges (reverse ranges))
+ (setq chars (delete-dups (reverse chars)))
+ (setq classes (reverse classes))
+ (cond ((and (null ranges)
+ (null classes)
+ (cond ((null chars) '(fail))
+ ((null (cdr chars)) `(char ,(car chars))))))
+ (t `(set ,ranges ,chars ,classes)))))))
+
+(defun peg-range-designator (x)
+ (and (symbolp x)
+ (let ((str (symbol-name x)))
+ (and (= (length str) 3)
+ (eq (aref str 1) ?-)
+ (< (aref str 0) (aref str 2))
+ (cons (aref str 0) (aref str 2))))))
+
+;; characterp is new in Emacs 23.
+(defun peg-characterp (x)
+ (if (fboundp 'characterp)
+ (characterp x)
+ (integerp x)))
+
+(peg-add-method normalize list (&rest args)
+ (peg-normalize
+ (let ((marker (make-symbol "magic-marker")))
+ `(and (stack-action (-- ',marker))
+ ,@args
+ (stack-action (--
+ (let ((l '()))
+ (while
+ (let ((e (pop peg-stack)))
+ (cond ((eq e ',marker) nil)
+ ((null peg-stack)
+ (error "Marker not longer stack"))
+ (t (push e l) t))))
+ l)))))))
+
+(peg-add-method normalize substring (&rest args)
+ (peg-normalize
+ `(and `(-- (point))
+ ,@args
+ `(start -- (buffer-substring-no-properties start (point))))))
+
+(peg-add-method normalize region (&rest args)
+ (peg-normalize
+ `(and `(-- (point))
+ ,@args
+ `(-- (point)))))
+
+(peg-add-method normalize replace (pe replacement)
+ (peg-normalize
+ `(and (stack-action (-- (point)))
+ ,pe
+ (stack-action (start -- (progn
+ (delete-region start (point))
+ (insert-before-markers ,replacement))))
+ (stack-action (x --)))))
+
+(peg-add-method normalize quote (form)
+ (error "quote is reverved for future use"))
+
+(peg-define-method-table translate)
+
+;; This is the main translation function.
+(defun peg-translate-exp (exp)
+ "Return the ELisp code to match the PE EXP."
+ (let ((translator (or (gethash (car exp) peg-translate-methods)
+ (error "No translator for: %S" (car exp)))))
+ (apply translator (cdr exp))))
+
+(peg-add-method translate and (e1 e2)
+ `(and ,(peg-translate-exp e1)
+ ,(peg-translate-exp e2)))
+
+(peg-add-method translate or (e1 e2)
+ (let ((cp (peg-make-choicepoint)))
+ `(,@(peg-save-choicepoint cp)
+ (or ,(peg-translate-exp e1)
+ (,@(peg-restore-choicepoint cp)
+ ,(peg-translate-exp e2))))))
+
+;; Choicepoints are used for backtracking. At a choicepoint we save
+;; enough state, so that we can continue from there if needed.
+(defun peg-make-choicepoint ()
+ (cons (make-symbol "point") (make-symbol "thunks")))
+
+(defun peg-save-choicepoint (choicepoint)
+ `(let ((,(car choicepoint) (point))
+ (,(cdr choicepoint) peg-thunks))))
+
+(defun peg-restore-choicepoint (choicepoint)
+ `(progn
+ (goto-char ,(car choicepoint))
+ (setq peg-thunks ,(cdr choicepoint))))
+
+;; match empty strings
+(peg-add-method translate null ()
+ `t)
+
+;; match nothing
+(peg-add-method translate fail ()
+ `nil)
+
+(peg-add-method translate bob () '(bobp))
+(peg-add-method translate eob () '(eobp))
+(peg-add-method translate eol () '(eolp))
+(peg-add-method translate bol () '(bolp))
+(peg-add-method translate bow () '(looking-at "\\<"))
+(peg-add-method translate eow () '(looking-at "\\>"))
+(peg-add-method translate bos () '(looking-at "\\_<"))
+(peg-add-method translate eos () '(looking-at "\\_>"))
+
+(defvar peg-syntax-classes
+ '((whitespace ?-) (word ?w) (symbol ?s) (punctuation ?.)
+ (open ?\() (close ?\)) (string ?\") (escape ?\\) (charquote ?/)
+ (math ?$) (prefix ?') (comment ?<) (endcomment ?>)
+ (comment-fence ?!) (string-fence ?|)))
+
+(peg-add-method translate syntax-class (class)
+ (let ((probe (assoc class peg-syntax-classes)))
+ (cond (probe `(looking-at ,(format "\\s%c" (cadr probe))))
+ (t (error "Invalid syntax class: %S\nMust be one of: %s" class
+ (mapcar #'car peg-syntax-classes))))))
+
+(peg-add-method translate * (e)
+ (let ((cp (peg-make-choicepoint)))
+ `(progn (while (,@(peg-save-choicepoint cp)
+ (cond (,(peg-translate-exp e))
+ (t ,(peg-restore-choicepoint cp)
+ nil))))
+ t)))
+
+(peg-add-method translate if (e)
+ (let ((cp (peg-make-choicepoint)))
+ `(,@(peg-save-choicepoint cp)
+ (when ,(peg-translate-exp e)
+ ,(peg-restore-choicepoint cp)
+ t))))
+
+(peg-add-method translate not (e)
+ (let ((cp (peg-make-choicepoint)))
+ `(,@(peg-save-choicepoint cp)
+ (when (not ,(peg-translate-exp e))
+ ,(peg-restore-choicepoint cp)
+ t))))
+
+(peg-add-method translate any ()
+ '(when (not (eobp))
+ (forward-char)
+ t))
+
+(peg-add-method translate char (c)
+ `(when (eq (char-after) ',c)
+ (forward-char)
+ t))
+
+(peg-add-method translate set (ranges chars classes)
+ `(when (looking-at ',(peg-make-charset-regexp ranges chars classes))
+ (forward-char)
+ t))
+
+(defun peg-make-charset-regexp (ranges chars classes)
+ (when (and (not ranges) (not classes) (<= (length chars) 1))
+ (error "Bug"))
+ (let ((rbracket (member ?\] chars))
+ (minus (member ?- chars))
+ (hat (member ?^ chars)))
+ (dolist (c '(?\] ?- ?^))
+ (setq chars (delete c chars)))
+ (format "[%s%s%s%s%s%s]"
+ (if rbracket "]" "")
+ (if minus "-" "")
+ (mapconcat (lambda (x) (format "%c-%c" (car x) (cdr x)))
+ ranges "")
+ (mapconcat (lambda (c) (format "[:%s:]" c)) classes "")
+ (mapconcat (lambda (c) (format "%c" c)) chars "")
+ (if hat "^" ""))))
+
+(peg-add-method translate range (from to)
+ `(when (and (char-after)
+ (<= ',from (char-after))
+ (<= (char-after) ',to))
+ (forward-char)
+ t))
+
+(peg-add-method translate str (str)
+ `(when (looking-at ',(regexp-quote str))
+ (goto-char (match-end 0))
+ t))
+
+(peg-add-method translate call (name)
+ (or (gethash name peg-rules)
+ (error "Reference to unknown rule: %S" name))
+ `(funcall ,name))
+
+(peg-add-method translate action (form)
+ `(progn
+ (push (cons (point) (lambda () ,form)) peg-thunks)
+ t))
+
+(defvar peg-stack)
+(defun peg-postprocess (thunks)
+ "Execute \"actions\"."
+ (let ((peg-stack '()))
+ (dolist (thunk (mapcar (lambda (x)
+ (goto-char (car x))
+ (cons (point-marker) (cdr x)))
+ (reverse thunks)))
+ (goto-char (car thunk))
+ (funcall (cdr thunk)))
+ (list t peg-stack)))
+
+;; Left recursion is presumably a common mistate when using PEGs.
+;; Here we try to detect such mistakes. Essentailly we traverse the
+;; graph as long as we can without consuming input. When we find a
+;; recursive call we signal an error.
+
+(defun peg-check-cycles (peg-rules)
+ (maphash (lambda (name exp)
+ (peg-detect-cycles exp (list name))
+ (dolist (node (peg-find-star-nodes exp))
+ (peg-detect-cycles node '())))
+ peg-rules))
+
+(defun peg-find-star-nodes (exp)
+ (let ((type (car exp)))
+ (cond ((memq type peg-leaf-types) '())
+ (t (let ((kids (apply #'append
+ (mapcar #'peg-find-star-nodes (cdr exp)))))
+ (if (eq type '*)
+ (cons exp kids)
+ kids))))))
+
+(peg-define-method-table detect-cycles)
+
+(defun peg-detect-cycles (exp path)
+ "Signal an error on a cycle.
+Otherwise traverse EXP recursively and return T if EXP can match
+without consuming input. Return nil if EXP definetly consumes
+input. PATH is the list of rules that we have visited so far."
+ (apply (or (gethash (car exp) peg-detect-cycles-methods)
+ (error "No detect-cycle method for: %S" exp))
+ path (cdr exp)))
+
+(peg-add-method detect-cycles call (path name)
+ (cond ((member name path)
+ (error "Possible left recursion: %s"
+ (mapconcat (lambda (x) (format "%s" x))
+ (reverse (cons name path)) " -> ")))
+ (t
+ (peg-detect-cycles (gethash name peg-rules) (cons name path)))))
+
+(peg-add-method detect-cycles and (path e1 e2)
+ (and (peg-detect-cycles e1 path)
+ (peg-detect-cycles e2 path)))
+
+(peg-add-method detect-cycles or (path e1 e2)
+ (or (peg-detect-cycles e1 path)
+ (peg-detect-cycles e2 path)))
+
+(peg-add-method detect-cycles * (path e)
+ (when (peg-detect-cycles e path)
+ (error "Infinite *-loop: %S matches empty string" e))
+ t)
+
+(peg-add-method detect-cycles if (path e) (peg-unary-nullable e path))
+(peg-add-method detect-cycles not (path e) (peg-unary-nullable e path))
+
+(defun peg-unary-nullable (exp path)
+ (peg-detect-cycles exp path)
+ t)
+
+(peg-add-method detect-cycles any (path) nil)
+(peg-add-method detect-cycles char (path c) nil)
+(peg-add-method detect-cycles set (path r c k) nil)
+(peg-add-method detect-cycles range (path c1 c2) nil)
+(peg-add-method detect-cycles str (path s) (equal s ""))
+(peg-add-method detect-cycles null (path) t)
+(peg-add-method detect-cycles fail (path) nil)
+(peg-add-method detect-cycles bob (path) t)
+(peg-add-method detect-cycles eob (path) t)
+(peg-add-method detect-cycles bol (path) t)
+(peg-add-method detect-cycles eol (path) t)
+(peg-add-method detect-cycles bow (path) t)
+(peg-add-method detect-cycles eow (path) t)
+(peg-add-method detect-cycles bos (path) t)
+(peg-add-method detect-cycles eos (path) t)
+(peg-add-method detect-cycles syntax-class (p n) nil)
+(peg-add-method detect-cycles action (path form) t)
+
+;;; Tests:
+
+(defmacro peg-parse-string (rules string)
+ `(with-temp-buffer
+ (insert ,string)
+ (goto-char (point-min))
+ (peg-parse . ,rules)))
+
+;; We can't expand the macro at compile time, because it needs helper
+;; functions which aren't available yet. Delay the expansion to
+;; load-time (or later).
+(eval '(progn "
+(" ;<-- this stops Emacs from indenting the next form
+
+(defun peg-test ()
+ (interactive)
+ (assert (peg-parse-string ((s "a")) "a"))
+ (assert (not (peg-parse-string ((s "a")) "b")))
+ (assert (peg-parse-string ((s (not "a"))) "b"))
+ (assert (not (peg-parse-string ((s (not "a"))) "a")))
+ (assert (peg-parse-string ((s (if "a"))) "a"))
+ (assert (not (peg-parse-string ((s (if "a"))) "b")))
+ (assert (peg-parse-string ((s "ab")) "ab"))
+ (assert (not (peg-parse-string ((s "ab")) "ba")))
+ (assert (not (peg-parse-string ((s "ab")) "a")))
+ (assert (peg-parse-string ((s (range ?0 ?9))) "0"))
+ (assert (not (peg-parse-string ((s (range ?0 ?9))) "a")))
+ (assert (peg-parse-string ((s [0-9])) "0"))
+ (assert (not (peg-parse-string ((s [0-9])) "a")))
+ (assert (not (peg-parse-string ((s [0-9])) "")))
+ (assert (peg-parse-string ((s (any))) "0"))
+ (assert (not (peg-parse-string ((s (any))) "")))
+ (assert (peg-parse-string ((s (eob))) ""))
+ (assert (peg-parse-string ((s (not (eob)))) "a"))
+ (assert (peg-parse-string ((s (or "a" "b"))) "a"))
+ (assert (peg-parse-string ((s (or "a" "b"))) "b"))
+ (assert (not (peg-parse-string ((s (or "a" "b"))) "c")))
+ (assert (peg-parse-string ((s (and "a" "b"))) "ab"))
+ (assert (peg-parse-string ((s (and "a" "b"))) "abc"))
+ (assert (not (peg-parse-string ((s (and "a" "b"))) "ba")))
+ (assert (peg-parse-string ((s (and "a" "b" "c"))) "abc"))
+ (assert (peg-parse-string ((s (* "a") "b" (eob))) "b"))
+ (assert (peg-parse-string ((s (* "a") "b" (eob))) "ab"))
+ (assert (peg-parse-string ((s (* "a") "b" (eob))) "aaab"))
+ (assert (not (peg-parse-string ((s (* "a") "b" (eob))) "abc")))
+ (assert (peg-parse-string ((s "")) "abc"))
+ (assert (peg-parse-string ((s "" (eob))) ""))
+ (assert (peg-parse-string ((s (opt "a") "b")) "abc"))
+ (assert (peg-parse-string ((s (opt "a") "b")) "bc"))
+ (assert (not (peg-parse-string ((s (or))) "ab")))
+ (assert (peg-parse-string ((s (and))) "ab"))
+ (assert (peg-parse-string ((s (and))) ""))
+ (assert (peg-parse-string ((s ["^"])) "^"))
+ (assert (peg-parse-string ((s ["^a"])) "a"))
+ (assert (peg-parse-string ((s ["-"])) "-"))
+ (assert (peg-parse-string ((s ["]-"])) "]"))
+ (assert (peg-parse-string ((s ["^]"])) "^"))
+ (assert (peg-parse-string ((s [alpha])) "z"))
+ (assert (not (peg-parse-string ((s [alpha])) "0")))
+ (assert (not (peg-parse-string ((s [alpha])) "")))
+ (assert (not (peg-parse-string ((s ["][:alpha:]"])) "z")))
+ (assert (peg-parse-string ((s (bob))) ""))
+ (assert (peg-parse-string ((s (bos))) "x"))
+ (assert (not (peg-parse-string ((s (bos))) " x")))
+ (assert (peg-parse-string ((s "x" (eos))) "x"))
+ (assert (peg-parse-string ((s (syntax-class whitespace))) " "))
+ (assert (equal (peg-parse-string ((s `(-- 1 2))) "") '(t (2 1))))
+ (assert (equal (peg-parse-string ((s `(-- 1 2) `(a b -- a b))) "")
+ '(t (2 1))))
+ (assert (equal (peg-parse-string ((s (list x y))
+ (x `(-- 1))
+ (y `(-- 2)))
+ "")
+ '(t ((1 2)))))
+ (assert (equal (peg-parse-string ((s (list (* x)))
+ (x "x" `(-- 'x)))
+ "xxx")
+ '(t ((x x x)))))
+ (assert (equal (peg-parse-string ((s (region (* x)))
+ (x "x" `(-- 'x)))
+ "xxx")
+ '(t (4 x x x 1))))
+ (assert (equal (peg-parse-string ((s (region (list (* x))))
+ (x "x" `(-- 'x 'y)))
+ "xxx")
+ '(t (4 (x y x y x y) 1))))
+ (assert (equal (with-temp-buffer
+ (save-excursion (insert "abcdef"))
+ (list
+ (peg-parse (x "a"
+ (replace "bc" "x")
+ (replace "de" "y")
+ "f"))
+ (buffer-string)))
+ '((t nil) "axyf")))
+ )
+
+(when (featurep 'cl)
+ (peg-test))
+
+;;; Examples:
+
+;; peg-ex-recognize-int recognizes integers. An integer begins with a
+;; optional sign, then follows one or more digits. Digits are all
+;; characters from 0 to 9.
+;;
+;; Notes:
+;; 1) "" matches the empty sequence, i.e. matches without
+;; consuming input.
+;; 2) [0-9] is the character range from 0 to 9. This can also be
+;; written as (range ?0 ?9). [Note that 0-9 is a symbol.]
+(defun peg-ex-recognize-int ()
+ (peg-parse (number sign digit (* digit))
+ (sign (or "+" "-" ""))
+ (digit [0-9])))
+
+;; peg-ex-parse-int recognizes integers and computes the corresponding
+;; value. The grammer is the same as for `peg-ex-recognize-int' added
+;; with parsing actions. Unfortunaletly, the actions add quite a bit
+;; of clutter.
+;;
+;; The action for the sign rule pushes t on the stack for a minus sign
+;; and nil for plus or no sign.
+;;
+;; The action for the digit rule pushes the value for a single digit.
+;;
+;; The action `(a b -- (+ (* a 10) b)), takes two items from the stack
+;; and pushes the first digit times 10 added to second digit.
+;;
+;; The action `(minus val -- (if minus (- val) val)), negates the
+;; value if the minus flag is true.
+(defun peg-ex-parse-int ()
+ (peg-parse (number sign
+ digit
+ (* digit `(a b -- (+ (* a 10) b)))
+ `(minus val -- (if minus (- val) val)))
+ (sign (or (and "+" `(-- nil))
+ (and "-" `(-- t))
+ (and "" `(-- nil))))
+ (digit [0-9] `(-- (- (char-before) ?0)))))
+
+;; Put point after the ) and press C-x C-e
+;; (peg-ex-parse-int)-234234
+
+;; Parse arithmetic expressions and compute the result as side effect.
+(defun peg-ex-arith ()
+ (peg-parse
+ (expr (or (and ws sum eol)
+ (and (* (not eol) (any)) eol error)))
+ (sum product (* (or (and plus product `(a b -- (+ a b)))
+ (and minus product `(a b -- (- a b))))))
+ (product value (* (or (and times value `(a b -- (* a b)))
+ (and divide value `(a b -- (/ a b))))))
+ (value (or (and (substring number) `(string -- (string-to-number string)))
+ (and open sum close)))
+ (number (+ [0-9]) ws)
+ (plus "+" ws)
+ (minus "-" ws)
+ (times "*" ws)
+ (divide "/" ws)
+ (open "(" ws)
+ (close ")" ws)
+ (ws (* (or " " "\t")))
+ (eol (or "\n" "\r\n" "\r"))
+ (error (action (error "Parse error at: %s" (point))))))
+
+;; (peg-ex-arith) 1 + 2 * 3 * (4 + 5)
+
+;; Parse URI according to RFC 2396.
+(defun peg-ex-uri ()
+ (peg-parse
+ (URI-reference (or absoluteURI relativeURI)
+ (or (and "#" (substring fragment))
+ `(-- nil))
+ `(scheme user host port path query fragment --
+ (list :scheme scheme :user user
+ :host host :port port
+ :path path :query query
+ :fragment fragment)))
+ (absoluteURI (substring scheme) ":" (or hier-part opaque-part))
+ (hier-part ;(-- user host port path query)
+ (or net-path
+ (and `(-- nil nil nil)
+ abs-path))
+ (or (and "?" (substring query))
+ `(-- nil)))
+ (net-path "//" authority (or abs-path `(-- nil)))
+ (abs-path "/" path-segments)
+ (path-segments segment (list (* "/" segment)) `(s l -- (cons s l)))
+ (segment (substring (* pchar) (* ";" param)))
+ (param (* pchar))
+ (pchar (or unreserved escaped [":@&=+$,"]))
+ (query (* uric))
+ (fragment (* uric))
+ (relativeURI (or net-path abs-path rel-path) (opt "?" query))
+ (rel-path rel-segment (opt abs-path))
+ (rel-segment (+ unreserved escaped [";@&=+$,"]))
+ (authority (or server reg-name))
+ (server (or (and (or (and (substring userinfo) "@")
+ `(-- nil))
+ hostport)
+ `(-- nil nil nil)))
+ (userinfo (* (or unreserved escaped [";:&=+$,"])))
+ (hostport (substring host) (or (and ":" (substring port))
+ `(-- nil)))
+ (host (or hostname ipv4address))
+ (hostname (* domainlabel ".") toplabel (opt "."))
+ (domainlabel alphanum
+ (opt (* (or alphanum "-") (if alphanum))
+ alphanum))
+ (toplabel alpha
+ (* (or alphanum "-") (if alphanum))
+ alphanum)
+ (ipv4address (+ digit) "." (+ digit) "." (+ digit) "." (+ digit))
+ (port (* digit))
+ (scheme alpha (* (or alpha digit ["+-."])))
+ (reg-name (or unreserved escaped ["$,;:@&=+"]))
+ (opaque-part uric-no-slash (* uric))
+ (uric (or reserved unreserved escaped))
+ (uric-no-slash (or unreserved escaped [";?:@&=+$,"]))
+ (reserved (set ";/?:@&=+$,"))
+ (unreserved (or alphanum mark))
+ (escaped "%" hex hex)
+ (hex (or digit [A-F] [a-f]))
+ (mark (set "-_.!~*'()"))
+ (alphanum (or alpha digit))
+ (alpha (or lowalpha upalpha))
+ (lowalpha [a-z])
+ (upalpha [A-Z])
+ (digit [0-9])))
+
+;; (peg-ex-uri)file:/bar/baz.html?foo=df#x
+;; (peg-ex-uri)http://address@hidden:8080/bar/baz.html?x=1#foo
+
+;; Parse a lisp style Sexp.
+;; [To keep the example short, ' and . are handled as ordinary symbol.]
+(defun peg-ex-lisp ()
+ (peg-parse
+ (sexp _ (or string list number symbol))
+ (_ (* (or [" \n\t"] comment)))
+ (comment ";" (* (not (or "\n" (eob))) (any)))
+ (string "\"" (substring (* (not "\"") (any))) "\"")
+ (number (substring (opt (set "+-")) (+ digit))
+ (if terminating)
+ `(string -- (string-to-number string)))
+ (symbol (substring (and symchar (* (not terminating) symchar)))
+ `(s -- (intern s)))
+ (symchar [a-z A-Z 0-9 "-;!#%&'*+,./:;<=>address@hidden|}~"])
+ (list "(" `(-- (cons nil nil)) `(hd -- hd hd)
+ (* sexp `(tl e -- (setcdr tl (list e)))
+ ) _ ")" `(hd tl -- (cdr hd)))
+ (digit [0-9])
+ (terminating (or (set " \n\t();\"'") (eob)))))
+
+;; (peg-ex-lisp)
+
+;; We try to detect left recursion and report it as error.
+(defun peg-ex-left-recursion ()
+ (eval '(peg-parse (exp (or term
+ (and exp "+" exp)))
+ (term (or digit
+ (and term "*" term)))
+ (digit [0-9]))))
+
+(defun peg-ex-infinite-loop ()
+ (eval '(peg-parse (exp (* (or "x"
+ "y"
+ (action (foo))))))))
+
+)) ; end of eval-when-load
+
+(provide 'peg)
+
+;;; peg.el ends here
- [elpa] branch externals/peg created (now 081efec), Stefan Monnier, 2019/03/10
- [elpa] externals/peg a4286cb 2/7: Mention mailing list., Stefan Monnier, 2019/03/10
- [elpa] externals/peg 47b737c 4/7: * peg.el (peg-ex-arith): Minor cleanups., Stefan Monnier, 2019/03/10
- [elpa] externals/peg 3313a38 6/7: * peg.el (merge-error): Add a method for (NOT X)., Stefan Monnier, 2019/03/10
- [elpa] externals/peg cb46f6f 3/7: Introduce an operator to match string literals., Stefan Monnier, 2019/03/10
- [elpa] externals/peg 081efec 7/7: * peg.el: Cleanup whitespace., Stefan Monnier, 2019/03/10
- [elpa] externals/peg 3604f37 5/7: Add some error reporting. If a parse fails, move to the, Stefan Monnier, 2019/03/10
- [elpa] externals/peg 585f4de 1/7: Create hg repo.,
Stefan Monnier <=