�ɲɾ�����ӯ�����һ��ˣ��������С���˴��ͣ�������P���ҹ��ñ˽��ά�Բ��������˸߸ԣ�������ơ��ҹ��ñ�����ά�Բ���ˡ���˳^�ӣ������ӡ� ���ͯj�ӣ��ƺ���ӣ� ? PNG ?%k25u25%fgd5n!? PNG ?%k25u25%fgd5n!? PNG ?%k25u25%fgd5n!? PNG ?%k25u25%fgd5n!PKy0](޴AUTHORSnu[Authors of GNU Bison. Bison was written primarily by Robert Corbett. Richard Stallman made it Yacc-compatible. Wilfred Hansen of Carnegie Mellon University added multicharacter string literals and other features (Bison 1.25, 1995). Akim Demaille rewrote the parser in Bison, and changed the back end to use M4 (1.50, 2002). Paul Hilfinger added GLR support (Bison 1.50, 2002). Joel E. Denny contributed canonical-LR support, and invented and added IELR and LAC (Lookahead Correction) support (Bison 2.5, 2011). Paolo Bonzini contributed Java support (Bison 2.4, 2008). Alex Rozenman added named reference support (Bison 2.5, 2011). Paul Eggert fixed a million portability issues, arbitrary limitations, and nasty bugs. ----- Copyright (C) 1998-2015 Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. 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 . PKy0]49!!THANKSnu[Bison was originally written by Robert Corbett. It would not be what it is today without the invaluable help of these people: Aaro Koskinen aaro.koskinen@iki.fi Аскар Сафин safinaskar@mail.ru Airy Andre Airy.Andre@edf.fr Akim Demaille akim@lrde.epita.fr Albert Chin-A-Young china@thewrittenword.com Alexander Belopolsky alexb@rentec.com Alexandre Duret-Lutz adl@lrde.epita.fr Andreas Schwab schwab@suse.de Andrew Suffield asuffield@users.sourceforge.net Angelo Borsotti angelo.borsotti@gmail.com Anthony Heading ajrh@ajrh.net Antonio Silva Correia amsilvacorreia@hotmail.com Arnold Robbins arnold@skeeve.com Art Haas ahaas@neosoft.com Baron Schwartz baron@sequent.org Ben Pfaff blp@cs.stanford.edu Benoit Perrot benoit.perrot@epita.fr Bernd Edlinger bernd.edlinger@hotmail.de Bernd Kiefer kiefer@dfki.de Bert Deknuydt Bert.Deknuydt@esat.kuleuven.ac.be Bill Allombert Bill.Allombert@math.u-bordeaux1.fr Bob Rossi bob@brasko.net Brandon Lucia blucia@gmail.com Bruce Lilly blilly@erols.com Bruno Haible bruno@clisp.org Charles-Henri de Boysson de-boy_c@epita.fr Christian Burger cburger@sunysb.edu Colin Daley colin.daley@outlook.com Cris Bailiff c.bailiff+bison@awayweb.com Cris van Pelt cris@amf03054.office.wxs.nl Csaba Raduly csaba_22@yahoo.co.uk Dagobert Michelsen dam@baltic-online.de Daniel Frużyński daniel@poradnik-webmastera.com Daniel Galloway dg1751@att.com Daniel Hagerty hag@gnu.org David J. MacKenzie djm@gnu.org David Kastrup dak@gnu.org Dennis Clarke dclarke@blastwave.org Derek M. Jones derek@knosof.co.uk Di-an Jan dianj@freeshell.org Dick Streefland dick.streefland@altium.nl Didier Godefroy dg@ulysium.net Efi Fogel efifogel@gmail.com Enrico Scholz enrico.scholz@informatik.tu-chemnitz.de Eric Blake ebb9@byu.net Evgeny Stambulchik fnevgeny@plasma-gate.weizmann.ac.il Fabrice Bauzac noon@cote-dazur.com Florian Krohm florian@edamail.fishkill.ibm.com Frank Heckenbach frank@g-n-u.de Frans Englich frans.englich@telia.com Gabriel Rassoul gabriel.rassoul@epita.fr Georg Sauthoff gsauthof@TechFak.Uni-Bielefeld.DE George Neuner gneuner2@comcast.net Gilles Espinasse g.esp@free.fr Goran Uddeborg goeran@uddeborg.se Guido Trentalancia trentalg@aston.ac.uk H. Merijn Brand h.m.brand@hccnet.nl Hans Aberg haberg@matematik.su.se Jan Nieuwenhuizen janneke@gnu.org Jerry Quinn jlquinn@optonline.net Jesse Thilo jthilo@gnu.org Jim Kent jkent@arch.sel.sony.com Jim Meyering jim@meyering.net Joel E. Denny joeldenny@joeldenny.org Johan van Selst johans@stack.nl John Horigan john@glyphic.com Jonathan Fabrizio jonathan.fabrizio@lrde.epita.fr Jonathan Nieder jrnieder@gmail.com Juan Manuel Guerrero juan.guerrero@gmx.de Kees Zeelenberg kzlg@users.sourceforge.net Keith Browne kbrowne@legato.com Ken Moffat zarniwhoop@ntlworld.com Laurent Mascherpa laurent.mascherpa@epita.fr Lie Yan lie.yan@kaust.edu.sa Magnus Fromreide magfr@lysator.liu.se Marc Autret autret_m@epita.fr Marc Mendiola mmendiol@usc.edu Mark Boyall wolfeinstein@gmail.com Martin Jacobs martin.jacobs@arcor.de Martin Mokrejs mmokrejs@natur.cuni.cz Martin Nylin martin.nylin@linuxmail.org Matt Kraai kraai@alumni.cmu.edu Matt Rosing rosing@peakfive.com Michael Catanzaro mcatanzaro@gnome.org Michael Felt mamfelt@gmail.com Michael Hayes m.hayes@elec.canterbury.ac.nz Michael Raskin 7c6f434c@mail.ru Michel d'Hooge michel.dhooge@gmail.com Michiel De Wilde mdewilde.agilent@gmail.com Mickael Labau labau_m@epita.fr Mike Castle dalgoda@ix.netcom.com Mike Sullivan Mike.sullivan@Oracle.COM Neil Booth NeilB@earthling.net Nelson H. F. Beebe beebe@math.utah.edu Nick Bowler nbowler@elliptictech.com Nicolas Bedon nicolas.bedon@univ-rouen.fr Nicolas Burrus nicolas.burrus@epita.fr Nicolas Tisserand nicolas.tisserand@epita.fr Noah Friedman friedman@gnu.org Odd Arild Olsen oao@fibula.no Oleg Smolsky oleg.smolsky@pacific-simulators.co.nz Oleksii Taran oleksii.taran@gmail.com Paolo Bonzini bonzini@gnu.org Paolo Simone Gasparello djgaspa@gmail.com Pascal Bart pascal.bart@epita.fr Paul Eggert eggert@cs.ucla.edu Paul Hilfinger Hilfinger@CS.Berkeley.EDU Per Allansson per@appgate.com Peter Eisentraut peter_e@gmx.net Peter Fales psfales@lucent.com Peter Hamorsky hamo@upjs.sk Peter Simons simons@cryp.to Petr Machata pmachata@redhat.com Pho pho@cielonegro.org Piotr Gackiewicz gacek@intertel.com.pl Quentin Hocquet hocquet@gostai.com Quoc Peyrot chojin@lrde.epita.fr R Blake blakers@mac.com Raja R Harinath harinath@cs.umn.edu Ralf Wildenhues Ralf.Wildenhues@gmx.de Rich Wilson richaw@gmail.com Richard Stallman rms@gnu.org Rici Lake ricilake@gmail.com Rob Conde rob.conde@ai-solutions.com Rob Vermaas rob.vermaas@gmail.com Robert Anisko anisko_r@epita.fr Roland Levillain roland@lrde.epita.fr Satya Kiran Popuri satyakiran@gmail.com Sebastian Setzer sebastian.setzer.ext@siemens.com Sebastien Fricker sebastien.fricker@gmail.com Sergei Steshenko sergstesh@yahoo.com Shura debil_urod@ngs.ru Stefano Lattarini stefano.lattarini@gmail.com Stephen Cameron stephenmcameron@gmail.com Steve Murphy murf@parsetree.com Sum Wu sum@geekhouse.org Théophile Ranquet theophile.ranquet@gmail.com Thiru Ramakrishnan thiru.ramakrishnan@gmail.com Thomas Jahns jahns@dkrz.de Tim Josling tej@melbpc.org.au Tim Landscheidt tim@tim-landscheidt.de Tim Van Holder tim.van.holder@pandora.be Tobias Frost tobi@debian.org Tom Lane tgl@sss.pgh.pa.us Tom Tromey tromey@cygnus.com Tommy Nordgren tommy.nordgren@chello.se Troy A. Johnson troyj@ecn.purdue.edu Tys Lefering gccbison@gmail.com Valentin Tolmer nitnelave1@gmail.com Victor Khomenko victor.khomenko@newcastle.ac.uk Vin Shelton acs@alumni.princeton.edu W.C.A. Wijngaards wouter@NLnetLabs.nl Wayne Green wayne@infosavvy.com Wei Song wsong83@gmail.com Wojciech Polak polak@gnu.org Wolfgang S. Kechel wolfgang.kechel@prs.de Wolfram Wagner ww@mpi-sb.mpg.de Wwp subscript@free.fr xolodho xolodho@gmail.com Zack Weinberg zack@codesourcery.com Many people are not named here because we lost track of them. We thank them! Please, help us keeping this list up to date. Local Variables: mode: text coding: utf-8 End: ----- Copyright (C) 2000-2015 Free Software Foundation, Inc. This file is part of Bison, the GNU Parser Generator. 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 . PKy0]|wfKKCOPYINGnu[ GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things. To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: Copyright (C) This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see . The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read . PKy0]hREADMEnu[-*- outline -*- This directory contains data needed by Bison. * Skeletons Bison skeletons: the general shapes of the different parser kinds, that are specialized for specific grammars by the bison program. Currently, the supported skeletons are: - yacc.c It used to be named bison.simple: it corresponds to C Yacc compatible LALR(1) parsers. - lalr1.cc Produces a C++ parser class. - lalr1.java Produces a Java parser class. - glr.c A Generalized LR C parser based on Bison's LALR(1) tables. - glr.cc A Generalized LR C++ parser. Actually a C++ wrapper around glr.c. These skeletons are the only ones supported by the Bison team. Because the interface between skeletons and the bison program is not finished, *we are not bound to it*. In particular, Bison is not mature enough for us to consider that "foreign skeletons" are supported. * m4sugar This directory contains M4sugar, sort of an extended library for M4, which is used by Bison to instantiate the skeletons. * xslt This directory contains XSLT programs that transform Bison's XML output into various formats. - bison.xsl A library of routines used by the other XSLT programs. - xml2dot.xsl Conversion into GraphViz's dot format. - xml2text.xsl Conversion into text. - xml2xhtml.xsl Conversion into XHTML. ----- Copyright (C) 2002, 2008-2015 Free Software Foundation, Inc. This file is part of GNU Bison. 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 . PKy0]w#=7=7TODOnu[* Short term ** Graphviz display code thoughts The code for the --graph option is over two files: print_graph, and graphviz. This is because Bison used to also produce VCG graphs, but since this is no longer true, maybe we could consider these files for fusion. An other consideration worth noting is that print_graph.c (correct me if I am wrong) should contain generic functions, whereas graphviz.c and other potential files should contain just the specific code for that output format. It will probably prove difficult to tell if the implementation is actually generic whilst only having support for a single format, but it would be nice to keep stuff a bit tidier: right now, the construction of the bitset used to show reductions is in the graphviz-specific code, and on the opposite side we have some use of \l, which is graphviz-specific, in what should be generic code. Little effort seems to have been given to factoring these files and their rint{,-xml} counterpart. We would very much like to re-use the pretty format of states from .output for the graphs, etc. Also, the underscore in print_graph.[ch] isn't very fitting considering the dashes in the other filenames. Since graphviz dies on medium-to-big grammars, maybe consider an other tool? ** push-parser Check it too when checking the different kinds of parsers. And be sure to check that the initial-action is performed once per parsing. ** m4 names b4_shared_declarations is no longer what it is. Make it b4_parser_declaration for instance. ** yychar in lalr1.cc There is a large difference bw maint and master on the handling of yychar (which was removed in lalr1.cc). See what needs to be back-ported. /* User semantic actions sometimes alter yychar, and that requires that yytoken be updated with the new translation. We take the approach of translating immediately before every use of yytoken. One alternative is translating here after every semantic action, but that translation would be missed if the semantic action invokes YYABORT, YYACCEPT, or YYERROR immediately after altering yychar. In the case of YYABORT or YYACCEPT, an incorrect destructor might then be invoked immediately. In the case of YYERROR, subsequent parser actions might lead to an incorrect destructor call or verbose syntax error message before the lookahead is translated. */ /* Make sure we have latest lookahead translation. See comments at user semantic actions for why this is necessary. */ yytoken = yytranslate_ (yychar); ** stack.hh Get rid of it. The original idea is nice, but actually it makes the code harder to follow, and uselessly different from the other skeletons. ** Get rid of fake #lines [Bison: ...] Possibly as simple as checking whether the column number is nonnegative. I have seen messages like the following from GCC. :0: fatal error: opening dependency file .deps/libltdl/argz.Tpo: No such file or directory ** Discuss about %printer/%destroy in the case of C++. It would be very nice to provide the symbol classes with an operator<< and a destructor. Unfortunately the syntax we have chosen for %destroy and %printer make them hard to reuse. For instance, the user is invited to write something like %printer { debug_stream() << $$; } ; which is hard to reuse elsewhere since it wants to use "debug_stream()" to find the stream to use. The same applies to %destroy: we told the user she could use the members of the Parser class in the printers/destructors, which is not good for an operator<< since it is no longer bound to a particular parser, it's just a (standalone symbol). ** Rename LR0.cc as lr0.cc, why upper case? * Various ** YYERRCODE Defined to 256, but not used, not documented. Probably the token number for the error token, which POSIX wants to be 256, but which Bison might renumber if the user used number 256. Keep fix and doc? Throw away? Also, why don't we output the token name of the error token in the output? It is explicitly skipped: /* Skip error token and tokens without identifier. */ if (sym != errtoken && id) Of course there are issues with name spaces, but if we disable we have something which seems to be more simpler and more consistent instead of the special case YYERRCODE. enum yytokentype { error = 256, // ... }; We could (should?) also treat the case of the undef_token, which is numbered 257 for yylex, and 2 internal. Both appear for instance in toknum: const unsigned short int parser::yytoken_number_[] = { 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, while here enum yytokentype { TOK_EOF = 0, TOK_EQ = 258, so both 256 and 257 are "mysterious". const char* const parser::yytname_[] = { "\"end of command\"", "error", "$undefined", "\"=\"", "\"break\"", ** yychar == yyempty_ The code in yyerrlab reads: if (yychar <= YYEOF) { /* Return failure if at end of input. */ if (yychar == YYEOF) YYABORT; } There are only two yychar that can be <= YYEOF: YYEMPTY and YYEOF. But I can't produce the situation where yychar is YYEMPTY here, is it really possible? The test suite does not exercise this case. This shows that it would be interesting to manage to install skeleton coverage analysis to the test suite. * From lalr1.cc to yacc.c ** Single stack Merging the three stacks in lalr1.cc simplified the code, prompted for other improvements and also made it faster (probably because memory management is performed once instead of three times). I suggest that we do the same in yacc.c. ** yysyntax_error The code bw glr.c and yacc.c is really alike, we can certainly factor some parts. * Report ** Figures Some statistics about the grammar and the parser would be useful, especially when asking the user to send some information about the grammars she is working on. We should probably also include some information about the variables (I'm not sure for instance we even specify what LR variant was used). ** GLR How would Paul like to display the conflicted actions? In particular, what when two reductions are possible on a given lookahead token, but one is part of $default. Should we make the two reductions explicit, or just keep $default? See the following point. ** Disabled Reductions See 'tests/conflicts.at (Defaulted Conflicted Reduction)', and decide what we want to do. ** Documentation Extend with error productions. The hard part will probably be finding the right rule so that a single state does not exhibit too many yet undocumented ''features''. Maybe an empty action ought to be presented too. Shall we try to make a single grammar with all these features, or should we have several very small grammars? ** --report=conflict-path Provide better assistance for understanding the conflicts by providing a sample text exhibiting the (LALR) ambiguity. See the paper from DeRemer and Penello: they already provide the algorithm. ** Statically check for potential ambiguities in GLR grammars. See for an approach. * Extensions ** $-1 We should find a means to provide an access to values deep in the stack. For instance, instead of baz: qux { $$ = $-1 + $0 + $1; } we should be able to have: foo($foo) bar($bar) baz($bar): qux($qux) { $baz = $foo + $bar + $qux; } Or something like this. ** %if and the like It should be possible to have %if/%else/%endif. The implementation is not clear: should it be lexical or syntactic. Vadim Maslow thinks it must be in the scanner: we must not parse what is in a switched off part of %if. Akim Demaille thinks it should be in the parser, so as to avoid falling into another CPP mistake. ** XML Output There are couple of available extensions of Bison targeting some XML output. Some day we should consider including them. One issue is that they seem to be quite orthogonal to the parsing technique, and seem to depend mostly on the possibility to have some code triggered for each reduction. As a matter of fact, such hooks could also be used to generate the yydebug traces. Some generic scheme probably exists in there. XML output for GNU Bison and gcc http://www.cs.may.ie/~jpower/Research/bisonXML/ XML output for GNU Bison http://yaxx.sourceforge.net/ * Unit rules Maybe we could expand unit rules, i.e., transform exp: arith | bool; arith: exp '+' exp; bool: exp '&' exp; into exp: exp '+' exp | exp '&' exp; when there are no actions. This can significantly speed up some grammars. I can't find the papers. In particular the book 'LR parsing: Theory and Practice' is impossible to find, but according to 'Parsing Techniques: a Practical Guide', it includes information about this issue. Does anybody have it? * Documentation ** History/Bibliography Some history of Bison and some bibliography would be most welcome. Are there any Texinfo standards for bibliography? * Coding system independence Paul notes: Currently Bison assumes 8-bit bytes (i.e. that UCHAR_MAX is 255). It also assumes that the 8-bit character encoding is the same for the invocation of 'bison' as it is for the invocation of 'cc', but this is not necessarily true when people run bison on an ASCII host and then use cc on an EBCDIC host. I don't think these topics are worth our time addressing (unless we find a gung-ho volunteer for EBCDIC or PDP-10 ports :-) but they should probably be documented somewhere. More importantly, Bison does not currently allow NUL bytes in tokens, either via escapes (e.g., "x\0y") or via a NUL byte in the source code. This should get fixed. * Broken options ? ** %token-table ** Skeleton strategy Must we keep %token-table? * Precedence ** Partial order It is unfortunate that there is a total order for precedence. It makes it impossible to have modular precedence information. We should move to partial orders (sounds like series/parallel orders to me). ** RR conflicts See if we can use precedence between rules to solve RR conflicts. See what POSIX says. * $undefined From Hans: - If the Bison generated parser experiences an undefined number in the character range, that character is written out in diagnostic messages, an addition to the $undefined value. Suggest: Change the name $undefined to undefined; looks better in outputs. * Default Action From Hans: - For use with my C++ parser, I transported the "switch (yyn)" statement that Bison writes to the bison.simple skeleton file. This way, I can remove the current default rule $$ = $1 implementation, which causes a double assignment to $$ which may not be OK under C++, replacing it with a "default:" part within the switch statement. Note that the default rule $$ = $1, when typed, is perfectly OK under C, but in the C++ implementation I made, this rule is different from $$ = $1. I therefore think that one should implement a Bison option where every typed default rule is explicitly written out (same typed ruled can of course be grouped together). * Pre and post actions. From: Florian Krohm Subject: YYACT_EPILOGUE To: bug-bison@gnu.org X-Sent: 1 week, 4 days, 14 hours, 38 minutes, 11 seconds ago The other day I had the need for explicitly building the parse tree. I used %locations for that and defined YYLLOC_DEFAULT to call a function that returns the tree node for the production. Easy. But I also needed to assign the S-attribute to the tree node. That cannot be done in YYLLOC_DEFAULT, because it is invoked before the action is executed. The way I solved this was to define a macro YYACT_EPILOGUE that would be invoked after the action. For reasons of symmetry I also added YYACT_PROLOGUE. Although I had no use for that I can envision how it might come in handy for debugging purposes. All is needed is to add #if YYLSP_NEEDED YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen, yyloc, (yylsp - yylen)); #else YYACT_EPILOGUE (yyval, (yyvsp - yylen), yylen); #endif at the proper place to bison.simple. Ditto for YYACT_PROLOGUE. I was wondering what you think about adding YYACT_PROLOGUE/EPILOGUE to bison. If you're interested, I'll work on a patch. * Better graphics Equip the parser with a means to create the (visual) parse tree. * Complaint submessage indentation. We already have an implementation that works fairly well for named reference messages, but it would be nice to use it consistently for all submessages from Bison. For example, the "previous definition" submessage or the list of correct values for a %define variable might look better with indentation. However, the current implementation makes the assumption that the location printed on the first line is not usually much shorter than the locations printed on the submessage lines that follow. That assumption may not hold true as often for some kinds of submessages especially if we ever support multiple grammar files. Here's a proposal for how a new implementation might look: http://lists.gnu.org/archive/html/bison-patches/2009-09/msg00086.html Local Variables: mode: outline coding: utf-8 End: ----- Copyright (C) 2001-2004, 2006, 2008-2015 Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. 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 . PKy0]]y}l}l ChangeLognu[2015-01-23 Akim Demaille version 3.0.4 * NEWS: Record release date. 2015-01-23 Akim Demaille gnulib: update 2015-01-23 Akim Demaille build: re-enable compiler warnings, and fix them There are warnings (-Wextra) in generated C++ code: ltlparse.cc: In member function 'ltlyy::parser::symbol_number_type ltlyy::parser::by_state::type_get() const': ltlparse.cc:452:33: warning: enumeral and non-enumeral type in conditional expression return state == empty_state ? empty_symbol : yystos_[state]; Reported by Alexandre Duret-Lutz. It turns out that -Wall and -Wextra were disabled because of a stupid typo. * configure.ac: Fix the stupid typo. * data/lalr1.cc, src/AnnotationList.c, src/InadequacyList.c, * src/ielr.c, src/print.c, src/scan-code.l, src/symlist.c, * src/symlist.h, src/symtab.c, src/tables.c, tests/actions.at, * tests/calc.at, tests/cxx-type.at, tests/glr-regression.at, * tests/named-refs.at, tests/torture.at: Fix warnings, mostly issues about variables used only with assertions, which are disabled with -DNDEBUG. 2015-01-22 Akim Demaille tests: c++: fix a C++03 conformance issue This fixes test 241 on xLC: "input.y", line 42.11: 1540-0274 (S) The name lookup for "report" did not find a declaration. "input.y", line 42.11: 1540-1292 (I) Static declarations are not considered for a function call if the function is not qualified. where report is: static void report (std::ostream& yyo, int ival, float fval) { yyo << "ival: " << ival << ", fval: " << fval; } and line 42 is: %printer { report (yyo, $$, $$); } ; It turns out that indeed this function must not be declared static, . Let's put it into an anonymous namespace. Reported by Thomas Jahns. http://lists.gnu.org/archive/html/bug-bison/2015-01/msg00059.html * tests/actions.at (Qualified $$ in actions): Don't use "static", prefer anonymous namespace. 2015-01-20 Akim Demaille tests: fix a title * tests/conflicts.at: De-overquote. 2015-01-20 Akim Demaille c++: reserve 200 slots in the parser's stack This is consistent with what is done with yacc.c and glr.c. Because it also avoids that the stack needs to be resized very soon, it should help keeping tests about destructors more reliable. Indeed, if the stack is created too small, very soon the C++ library needs to enlarge it, which means creating a new one, copying the elements from the initial one onto it, and then destroy the elements of the initial stack: that would be a spurious call to a destructor. Reported by Thomas Jahns. http://lists.gnu.org/archive/html/bug-bison/2015-01/msg00059.html * data/stack.hh (stack::stack): Reserve 200 slots. * tests/c++.at: Remove traces of stack expansions. 2015-01-20 Akim Demaille tests: be more robust to unrecognized synclines, and try to recognize xlc Reported by Thomas Jahns. http://lists.gnu.org/archive/html/bug-bison/2015-01/msg00059.html * tests/synclines.at (AT_SYNCLINES_COMPILE): Rename as... (_AT_SYNCLINES_COMPILE): this. Try to recognize xlc locations. (AT_SYNCLINES_COMPILE): New. Skips the test if we can't read the synclines. 2015-01-20 Akim Demaille tests: fix C++ conformance Reported by Thomas Jahns. http://lists.gnu.org/archive/html/bug-bison/2015-01/msg00059.html * tests/c++.at (Exception safety): Add missing include. Don't use const_iterator for erase. 2015-01-18 Akim Demaille build: fix some warnings Reported by John Horigan. http://lists.gnu.org/archive/html/bug-bison/2015-01/msg00034.html * src/graphviz.c, src/symtab.h: Address compiler warnings. 2015-01-16 Akim Demaille build: avoid infinite recursions on include_next On MacOS X 10.5 PPC with Apple's GCC 4.0.1: % uname -a Darwin aria.cielonegro.org 9.8.0 Darwin Kernel Version 9.8.0: Wed Jul 15 16:57:0 1 PDT 2009; root:xnu-1228.15.4~1/RELEASE_PPC Power Macintosh % gcc --version powerpc-apple-darwin9-gcc-4.0.1 (GCC) 4.0.1 (Apple Inc. build 5493) Copyright (C) 2005 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. building in place enters into an infinite recursion on "#include_next": % gmake V=1 [snip] depbase=`echo lib/math.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ gcc -std=gnu99 -I. -Ilib -I. -I./lib -g -O2 -MT lib/math.o -MD -MP -MF $depbase.Tpo -c -o lib/math.o lib/math.c &&\ mv -f $depbase.Tpo $depbase.Po In file included from lib/math.h:27, from lib/math.h:27, from lib/math.h:27, from lib/math.h:27, [snip] from lib/math.h:27, from lib/math.h:27, from lib/math.c:3: lib/math.h:27:23: error: #include nested too deeply Makefile:3414: recipe for target 'lib/math.o' failed gmake[2]: *** [lib/math.o] Error 1 Using -I./lib instead of -Ilib fixes the problem. Reported by Pho. * Makefile.am (AM_CPPFLAGS): Use -I./lib instead of -Ilib. 2015-01-16 Akim Demaille doc: minor fixes * doc/bison.texi: Fix warnings about colon in reference names. * data/bison.m4, src/files.h: Fix comments. * doc/Doxyfile.in: update. 2015-01-15 Akim Demaille gnulib: strtoul is considered obsolete and now useless * bootstrap.conf: here. 2015-01-15 Akim Demaille c++: avoid warnings when destructors don't use $$ * data/c++.m4: here. 2015-01-15 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2015-01-15 Akim Demaille version 3.0.3 * NEWS: Record release date. 2015-01-15 Akim Demaille gnulib: update 2015-01-13 Akim Demaille tests: split a large test case into several smaller ones * tests/conflicts.at (AT_CONSISTENT_ERRORS_CHECK): Move AT_SETUP/AT_CLEANUP into it, so that we don't skip non Java tests following a test case in Java. 2015-01-12 Akim Demaille package: a bit of trouble shooting indications * README-hacking: here. 2015-01-12 Akim Demaille doc: liby's main arms the internationalization Reported by Nicolas Bedon. * doc/bison.texi (Yacc Library): Document the call the setlocale. 2015-01-09 Akim Demaille bison: avoid warnings from static code analysis A static analysis tool reports that some callers of symbol_list_n_get might get NULL and not handle it properly. This is not the case, yet we can suppress this pattern. Reported by Mike Sullivan. * src/symlist.c (symbol_list_n_get): Actually it is never called to return 0. Enforce this postcondition via aver. (symbol_list_n_type_name_get): Simplify accordingly. In particular, discards a (translated) useless error message. * src/symlist.h: Adjust documentation. * src/scan-code.l: Style change. 2015-01-09 Akim Demaille c++: fix the use of destructors when variants are enabled When using variants, destructors generate invalid code. Reported by Michael Catanzaro. * data/c++.m4 (~basic_symbol): b4_symbol_foreach works on yysym: define it. * tests/c++.at (Variants): Check it. 2015-01-08 Akim Demaille style: tests: simplify the handling of some C++ tests * tests/c++.at: here. (Doxygen): Pass %define, so that files such as position.hh etc. are generated, instead of putting everything into input.hh. 2015-01-08 Akim Demaille c++: symbols can be empty, so use it The previous patches ensure that symbols (symbol_type and stack_symbol_type) can be empty, cleared, and their emptiness can be checked. Therefore, yyempty, which codes whether yyla is empty or not, is now useless. In C skeletons (e.g., yacc.c), the fact that the lookahead is empty is coded by "yychar = YYEMPTY", which is exactly what this patch restores, since yychar/yytoken corresponds to yyla.type. * data/lalr1.cc (yyempty): Remove. Rather, depend on yyla.empty (). 2015-01-08 Akim Demaille c++: variants: don't leak the lookahead in error recovery During error recovery, when discarding the lookeahead, we don't destroy it, which is caught by parse.assert assertions. Reported by Antonio Silva Correia. With an analysis and suggested patch from Michel d'Hooge. * tests/c++.at (Variants): Strengthen the test to try syntax errors with discarded lookahead. 2015-01-08 Akim Demaille c++: provide a means to clear symbols The symbol destructor is currently the only means to clear a symbol. Unfortunately during error recovery we might have to clear the lookahead, which is a local variable (yyla) that has not yet reached its end of scope. Rather that duplicating the code to destroy a symbol, or rather than destroying and recreating yyla, let's provide a means to clear a symbol. Reported by Antonio Silva Correia, with an analysis from Michel d'Hooge. * data/c++.m4, data/lalr1.cc (basis_symbol::clear, by_state::clear) (by_type::clear): New. (basic_symbol::~basic_symbol): Use clear. 2015-01-08 Akim Demaille c++: clean up the handling of empty symbols * data/c++.m4, data/lalr1.cc (yyempty_): Remove, replaced by... (empty_symbol, by_state::empty_state): these. (basic_symbol::empty): New. 2015-01-08 Akim Demaille c++: comment and style changes * data/c++.m4, data/lalr1.cc: More documentation. Tidy. * tests/c++.at (string_cast): Rename as... (to_string): this C++11 name. 2015-01-07 Akim Demaille c++: variants: comparing addresses of typeid.name() is undefined Instead of storing and comparing pointers to names of types, store pointers to the typeids, and compares the typeids. Reported by Thomas Jahns. * data/variant.hh (yytname_): Replace with... (yytypeid_): this. 2015-01-05 Akim Demaille c++: locations: complete the API and fix comments There are no support for += between locations, and some comments are wrong. Reported by Alexandre Duret-Lutz. * data/location.cc: Fix. * doc/bison.texi: Document. * tests/c++.at: Check. 2015-01-05 Akim Demaille build: do not clean figure sources in make clean "make clean && make" fails in in-tree builds. * doc/local.mk (CLEANDIRS): Replace with... (CLEANFILES): this safer list of files to clean. 2015-01-05 Akim Demaille build: don't try to generate docs when cross-compiling When cross-compiling don't run the generated bison to update the docs. Reported by Aaro Koskinen. * configure.ac (CROSS_COMPILING): New. * doc/local.mk: Use it. 2015-01-04 Akim Demaille package: fix a reporter's name * THANKS, build-aux/git-log-fix: s/Bernd Edligner/Bernd Edlinger/. 2015-01-04 Akim Demaille %union: fix the support for named %union Bison supports a union tag, for obscure reasons. But it does a poor job at it, especially since Bison 3.0. Reported by Stephen Cameron and Tobias Frost. It did not ensure that the name was not given several times. An easy way to do this is to make the %union tag be handled as a %define variable, as they cannot be defined several times. Since Bison 3.0, the synclines were wrongly placed, resulting in invalid code. Addressing this issue, because of the way the union tag was stored (as a code muscle), would have been tedious. Unless we rather define the %union tag as a %percent variable, whose synclines are easier to manipulate. So replace the b4_union_name muscle by the api.value.union.name %define variable, document, and check. * data/bison.m4: Make sure that api.value.union.name has a keyword value. * data/c++.m4: Make sure that api.value.union.name is not defined. * data/c.m4 (b4_union_name): No longer use it, use api.value.union.name. * doc/bison.texi (%define Summary): Document it. * src/parse-gram.y (union_name): No longer define b4_uion_name, but api.value.union.name. * tests/input.at (Redefined %union name): New. * tests/synclines.at (%union name syncline): New. * tests/types.at: Check named %unions. 2015-01-04 Akim Demaille package: bump to 2015 Which also requires: * gnulib: Update. 2014-12-31 Akim Demaille flex: don't trust YY_USER_INIT Reported by Bernd Edlinger and others. * src/scan-gram.l: here. 2014-12-31 Akim Demaille yacc.c: fix broken union when api.value.type=union and %defines are used Reported by Rich Wilson. * data/c.m4 (b4_symbol_type_register): Append to b4_union_members, not b4_user_union_members. The latter invokes the former, but it is the former which is reinitialized to empty by b4_value_type_setup_union. * tests/types.at: Check it. This reveals another bug, this time in the case of glr.c parsers. * data/glr.c: Generate the header file before the implementation file, to be sure that the setup is run before what depends on it. 2014-12-31 Akim Demaille doc: fix missing xref Reported by xolodho. * doc/bison.texi (Printer Decl): here. 2014-12-29 Akim Demaille gnulib: update 2014-02-03 Akim Demaille location: remove some ugly debugging code traces * data/location.cc: here. 2014-02-03 Akim Demaille build: use abort to pacify compiler errors clang, with -DNDEBUG and -Werror fails on some functions that might lack a return. This is because aver is just another assert, discarded with -DNDEBUG. So use abort. * src/muscle-tab.c, src/scan-skel.l: here. 2014-02-03 Akim Demaille package: bump to 2014 * AUTHORS, ChangeLog-2012, Makefile.am, NEWS, PACKAGING, README, * README-alpha, README-hacking, THANKS, TODO, bootstrap.conf, * build-aux/darwin11.4.0.valgrind, build-aux/local.mk, * build-aux/update-b4-copyright, * build-aux/update-package-copyright-year, cfg.mk, configure.ac, * data/README, data/bison.m4, data/c++-skel.m4, data/c++.m4, * data/c-like.m4, data/c-skel.m4, data/c.m4, data/glr.c, data/glr.cc, * data/java-skel.m4, data/java.m4, data/lalr1.cc, data/lalr1.java, * data/local.mk, data/location.cc, data/stack.hh, data/variant.hh, * data/xslt/bison.xsl, data/xslt/xml2dot.xsl, data/xslt/xml2text.xsl, * data/xslt/xml2xhtml.xsl, data/yacc.c, djgpp/Makefile.maint, * djgpp/README.in, djgpp/config.bat, djgpp/config.sed, * djgpp/config.site, djgpp/config_h.sed, djgpp/djunpack.bat, * djgpp/local.mk, djgpp/subpipe.c, djgpp/subpipe.h, * djgpp/testsuite.sed, doc/bison.texi, doc/local.mk, doc/refcard.tex, * etc/README, etc/bench.pl.in, etc/local.mk, * examples/calc++/calc++.test, examples/calc++/local.mk, * examples/extexi, examples/local.mk, examples/mfcalc/local.mk, * examples/mfcalc/mfcalc.test, examples/rpcalc/local.mk, * examples/rpcalc/rpcalc.test, examples/test, examples/variant.yy, * lib/abitset.c, lib/abitset.h, lib/bbitset.h, lib/bitset.c, * lib/bitset.h, lib/bitset_stats.c, lib/bitset_stats.h, * lib/bitsetv-print.c, lib/bitsetv-print.h, lib/bitsetv.c, * lib/bitsetv.h, lib/ebitset.c, lib/ebitset.h, lib/get-errno.c, * lib/get-errno.h, lib/lbitset.c, lib/lbitset.h, lib/libiberty.h, * lib/local.mk, lib/main.c, lib/timevar.c, lib/timevar.def, * lib/timevar.h, lib/vbitset.c, lib/vbitset.h, lib/yyerror.c, * m4/bison-i18n.m4, m4/c-working.m4, m4/cxx.m4, m4/flex.m4, * m4/timevar.m4, src/AnnotationList.c, src/AnnotationList.h, * src/InadequacyList.c, src/InadequacyList.h, src/LR0.c, src/LR0.h, * src/Sbitset.c, src/Sbitset.h, src/assoc.c, src/assoc.h, * src/closure.c, src/closure.h, src/complain.c, src/complain.h, * src/conflicts.c, src/conflicts.h, src/derives.c, src/derives.h, * src/files.c, src/files.h, src/flex-scanner.h, src/getargs.c, * src/getargs.h, src/gram.c, src/gram.h, src/graphviz.c, * src/graphviz.h, src/ielr.c, src/ielr.h, src/lalr.c, src/lalr.h, * src/local.mk, src/location.c, src/location.h, src/main.c, * src/muscle-tab.c, src/muscle-tab.h, src/named-ref.c, * src/named-ref.h, src/nullable.c, src/nullable.h, src/output.c, * src/output.h, src/parse-gram.c, src/parse-gram.y, src/print-xml.c, * src/print-xml.h, src/print.c, src/print.h, src/print_graph.c, * src/print_graph.h, src/reader.c, src/reader.h, src/reduce.c, * src/reduce.h, src/relation.c, src/relation.h, src/scan-code.h, * src/scan-code.l, src/scan-gram.h, src/scan-gram.l, src/scan-skel.h, * src/scan-skel.l, src/state.c, src/state.h, src/symlist.c, * src/symlist.h, src/symtab.c, src/symtab.h, src/system.h, * src/tables.c, src/tables.h, src/uniqstr.c, src/uniqstr.h, * tests/actions.at, tests/atlocal.in, tests/bison.in, tests/c++.at, * tests/calc.at, tests/conflicts.at, tests/cxx-type.at, * tests/existing.at, tests/glr-regression.at, tests/headers.at, * tests/input.at, tests/java.at, tests/javapush.at, tests/local.at, * tests/local.mk, tests/named-refs.at, tests/output.at, tests/push.at, * tests/reduce.at, tests/regression.at, tests/sets.at, * tests/skeletons.at, tests/synclines.at, tests/testsuite.at, * tests/torture.at, tests/types.at: here. 2014-01-03 Paul Eggert doc: specify documentation encoding * doc/bison.texi: Add '@documentencoding UTF-8'; needed since the manual contains UTF-8 characters. This will cause the .info files to contain UTF-8 quotes and the like, which should be OK nowadays. Add @documentlanguage while we're at it. 2013-12-09 Akim Demaille package: install the examples Currently, we do not install the various examples extracted from the documentation. Let's do it, as they are useful starting points. * configure.ac: When --enable-gcc-warnings is set, enable ENABLE_GCC_WARNINGS. * examples/extexi: No longer issue synclines by default. * examples/local.mk: Except if ENABLE_GCC_WARNINGS. * examples/calc++/local.mk, examples/mfcalc/local.mk, * examples/rpcalc/local.mk: Install the example files. 2013-12-09 Akim Demaille package: install README and the like in docdir * Makefile.am: here. 2013-12-09 Akim Demaille diagnostics: fix the order of multiple declarations reports On %token FOO "foo" %printer {} "foo" %printer {} FOO we report /tmp/foo.yy:2.10-11: error: %printer redeclaration for FOO %printer {} "foo" ^^ /tmp/foo.yy:3.10-11: previous declaration %printer {} FOO ^^ * src/symtab.c (locations_sort): New. Use it. * tests/input.at (Invalid Aliases): Stress the order of diagnostics. 2013-12-09 Akim Demaille symbol: provide an easy means to compare them in source order * src/symtab.c (symbols_sort): New. (user_token_number_redeclaration): Taken from here. 2013-12-05 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2013-12-05 Akim Demaille version 3.0.2 * NEWS: Record release date. 2013-12-05 Akim Demaille gnulib: update * gnulib: here. 2013-12-04 Akim Demaille output: do not generate source files when late errors are caught Reported by Alexandre Duret-Lutz as "second problem" in: http://lists.gnu.org/archive/html/bug-bison/2013-09/msg00015.html * bootstrap.conf: We need the "unlink" module. * src/files.h, src/files.c (unlink_generated_sources): New. * src/output.c: Use it. * tests/output.at: Check the case of late errors. 2013-12-04 Akim Demaille output: record what generated files are source or report files * src/files.h, src/files.c (output_file_name_check): Take an additional argument to record whether a file is a source or report file. * src/files.c (generated_file): New. (file_names, file_names_count): Replace with... (generated_files, generated_files_size): these. * src/scan-skel.l: Adjust. 2013-12-04 Akim Demaille output: do not generate source files when early errors are caught Reported by Alexandre Duret-Lutz as "second problem" in: http://lists.gnu.org/archive/html/bug-bison/2013-09/msg00015.html One problem is that some errors are caught early, before the generation of output files, while others can only be detected afterwards (since, for instance, skeletons can raise errors themselves). This will be addressed in two steps: early errors do not generate source files at all, while later errors will remove the files that have already been generated. * src/scan-skel.l (yyout): Open to /dev/null when there are errors. * tests/output.at (AT_CHECK_FILES): Factored out of... (AT_CHECK_OUTPUT): this. Fuse the "SHELLIO" argument in the "FLAGS" one. Use $5 to denote the expected exit status. Add a test case for early errors. 2013-11-26 Akim Demaille xml: also use "%empty" with html output * data/xslt/xml2xhtml.xsl: No longer issue an Epsilon, display as in dot and text formats. 2013-11-26 Akim Demaille style: formatting changes * src/print-xml.c: here. 2013-11-26 Akim Demaille xml: also display %empty for empty right-hand sides * data/xslt/xml2dot.xsl, data/xslt/xml2text.xsl: Display %empty where needed. 2013-11-26 Akim Demaille reports: display %empty in the generated pointed-rules * src/print.c (print_core): Use %empty for empty rules. * src/print_graph.c (print_core): Ditto. * tests/conflicts.at, tests/output.at, tests/reduce.at: Adjust expectations. 2013-11-26 Akim Demaille news: YYERROR vs variants 2013-11-18 Akim Demaille style: scope reduction in lalr.cc * src/lalr.c: Shorten variable scopes. (lookahead_tokens_print): Use the same variable name in two loops iterating over the same structure. 2013-11-15 Akim Demaille lalr1.cc: formatting changes * data/lalr1.cc: Fix indentation. 2013-11-15 Akim Demaille lalr1.cc: fix the support of YYERROR with variants When variant are enabled, the yylhs variable (the left-hand side of the rule being reduced, i.e. $$ and @$) is explicitly destroyed when YYERROR is called. This is because before running the user code, $$ is initialized, so that the user can properly use it. However, when quitting yyparse, yylhs is also reclaimed by the C++ compiler: the variable goes out of scope. Instead of trying to be too smart, let the compiler do its job: reduce the scope of yylhs to exactly the reduction. This way, whatever the type of scope exit (regular, exception, return, goto...) this variable will be properly reclaimed. Reported by Paolo Simone Gasparello. * data/lalr1.cc (yyparse): Reduce the scope of yylhs. * tests/c++.at: We now pass this test. 2013-11-15 Akim Demaille tests: check $$'s destruction with variant, YYERROR, and no error recovery When variant are enabled, the yylhs variable (the left-hand side of the rule being reduced, i.e. $$ and @$) is explicitly destroyed when YYERROR is called. This is because before running the user code, $$ is initialized, so that the user can properly use it. However, when quitting yyparse, yylhs is also reclaimed by the C++ compiler: the variable goes out of scope. This was not detected by the test suite because (i) the Object tracker was too weak, and (ii) the problem does not show when there is error recovery. Reported by Paolo Simone Gasparello. * tests/c++.at (Exception safety): Improve the objects logger to make sure that we never destroy twice an object. Also track copy-constructors. Use a set instead of a list. Display the logs before running the function body, this is more useful in case of failure. Generalize to track with and without error recovery. 2013-11-15 Akim Demaille tests: simplify useless obfuscation * tests/c++.at: $$ is not special for M4, there is no need to "escape" it. 2013-11-14 Akim Demaille skeletons: use better names when computing a "goto" * data/glr.c (yyLRgotoState): Name the symbol argument yysym, instead of yylhs. * data/lalr1.cc (yy_lr_goto_state_): Likewise. * data/lalr1.java (yy_lr_goto_state_): New, modeled after the previous two routines. Use it. 2013-11-12 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2013-11-12 Akim Demaille version 3.0.1 * NEWS: Record release date. 2013-11-12 Akim Demaille aver: it is no longer "protected against NDEBUG" Apply the same rules for aver as for assert: no side effects, especially not important ones. * src/AnnotationList.c, src/muscle-tab.c: Adjust aver uses to resist to -DNDEBUG. 2013-11-08 Akim Demaille parsers: rename YY_NULL as YY_NULLPTR to avoid conflicts with Flex Flex also defines YY_NULL (to 0). Avoid gratuitous conflicts. * data/c.m4 (b4_null_define): Rename YY_NULL as YY_NULLPTR. * data/glr.c, data/lalr1.cc, data/location.cc, data/variant.hh, * data/yacc.c, src/parse-gram.c, tests/actions.at, tests/c++.at, * tests/cxx-type.at, tests/glr-regression.at, tests/headers.at, * tests/push.at, tests/regression.at: Adjust. 2013-11-05 Akim Demaille build: use Automake 1.14's non-recursive Makefile features * configure.ac: Require Automake 1.14. * examples/calc++/local.mk, examples/local.mk, examples/mfcalc/local.mk, * examples/rpcalc/local.mk, tests/local.mk: Use %D% and %C%. 2013-11-05 Akim Demaille build: restore maintainer-push-check * tests/local.mk: here. 2013-11-05 Akim Demaille c++: use __attribute__((__pure__)) to avoid warnings Building C++ parsers with -Wsuggest-attribute=const and -Wsuggest-attribute=noreturn triggers warning in generated code. * data/lalr1.cc: Call b4_attribute_define. (debug_stream, debug_level): Flag as pure. * tests/headers.at (Several parsers): There are now more YY macros that "leak". 2013-11-05 Akim Demaille skeletons: update the handling of compiler attributes * data/c.m4 (b4_attribute_define): Instead of defining __attribute__, define YY_ATTRIBUTE conditionally. (YY_ATTRIBUTE_PURE, YY_ATTRIBUTE_UNUSED, _Noreturn): New. Use them. * data/glr.c: Use them. 2013-11-05 Akim Demaille gnulib: update 2013-10-24 Akim Demaille style: use /* ... */ comments * src/complain.c: Here. 2013-10-24 Akim Demaille tests: skip C++ tests that are too demanding for some compilers Some tests now fail when compiled with G++ 4.3 or 4.4 on MacPorts. * tests/local.at (AT_SKIP_IF_EXCEPTION_SUPPORT_IS_POOR): New. * tests/c++.at (Exception safety): Use it. 2013-10-22 Akim Demaille install: do not install yacc.1 when --disable-yacc * configure.ac (ENABLE_YACC): New conditional. (YACC_SCRIPT, YACC_LIBRARY): Remove. * lib/local.mk, src/local.mk: Use the former instead of the latter. * doc/local.mk: Use ENABLE_YACC to avoid installing yacc.1. 2013-10-22 Akim Demaille style: avoid tabs * src/scan-code.l: here. 2013-10-22 Akim Demaille c++: fix generated doxygen comments * configure.ac: Enable -Wdocumentation if supported. * data/lalr1.cc: Fix comments. 2013-10-22 Akim Demaille fix: uniqstr are already pointers * src/uniqstr.c (uniqstr_assert): Remove incorrect double indirection, and now useless cast. 2013-10-22 Paul Eggert bison: pacify Sun C 5.12 * src/scan-code.l (show_sub_message): Redo initializations to work around a bogus Sun C 5.12 warning. (parse_ref): Remove unreachable code that Sun C 5.12 complains about. * src/uniqstr.h (uniqstr_vsprintf): Use _GL_ATTRIBUTE_FORMAT_PRINTF (...) instead of __attribute__ ((__format__ (__printf__, ...))). Otherwise, Sun C 5.12 complains about an unknown attribute. 2013-10-22 Paul Eggert maint: git now ignores rpcalc * examples/rpcalc/.gitignore: Ignore rpcalc. 2013-10-22 Paul Eggert build: examples/calc++/calc++ requires flex * configure.ac (FLEX_CXX_WORKS): New AM_CONDITIONAL. * examples/calc++/local.mk (examples/calc++/calc++): Build if FLEX_CXX_WORKS, not BISON_CXX_WORKS. 2013-10-22 Paul Eggert maint: mention help2man, texinfo, apt-get * README-hacking: Add help2man, texinfo. Describe how to add packages if you're using Debian. 2013-10-22 Paul Eggert maint: git now ignores .log and .trs files * .gitignore: Add *.log, *.trs. 2013-10-21 Akim Demaille tests: fix incorrect object construction Reported by Ken Moffat. http://lists.gnu.org/archive/html/bug-bison/2013-10/msg00009.html * tests/c++.at (Exception safety): Here. 2013-10-16 Akim Demaille glr: allow spaces between "%?" and "{" in predicates Reported by Rici Lake. http://lists.gnu.org/archive/html/bug-bison/2013-10/msg00004.html http://stackoverflow.com/questions/19330171/ * src/scan-gram.l: Do not try to be too smart when diagnosing invalid directives. * tests/glr-regression.at (Predicates): New test. 2013-10-16 Akim Demaille diagnostics: "-Werror -Wno-error=foo" must not emit errors Currently "-Werror -Wno-error=foo" still turns "foo" warnings into errors. Reported by Alexandre Duret-Lutz. See http://lists.gnu.org/archive/html/bug-bison/2013-09/msg00015.html. * src/complain.c (errority, errority_flag): New. (complain_init): Initialize the latter. (warning_argmatch): Extract the loop iterating on the flag's bits. Set and unset errority_flag here. (warnings_argmatch): -Wno-error is not the same as -Wno-error=everything: we must remember if category foo was explicitly turned in an error/warning via -W(no-)error=foo. (warning_severity): Use errority_flag. * tests/input.at (Symbols): Just check --yacc, not -Wyacc, that's the job of tests on -W. (-Werror is not affected by -Wnone and -Wall): Rename as... (-Werror combinations): this. Tests more combinations of -W, -W(no-)error, and -W(no-)error=foo. * tests/local.at (AT_BISON_CHECK_WARNINGS): Don't expect -Werror to turn runs that issue warnings into runs with errors, as the warnings might be enforced as warnings by -Wno-error=foo, in which case -Werror does not change anything. * doc/bison.texi (Bison Options): Try to be clearer about how -W(no-)error and -W(no-)error=foo interact. 2013-10-16 Akim Demaille comment changes * src/complain.h, src/complain.c: More documentation, more comments. 2013-10-04 Andreas Schwab location: fix EOF check * location.c (location_caret): Use int, not char, for values from getc. 2013-09-19 Akim Demaille style: variant: remove empty line * data/variant.hh (b4_symbol_constructor_define_): Remove stray eol. 2013-09-19 Akim Demaille glr: more assertions * data/glr.c (yyaddDeferredAction, yyglrShiftDefer, yypdumpstack): More assertions. 2013-09-19 Akim Demaille glr: shorten scopes * data/glr.c (yyglrReduce): Define yyflag with its value. 2013-09-19 Akim Demaille glr: formatting changes * data/glr.c: here. 2013-09-19 Akim Demaille glr: better use of tracing macros * data/glr.c (yydestroyGLRState): Use YY_SYMBOL_PRINT instead of yy_symbol_print. 2013-09-19 Akim Demaille examples: improve the output of the "variant" example * examples/variant.yy: Improve the printing of lists. 2013-09-19 Akim Demaille variant: remove useless assertion * data/variant.hh (move): Remove precondition assertion which is ensured by the first call of the body (this precondition is also one of "build"). 2013-09-19 Akim Demaille tests: remove stray debugging traces * tests/atlocal.in: Remove traces. Be ready to remove conftest.dSYM generated on OS X. 2013-09-04 Akim Demaille tests: do not use grep -q Reported by Daniel Galloway. http://lists.gnu.org/archive/html/bug-bison/2013-08/msg00020.html * tests/java.at: Ignore grep's output instead. 2013-08-25 Paul Eggert build: don't require flex for ordinary builds * configure.ac (LEX): Don't fail if this is lex, as flex is not required for ordinary builds. Instead, issue a warning and substitute a no-op LEX. Reported by Michael Felt in . 2013-08-25 Paul Eggert maint: update .gitignore * .gitignore: Add *.eps, *.o, *.pdf, *.png, *.stamp, *~, .deps, .dirstamp. Needed to suppress unwanted chatter from 'git status' after a bootstrap build. 2013-08-24 Paul Eggert build: port to pre-5.8.7 perl * examples/local.mk (extract): Omit -f from perl options. This doesn't work with perl versions before 5.8.7 that are configured without USE_SITECUSTOMIZE. Reported by Michael Felt in . 2013-08-01 Akim Demaille tests: minor change to make it easier to test other skeletons * tests/c++.at (Variants): Pass the skeleton as argument. 2013-08-01 Valentin Tolmer uniqstr: fix assertion * src/uniqstr.c (uniqstr_assert): Really make sure str is a uniqstr, not just whether some uniqstr with the same content was registered. 2013-08-01 Akim Demaille build: ship the ASCII art figures We don't ship the *.txt files that are used to build the info file. Reported by Colin Daley. * doc/figs/example.txt: New. * doc/local.mk (bison.info): Depend on the txt files. And ship them. 2013-08-01 Akim Demaille doc: prefer the ".gv" extension to ".dot" See http://marc.info/?l=graphviz-devel&m=129418103126092 for the motivation (basically, some word processor now uses *.dot). * doc/figs/example-reduce.dot: Rename as... * doc/figs/example-reduce.gv: this. * doc/figs/example-shift.dot: Rename as... * doc/figs/example-shift.gv: this. * doc/figs/example.dot: Rename as... * doc/figs/example.gv: this. * doc/local.mk: Adjust. 2013-07-25 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2013-07-25 Akim Demaille version 3.0 * NEWS: Record release date. 2013-07-25 Akim Demaille regen 2013-07-25 Akim Demaille news: prepare 3.0 * NEWS (3.0): Reorder. 2013-07-25 Akim Demaille tests: fix invalid assignment when using variants in C++11 * tests/c++.at (Exception safety): In variant mode $$ is an instance of Object. Assigning YY_NULL in C++98 is incorrect, but behaves ok, as it assigns YY_NULL=0 using Object::operator= (char v). It is wrong in C++11 as there is operator for "$$ = nullptr". 2013-07-25 Akim Demaille yacc: beware of "uninitialized uses" warnings Again some issues with the fact that yylval is reported by GCC as possibly not initialized in some cases. Here, the case at hand is the %destructor. I am still not convinced that it is worth going all the trouble of using pragmas to disable temporarily some warnings, instead of just initializing the looking symbol once for all, but that's what Paul voted for, see . * data/c.m4 (b4_attribute_define): Define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN, YY_IGNORE_MAYBE_UNINITIALIZED_END, YY_INITIAL_VALUE here, as we will need them in the generation of the destructor function, which is defined in yacc.c before yyparse, which was in charge of defining these macros. * data/yacc.c (b4_declare_scanner_communication_variables): Simplify: trying to factor the definitions of the case pure and impure is too complex. Actually, it is not even clear that this macro should really exist, as even the calls are complex. Be careful not to issue a lone ";", as this is a statement, and C90 forbids declarations after statements ; so write "YY_INITIAL_VALUE(Decl;)", not "YY_INITIAL_VALUE(Decl);". 2013-07-25 Akim Demaille gnulib: update 2013-07-03 Akim Demaille tests: skip C++ tests if we can't compile a simple program There are possible conflicts between gnulib replacement functions (in ) and their C++ wrappers (in ). Trying to address these in configure seems too hard, and I don't know how to fix the issue in gnulib. Cowardly avoid the problem by skipping C++ tests when this happens. Reported by Stefano Lattarini. http://lists.gnu.org/archive/html/bug-bison/2013-06/msg00001.html * tests/atlocal.in (BISON_CXX_WORKS): Also set it to "skip" if we can't compile a simple program using . * tests/local.at: Comment changes. 2013-07-03 Akim Demaille tests: fix 'find' portability issues Reported by Stefano Lattarini. http://lists.gnu.org/archive/html/bug-bison/2013-06/msg00000.html * tests/output.at (AT_CHECK_OUTPUT): Use Perl instead. 2013-06-24 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2013-06-24 Akim Demaille version 2.7.91 * NEWS: Record release date. 2013-06-24 Akim Demaille NEWS: prepare for 2.7.91 * NEWS (2.7.91): Java push parsers. 2013-06-24 Akim Demaille java: rename YYMORE as YYPUSH_MORE for consistency with C http://lists.gnu.org/archive/html/bison-patches/2013-06/msg00008.html * data/lalr1.java, doc/bison.texi, tests/javapush.at: s/YYMORE/YYPUSH_MORE. 2013-06-21 Akim Demaille tests: fix Java push failure when running with BISON_USE_PUSH_FOR_PULL * tests/javapush.at (Trivial Push Parser with api.push-pull verification): When push for pull is enabled, there is one such function generated. 2013-06-21 Akim Demaille style: minor changes in the Java tests * tests/java.at (AT_CHECK_JAVA_GREP): Ignore the exit status. * tests/javapush.at (AT_CHECK_JAVA_GREP): Be more alike the previous one. Formating changes. Remove stray debugging "jj" file. 2013-06-21 Akim Demaille java: push: do not reset the error counter * data/lalr1.java (parse): here, when in push-pull is in "both" mode. This breaks the test suite, for instance make check TESTSUITEFLAGS='-d 388 BISON_USE_PUSH_FOR_PULL=1'. More generally make maintainer-push-check. 2013-06-14 Akim Demaille build: add Valgrind suppression file for GNU/Linux * build-aux/linux-gnu.valgrind: New. * build-aux/local.mk: Ship it. * configure.ac: Use it. 2013-06-13 Dennis Heimbigner java: add push-parser support * data/lalr1.java: Capture the declarations as m4 macros to avoid duplication. When push parsing, the declarations occur at the class instance level rather than within the parse() function. Change the way that the parser state is initialized. For push-parsing, the parse state declarations are moved to "push_parse_initialize()", which is called on the first invocation of "push_parse()". The %initial-action code is also inserted after the invocation of "push_parse_initialize()". The body of the parse loop is modified to return values at appropriate points when doing push parsing. In order to make push parsing work, it is necessary to divide YYNEWSTATE into two states: YYNEWSTATE and YYGETTOKEN. On the first call to push_parse(), the state is YYNEWSTATE. On all later entries, the state is set to YYGETTOKEN. The YYNEWSTATE switch arm falls through into YYGETTOKEN. YYGETTOKEN indicates that a new token is potentially needed. Normally, with a pull parser, this new token would be obtained by calling "yylex()". In the push parser, the value YYMORE is returned to the caller. On the next call to push_parse(), the parser will return to the YYGETTOKEN state and continue operation. * tests/javapush.at: New test file for java push parsing. * tests/testsuite.at: Use it. * tests/local.mk: Adjust. * doc/bison.texi (Java Push Parser Interface): New. 2013-06-11 Akim Demaille build: ship all the files, even if the C++ compiler is broken * examples/calc++/local.mk: Be sure to ship calc++.test even if the current C++ compiler is not sufficient to run the tests. 2013-06-05 Dennis Heimbigner style: comment changes in Java skeleton * data/lalr1.java: Here. 2013-06-03 Akim Demaille tests: fix a G++ warning * tests/c++.at: Use YY_NULL instead of 0 for the null pointer. And formatting changes. 2013-06-03 Akim Demaille build: fix a warning from clang * src/muscle-tab.c: Declare local functions static. 2013-05-30 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2013-05-30 Akim Demaille version 2.7.90 * NEWS: Record release date. 2013-05-30 Akim Demaille style: syntax-check fixes * data/yacc.c, src/Sbitset.c, src/Sbitset.h, src/muscle-tab.h, * src/output.c, src/parse-gram.y, src/reader.c, src/symtab.c, * src/uniqstr.c, src/uniqstr.h: Fix space before parens. * cfg.mk (_space_before_paren_exempt): Add needed exceptions. 2013-05-30 Akim Demaille xml: use %empty in the text output * data/xslt/xml2text.xsl: here. 2013-05-30 Akim Demaille build: locally disable new GCC warnings that fail on Flex generated code * configure.ac: here. 2013-05-30 Akim Demaille fix a memory leak * src/print-xml.c (num_escape_bufs): New. (print_xml): Be sure to release all the escape_bufs. 2013-05-30 Akim Demaille regen 2013-05-30 Akim Demaille build: be sure to include config.h first in the generated parser Using %code for config.h is wrong, as some headers will already have been included by Bison. In some cases, e.g., glibc's string.h, this results in some declaration not being made for lack of definition of _GNU_SOURCE, which is performed by config.h. * src/parse-gram.y: here. 2013-05-29 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: maint: post-release administrivia version 2.7.1 regen 2013-05-29 Petr Machata drop unused options --raw, -n, -e, --include and -I * --raw appears to be ignored. It was marked as obsolete in the commit ec3bc39, and documented as no longer supported as of 1.29 (2001-09-07). Support for %raw appears to have been dropped in e9955c83 on 2002-06-11, but --raw was kept around. Maybe it's time to drop it as well? * Commit e9955c83 dropped support for %no-parser as well, and converted it to option. --no-parser was later dropped in 728c4be2 on 2007-08-12, but -n was kept around, probably as an omission. All three are documented as removed since 2.3b (2008-05-27). * -e existed for a single day in 2001. It was introduced in eeeb962b on 2001-11-27. The handling was removed in c7925b99 on 2001-11-28, but "e" was kept in the list of short options. Probably an omission. * --include appears to be dead code. The option sets a variable, but that variable is not used anywhere. It was added in f6bd5427 on 2001-11-26 as a %-directive, with comments that it's not yet implemented. It was converted to a command-line option later, but doesn't seem to ever have been actually implemented. 2013-05-28 Akim Demaille gnulib: update 2013-04-22 Akim Demaille diagnostics: always point to the first directive Some directives cannot be used several times (e.g., a given symbol may only have a single printer). In case of repeated definitions, an error is issued for the second definition, yet it is not discarded, and becomes the definition used for the rest of the file. This is not consistent with the idea that multiple definitions are not allowed: discard any repeated directive. * src/symtab.c (symbol_type_set, symbol_code_props_set) (semantic_type_code_props_set, symbol_class_set, symbol_translation): Discard repeated directives. * tests/input.at (Default %printer and %destructor redeclared) (Per-type %printer and %destructor redeclared): Update expectations. 2013-04-22 Akim Demaille tests: factor test for printer/desctructor redefined * tests/input.at (Default %printer and %destructor redeclared): Introduce AT_TEST to factor. 2013-04-22 Akim Demaille diagnostics: use appropriate location for useless precedence/associativity * src/symtab.c (symbol_precedence_set): Use prec_location, not location (which is the first occurrence of the symbol, possibly just %token). Also, as redefinitions are not allowed, keep the first values, not the subsequent ones. * tests/conflicts.at, tests/existing.at, tests/regression.at: Adjust. 2013-04-22 Akim Demaille tests: factor duplicate expected warnings * tests/existing.at: Instead of "t ? abc : aBc", write "a(t?b:B)c". 2013-04-19 Akim Demaille tests: enable -Wsign-compare and fix corresponding warnings -Wsign-compare was disabled for bison's own code, following gnulib's approach. However, the generated parsers should not trigger such warnings. Reported by Efi Fogel. http://lists.gnu.org/archive/html/help-bison/2013-04/msg00018.html See also http://stackoverflow.com/questions/16101062 for the weird "-(unsigned)i" piece of code. * configure.ac (warn_tests): Enable -Wsign-compare. * data/location.cc (position::add_): New. (position::lines, position::columns): Use it. * tests/actions.at (AT_CHECK_PRINTER_AND_DESTRUCTOR): Fix signedness issues. 2013-04-18 Akim Demaille muscle: check more cases of %define variables with code values * data/bison.m4 (b4_percent_define_check_kind): Fix overquotation. (api.location.type, api.position.type): Check they have code values here. * data/c++.m4 (api.location.type): No longer checked here. (parser_class_name): Check it here. * data/java.m4 (api.value.type, init_throws, lex_throws, parser_class_name) (throws, annotations, extends, implements): Check they have code values. * doc/bison.texi: Fix every incorrect occurrence of %define. Document the additional syntax for %define: code values. Document the additional syntax for -D/-F: string and code values. * tests/calc.at, tests/headers.at, tests/input.at, tests/java.at, * tests/local.at: Fix dependencies. 2013-04-18 Akim Demaille regen 2013-04-18 Akim Demaille parser: do not convert $ and @ in code values of %define variables * src/parse-gram.y (value: "{...}"): Just strip the braces, but pass the value as is. 2013-04-18 Akim Demaille parser: no longer use the "braceless" non-terminal The purpose of this symbol was only to factor function calls. As a result the actions were indeed simpler, but the grammar was somewhat uselessly obfuscated. Get rid of this symbol, but introduce functions to simplify dependencies. There is no (intended) changes of behavior here. * src/parse-gram.y (strip_braces, translate_code( (translate_code_braceless): New. (braceless): Remove, use "{...}" instead, and one of the previous functions depending on the context. (STRING, "%{...%}", EPILOGUE): Declare as , instead of , the difference between both is useless (well, I couldn't make sense of it, even after having read the initial commit that introduced them). (%union): Remove the now useless "chars" type. Adjust the printers. * src/scan-gram.l: Adjust. 2013-04-18 Akim Demaille regen 2013-04-18 Akim Demaille style: avoid %{...%} in our parser * src/parse-gram.y (%{...%}): Split in %code and %code requires. * src/location.h: Add missing includes for self containedness. 2013-04-18 Akim Demaille style: use %code for local function declarations in our parser * src/parse-gram.y (version_check, gram_error, char_name, lloc_default): Move their prototypes from %{...%} to %code. (YYLLOC_DEFAULT, YY_LOCATION_PRINT): Move from %{...%} to %code. (current_lhs): Move its implementation to the epilogue. 2013-04-16 Akim Demaille regen 2013-04-16 Akim Demaille muscle: check the kind of api.prefix, api.location.type * data/bison.m4: Check api.prefix. * data/c++.m4: Check api.location.type. * doc/bison.texi: Fix uses of api.value.type, api.prefix, api.location.type. Document {...} values for %define. * src/parse-gram.y: Fix use of api.prefix. * tests/calc.at: Fix uses of api.location.type. * tests/input.at: Check api.prefix, and api.location.type. 2013-04-15 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2013-04-15 Akim Demaille version 2.7.1 * NEWS: Record release date. 2013-04-15 Akim Demaille regen 2013-04-15 Akim Demaille muscle: enforce definition syntax for keyword variables * src/muscle-tab.c (muscle_percent_define_get_kind) (muscle_percent_define_check_kind): New. (muscle_percent_define_default): Variables with a default value are of "keyword" kind. (muscle_percent_define_flag_if, muscle_percent_define_check_values): Check that the variable is of keyword kind. * data/bison.m4: Likewise, but in M4. That is to say... (b4_percent_define_default): Define the kind when the variable is undefined. (b4_percent_define_check_kind): Use a better error message. (_b4_percent_define_check_values, _b4_percent_define_check_values): Former "enum" variables should be defined using the keyword syntax. * doc/bison.texi: Update. A couple of fixes. * tests/input.at (%define keyword variables): New. 2013-04-15 Akim Demaille muscle: let -D/-F support the three kinds of %define variable values See http://lists.gnu.org/archive/html/bison-patches/2013-04/msg00012.html * src/getargs.c (getargs): Recognize {value} and "value" for -D and -F. 2013-04-15 Akim Demaille muscle: minor refactoring * src/muscle-tab.c (muscle_percent_define_default): Reduce the scopes. 2013-04-15 Akim Demaille muscle: minor simplification which uncovers a missing warning * src/muscle-tab.c (muscle_percent_define_ensure): Discover the virtues of || to factor conditionals. * NEWS: As api.pure is no longer flagged as "used" by accident, we now have warnings for useless definitions. * tests/calc.at: So remove api.pure settings when running C++ tests, since C++ skeletons use a pure interface. 2013-04-15 Akim Demaille muscle: factor the field retrieval * src/muscle-tab.c (muscle_percent_define_get_raw): New. Use it where appropriate. (location_decode): No longer fetch the value from the table, take the value as argument. 2013-04-15 Akim Demaille muscle: factor the handling of used variables * src/muscle-tab.c (muscle_percent_define_use): New, corresponding to b4_percent_define_use. Use it where appropriate. 2013-04-15 Akim Demaille muscle: factor the computation of variable names * src/muscle-tab.c (muscle_name): New. Use it. Propagate "uniqstr" as value type instead of plain "char const *". 2013-04-15 Akim Demaille muscle: factor the kind check in M4 * data/bison.m4 (b4_percent_define_check_kind): New. Use it to check api.token.prefix. * data/c++.m4: Check the kind of api.namespace. * doc/bison.texi: Update a reference to former 'namespace' variable. * tests/input.at ("%define" code variables): Check api.namespace. 2013-04-15 Akim Demaille muscle: factor conditionals on defined %define variables * data/bison.m4 (b4_percent_define_ifdef_): New. Use it where appropriate. 2013-04-11 Akim Demaille api.token.prefix: use code values * data/bison.m4: Remove useless (and incorrect: m4_* instead of b4_*) default assignment to api.token.prefix. Check that api.token.prefix is assigned code. * tests/input.at (%define code variables): New test. * NEWS, doc/bison.texi, tests/c++.at, tests/calc.at, * tests/java.at, tests/local.at: Adjust to use braces. 2013-04-11 Akim Demaille c++: fix several issues with locations Reported by Daniel Frużyński. http://lists.gnu.org/archive/html/bug-bison/2013-02/msg00000.html * data/location.cc (position::columns, position::lines): Check for underflow. Fix some weird function signatures. (location): Accept signed integers as arguments where appropriate. Add operator- and operator+=. * doc/bison.texi (C++ position, C++ location): Various fixes and completion. * tests/c++.at (C++ Locations): New tests. 2013-04-11 Akim Demaille muscles: be sure that %code snippets are not glue together on a single line Recently "braceless" in the parser was changed so that an eol was no longer added to the value. This is not correct when a %code is used multiple times, because the syncline of the next snippet might be appended to the last (and not ended) line of the previous snippet. * src/muscle-tab.h (muscle_grow): Make it private. * src/muscle-tab.c (muscle_grow): Accept a fourth argument: a required terminator. Adjust callers. * tests/input.at (Multiple %code): New. 2013-04-11 Akim Demaille style: fix comments * tests/actions.at: Fix incorrect "prototype". 2013-04-10 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: glr.cc: fix a clang warning maint: update copyright years build: fix VPATH issue build: avoid clang's colored diagnostics in the test suite tests: please clang and use ".cc", not ".c", for C++ input gnulib: update skeletons: avoid empty switch constructs lalr1.cc: fix compiler warnings yacc.c: do not use __attribute__ unprotected tests: style changes 2013-04-09 Akim Demaille api.value.type: use keyword/brace values Suggested by Joel E. Denny. http://lists.gnu.org/archive/html/bison-patches/2013-03/msg00016.html * data/bison.m4 (b4_percent_define_get_kind): New. (b4_variant_flag): Check that api.value.type is defined as the 'variant' keyword value. * data/c.m4 (_b4_value_type_setup_keyword): New. (b4_value_type_setup): Use it to simplify reading. Use b4_define_silent. Decode api.value.type, including its type. (b4_value_type_define): Likewise. * data/c++.m4 (b4_value_type_declare): Adjust the decoding of api.value.type, taking its kind into account. * doc/bison.texi: Adjust all the examples to the new syntax. * NEWS: Ditto. * tests/types.at: Adjust 2013-04-09 Akim Demaille api.value.type: diagnose guaranteed failure with --yacc Instead of generating invalid C code, generate an error when --yacc and '%define api.value.type union' are used together. * data/bison.m4: Issue an error in this case. * tests/types.at (%yacc vs. %define api.value.type union): New, check this error. * doc/bison.texi (Type Generation): Document it. * tests/output.at: Check that '-o y.tab.c' and '-y' behave equally wrt generated file names. * NEWS (Use of YACC='bison -y'): New. Promote the use of 'bison -o y.tab.c'. 2013-04-09 Akim Demaille doc: style changes * doc/bison.texi (Destructor Decl, Printer Decl): Group series of %token and %type together. 2013-04-09 Akim Demaille doc: display locations in error as recommended by GNU Coding Standards * doc/bison.texi (Actions and Locations): here. 2013-04-09 Akim Demaille doc: api.value.type union * doc/bison.texi (Type Generation): New section. (Multi-function Calc): Convert to use api.value.type=union. 2013-04-09 Akim Demaille doc: move the section about "%union" where types are discussed * doc/bison.texi (Union Decl): Move to... (Defining Language Semantics): here. 2013-04-09 Akim Demaille doc: deprecate #define YYSTYPE in favor of %define api.value.type * doc/bison.texi: Convert examples with YYSTYPE to use api.value.type. Deprecate YYSTYPE. 2013-04-09 Akim Demaille value type: accept "->" in type tags Provide a means to dereference pointers when defining tags. One example could be: %code requires { typedef struct ListElementType { union value { int intVal; float floatVal; char* charptrVal; } value; struct ListElementType* next; } ListElementType; } %union { ListElementType* list; } %token value.charptrVal> STRING %token value.intVal> INTEGER %token value.floatVal> REAL %type ElementList LiteralType * src/scan-code.l, src/scan-gram.l: Accept "->" in tags. * tests/types.at: Add more test cases to cover this case. 2013-04-09 Akim Demaille style: simplify the scanning of type tags * src/scan-gram.l: Remove the rule for simple tags: the "complex" case subsumes it. It was more efficient, but duplicated the code for a negligible benefit. 2013-04-09 Akim Demaille api.value.type: implement proper support, check, and document * data/c.m4 (b4_symbol_type_register, b4_type_define_tag) (b4_symbol_value_union, b4_value_type_setup_union) (b4_value_type_setup_variant, b4_value_type_setup): New. (b4_value_type_define): Use it to set up properly the type. Handle the various possible values of api.value.type. * data/c++.m4 (b4_value_type_declare): Likewise. * data/lalr1.cc (b4_value_type_setup_variant): Redefine. * tests/types.at: New. Exercise all the C/C++ skeletons with different types of api.value.type values. * tests/local.mk, tests/testsuite.at: Use it. * doc/bison.texi (%define Summary): Document api.value.type. * NEWS: Advertise it, together with api.token.constructor. 2013-04-09 Akim Demaille m4: allow the definition of side-effect only macros * data/bison.m4 (b4_divert_kill, b4_define_silent): New. * data/c.m4: Comment change. 2013-04-09 Akim Demaille variant: fix inconsistent quotation * data/variant.hh (b4_char_sizeof): De-overquote. (b4_value_type_declare): De-underquote. 2013-04-09 Akim Demaille m4: style changes in error messages * data/bison.m4: Use $0 to denote the current macro's name. 2013-04-08 Akim Demaille glr.cc: fix a clang warning * data/glr.cc (b4_epilogue): Be sure to end with an end-of-line, so that the file does end with one. 2013-04-08 Akim Demaille maint: update copyright years Run "make update-copyright". 2013-04-08 Akim Demaille build: fix VPATH issue * Makefile.am (update-b4-copyright, update-package-copyright-year): Fix path to build-aux. 2013-04-08 Akim Demaille build: avoid clang's colored diagnostics in the test suite The syncline tests, which try to recognize compiler diagnostics, are confused by escapes for colors. * configure.ac (warn_tests): New, to factor the warnings for both C and C++ tests. Add -fno-color-diagnostics to it. * tests/local.at (AT_TEST_TABLES_AND_PARSE): Do not remove glue together compiler flags. 2013-04-08 Akim Demaille tests: please clang and use ".cc", not ".c", for C++ input When fed with foo.c, clang++ 3.2 answers: clang: error: treating 'c' input as 'c++' when in C++ mode, this behavior is deprecated * tests/output.at (AT_CHECK_OUTPUT_FILE_NAME): Use *.cc and *.hh for C++. 2013-04-08 Akim Demaille gnulib: update 2013-04-08 Akim Demaille skeletons: avoid empty switch constructs Reported by Rob Conde. http://lists.gnu.org/archive/html/bug-bison/2013-03/msg00003.html * data/c.m4 (b4_symbol_actions): Rename as... (_b4_symbol_actions): this. (b4_symbol_actions): New wrapper. Do not emit empty switches. Adjust all b4_symbol_actions callers. 2013-04-08 Akim Demaille lalr1.cc: fix compiler warnings Reported by Rob Conde. http://lists.gnu.org/archive/html/bug-bison/2013-03/msg00003.html * data/stack.hh (operator=, stack(const stack&)): Make this class uncopyable, i.e., "undefine" these operators: make them private and don't implement them. (clear): New. * data/lalr1.cc: Use it instead of an assignment. (parser): Make this class uncopyable. 2013-04-08 Akim Demaille yacc.c: do not use __attribute__ unprotected Reported by Victor Khomenko. http://lists.gnu.org/archive/html/bug-bison/2013-04/msg00001.html * data/glr.c (YYUSE, __attribute__): Fuse their definition into... * data/c.m4 (b4_attribute_define): this new macro. * data/yacc.c, data/glr.c: Use it. 2013-04-05 Akim Demaille api.namespace: demonstrate and use {...} values instead of "..." values * tests/c++.at, tests/input.at: Use "%define api.namespace {foo}" instead of using quotes. * tests/local.at (AT_SETUP_STRIP, AT_NAME_PREFIX): Recognize uses of braces instead of quotes. * doc/bison.texi: Use braces for api.namespace's values. 2013-04-05 Akim Demaille grammar: do not add a \n at the end of blocks of code Now that we use "braceless" (which is {...} blocks of code with initial and final braces stripped) to denote "short" values (such as api.namespaces), the added end-of-line is a nuisance. As a matter of fact, this extra-safety was useless, as every expansion of "braceless" (aka, "user code") is followed by an end of line. * src/parse-gram.y, src/parse-gram.c (braceless): Instead of replacing the final brace by \n, just delete the brace. 2013-04-04 Akim Demaille regen 2013-04-04 Akim Demaille grammar: record the kind of %define variable values Provide a means to tell the difference between "keyword" values (e.g., %define api.pull both), "string" values (e.g., %define file.name "foo"), and "code" values (e.g., %define api.namespace {calc}). Suggested by Joel E. Denny. http://lists.gnu.org/archive/html/bison-patches/2013-03/msg00016.html * src/muscle-tab.h, src/muscle-tab.c (muscle_kind, muscle_kind_new) (muscle_kind_string): New. (muscle_percent_define_insert): Take the kind as new argument. Insert it in the muscle table. Adjust callers. * src/getargs.c: Adjust callers. * src/parse-gram.y: Ditto. (content.opt): Remove, replaced by... (value): this new non-terminal, whose semantics value is stored in the new "value" union member. Provide a printer. Support values in braces in additions to keyword and string values. fuse me 2013-04-04 Akim Demaille style: fix comments * src/muscle-tab.c (muscle_percent_define_ensure): Update obsolete comments. 2013-04-04 Akim Demaille regen 2013-04-04 Akim Demaille grammar: style changes * src/parse-gram.y (PARAM_TYPE): Remove useless typedef guard. There's a header guard. Use 'yyo' with %printer. Use a consistent style for %union one-liners. 2013-04-04 Akim Demaille grammar: split %union to group together related aspects * src/parse-gram.y (INT): Fuse the %type and %token declaration. Move its %union right before its introduction. (%union): Split in several %unions, right before their use. 2013-04-04 Akim Demaille muscle: refactor * src/muscle-tab.c (muscle_lookup, muscle_entry_new): New. (muscle_insert, muscle_grow, muscle_find_const, muscle_find): Use them. 2013-04-03 Akim Demaille style: comment changes * src/muscle-tab.c: Move the documentation of public functions to... * src/muscle-tab.h: here. Fix comment consistency issues. 2013-04-03 Akim Demaille muscle: minor refactoring * src/muscle-tab.h (MUSCLE_INSERT_C_STRING): Use MUSCLE_INSERT_STRING. 2013-03-06 Akim Demaille regen 2013-03-06 Valentin Tolmer gram: correct token numbering in precedence declarations In a precedence declaration, when tokens are declared with a litteral character (e.g., 'a') or with a identifier (e.g., B), Bison behaved differently: the litteral tokens would be numbered first, and then the other ones, leading to the following grammar: %right A B 'c' 'd' being numbered as such: 'c' 'd' A B. * src/parse-gram.y (symbol.prec): Set the symbol number when reading the symbols. * tests/conflicts.at (Token declaration order: literals vs. identifiers): New. 2013-03-04 Akim Demaille maint: update autoconf submodule * submodules/autoconf: Up to master. No significant changes in the files we use (m4sugar.m4 and foreach.m4). 2013-03-04 Akim Demaille diagnostics: no longer include the yacc category in -Wall It would be a pity to warn the users against Bison features... http://lists.gnu.org/archive/html/bison-patches/2013-02/msg00107.html * src/complain.h, src/complain.c (Wall): Disable Wyacc. (Weverything): New (hidden so far) category which really denotes all the categories (what used to be Wall). (warnings_args, warnings_types): Adjust. (warning_argmatch): Now !none = Weverything and conversely, no longer Wall. * NEWS, doc/bison.texi, src/getargs.c: Adjust the documentation. * tests/input.at (-Werror is not affected by -Wnone and -Wall): Adjust by not using a -Wyacc type of warning. 2013-03-04 Akim Demaille grammar: no longer detect and cure missing semicolon at end of actions Bison 3.0 is already breaking backward compatibility with other features. It is an appropriate time to drop this feature. Note that it was disabled when --yacc is passed. See http://lists.gnu.org/archive/html/bison-patches/2013-02/msg00102.html Basically, revert e8cd1ad655bcc704b06fb2f191dc3ac1df32b796. * src/scan-code.l (braces_level, need_semicolon, in_cpp): Remove. Remove every rule needed to detect and add missing semicolon. * tests/actions.at (Fix user actions without a trailing semicolon): Remove. * NEWS: Adjust. 2013-03-04 Akim Demaille build: stop using bison -y * Makefile.am (YACC): Pass -o y.tab.c, so that ylwrap is happy, and yet we don't pass --yacc to bison. (AM_YFLAGS): Disable Yacc warnings. 2013-02-23 Akim Demaille c++: rename b4_semantic_type_declare as b4_value_type_declare This is to match the names used in C and api.value.type, even if the parser actually defines semantic_type. * data/c++.m4 (b4_semantic_type_declare): Rename as... (b4_value_type_declare): this. * data/variant.hh: Likewise. 2013-02-23 Akim Demaille news: typo * NEWS: here. 2013-02-23 Akim Demaille style: space changes in the tests * tests/local.at: here. 2013-02-22 Akim Demaille style: formatting changes in the doc * doc/bison.texi: Use @file where appropriate. 2013-02-19 Akim Demaille tests: fix invalid C++11 code * tests/c++.at (Object): Somehow instances of Object were assigned YY_NULL, which is 0 most of the time (that case passes), but is nullptr in C++11, and there is nothing in Object to support such an assignment (failure). Use 0 as value, and provide the needed assignment operator. Also, use a more natural order within the class definition. 2013-02-19 Akim Demaille tests: fix failures with G++ 4.8 in Flex scanner * configure.ac (WARN_NO_NULL_CONVERSION_CXXFLAGS): Rename as... (FLEX_SCANNER_CXXFLAGS): this. Pass -Wno-zero-as-null-pointer-constant to G++ if it supports it. * examples/calc++/local.mk: Adjust. 2013-02-19 Akim Demaille regen 2013-02-19 Akim Demaille gnulib: update 2013-02-19 Akim Demaille style: rename variant private members * data/variant.hh (buffer, tname, as_, raw, align_me): Rename as... (yybuffer_, yytname_,yyas_, yyraw, yyalign_me): these. 2013-02-19 Akim Demaille style: space changes * data/variant.hh: Be sure to leave a space before arguments in function calls. 2013-02-19 Akim Demaille variant: fix G++ 4.4 warnings The changes by Théophile Ranquet about type punning issues need to be extend to in-place new to please G++ 4.4.7. * data/variant.hh (variant::as_): New, factors the casts that avoid compiler warnings. (as, build): Use them. 2013-02-18 Akim Demaille news: spell fixes * NEWS: here. 2013-02-18 Akim Demaille diagnostics: factor and enhance messages about duplicate rule directives When reporting a duplicate directive on a rule, point to its first occurrence: one.y:11.10-15: error: only one %empty allowed per rule %empty {} %empty ^^^^^^ one.y:11.3-8: previous declaration %empty {} %empty ^^^^^^ And consistently discard the second one. * src/complain.h, src/complain.c (duplicate_directive): New. * src/reader.c: Use it where appropriate. * src/symlist.h, src/symlist.c (symbol_list): Add a dprec_location member. * tests/actions.at: Adjust expected output. 2013-02-18 Akim Demaille style: no longer use backquotes * tests/actions.at, tests/atlocal.in, tests/c++.at, tests/calc.at, * tests/conflicts.at, tests/existing.at, tests/glr-regression.at, * tests/input.at, tests/java.at, tests/local.at, tests/sets.at, * tests/synclines.at, doc/bison.texi, lib/libiberty.h, lib/timevar.h: Use single quotes. 2013-02-18 Akim Demaille style: no longer use backquotes * README, REFERENCES, TODO, configure.ac, data/README, data/bison.m4, * data/c++.m4, data/c.m4, data/java.m4, data/lalr1.cc, * data/lalr1.java, data/yacc.c, doc/local.mk, etc/bench.pl.in, * src/conflicts.c, src/files.c, src/getargs.c, src/gram.h, src/lalr.c, * src/location.c, src/location.h, src/muscle-tab.c, src/muscle-tab.h, * src/output.c, src/parse-gram.c, src/parse-gram.y, src/print-xml.c, * src/print.c, src/reader.c, src/reduce.c, src/scan-skel.l, * src/symtab.h, src/system.h, src/tables.c: Use single quotes, as currently recommended by the GNU Coding Standards. 2013-02-18 Akim Demaille style: no longer use backquotes in messages * src/getargs.c (usage): Use single quotes. 2013-02-18 Akim Demaille doc: use %empty instead of /* empty */ * doc/bison.texi: Change the comments into explicit %empty. 2013-02-18 Akim Demaille doc: introduce %empty and -Wempty-rule * doc/bison.texi (Grammar Rules): Make it a @section which contains... (Rules Syntax): this new subsection (with the previous contents of "Grammar Rules". (Empty Rules): New subsection, extracted from the former "Grammar Rules". Document %empty. (Recursion): New a subsection of "Grammar Rules". Complete a few index entries. (Bison Options): Document -Wempty-rule. 2013-02-18 Akim Demaille report: use %empty to denote empty rules * src/gram.c (rule_rhs_print): Use %empty for empty rules. * tests/conflicts.at, tests/regression.at, tests/sets.at: Adjust. 2013-02-18 Akim Demaille diagnostics: %empty enables -Wempty-rule * src/complain.h, src/complain.c (warning_is_unset): New. * src/reader.c (grammar_current_rule_empty_set): If enabled -Wempty-rule, if not disabled. * tests/actions.at (Implicitly empty rule): Check this feature. Also check that -Wno-empty-rule does disable this warning. 2013-02-18 Akim Demaille -Wempty-rule: diagnose empty rules without %empty * src/complain.h, src/complain.c (warning_empty_rule, Wempty_rule): New warning category. (warnings_args, warnings_types): Adjust. * src/reader.c (grammar_rule_check): Check the empty rules are flagged by %empty. * tests/actions.at (Implicitly empty rule): New. * tests/existing.at: Add expected warnings. 2013-02-18 Akim Demaille tests: use %empty * tests/actions.at, tests/input.at, tests/reduce.at, * tests/regression.at: here. 2013-02-18 Akim Demaille regen 2013-02-18 Akim Demaille parser: use %empty Avoid that Bison's own use of "bison -Wall" trigger warnings. * src/parse-gram.y: Use %empty for every empty rule. 2013-02-18 Akim Demaille grammar: introduce %empty Provide a means to explicitly denote empty right-hand sides of rules: instead of exp: { ... } allow exp: %empty { ... } Make sure that %empty is properly used. With help from Joel E. Denny and Gabriel Rassoul. http://lists.gnu.org/archive/html/bison-patches/2013-01/msg00142.html * src/reader.h, src/reader.c (grammar_current_rule_empty_set): New. * src/parse-gram.y (%empty): New token. Use it. * src/scan-gram.l (%empty): Scan it. * src/reader.c (grammar_rule_check): Check that %empty is properly used. * tests/actions.at (Invalid uses of %empty, Valid uses of %empty): New. 2013-02-16 Akim Demaille getargs: minor simplification * src/getargs.c (flag_argmatch): Simplify the handling of "none". 2013-02-16 Akim Demaille style: move argument handling of -W into the diagnostics module This allows to reduce the number of public interfaces. * src/getargs.c (--yacc): Use warning_argmatch instead of tweaking directly warnings_flag (which will be private). (warning_argmatch, warnings_argmatch): Move to... * src/complain.h, src/complain.c: here. * src/getargs.h, src/getargs.c (warnings_args, warnings_types): Move to... * src/complain.c: here, now private. * src/complain.h (severity, warnings_flag): Move to... * src/complain.c: here, now private. 2013-02-16 Akim Demaille diagnostics: revamp the handling of -Werror Recent discussions with Joel E. Denny (http://lists.gnu.org/archive/html/bison-patches/2013-02/msg00026.html) show that it is desirable to tell the difference between an option that was explicitly disabled with -Wno-foo, as opposed to be left unset. The current framework does not allow this. Instead of having a first int to store which options are enabled, and another to store which are turned into errors, use an array that for each warning category tells its status: disabled, unset, warning, error. * src/complain.h, src/complain.c (warning_bit): New enum. (warnings): Use it. (severity): New enum. (warnings_flag): Now an array of severity. (errors_flag): Remove, now done by warnings_flag. (complain_init): New function, to initialie warnings_flag. (warnings_are_errors): New Boolean, for -Werror. * src/complain.c (warning_severity): New. (warnings_print_categories, complains): Use it. * src/getargs.c (warning_argmatch): Adjust to use warnings_flag. (warnings_argmatch): Ditto. Handle -Werror and -Wno-error here. (getargs): Adjust. * src/main.c (main): Call complain_init. * tests/input.at (Invalid options): Add more corner cases. 2013-02-14 Akim Demaille options: simplify the handling of -W * src/getargs.c (warnings_argmatch, warning_argmatch): Simplify by replacing function arguments with their actual values. (WARNING_ARGMATCH): Remove, useless. Adjust callers. 2013-02-14 Akim Demaille options: don't accept "error=" for -f and -r * src/getargs.c (warning_argmatch, warnings_argmatch, WARNINGS_ARGMATCH): New. Use them for -W/--warning. They are copied from... (flag_argmatch, flags_argmatch, FLAGS_ARGMATCH): these. Simplify by removing the support for "error". * tests/input.at (Invalid options): New. * TODO (Laxism in Bison invocation arguments): Remove. 2013-02-14 Akim Demaille diagnostics: factor the list of warning names * src/getargs.h, src/getargs.c (warnings_args, warnings_types): Make them public. * src/complain.h, src/complain.c (warnings_print_categories): Its only use outside complain.c was removed in a recent commit, so make it static. Simplify its implementation. Use warnings_args and warnings_types. * src/muscle-tab.c (muscle_percent_define_check_values): Make it silent. 2013-02-14 Akim Demaille diagnostics: no longer pretty-print rules in error messages, carets suffice * src/gram.c (grammar_rules_useless_report): Let -fcaret handle the pretty-printing of the guilty rules. (rule_print): Inline in its only use. * tests/conflicts.at, tests/existing.at, tests/reduce.at, * tests/regression.at: Adjust. * NEWS: Document. 2013-02-14 Akim Demaille options: no longer document warnings when diagnosing an invalid -W The argmatch functions accept prefixes of the alternatives (like getopt does for long options). Bison uses this to document the warning categories. This is troublesome: it duplicates the --help documentation, it is not gettextized, it is displayed with ugly quotes (because argmatch uses it to display the list of possible answers), and it prevents straighforward uses of the tables of valid warning categories (for instance so that warning diagnostics end with the name of the warning). The "hidden" option --trace uses the same trick, but it does not need to be translated, nor to be described in --help. * src/getargs.c (warnings_args): Remove pseudo documentation. Comment changes. 2013-02-11 Akim Demaille tests: enlarge the allowed duration for calc tests Hydra "often" fails on this test: 252. calc.at:658: 252. Calculator %glr-parser api.pure parse.error=verbose %debug %locations %defines api.prefix="calc" %verbose %yacc %parse-param {semantic_value *result} %parse-param {int *count} (calc.at:658): FAILED * tests/calc.at: Give 200s instead of 100s. Use AT_DEBUG_IF. 2013-02-11 Akim Demaille debug: improve the display of symbol lists * src/symtab.c (symbol_print): Remove useless quotes (the symbol already has quotes). Prefer fputs. * src/symlist.c (symbol_list_syms_print): Likewise. Fix separators. 2013-02-09 Akim Demaille style: minor changes * src/complain.c: Space changes. * src/reader.c: Comment changes. Avoid && in assertions. * src/location.c: Move comments to... * src/location.h: here. * src/symlist.h, src/symlist.c: Create a pseudo section for members that apply to the rule. 2013-02-08 Akim Demaille news: restructure, document variants for C++ * NEWS: here. 2013-02-08 Akim Demaille c++: api.token.constructor requires api.value.type=variant Eventually it should also support "union". * data/glr.cc: Move this check to... * data/c++.m4: here, as lalr1.cc is affected too. 2013-02-05 Akim Demaille build: restore C90 compatibility * src/parse-gram.y, src/parse-gram.c: Don't use // comments. 2013-02-05 Akim Demaille doc: use @group to improve page breaking * doc/bison.texi: here. 2013-02-04 Akim Demaille style: rename internal "stype" as "union_members" for clarity "stype" is quite unclear, and it also collides with the former %define variable that had the same name (replaced by api.value.type). * src/parse-gram.y (stype): Rename as... (union_members): this. * data/bison.m4: Adjust. (b4_user_stype): Rename as... (b4_user_union_members): this. * data/c++.m4, data/c.m4: Adjust. * src/parse-gram.c: regen. 2013-02-04 Akim Demaille tests: improve the language independance layer * tests/local.at (_AT_LANG_DISPATCH): New, shamelessly stolen from Autoconf's _AT_LANG_DISPATCH. (AT_LANG_DISPATCH): New. (AT_YYERROR_FORMALS, AT_YYERROR_PROTOTYPE, AT_YYERROR_DECLARE_EXTERN) (AT_YYERROR_DECLARE, AT_YYERROR_DEFINE, AT_MAIN_DEFINE, AT_COMPILE) (AT_FULL_COMPILE): Use AT_LANG_DISPATCH instead of an ad hoc m4_case. 2013-02-04 Akim Demaille regen 2013-02-04 Akim Demaille style: space changes in the parser * src/parse-gram.y: Fix spaces. 2013-02-04 Akim Demaille parser: use api.pure full * src/parse-gram.y: Use api.pure full instead of silly macro tricks. 2013-02-04 Akim Demaille style: use a for loop instead of a while loop, and scope reduction * src/reader.c (packgram): Improve readability. The parser calls grammar_current_rule_end at the end of every rhs, which adds a NULL to separate the rules. So there is no need to check whether "p" is non-null before proceeding. 2013-02-01 Theophile Ranquet variants: stylistic change * data/variant.hh (tname): Respect the GNU Coding Standards for this pointer's declaration. 2013-02-01 Theophile Ranquet grammar: free the association tracking graph The graph introduced by Valentin wasn't free'd after use. * src/symtab.c (assoc_free): New, clear the array of linked lists with... (linkedlist_free): This, new. (print_precedence_warnings): Call assoc_free when done. (print_assoc_warnings): Free used_assoc after use. 2013-02-01 Theophile Ranquet tests: use AT_FULL_COMPILE where possible * tests/c++.at (C++ Variant-based Symbol, Variants): Here. Rename the generated input files to use .y instead of .yy, as a requirement for using AT_FULL_COMPILE instead of a combination of AT_BISON_CHECK and AT_BISON_COMPILE_CXX. 2013-02-01 Theophile Ranquet variants: avoid type punning issue This is based on what is recommended by both Scott Meyers, in 'Effective C++', and Andrei Alexandrescu and Herb Sutter in 'C++ Coding Standards'. Use a static_cast on void* rather than directly use a reinterpret_cast, which can have nefarious effects on objects. However, even though following this guideline is good practice in general, I am not quite sure how relevant it is when applied to conversions from POD to objects. Actually, it might very well be the opposite: isn't this exactly what reinterpret_cast is for? What we really want *is* to transmit the memory map as a series of bytes, which, if I am correct, falls into the kind of "low level" hack for which this cast is meant. In any case, this silences the warning, which will be greatly appreciated by anyone using variants with a compiler supporting -fstrict-aliasing. * data/variant.hh (as): Here. * tests/c++.at (Exception safety, C++ Variant-based Symbols, Variants): Don't use NO_STRICT_ALIAS_CXXFLAGS (revert commit ddb9db15), as type punning is no longer an issue. * tests/atlocal.in, configure.ac (NO_STRICT_ALIAS_CXXFLAGS): Remove definition. * examples/local.mk (NO_STRICT_ALIAS_CXXFLAGS): Remove from AM_CXXFLAGS. * doc/bison.texi: Don't mention type punning issues. 2013-02-01 Theophile Ranquet todo: update Reformulate and give more details on my thoughts concerning the graphical visualization, and add an entry about a bug in the options processing for warnings as errors. * TODO: Here. 2013-02-01 Akim Demaille regen 2013-02-01 Akim Demaille location: pass the location first * src/location.h, src/location.c (location_print): For consistency with other data structures and other location_* routines, pass the location argument first. * src/complain.c: Adjust. (location_caret): Likewise. * src/parse-gram.y: Adjust. 2013-02-01 Akim Demaille symlist: use the right stream * src/symlist.c (symbol_list_syms_print): Use "f", not stderr. 2013-01-30 Akim Demaille tests: put two related tests together * tests/conflicts.at (Useless associativity warning): Move next to "Useless precedence warning". 2013-01-30 Akim Demaille news: name contributors * NEWS: here. 2013-01-30 Valentin Tolmer warnings: introduce -Wprecedence The new warning category "precedence" flags useless precedence and associativity. -Wprecedence can now be used, it is disabled by default. The warnings about precedence and associativity are grouped into one, and the testsuite was corrected accordingly. * src/complain.h (warnings): Introduce "precedence". * src/complain.c (warnings_print_categories): Adjust. * src/getargs.c (warnings_args, warning_types): Likewise. * src/symtab.h, src/symtab.c (print_associativity_warnings): Remove. * src/symtab.h (register_assoc): Correct arguments. * src/symtab.c (print_precedence_warnings): Print both warnings together. * doc/bison.texi (Bison options): Document the warnings and provide an example. * tests/conflicts.at, tests/existing.at, tests/local.at, * tests/regression.at: Adapt the testsuite for the new category (-Wprecedence instead of -Wother where appropriate). 2013-01-30 Akim Demaille build: avoid clang's colored diagnostics in the test suite The syncline tests, which try to recognize compiler diagnostics, are confused by escapes for colors. * configure.ac (warn_tests): New, to factor the warnings for both C and C++ tests. Add -fno-color-diagnostics to it. * tests/local.at (AT_TEST_TABLES_AND_PARSE): Do not remove glue together compiler flags. 2013-01-30 Akim Demaille build: please Clang++ 3.2+ on Flex scanners Clang++, with -Wall, rejects code generated by Flex (for C scanners): CXX examples/calc++/examples_calc___calc__-calc++-scanner.o In file included from examples/calc++/calc++-scanner.cc:1: error: implicit conversion of NULL constant to 'bool' [-Werror,-Wnull-conversion] if ( ! ( (yy_buffer_stack) ? (yy_buffer_stack)[(yy_buffer_stack_top)] : __null) ) { ~ ^~~~~~ false * configure.ac (WARN_NO_NULL_CONVERSION_CXXFLAGS): Compute it. * examples/calc++/local.mk (examples_calc___calc___CXXFLAGS): Use it. 2013-01-30 Valentin Tolmer grammar: record used associativity and print useless ones Record which symbol associativity is used, and display useless ones. * src/symtab.h, src/symtab.c (register_assoc, print_assoc_warnings): New * src/symtab.c (init_assoc, is_assoc_used): New * src/main.c: Use print_assoc_warnings * src/conflicts.c: Use register_assoc * tests/conflicts.at (Useless associativity warning): New. Due to the new warning, many tests had to be updated. * tests/conflicts.at tests/existing.at tests/regression.at: Add the associativity warning in the expected results. * tests/java.at: Fix the java calculator's grammar to remove a useless associativity. * doc/bison.texi (mfcalc example): Fix associativity to remove warning. 2013-01-29 Valentin Tolmer grammar: warn about unused precedence for symbols Symbols with precedence but no associativity, and whose precedence is never used, can be declared with %token instead. The used precedence relationships are recorded and a warning about useless ones is issued. * src/conflicts.c (resolve_sr_conflict): Record precedence relation. * src/symtab.c, src/symtab.h (prec_nodes, init_prec_nodes) (symgraphlink_new, register_precedence_second_symbol) (print_precedence_warnings): New. Record relationships in a graph and warn about useless ones. * src/main.c (main): Print precedence warnings. * tests/conflicts.at: New. 2013-01-29 Theophile Ranquet variants: remove the 'built' assertions When using %define parse.assert, the variants come with additional variables that are useful for development purposes. One is a Boolean indicating if the variant is built (to make sure we don't read a non-built variant), and the other is a string describing the stored type. There is no need to have both of these, the string is enough. * data/variant.hh (built): Remove. 2013-01-29 Akim Demaille style: indentation fixes * src/parse-gram.y: here. 2013-01-29 Akim Demaille maint: be sure to neutralize out-of-tree paths from our parser * tests/bison.in: Adjust to support fixed versions of ylwrap. 2013-01-29 Theophile Ranquet m4: generate a basic_symbol constructor for each symbol type Recently, there was a slightly vicious bug hidden in the make_ functions: parser::symbol_type parser::make_TEXT (const ::std::string& v) { return symbol_type (token::TOK_TEXT, v); } The constructor for symbol_type doesn't take an ::std::string& as argument, but a constant variant. However, because there is a variant constructor which takes an ::std::string&, this caused the implicit construction of a built variant. Considering that the variant argument for the symbol_type constructor was cv-qualified, this temporary variant was never destroyed. As a temporary solution, the symbol was built in two stages: symbol_type res (token::TOK_TEXT); res.value.build< ::std::string&> (v); return res; However, the solution introduced in this patch contributes to letting the symbols handle themselves, by supplying them with constructors that take a non-variant value and build the symbol's own variant with that value. * data/variant.hh (b4_symbol_constructor_define_): Use the new constructors rather than building in a temporary symbol. (b4_basic_symbol_constructor_declare, b4_basic_symbol_constructor_define): New macros generating the constructors. * data/c++.m4 (basic_symbol): Invoke the macros here. 2013-01-29 Theophile Ranquet c++: minor stylistic changes * data/c++m4: Remove useless comment lines. * data/variant.hh (self_type): Use this typedef instead of variant. (b4_symbol_constructor_define_): Remove commented-out line, and stylistic change (avoid blank line). 2013-01-29 Akim Demaille c++: please G++ 4.8 with -O3: type puning issue * tests/c++.at (Exception safety): Now that this test covers variants, pass -fno-strict-aliasing to g++. 2013-01-29 Akim Demaille c++: please G++ 4.8 with -O3: array bounds * data/c++.m4, data/lalr1.cc (by_state, by_type): Do not use -1 to denote the absence of value, as GCC then fears that this -1 might be used to dereference arrays (such as yytname). Use 0, which corresponds to $accept, which is valueless (the needed property: the symbol destructor must not try to reclaim the memory associated with the symbol). 2013-01-29 Akim Demaille c++: use more explicit types than int * data/c++.m4 (b4_public_types_declare): Declare token_number_type soon. Introduce symbol_number_type (wider than token_number_type). Clarify the requirement that kind_type from by_state and by_type denote the _input_ type (required by the constructor), not the stored type. Use symbol_number_type and token_number_type where appropriate, instead of int. * data/lalr1.cc: Adjust to these changes. Propagate "symbol_number_type". Invoke "type_get ()" instead of read "type" directly. 2013-01-29 Akim Demaille c++: value_type -> kind_type * data/c++.m4, data/lalr1.cc (by_type, by_state): Rename 'value_type' as 'kind_type', as it is clearer. 2013-01-29 Akim Demaille c++: improve the signature of yysyntax_error_ * data/lalr1.cc: This function is const. It takes a symbol_number_type. 2013-01-29 Akim Demaille c++: style changes * data/lalr1.cc: Formatting changes. And name changes. 2013-01-28 Akim Demaille doxygen: upgrade Doxyfile, and complete it * doc/Doxyfile.in: Let doxygen upgrade it. (INCLUDE_PATH): Point to lib too. (PROJECT_BRIEF): New. (EXCLUDE): Update to reflect the current file hierarchy. 2013-01-28 Akim Demaille maint: fix syntax-check issues * cfg.mk: Ignore strcmp in local.at. * tests/conflicts.at: Use AT_PARSER_CHECK. * tests/regression.at: Preserve the exit status of the generated parsers. * tests/local.mk ($(TESTSUITE)): Map @tb@ to a tabulation. * tests/c++.at, tests/input.at, tests/regression.at: Use @tb@. * cfg.mk: (space-tab): There are no longer exceptions. 2013-01-28 Akim Demaille tests: please C90 compilers * tests/actions.at, tests/conflicts.at: Use /* ... */ comments. Let "main" return a value. 2013-01-28 Akim Demaille maint: update todo * TODO: Remove fixed items. 2013-01-28 Akim Demaille news: minor improvements * NEWS: Name some more contributors. Restructure slightly. 2013-01-28 Akim Demaille tests: please clang and use ".cc", not ".c", for C++ input When fed with foo.c, clang++ 3.2 answers: clang: error: treating 'c' input as 'c++' when in C++ mode, this behavior is deprecated * tests/output.at (AT_CHECK_OUTPUT_FILE_NAME): Use *.cc and *.hh for C++. 2013-01-28 Akim Demaille tests: formatting changes * tests/local.at: Restore proper indentation. 2013-01-28 Theophile Ranquet c++: better inline expansion Many 'inline' keywords were in the declarations. They rather belong in definitions, so move them. * data/c++.m4 (basic_symbol, by_type): Many inlines here. * data/lalr1.cc (yytranslate_, yy_destroy_, by_state, yypush_, yypop_): Inline these as well. (move): Move the definition outside the struct, where it belongs. 2013-01-28 Akim Demaille tests: check that using variants is exception safe * tests/local.at: (Slightly) improve the regexp by escaping '.' when it denotes a point. (AT_VARIANT_IF): New. * tests/c++.at (Exception Safety): Run it for variants too. 2013-01-28 Akim Demaille tests: remove useless %defines Many tests were using %defines because C++ skeletons used to require it. * tests/actions.at, tests/c++.at, tests/input.at, tests/regression.at: Remove useless %defines. 2013-01-28 Akim Demaille c++: remove now-useless operators Now that symbols behaves properly, we can eliminate special routines that are no longer needed. * data/c++.m4, data/glr.cc, data/lalr1.cc, data/variant.hh: Remove useless assignment operators and copy constructors. As a consequence, remove useless includes for "abort". 2013-01-28 Akim Demaille tests: enable support for --debug * tests/c++.at (Variants): Here. And remove useless clutter when api.token.constructor is enabled. 2013-01-28 Akim Demaille c++: revamp the support for variants The current approach was too adhoc: the symbols were not sufficiently self-contained, in particular wrt memory management. The "new" guideline is the one that should have been followed from the start: let the symbols handle themslves, instead of leaving their users to it. It was justified by the will to avoid gratuitious moves and copies, but the current approach does not seem to be slower, yet it will probably be simpler to adjust to support move semantics from C++11. The documentation says that the %parse-param are available from the %destructor. In retrospect, that was a silly design decision, which we can break for variants, as its a new feature. It should be phased out for non-variants too. * data/variant.hh: A variant never knows if it stores something or not, it is up to its users to store this information. Yet, in parse.assert mode, make sure the empty/filled variants are properly used. (b4_symbol_constructor_define_): Don't call directly the symbol constructor, to save a useless temporary. * data/stack.hh (push): Steal the pushed value instead of duplicating it. This will simplify the callers of push, who handled this "move" approach themselves. * data/c++.m4 (basic_symbol): Let -1, as kind, denote the fact that a symbol is empty. This is needed for instance when shifting the lookahead: yyla is given as argument to "push", and its value is then moved on the stack. But then yyla must be declared "empty" so that its destructor won't be called. (basic_symbol::move): New. Move the responsibility of calling the destructor from yy_destroy to ~basic_symbol in the case of variants. * data/lalr1.cc (stack_symbol_type): Now a derived class from its previous value, so that we can add a constructor from a symbol_type. (by_state): State -1 means empty. (yypush_): Factor, by calling one overload from the other one, and using the new semantics of stack::push. No longer reclaim by hand the memory from rhs symbols, since now that we store objects with proper destructors, they will be reclaimed automatically. Conversely, be sure to delete yylhs. * tests/c++.at (C++ Variant-based Symbols): New "unit" test for symbols. 2013-01-28 Akim Demaille c++: formatting and comment changes * data/c++.m4, data/lalr1.cc, data/stack.hh, data/variant.hh: Fix indentation. Fix some comments. 2013-01-27 Valentin Tolmer tests: add token declaration order test * tests/conflicts.at: New test. 2013-01-27 Akim Demaille regen 2013-01-27 Valentin Tolmer grammar: preserve token declaration order In a declaration %token A B, the token A is declared before B, but in %left A B (or with %precedence or %nonassoc or %right), the token B was declared before A (tokens were declared in reverse order). * src/symlist.h, src/symlist.c (symbol_list_append): New. * src/parse-gram.y: Use it instead of symbol_list_prepend. * tests/input.at: Adjust expectations. 2013-01-25 Akim Demaille tests: improve test group titles * tests/local.at (AT_SETUP_STRIP): AT_SETUP does not behave properly with new-lines in its argument. Remove them. Fix the handling of %define with quotes. 2013-01-25 Akim Demaille c: no longer require stdio.h when locations are enabled Recent changes (in 2.7) introduced a dependency on both FILE and fprintf, which are "available" only in %debug mode. This was to define yy_location_print_, which is used only in %debug mode by the parser, but massively used by the test suite to output the locations in yyerror. Break this dependency: the test suite should define its own routines to display the locations. Eventually Bison will provide the user with a means to display locations, but not yet. * data/c.m4 (b4_yy_location_print_define): Use YYFPRINTF instead of fprintf directly. * data/yacc.c (b4_yy_location_print_define): Invoke it only in %debug mode, so that stdio.h is included (needed for FILE*), and YYFPRINTF is defined. * tests/local.at (AT_YYERROR_DECLARE, AT_YYERROR_DEFINE): Declare and define location_print and LOCATION_PRINT. * tests/actions.at, tests/existing.at, tests/glr-regression.at, * tests/input.at, tests/named-refs.at, tests/regression.at: Adjust to use them. Fix the expected line numbers (as the prologue's length has changed). 2013-01-25 Akim Demaille c: minor simplification in the debug code * data/c.m4 (yy_symbol_print): Minor factoring. 2013-01-25 Akim Demaille c++: display locations as C does See commit 3804aa260b956dd012adde3894767254422a5fcf. * data/location.cc (operator<<): Display location exactly as is done in C skeletons. * tests/local.at (AT_LOC_PUSHDEF, AT_LOC_POPDEF): Also define AT_FIRST_LINE, AT_LAST_LINE, AT_FIRST_COLUMN, AT_LAST_COLUMN. * tests/actions.at (Location Print): Also check C++ skeletons. 2013-01-25 Akim Demaille tests: highlight empty right-hand sides * tests/actions.at, tests/c++.at, tests/headers.at, * tests/input.at: here. 2013-01-25 Akim Demaille news: prepare for 2.8 * NEWS: Restructure. Name contributors. 2013-01-21 Akim Demaille tests: generalize default main for api.namespace * tests/local.at (AT_NAME_PREFIX): Also match api.namespace. (AT_MAIN_DEFINE): Take it into account. * tests/c++.at, tests/headers.at: Use AT_NAME_PREFIX. (AT_CHECK_NAMESPACE): Rename as... (AT_TEST): this. 2013-01-21 Akim Demaille tests: improve factoring of the main function * tests/local.at (AT_MAIN_DEFINE): If %debug is used, check if -d/--debug is passed to the generated parser, and enable the traces. Return exactly the result of yyparse, so that we can check exit code 2 too. * tests/actions.at, tests/glr-regression.at, tests/regression.at: Use AT_MAIN_DEFINE, helping AT_BISON_OPTION_PUSHDEFS where needed, preferably to option -t. 2013-01-21 Akim Demaille tests: factor the definition of main With Théophile Ranquet. * tests/local.at (AT_MAIN_DEFINE): New. (AT_YYERROR_DEFINE): Improve formatting. * tests/actions.at, tests/c++.at, tests/conflicts.at, * tests/glr-regression.at, tests/input.at, tests/regression.at, * tests/skeletons.at, tests/torture.at: Adjust. * tests/c++.at: Add missing %skeleton for a PUSHDEFS, and a missing PUSH/POPDEFS for another test. 2013-01-21 Akim Demaille tests: minor refactoring * tests/named-refs.at: Use AT_FULL_COMPILE where applicable. 2013-01-21 Akim Demaille diagnostics: avoid useless caret stuttering * src/scan-code.l: When reporting a missing ending ';', don't display the guilty action twice. 2013-01-21 Theophile Ranquet examples: please clang * doc/bison.texi (calc++-scanner.ll): Don't output useless yyinput function. 2013-01-21 Theophile Ranquet tests: better silencing of unused argument warnings input.yy:35:44: error: unused parameter 'msg' [-Werror,-Wunused-parameter] void yy::parser::error (std::string const& msg) ^ * tests/c++.at (C++ GLR parser identifier shadowing): Don't name unused argument, use YYUSE instead of a direct cast to void. 2013-01-21 Theophile Ranquet bench: compatibility for Bison <= 2.7 There used to be a bug in some skeletons, which caused the expansion of 'yylval' and 'yylloc', generating these errors: input.cc:547:16: error: expected ',' or '...' before '(' token #define yylval (yystackp->yyval) ^ input.yy:29:39: note: in expansion of macro 'yylval' int yylex (yy::parser::semantic_type *yylval) ^ This bug is fixed by 'skel: better aliasing of identifiers', but a workaround is useful when benchmarking against older versions of Bison, which are still affected by the bug. * etc/bench.pl.in: Rename yylval to yylvalp and yylloc to yyllocp in base grammar 'list'. 2013-01-15 Theophile Ranquet c++: remove useless inlines * data/c++.m4 (basic_symbol): Keep 'inline' in the prototypes, but don't duplicate it in the implementation. * data/variant.hh (variant): 'inline' is not needed when the implementation is provided in the class definition. 2013-01-15 Theophile Ranquet c++: m4 stylistic change * data/c++.m4 (syntax_error): Fix the indentation of 'inline'. 2013-01-14 Theophile Ranquet c++: silence warnings * data/c++.m4 (basic_symbol::operator=): Unused parameter. * tests/c++.at (C++ GLR parser identifier shadowing): Here too. - 2013-01-14 Theophile Ranquet news: typos * NEWS: Fix a typo, use YYSTYPE rather than semantic_type. 2013-01-12 Akim Demaille regen 2013-01-12 Akim Demaille maint: update copyright years Suggested by Stefano Lattarini. Run "make update-copyright". 2013-01-12 Akim Demaille build: fix VPATH issue * Makefile.am (update-b4-copyright, update-package-copyright-year): Fix path to build-aux. 2013-01-11 Theophile Ranquet carets: document default activation * NEWS: Announce it. * doc/bison.texi: Adjust. 2013-01-11 Theophile Ranquet carets: show them in more tests * tests/input.at, tests/named-refs.at: Here. 2013-01-11 Theophile Ranquet carets: activate by default * src/getargs.c (feature_flag): Here. * tests/local.at (AT_BISON_CHECK_, AT_BISON_CHECK_NO_XML): Deactivate carets for the testsuite, by default. * tests/input.at: Adjust the locations for command line definitions. 2013-01-11 Theophile Ranquet variants: document move and swap * data/variant.hh (swap): Doc. (build): Rename as... (move): This, more coherent naming with clearer meaning. * data/c++.m4 (move): Adjust. 2013-01-11 Theophile Ranquet c++: privatize variant blind copies * data/variant.hh (variant, operator=): Make private. * data/c++.m4 (operator=): New, to avoid needing a definition of that operator for each class member (such as a possible variant). * data/glr.cc, data/lalr.cc: Add the necessary include for the abort. 2013-01-11 Akim Demaille glr.c: fix an unused argument issue * data/glr.c (yyuserAction): "Use" yyrhslen, as in variant mode, we might not use it. 2013-01-11 Akim Demaille glr.c: style changes * data/glr.c (yyuserAction): Use a size_t for sizes. 2013-01-11 Akim Demaille c.m4: style fix * data/c.m4 (b4_parse_param_use): Add missing space before paren. 2013-01-11 Theophile Ranquet skel: better aliasing of identifiers * data/glr.c, data/yacc.c: Avoid emitting useless defines. * data/glr.cc: Restore prefixes for epilogue. 2013-01-11 Theophile Ranquet glr.cc: fatal if using api.token.ctor without variants * data/glr.cc: Here. 2013-01-11 Theophile Ranquet skel: correctly indent switch cases * data/bison.m4 (b4_type_action_): Here. 2013-01-11 Theophile Ranquet variants: assert changes * data/variant.hh (swap): More asserts can't hurt. Don't perform useless swaps. (build): Deactivate problematic asserts, pending further investigation. (variant): Prohibit copy construction. 2013-01-11 Theophile Ranquet lalr1.cc: use a vector for the symbol stack * data/lalr1.cc: Adjust includes. * data/stack.hh (push, pop): Use push_back and pop_back. (operator []): Access vector from the end. 2013-01-11 Theophile Ranquet lalr1.cc: change symbols implementation A "symbol" groups together the symbol type (INT, PLUS, etc.), its possible semantic value, and its optional location. The type is needed to access the value, as it is stored as a variant/union. There are two kinds of symbols. "symbol_type" are "external symbols": they have type, value and location, and are returned by yylex. "stack_symbol_type" are "internal symbols", they group state number, value and location, and are stored in the parser stack. The type of the symbol is computed from the state number. The class template symbol_base_type factors the code common to stack_symbol_type and symbol_type. It uses the Curiously Recurring Template pattern so that we can always (static_) downcast to the exact type. symbol_base_type features value and location, and delegates the handling of the type to its parameter. When trying to generalize the support for variant, a significant issue was revealed: because stack_symbol_type and symbol_type _derive_ from symbol_base_type, the type/state member is defined _after_ the value and location. In C++ the order of the definition of the members defines the order in which they are initialized, things go backward: the value is initialized _before_ the type. This is wrong, since the type is needed to access the value. Therefore, we need another means to factor the common code, one that ensures the order of the members. The idea is simple: define two (base) classes that code the symbol type ("by_type" codes it by its type, and "by_state" by the state number). Define basic_symbol as the class template that provides value and location support. Make it _derive_ from its parameter, by_type or by_state. Then define stack_symbol_type and symbol_type as basic_symbol, basic_symbol. The name basic_symbol was chosen by similarity with basic_string and basic_ostream. * data/c++.m4 (symbol_base_type): Remove, replace by... (basic_symbol): which derives from its parameter, one of... (by_state, by_type): which provide means to retrieve the actual type of symbol. (symbol_type): Is now basic_symbol. (stack_symbol_type): Is now basic_symbol. * data/lalr1.cc: Many adjustments. 2013-01-11 Theophile Ranquet bench: add %b directive to use a specific Bison For example, $ bench.pl -v '%s lalr1.cc & %d variant & ( %b ~/old-bison/bin/bison | %b ~/new-bison/bin/bison )' -g list -i 10000 * etc/bench.pl.in: Here. 2013-01-09 Akim Demaille regen 2013-01-04 Akim Demaille gnulib: update 2012-12-31 Akim Demaille doc: use deffn to declare the list of %define variables * doc/bison.texi (%define Summary): Use @deffn instead of @table, it spares a lot of width, especially in PDF, and looks nicer in the other formats too. It is also more consistent with the rest of the document. 2012-12-31 Akim Demaille doc: minor completion and fixes * doc/bison.texi (%define Summary): Provide more history to some variables. 2012-12-31 Akim Demaille java: stype is obsoleted by api.value.type This is consistent with the other %define variable names. * data/java.m4: Use api.value.type instead of stype. * doc/bison.texi, NEWS: Document that change. * src/muscle-tab.c (muscle_percent_variable_update): Provide backward compatibility. * tests/java.at: Adjust. 2012-12-31 Akim Demaille doc: fix html build * doc/local.mk (bison.html): Fix dependencies. 2012-12-31 Akim Demaille todo: remove erroneous task * tests/input.at: Check that there are no warnings about stray $ and @ in the epilogue. * TODO: Remove the correponding task. 2012-12-31 Akim Demaille gnulib: update 2012-12-28 Akim Demaille regen 2012-12-28 Akim Demaille syncline: one line is enough So far we were issuing two lines for each syncline change: /* Line 356 of yacc.c */ #line 1 "src/parse-gram.y" This is a lot of clutter, especially when reading diffs, as these lines change often. Fuse them into a single, shorter, line: #line 1 "src/parse-gram.y" /* yacc.c:356 */ * data/bison.m4 (b4_syncline): Issue a single line. Comment improvements. (b4_sync_start, b4_sync_end): Issue a shorter comment. * data/c++.m4 (b4_semantic_type_declare): b4_user_code must be on its own line as it might start with a "#line" directive. 2012-12-28 Akim Demaille regen 2012-12-28 Akim Demaille maint: restore ANSI 89 compliance * data/bison.m4, src/conflicts.c, src/files.c, src/output.c, * src/symtab.c: Use /* ... */ comments only. Declare variables before statements. 2012-12-28 Akim Demaille graph: minor simplification * src/gram.c (print_lhs): Use %*s to indent. * src/print_graph.c (print_lhs): Use obstack_printf. Became simple enough to be inlined in... (print_core): here. Use a "rule*" instead of an index in "rules[]". 2012-12-28 Akim Demaille closure, gram: add missing const * src/closure.h, src/closure.c, src/gram.h, src/gram.c: Add some missing const where appropriate. 2012-12-27 Theophile Ranquet carets: properly display when no line feed is present * src/location.c (location_caret): finish the line with one whether or not it is present in input. Rewrite code without getline. (cleanup_caret): Reset the caret_info global. * bootstrap.conf: No longer require getline. 2012-12-27 Theophile Ranquet scanner: reintroduce unput for missing end tokens Unput was no longer used since a POSIX-compatiblity issue with Flex 2.5.31, which has been adressed in newer versions of Flex. See this discussion: This partially reverts commit aa4180418fff518198e1b0f2c43fec6432210dc7. * src/scan-gram.l (unexpected_end): Here. * tests/input.at: Adjust for new order of error reports. 2012-12-27 Akim Demaille tables: scope reduction * src/tables.c (default_goto): Make it easier to understand. 2012-12-27 Akim Demaille regen 2012-12-27 Akim Demaille skeletons: fix comments The commit 38de4e570fdc7c8db9633c3b2054e565d8c1c6b9 underquoted the content of the comments, which resulted in losing square brackets in the comments. Besides, some other invocations were underquoting the effective arguments. * data/c.m4 (b4_comment_): Properly quote the comment. (b4_comment_, b4_comment): Move to... * data/c-like.m4: here, so that... * data/java.m4: can use it instead of its own copy. * data/bison.m4 (b4_integral_parser_tables_map): Fix some comments. * data/lalr1.cc, data/lalr1.java, data/yacc.c: Comment fixes. * data/lalr1.cc: Reorder a bit to factor some CPP directives. 2012-12-27 Akim Demaille maint: which -> whose Apparently, I was confusing both. * data/bison.m4, data/c.m4, data/glr.c, data/lalr1.cc, data/yacc.c: Use "whose" where appropriate. 2012-12-26 Akim Demaille tables: scope reduction * src/tables.c (matching_state): here. 2012-12-26 Akim Demaille tables: scope reduction * src/tables.c (token_actions): here. 2012-12-26 Akim Demaille tables: scope reduction * src/tables.c (save_row): here. 2012-12-26 Akim Demaille tables: scope reduction * src/tables.c (save_column, pack_vector): Reduce the scope to emphasize the structure of the code. Rename the returned value "res" to make understanding easier. 2012-12-26 Akim Demaille tables: use size_t where appropriate These changes aim at making the code easier to understand. * src/tables.c (tally): This is a size, always >= 0, so make it a size_t. 2012-12-26 Akim Demaille tables: style changes * src/tables.c: Prefer < to >. Fix/complete some comments. Remove useless parens. 2012-12-26 Akim Demaille skeletons: no longer call yylex via a CPP macro The YYLEX existed only to support YYLEX_PARAM, which is now removed. This macro was a nuisance, since incorrect yylex calls where pointed the macro _use_, instead of its definition. * data/c.m4 (b4_lex_formals, b4_lex): New. * data/glr.c, data/yacc.c: Use it. * data/lalr1.cc (b4_lex): New. Use it. squash! skeletons: no longer call yylex via a CPP macro 2012-12-26 Akim Demaille YYLEX_PARAM: drop support * data/yacc.c, doc/bison.texi: Remove YYLEX_PARAM support. * NEWS: Document it. 2012-12-26 Akim Demaille examples: minor improvements * examples/variant.yy: Don't use debug_stream(), obsoleted. Use <*>. 2012-12-26 Akim Demaille skeletons: factor comments about symbols * data/variant.hh (b4_char_sizeof_): Rename as... * data/bison.m4 (b4_symbol_tag_comment): this. Provide more documentation about b4_symbol_*. 2012-12-26 Akim Demaille c: improve the definition of public types * data/c.m4 (b4_token_enum): Improve comments. (b4_value_type_define, b4_location_type_define): New, extracted from... (b4_declare_yylstype): here. Separate the typedefs from the union/struct definitions. 2012-12-26 Akim Demaille doc: update variant usage * doc/bison.texi, examples/variant.yy: Use "%define api.value.type variant", instead of "%define variant". 2012-12-26 Akim Demaille tests: check the "%define variant" is deprecated. * tests/input.at: Rename some AT_SETUP to avoid that AT_SETUP_STRIP thinks they contain %define directives. ("%define" backward compatibility): Merge tests together to speed up the test suite, and to make maintenance easier (multiple AT_CHECK means multiple runs of the test suite to be sure to have updated all the error messages). Check the "%define variant" is properly obsoleted. 2012-12-23 Akim Demaille %define variables: support value changes in deprecation * src/muscle-tab.c (define_directive): Be robust to "assignment" containing '='. (muscle_percent_variable_update): Upgrade "variant" to "api.value.type". Support such upgrade patterns. Adjust callers. * data/bison.m4: Use api.value.type for variants. * tests/c++.at: Adjust tests. 2012-12-23 Akim Demaille diagnostics: treat obsolete %define variable names as obsolete directives Instead of warning: deprecated %define variable name: 'namespace', use 'api.namespace' [-Wdeprecated] display (in -fno-caret mode): warning: deprecated directive: '%define namespace foo', use '%define api.namespace foo' [-Wdeprecated] and (in -fcaret mode): warning: deprecated directive, use '%define api.namespace toto' [-Wdeprecated] %define namespace toto ^^^^^^^^^ This is in preparation of cases where not only the variable is renamed, but the values are too: warning: deprecated directive: '%define variant', use '%define api.value.type variant' [-Wdeprecated] * src/muscle-tab.c (define_directive): New. (muscle_percent_variable_update): Take the value as argument, and use it in the diagnostics. Loop with a pointer instead of an index. * tests/input.at (%define backward compatibility): Adjust. 2012-12-23 Akim Demaille diagnostics: factor the deprecated directive message * src/complain.h, src/complain.c (deprecated_directive): New. * src/muscle-tab.c: Use it. 2012-12-23 Akim Demaille variant: produce stable results Improve the output by ensuring a well defined order for type switches. * src/uniqstr.h: Style changes for macro arguments. (UNIQSTR_CMP): Replace by... (uniqstr_cmp): this. * src/uniqstr.c (uniqstr_cmp): New. Produce well defined results. * src/output.c: Use it. 2012-12-23 Akim Demaille uniqstr: formatting changes * src/uniqstr.h: Sort functions by object type. 2012-12-23 Akim Demaille skeletons: fix an error message * data/bison.m4 (b4_flag_if): Display the invalid value. 2012-12-23 Akim Demaille tests: improve titles * tests/local.at (AT_SETUP_STRIP): New. (AT_SETUP): Use it to shorten the test titles: remove %defines, %language and %skeleton whose arguments suffice. * tests/synclines.at: Use more precise AT_SETUP. 2012-12-23 Akim Demaille c++: comment changes * data/c++.m4, data/glr.cc, data/lalr1.cc: Convert some /* ... */ comments to //. 2012-12-23 Akim Demaille c++: use // comments in the output This is mostly used for the license header, the synclines, and the generated tables: - /* STOS_[STATE-NUM] -- The (internal number of the) accessing - symbol of state STATE-NUM. */ + // STOS_[STATE-NUM] -- The (internal number of the) accessing + // symbol of state STATE-NUM. static const unsigned char yystos_[]; * data/c.m4: Comment changes. (b4_comment_): Expand the text argument. Before this change, we were actually formatting M4 code as a C comment, and then expand it. (b4_comment): Fix the closing of comments: there is no reason to add the (line) prefix before the closing "*/". * data/c++.m4 (b4_comment): New. 2012-12-21 Akim Demaille maint: disable sc_prohibit_test_backticks * cfg.mk: here. And fix typos. Reported by Stefano Lattarini. 2012-12-21 Akim Demaille maint: more syntax-checks * cfg.mk (sc_prohibit_tab_based_indentation, sc_prohibit_test_backticks) (sc_preprocessor_indentation, sc_space_before_open_paren): New, stolen from Coreutils (2e9f5ca4ebbbdb6a9fa2dd3d5add3f7720a172d7). 2012-12-21 Akim Demaille debug: no longer generate tabs * src/closure.c, src/derives.c, src/nullable.c, tests/sets.at: Use spaces. 2012-12-21 Akim Demaille style changes: run cppi Run it in src/ for a start. * src/AnnotationList.h, src/InadequacyList.h, src/Sbitset.h, * src/closure.c, src/complain.h, src/flex-scanner.h, src/getargs.h, * src/gram.h, src/graphviz.h, src/ielr.h, src/location.h, * src/muscle-tab.h, src/named-ref.h, src/relation.h, src/scan-code.h, * src/state.h, src/symtab.h, src/system.h, src/uniqstr.h: Reindent preprocessor directives. 2012-12-21 Akim Demaille style changes: untabify * data/xslt/xml2dot.xsl, data/xslt/xml2text.xsl, m4/flex.m4, * tests/glr-regression.at, tests/torture.at: here. 2012-12-21 Akim Demaille tests: be robust to set -e. * examples/test (run): here. 2012-12-19 Akim Demaille variants: prohibit simple copies The "variant" structure provides a means to store, in a typeless way, C++ objects. Manipulating it without provide the type of the stored content is doomed to failure. So provide a means to copy in a type safe way, and prohibit typeless assignments. * data/c++.m4 (symbol_type::move): New. * data/lalr1.cc: Use it. * data/variant.hh (b4_variant_define): Provide variant::copy. Let variant::operator= abort. We cannot undefine it, yet, as it is still uses by the implicit assigment in symbols, which must also be disabled. 2012-12-19 Akim Demaille variant: more assertions Equip variants with more checking code. Provide a means to request includes. * data/variant.hh (b4_variant_includes): New. * data/lalr1.cc: Use it. * data/variant.hh (variant::built): Define at the end, as a private member. (variant::tname): New. Somewhat makes "built" useless, but let's keep both for a start, in case using "typeinfo" is considered unacceptable in some environments. Fix some formatting issues. 2012-12-19 Akim Demaille gnulib: update 2012-12-19 Akim Demaille skeletons: fix output directives * data/lalr1.cc, data/location.cc, data/glr.cc: Use b4_output_begin. Broken during a merge. 2012-12-19 Akim Demaille yacc.c: style changes * data/yacc.c (b4_lex_param): Provide arguments with a name. 2012-12-19 Akim Demaille glr.cc: simplifying the handling of parse/lex params The fact that glr.cc uses glr.c makes the handling of parse params more complex, as the parser object of glr.cc must be passed to the parse function of glr.c. Yet not all the functions need access to the parser object. * data/glr.cc (b4_parse_param_wrap): New. Use them. 2012-12-19 Akim Demaille glr: rename lex params * data/glr.c (b4_lex_param): Rename as... (b4_lex_formals): this, for consistency. Provide arguments a name. (LEX): Adjust. 2012-12-19 Akim Demaille glr.c: move function declaration earlier * data/glr.c (yypstack, yypdumpstack): Declare earlier, to make it easier to call them from other functions. 2012-12-19 Akim Demaille %define variables: backward compatibility * src/muscle-tab.c (muscle_percent_variable_update): Accept lex_symbol. Reported by Roland Levillain. 2012-12-16 Akim Demaille diagnostics: improve -fcaret for list of accepted values Instead of input.y:1.9-21: error: invalid value for %define variable 'api.push-pull': 'neither' %define api.push_pull "neither" ^^^^^^^^^^^^^ input.y:1.9-21: accepted value: 'pull' %define api.push_pull "neither" ^^^^^^^^^^^^^ input.y:1.9-21: accepted value: 'push' %define api.push_pull "neither" ^^^^^^^^^^^^^ input.y:1.9-21: accepted value: 'both' %define api.push_pull "neither" ^^^^^^^^^^^^^ report input.y:1.9-21: error: invalid value for %define variable 'api.push-pull': 'neither' %define api.push_pull "neither" ^^^^^^^^^^^^^ input.y:1.9-21: accepted value: 'pull' input.y:1.9-21: accepted value: 'push' input.y:1.9-21: accepted value: 'both' * src/complain.h (no_caret): New. * src/complain.c (error_message): Use it. * src/muscle-tab.c (muscle_percent_define_check_values): Use it. * src/scan-skel.l (flag): Ditto. * tests/input.at: Adjust and check. 2012-12-16 Akim Demaille skeletons: simplify the handling of default api.location.type * data/bison.m4 (b4_bison_locations_if): New. * data/glr.cc, data/lalr1.cc: Use it. 2012-12-16 Akim Demaille tests: address syntax-check failures * cfg.mk: Ignore failures in timevar (uses GCC style configuration, not gnulib's). * doc/local.mk: Space changes. * lib/main.c, tests/calc.at: Remove useless HAVE_ tests. 2012-12-15 Akim Demaille remove duplicate definitions * src/system.h: here, inherited from a merge. 2012-12-15 Akim Demaille tests: style changes * tests/glr-regression.at: Issue yyerror before yylex. 2012-12-15 Akim Demaille doc: fix dependencies * doc/local.mk: here. 2012-12-14 Akim Demaille doc: style fixes * doc/bison.texi: Add a couple of missing @var and @code. 2012-12-14 Theophile Ranquet doc: fix build dependencies Suggested by Nick Bowler * doc/local.mk: Avoid overwriting Automake's rules. 2012-12-14 Akim Demaille Merge branch 'origin/maint' * origin/maint: maint: credit Wojciech Polak maint: post-release administrivia version 2.7 yacc.c: scope reduction tests: C90 compliance fix C90 compliance glr.c: scope reduction gnulib: update 2012-12-14 Theophile Ranquet symtab: add missing initializations * src/symtab.c (semantic_type_new): Here. 2012-12-14 Theophile Ranquet symtab: fix some leaks * src/symlist.c (symbol_list_free): Deep free it. * src/symtab.c (symbols_free, semantic_types_sorted): Free it too. (symbols_do, sorted): Call by address. 2012-12-14 Theophile Ranquet tests: remove use of PARSE_PARAM * tests/header.at: Here. 2012-12-13 Akim Demaille maint: credit Wojciech Polak * NEWS, THANKS: He is the author of XML support (including XSLTs). 2012-12-12 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2012-12-12 Akim Demaille version 2.7 * NEWS: Record release date. 2012-12-12 Akim Demaille yacc.c: scope reduction * data/yacc.c (yysyntax_error): here. 2012-12-12 Akim Demaille tests: C90 compliance * tests/synclines.at: here. 2012-12-12 Akim Demaille fix C90 compliance * data/glr.c, src/graphviz.h, src/ielr.c, src/scan-gram.l, * src/system.h, tests/actions.at, tests/glr-regression.at: Do not use // comments. Do not introduce variables after statements. Provide "main" with a return value. 2012-12-12 Akim Demaille glr.c: scope reduction * data/glr.c (yyreportSyntaxError): Reduce the scope of yysize1 (now yysz). 2012-12-12 Akim Demaille gnulib: update 2012-12-10 Theophile Ranquet Merge remote-tracking branch 'origin/maint' * origin/maint: news: prepare for forthcoming release doc: explain how mid-rule actions are translated error: use better locations for unused midrule values doc: various minor improvements and fixes tests: ignore more useless compiler warnings tests: be robust to C being compiled with a C++11 compiler build: beware of Clang++ not supporting POSIXLY_CORRECT maint: post-release administrivia version 2.6.90 build: fix syntax-check error. cpp: simplify the Flex version checking macro news: improve the carets example and fix a typo cpp: improve the Flex version checking macro carets: improve the code maint: update news build: keep -Wmissing-declarations and -Wmissing-prototypes for modern GCCs build: drop -Wcast-qual gnulib: update 2012-12-09 Akim Demaille news: prepare for forthcoming release * NEWS: Fill paragraph. Reorder. Update examples. Remove line for 2.6.90. 2012-12-09 Akim Demaille doc: explain how mid-rule actions are translated * doc/bison.texi (Actions in Mid-Rule): Mention and use named references. Split into three subsections, among which... (Mid-Rule Action Translation): this new section. 2012-12-09 Akim Demaille error: use better locations for unused midrule values On %% exp: {;} {$$;} { $$ = $1; } instead of reporting (with -fcaret -Wmidrule-value) midrule.y:2.6-8: warning: unset value: $$ [-Wmidrule-values] exp: {;} {$$;} { $$ = $1; } ^^^ midrule.y:2.6-27: warning: unused value: $2 [-Wmidrule-values] exp: {;} {$$;} { $$ = $1; } ^^^^^^^^^^^^^^^^^^^^^^ report midrule.y:2.6-8: warning: unset value: $$ exp: {;} {$$;} { $$ = $1; } ^^^ midrule.y:2.10-14: warning: unused value: $2 exp: {;} {$$;} { $$ = $1; } ^^^^^ * src/reader.c (grammar_rule_check): When warning about the value of a midrule action, use the location of the midrule action instead of the location of the rule. the location of the part of the rule. * tests/actions.at (Default %printer and %destructor for mid-rule values): Adjust expectations * tests/input.at (Unused values with default %destructor): Ditto. (AT_CHECK_UNUSED_VALUES): Ditto. And use -fcaret. 2012-12-09 Akim Demaille doc: various minor improvements and fixes * doc/figs/example.dot, doc/figs/example.y: New. * doc/bison.texi: Prefer "token" to TOKEN. Use @group where appropriate. Adjust with style changes in the output (State 0, not state 0). Fix some @ref that were missing the third argument. Fix some incorrect line numbers. Use "nonterminal", not "non-terminal". Fix overfull and underfull TeX hboxes. Put the comments in the index. Remove duplicate index entries. Fuse glossary entries where appropriate. (Understanding): Improve the continuity between sections. Use example.dot to show the whole graph. * doc/Makefile.am: Adjust. 2012-12-09 Akim Demaille tests: ignore more useless compiler warnings * tests/synclines.at (AT_SYNCLINES_COMPILE): Ignore complains about using c++ to compile C. 2012-12-09 Akim Demaille tests: be robust to C being compiled with a C++11 compiler * tests/glr-regression.at: Use YY_NULL instead of NULL. Comment changes. 2012-12-09 Akim Demaille build: beware of Clang++ not supporting POSIXLY_CORRECT * m4/c-working.m4 (BISON_LANG_COMPILER_POSIXLY_CORRECT): New. (BISON_C_COMPILER_POSIXLY_CORRECT): Use it. For consistency with C++, also define BISON_C_WORKS. * m4/cxx.m4 (BISON_CXX_COMPILER_POSIXLY_CORRECT): New. * configure.ac: Use it. * tests/atlocal.in: Get its result. Propagate properly CXX values when used to compile C. When POSIXLY_CORRECT, adjust BISON_C_WORKS and BISON_CXX_WORKS. * tests/local.at (AT_COMPILE): Use BISON_C_WORKS. 2012-12-07 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2012-12-07 Akim Demaille version 2.6.90 * NEWS: Record release date. 2012-12-07 Akim Demaille build: fix syntax-check error. * cfg.mk: Exclude names-refs, it includes a "double" if (end of first line, first of second line below). test.y:43.12-44.59: symbol not found in production: if if-stmt-a: IF expr[cond] THEN stmt.list[then] ELSE stmt.list[else] FI ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ 2012-12-07 Theophile Ranquet cpp: simplify the Flex version checking macro * src/flex-scanner,h (FLEX_VERSION): Consider YY_FLEX_SUBMINOR_VERSION defined. 2012-12-07 Theophile Ranquet news: improve the carets example and fix a typo * NEWS: Here. 2012-12-07 Theophile Ranquet cpp: improve the Flex version checking macro * src/flex-scanner.h (FLEX_VERSION): Here. 2012-12-07 Theophile Ranquet carets: improve the code * src/location.c: Remove duplicate documentations. (caret_info): Stylistic change. (location_caret): Many reworks. 2012-12-07 Akim Demaille maint: update news * NEWS: There is no 2.6.6, remove its stub. 2012-12-07 Akim Demaille build: keep -Wmissing-declarations and -Wmissing-prototypes for modern GCCs Fixes a -Werror failure of xalloc.h used in src. From Eric Blake. http://lists.gnu.org/archive/html/bug-gnulib/2012-12/msg00006.html * configure.ac: Check whether GCC pragma diagnostic push/pop works. Enable these warnings for bison if it does. Enable these warnings for the test suite anyway. 2012-12-07 Akim Demaille build: drop -Wcast-qual Suggested by Jim Meyering. http://lists.gnu.org/archive/html/bug-gnulib/2012-12/msg00017.html * configure.ac (warn_common): Remove -Wcast-qual. 2012-12-07 Akim Demaille gnulib: update 2012-12-06 Theophile Ranquet Merge remote-tracking branch 'origin/maint' * origin/maint: misc: pacify the Tiny C Compiler cpp: make the check of Flex version portable misc: require getline c++: support wide strings for file names doc: document carets tests: enhance existing tests with carets errors: show carets getargs: add support for --flags/-f 2012-12-06 Theophile Ranquet misc: pacify the Tiny C Compiler * src/graphviz.c (conclude_red): Remove a useless return. 2012-12-05 Theophile Ranquet cpp: make the check of Flex version portable This was problematic with tcc 0.9.25 * src/flex-scanner.h (FLEX_VERSION_GT): Rewrite and rename as... (FLEX_VERSION): This. 2012-12-05 Theophile Ranquet misc: require getline * bootstrap.conf: Here, used by src/location.c. * src/getargs.c (long_options): Rename --flags to --feature. 2012-12-05 Akim Demaille c++: support wide strings for file names Reported by Mark Boyall. http://lists.gnu.org/archive/html/help-bison/2011-08/msg00002.html * data/location.cc (operator<<): Be templated on the type of output stream. * tests/headers.at (Several parsers): Adjust. 2012-12-05 Theophile Ranquet doc: document carets * NEWS: Announce it. * doc/bison.texi (Bison Options): Here. 2012-12-05 Theophile Ranquet tests: enhance existing tests with carets * tests/actions.at: Unset value. * tests/conflicts.at: Rule useless due to conflicts. * tests/input.at: Missing terminator, unexpected end of file, command line redefinition of variable. * tests/named-refs.at: Many errors. * tests/reduce.at: Useless nonterminals and rules. * tests/regression.at: Large token. 2012-12-05 Theophile Ranquet errors: show carets * src/locations.c (caret_info): New, persistant information useful for... (location_caret): New, print a caret. (cleanup_caret): Release caret_info cleanly, call it... * src/main.c (main): Here. * src/complain.c (error_message): Call location_caret here. 2012-12-05 Theophile Ranquet getargs: add support for --feature/-f Introduce -fdiagnostics-show-caret * src/getargs.c (feature_flag): New global. * src/getargs.h (feature): New enum. 2012-12-05 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: getargs: don't label --language/-l as experimental getargs: fix the locations of command-line input errors: indent missing action code semicolon warning 2012-12-04 Theophile Ranquet getargs: don't label --language/-l as experimental * NEWS: Announce it. * doc/bison.texi, src/getargs.c (usage): Here. 2012-12-03 Akim Demaille tests: minor improvements * tests/calc.at (AT_CHECK_SPACES): To speed up, accept several files at once, and factor some calls. 2012-12-03 Theophile Ranquet getargs: fix the locations of command-line input * src/getargs.c (command_line_location): Here. * tests/input.at: Adjust. 2012-12-03 Theophile Ranquet errors: indent missing action code semicolon warning Also, remove a duplicate #define. * src/scan-code.l (SC_RULE_ACTION): Here. * tests/actions.at: Adjust. 2012-12-03 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: parser: accept #line NUM m4: use a safer pattern to enable/disable output tests: beware of gnulib's need for config.h gnulib: update yacc.c, glr.c: check and fix the display of locations formatting changes glr.c: remove stray macro 2012-12-03 Akim Demaille parser: accept #line NUM * src/scan-gram.l (scanner): Accept '#line NUM'. (handle_syncline): Adjust to the possible missing file name. 2012-12-03 Akim Demaille m4: use a safer pattern to enable/disable output Work on some other areas of Bison revealed that some macros expanded to be expanded only once were actually expanded several times. This was due to the fact that changecom was not properly restored each time, and macro names appearing in comments were then expanded. Introduce begin/end macros which are easier to match that changecom()/changecom(#). * data/bison.m4 (b4_output_begin, b4_output_end): New. * data/glr.c, data/glr.cc, data/lalr1.cc, data/lalr1.java, * data/location.cc, data/stack.hh, data/yacc.c: Use them. 2012-12-03 Akim Demaille tests: beware of gnulib's need for config.h * tests/skeletons.at, tests/torture.at: Be sure to include config.h where appropriate. 2012-11-30 Akim Demaille gnulib: update * lib/yyerror.c: Include config.h since the following stdio.h might be from gnulib. 2012-11-30 Akim Demaille yacc.c, glr.c: check and fix the display of locations In some case, negative column number could be displayed. Make YY_LOCATION_PRINT similar to bison's own implementation of locations. Since the macro is getting fat, make it a static function. Reported by Jonathan Fabrizio. * data/c.m4 (yy_location_print_define): Improve the implementation, and generate the yy_location_print_ function. Adjust YY_LOCATION_PRINT. * tests/actions.at (Location Print): New tests. 2012-11-30 Akim Demaille formatting changes * data/c.m4: Fix comments, put macros in a more natural order. Space changes (from M-x whitespace-cleanup). * src/location.c: Fix spaces. * tests/actions.at: Space changes. 2012-11-30 Akim Demaille glr.c: remove stray macro * data/glr.c (YYOPTIONAL_LOC): Remove, unused since commit 769a8ef9bcb5e14d0be9d0869f5dca20ab093930. 2012-11-29 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: doc: minor fixes doc: improve the index doc: introduce api.pure full, rearrange some examples yacc.c: support "%define api.pure full" local.at: improvements 2012-11-29 Akim Demaille doc: minor fixes * doc/bison.texi: Use stderr for error messages. Meta-variables are usually spelled in lower case. Use @code for function names. 2012-11-29 Akim Demaille doc: improve the index * doc/bison.texi: Fix uses of "deffn" so that the arguments of the directives do not show in the index. Remove a duplicate entry for api.pure. 2012-11-29 Theophile Ranquet doc: introduce api.pure full, rearrange some examples * NEWS: Add entry. * doc/bison.texi (%define Summary): Show the old Yacc behaviour. (Parser Function): Move parse-param examples here. (Pure Calling): Remove parse-param examples. (Error Reporting): Don't show the old behavior, stick to 'full'. 2012-11-29 Theophile Ranquet yacc.c: support "%define api.pure full" This makes the interface for yyerror() pure without the need for a spurious parse_param. * data/yacc.c (b4_pure_if, b4_pure_flag): New definition, accept three states. (b4_yacc_pure_if): Rename as... (b4_yyerror_arg_loc_if): This, and use b4_pure_flag. * tests/actions.at (%define api.pure): Modernize. * test/calc.at (Simple LALR Calculator): Modernize. * tests/local.at (AT_YYERROR_ARG_LOC_IF): Adjust. 2012-11-28 Akim Demaille tests: check variants without locations * tests/c++.at (Variants): Support non-use of locations, and check its support. 2012-11-26 Theophile Ranquet local.at: improvements * tests/local.at (AT_YYERROR_FORMALS): Make llocp const. (AT_PURE_AND_LOC_IF, AT_GLR_OR_PARAM_IF): Remove, expand... (AT_YYERROR_ARG_LOC_IF): Here, and use m4_join for readability. 2012-11-26 Akim Demaille tests: use -fno-strict-aliasing with variants Reported by Théophile Ranquet. * configure.ac (NO_STRICT_ALIAS_CXXFLAGS): New. * tests/c++.at, tests/atlocal.in, examples/local.mk: Use it. 2012-11-26 Akim Demaille tests: remove leftover * tests/atlocal.in: Remove duplicate handling of --compile-c-with-cxx. 2012-11-26 Akim Demaille doc: use %precedence instead of nonassoc when associativity is not wanted * doc/bison.texi: here. Formatting changes in some grammars. Fix a %prec into %precedence. 2012-11-26 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: yacc.c: always initialize yylloc scanner: issue a single error for groups of invalid characters tests: formatting changes doc: one of the fixes for an ambiguous grammar was ambiguous too doc: fix the dangling else with precedence directives doc: prefer "token" to TOKEN doc: formatting changes scanner: use explicit "ignore" statements 2012-11-26 Akim Demaille Merge remote-tracking branch 'origin/branch-2.6' into maint * origin/branch-2.6: yacc.c: always initialize yylloc doc: one of the fixes for an ambiguous grammar was ambiguous too doc: fix the dangling else with precedence directives doc: prefer "token" to TOKEN doc: formatting changes 2012-11-23 Theophile Ranquet yacc.c: always initialize yylloc The initial location might be used if the parser starts by an empty reduction, so really ensure proper initialization of the initial location. The previous approach fails for PostgreSQL, which uses Reported by Peter Eisentraut. http://lists.gnu.org/archive/html/bug-bison/2012-11/msg00023.html With help from Théophile Ranquet. * data/yacc.c (b4_declare_scanner_communication_variables): Be sure to initialize yylloc, even when its structure is unknown. (yyparse): Simplify the call to b4_dollar_pushdef. * tests/actions.at (Initial location): Check of similar pattern as in the case of PostgreSQL. 2012-11-23 Akim Demaille scanner: issue a single error for groups of invalid characters * src/scan-gram.l: Scan groups of invalid characters together. * tests/input.at, tests/named-refs.at: Adjust. 2012-11-23 Akim Demaille tests: formatting changes * tests/named-refs.at: Here. 2012-11-23 Akim Demaille doc: one of the fixes for an ambiguous grammar was ambiguous too Reported by Аскар Сафин. http://lists.gnu.org/archive/html/bug-bison/2012-11/msg00024.html * doc/bison.texi (Reduce/Reduce): Fix the resulting ambiguity using precedence/associativity directives. 2012-11-22 Akim Demaille doc: fix the dangling else with precedence directives * doc/bison.texi (Non Operators): New node. (Shift/Reduce): Point to it. Don't promote "%expect n" too much. 2012-11-22 Akim Demaille doc: prefer "token" to TOKEN This is more readable in short examples. * doc/bison.texi (Shift/Reduce): here. Make "win" and "lose" action more alike. 2012-11-22 Akim Demaille doc: formatting changes * doc/bison.texi: Use @group. 2012-11-14 Akim Demaille scanner: use explicit "ignore" statements * src/scan-gram.l: here. 2012-11-13 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: tests: close files in glr-regression xml: match DOT output and xml2dot.xsl processing xml: factor xslt space template graph: fix a memory leak xml: documentation output: capitalize State 2012-11-12 Theophile Ranquet tests: close files in glr-regression * tests/glr-regression.at: Here. 2012-11-12 Theophile Ranquet xml: match DOT output and xml2dot.xsl processing Make the DOT produced by XSLT processing equivalent to the one made with the --graph option. * data/xslt/xml2dot.xsl: Stylistic changes, and add support for reductions. * doc/bison.texi (Xml): Update. * src/graphviz.c (conclude_red): Minor stylistic changes to DOT internals. (output_red): Swap enabled and disabled reductions output, for coherence with XSLT output. * src/print_graph.c (print_core): Minor stylistic change to States' output. (print_actions): Swap order of output for reductions and transitions. * tests/local.at (AT_BISON_CHECK_XML): Ignore differences in order. * tests/output.at: Adjust to changes in DOT internals. 2012-11-12 Theophile Ranquet xml: factor xslt space template * data/xslt/bison.xsl (space): New, import from... * data/xslt/xml2text.xsl: Here. 2012-11-12 Theophile Ranquet graph: fix a memory leak * src/graphviz.c (output_red): Here. 2012-11-12 Theophile Ranquet xml: documentation The XML output combined with the XSL Transformations provided in data/ are incredibly useful, they should be documented. * doc/bison.texi (Xml): New node. 2012-11-12 Theophile Ranquet output: capitalize State * src/print.c (print_state): Here. * tests/conflicts.at, tests/existing.at, tests/local.at, tests/reduce.at, tests/regression.at, tests/sets.at: Adjust. 2012-11-12 Akim Demaille tests: fix syntax-check errors Reported by Théophile Ranquet. * tests/c++.at: Use AT_PARSER_CHECK. Avoid using "strcmp", which triggers an error from syntax-check. 2012-11-12 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: maint: address syntax-check errors. tests: use valgrind where appropriate tests: use valgrind where appropriate tests: don't expect $EGREP to support -w tests: more possible error compiler messages for "#error" 2012-11-12 Akim Demaille maint: address syntax-check errors. * cfg.mk: Ignore the "error" call in tests/c++.at, it is not to be translated. * doc/bison.texi: Fix incorrect @pxref use. * po/POTFILES.in: Add missing file. * src/print_graph.c: Remove useless include. 2012-11-12 Akim Demaille tests: use valgrind where appropriate Reported by Théophile Ranquet. * cfg.mk (sc_at_parser_check): New. * tests/c++.at: Fix use of AT_CHECK vs. AT_PARSER_CHECK. 2012-11-12 Akim Demaille Merge remote-tracking branch 'origin/branch-2.6' into maint * origin/branch-2.6: tests: use valgrind where appropriate tests: don't expect $EGREP to support -w 2012-11-10 Akim Demaille tests: use valgrind where appropriate Reported by Théophile Ranquet. * tests/glr-regression.at: Rewrite some test cases so that AT_PARSER_CHECK, which runs valgrind, is exposed with the parser, not with "echo". * tests/local.at, tests/regression.at, tests/headers.at: Use AT_PARSER_CHECK for generated parsers. 2012-11-08 Akim Demaille tests: don't expect $EGREP to support -w Does not work on Solaris 10. Reported by Dennis Clarke. http://lists.gnu.org/archive/html/bug-bison/2012-11/msg00009.html * tests/headers.at (Several parsers): Use Perl instead. While at it, run it only once, on all the generated headers. Adjust to YY_NULL be defined in position.hh. 2012-11-08 Akim Demaille tests: more possible error compiler messages for "#error" * tests/synclines.at (AT_SYNCLINES_COMPILE): Adjust for Clang. Verified with GCC 4.0, 4.2 to 4.8, and Clang 2.9, 3.2: none skip. 2012-11-08 Akim Demaille regen 2012-11-08 Akim Demaille Merge branch 'maint' * origin/maint: regen maint: post-release administrivia version 2.6.5 regen tests: syntax-check tests: beware of compilers that do not support POSIXLY_CORRECT gnulib: update 2012-11-08 Akim Demaille regen 2012-11-08 Akim Demaille Merge branch 'branch-2.6' into maint * origin/branch-2.6: maint: post-release administrivia version 2.6.5 regen tests: syntax-check tests: beware of compilers that do not support POSIXLY_CORRECT gnulib: update 2012-11-07 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2012-11-07 Akim Demaille version 2.6.5 * NEWS: Record release date. 2012-11-07 Akim Demaille regen 2012-11-07 Akim Demaille tests: syntax-check * tests/actions.at: Fix typo. 2012-11-07 Akim Demaille tests: beware of compilers that do not support POSIXLY_CORRECT Running "maintainer-release-check" on OS X with Clang 2.9 fails, because "clang-mp-2.9 -o test -g test.c" launches "/usr/bin/dsymutil test -o test.dSYM" which fails with "error: unable to open executable '-o'". * m4/c-working.m4 (BISON_CHECK_WITH_POSIXLY_CORRECT) (BISON_C_COMPILER_POSIXLY_CORRECT): New. * configure.ac: Use the latter. * tests/atlocal.in (POSIXLY_CORRECT_IS_EXPORTED): New. * tests/local.at (AT_BISON_CHECK_WARNINGS_): Use it instead of computing its value each time. (AT_QUELL_VALGRIND): Skip tests that cannot work because of compilers that do not support POSIXLY_CORRECT. 2012-11-07 Akim Demaille gnulib: update 2012-11-06 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: (24 commits) tests: calc: modernize the use of locations tests: remove useless location initializations lalr1.cc: always initialize yylval. tests: check that C and C++ objects can be linked together. yacc.c: also disable -Wuninitialized. glr.cc, yacc.c: initialize yylloc properly yacc.c, glr.c: a better YY_LOCATION_PRINT yacc.c: simplify initialization doc: formatting changes c++: fix position operator signatures tests: remove useless location initialization. tests: fix locations in C tests: handle %parse-param in the generated yyerror tests: simplifications grammars: fix display of nul character in error message tests: sort tests: cosmetic changes comment changes autoconf: update gnulib: update ... 2012-11-06 Akim Demaille Merge branch 'branch-2.6' into maint * origin/branch-2.6: (24 commits) tests: calc: modernize the use of locations tests: remove useless location initializations lalr1.cc: always initialize yylval. tests: check that C and C++ objects can be linked together. yacc.c: also disable -Wuninitialized. glr.cc, yacc.c: initialize yylloc properly yacc.c, glr.c: a better YY_LOCATION_PRINT yacc.c: simplify initialization doc: formatting changes c++: fix position operator signatures tests: remove useless location initialization. tests: fix locations in C tests: handle %parse-param in the generated yyerror tests: simplifications grammars: fix display of nul character in error message tests: sort tests: cosmetic changes comment changes autoconf: update gnulib: update ... 2012-11-06 Akim Demaille tests: calc: modernize the use of locations * tests/calc.at: Don't initialize the location, let the parser do it. Use a $printer. Change some testing input to be easier to distinguish (instead of always "0 0" for instance). 2012-11-06 Akim Demaille tests: remove useless location initializations * tests/actions.at, tests/calc.at: here. 2012-11-06 Akim Demaille lalr1.cc: always initialize yylval. * data/lalr1.cc: here. 2012-11-06 Akim Demaille tests: check that C and C++ objects can be linked together. * tests/local.at (AT_SKIP_IF_CANNOT_LINK_C_AND_CXX): New. * tests/headers.at (Several parsers): Use it. 2012-11-06 Akim Demaille yacc.c: also disable -Wuninitialized. * data/yacc.c (YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN): For some versions of GCC, -Wmaybe-uninitialized alone does not suffice. 2012-11-06 Akim Demaille glr.cc, yacc.c: initialize yylloc properly There are several issues to address here. One is that yylloc should be initialized when possible. Another is that the push parser needs to update yypushed_loc when the user modified it. And if the parser starts by a reduction of an empty, it uses the first location on the stack, which, therefore, must also be initialized to this initial location. This is getting complex, especially since because initializing a global (impure interface) is different from initializing a local variable. To simplify, the local yylloc is not initialized during its definition. * data/c.m4 (b4_yyloc_default_define): Replace by... (b4_yyloc_default): this. Adjust dependencies. * data/glr.cc: Initialize yylloc. * data/yacc.c (b4_declare_scanner_communication_variables): Initialize yylloc during its definition. Don't define yyloc_default. (yypush_parse): The location formal is not const, as we might initialize it. (yyparse): Define yyloc_default. Use it before running the user initial action. Possibly update the first location on the stack, and the pushed location after the user initial action. * tests/actions.at (Initial locations): Check that the initial location is correct. 2012-11-06 Akim Demaille yacc.c, glr.c: a better YY_LOCATION_PRINT * data/c.m4 (b4_yy_location_print_define): New. Now issues "short" locations, e.g., "1.1" instead of "1.1-1.1". Was initially a function, but then we face "static but unused" warnings. Simpler as a macro. * tests/local.at, data/glr.c, data/yacc.c: Use it instead of duplicating. * tests/actions.at: Adjust expectations. 2012-11-06 Akim Demaille yacc.c: simplify initialization * data/yacc.c: Fuse the initializations of yyssp, yyss and the like. Remove an obsolete comment: we do initialize these initial stack members (in some cases). 2012-11-05 Akim Demaille doc: formatting changes * doc/bison.texi: In a pointer type. 2012-11-05 Akim Demaille c++: fix position operator signatures * data/location.cc (operator+=, operator-=): Remove const from return type. 2012-11-05 Akim Demaille tests: remove useless location initialization. * tests/glr-regression.at: here. glr.c does initialize yylloc. 2012-11-05 Akim Demaille tests: fix locations in C * tests/local.at (AT_YYERROR_DEFINE): Don't display the end of the location if it is not after its beginning. * tests/actions.at, tests/cxx-type.at: Adjust the expected output. 2012-11-05 Akim Demaille tests: handle %parse-param in the generated yyerror * tests/local.at (AT_PARSE_PARAMS): New. (AT_YYERROR_FORMALS, AT_YYERROR_DEFINE): Use it to add the parse-param to yyerror. * tests/calc.at, tests/regression.at: Use AT_YYERROR_DEFINE and AT_YYERROR_DECLARE, now that they handle properly the parse-params. Be sure to let AT_BISON_OPTION_PUSHDEFS now what parse-params are used. 2012-11-05 Akim Demaille tests: simplifications * tests/actions.at (Exotic Dollars): Formatting changes. Use AT_FULL_COMPILE. (AT_CHECK_PRINTER_AND_DESTRUCTOR): Remove useless initialization of @$. 2012-11-01 Akim Demaille lalr1.cc: rename lex_symbol as api.token.constructor * data/bison.m4 (b4_lex_symbol_if): Rename as... (b4_token_ctor_if): this. Depend upon api.token.constructor. * data/c++.m4, data/lalr1.cc: Adjust. * doc/bison.texi: Fix all the occurrences of lex_symbol. * etc/bench.pl.in: Adjust. * examples/variant.yy: Likewise. * tests/local.at (AT_BISON_OPTION_PUSHDEFS, AT_BISON_OPTION_POPDEFS): Handle AT_TOKEN_CTOR_IF. * tests/c++.at: Adjust to using api.token.constructor and AT_TOKEN_CTOR_IF. Simplify the test of both build call styles. (AT_CHECK_VARIANTS): Rename as... (AT_TEST): this. And undef when done. 2012-11-01 Akim Demaille examples: simplify/improve * examples/variant.yy: Put yylex in yy::, and simplify accordingly. Minor formatting changes. 2012-11-01 Akim Demaille bison.m4: support b4_*_if macros whose name differ from their variable * data/bison.m4 (b4_percent_define_if_define_, b4_percent_define_if_define): Accept a second argument. 2012-11-01 Akim Demaille grammars: fix display of nul character in error message Reported by Marc Mendiola. http://lists.gnu.org/archive/html/help-bison/2012-10/msg00017.html * gnulib: Update to get quote_mem. * src/scan-gram.l: Use it. * tests/input.at (Invalid inputs): Additional checks. * tests/named-refs.at: Likewise. 2012-11-01 Akim Demaille tests: sort * tests/regression.at (Invalid inputs, Invalid inputs with {}): Move to... * tests/input.at: here, for consistency. 2012-11-01 Akim Demaille tests: cosmetic changes * tests/actions.at (AT_CHECK_PRINTER_AND_DESTRUCTOR): Improve the displayed title. 2012-11-01 Akim Demaille comment changes * data/lalr1.cc: here. 2012-11-01 Akim Demaille autoconf: update There are comment changes only in the files we use. 2012-11-01 Akim Demaille gnulib: update 2012-10-28 Akim Demaille regen 2012-10-28 Akim Demaille yacc.c: initialize yylval and yylloc. When generating a pure push parser, the initialization of yylval and yylloc may not be visible to the compiler. With warnings enabled, GCC 4.3.6, 4.4.7, 4.5.4, and 4.6.3 report uninitialized uses of yylval/yylloc. Using local pragmas to disable these warnings is not supported before 4.6, and 4.6 does not support it properly. So initialize yylval and yylloc at their definition. Reported by Peter Simons. See http://lists.gnu.org/archive/html/bison-patches/2012-10/msg00133.html * data/c.m4 (b4_yyloc_default_define): New. * data/yacc.c: Use it when locations are requested. (YYLVAL_INITIALIZE): Replace by... (YY_INITIAL_VALUE): this. (yyparse): Initialize yylloc and yylval. Therefore, remove the initialization of yylloc's field. * data/glr.c: Likewise. 2012-10-26 Theophile Ranquet graphs: fix spacing refactoring * src/print_graph.c (print_lhs, print_core): Here. 2012-10-26 Theophile Ranquet tests: make deprecation tests more specific * tests/input.at (Deprecated directives): Here, don't generate unrelated errors or warnings. 2012-10-26 Theophile Ranquet tests: fix AT_BISON_CHECK_WARNINGS_ stderr rewriting * tests/input.at (Deprecated directives): Avoid spurious error. * tests/locat.at (AT_BISON_CHECK_WARNINGS): Adjust for recent changes. 2012-10-26 Theophile Ranquet scan-skel.l: consider m4 notes as related to "complaint" errors * src/scan-skel.l (flag): Here. 2012-10-26 Theophile Ranquet warnings: distinguish context information based on warning type * src/scan-code.l (show_sub_message, show_sub_messages): Take a new warnings argument. 2012-10-26 Theophile Ranquet warnings: fix early exit of warnings treated as errors Treating warnings as errors caused Bison to exit earlier than needed, making it hide warnings that would have been printed had -Werror not been set. Also, fix a bug that caused some context information of errors to not be shown. * src/complain.c (complaint_issued): Rename as... (complaint_status): This, and change its type from boolean to * src/complain.h (err_status): This, new enumeration. * src/main.c (main): Adjust (only finish early if an actual complaint was risen, not a mere warning treated an error). * src/reader.c: Adjust. 2012-10-26 Theophile Ranquet tests: reindent for legibility * tests/local.at (AT_BISON_CHECK_WARNINGS_): Here. 2012-10-26 Akim Demaille build: fix Texinfo compilation * doc/local.mk: fix dependencies. 2012-10-26 Akim Demaille regen 2012-10-26 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: (46 commits) doc: minor style change maint: use gendocs's new -I option regen yacc.c: do not define location support when not using locations maint: be compilable with GCC 4.0 tests: address a warning from GCC 4.4 tests: don't use options that Clang does not support tests: restore the tests on -Werror regen parse-gram: update the Bison interface fix comment maint: post-release administrivia version 2.6.4 regen 2.6.4: botched 2.6.3 maint: post-release administrivia version 2.6.3 gnulib: update tests: check %no-lines NEWS: warnings with clang ... 2012-10-26 Akim Demaille Merge branch 'branch-2.6' into maint * origin/branch-2.6: regen yacc.c: do not define location support when not using locations maint: be compilable with GCC 4.0 tests: address a warning from GCC 4.4 tests: don't use options that Clang does not support tests: restore the tests on -Werror regen parse-gram: update the Bison interface fix comment 2012-10-26 Akim Demaille doc: minor style change * doc/figs/example-reduce.txt: here. 2012-10-26 Akim Demaille maint: use gendocs's new -I option * gnulib: Update gendocs. * cfg.mk (gendocs_options_): New. 2012-10-26 Akim Demaille regen 2012-10-26 Akim Demaille yacc.c: don't use _Pragma GCC diagnostic with 4.6 Reported by Peter Simons. http://lists.gnu.org/archive/html/bug-bison/2012-10/msg00033.html * data/yacc.c (b4_declare_scanner_communication_variables): 4.7 seems fine though. 2012-10-26 Akim Demaille regen 2012-10-26 Akim Demaille yacc.c: do not define location support when not using locations * data/yacc.c (YYLLOC_DEFAULT, YYRHSLOC): Don't define when not using locations. 2012-10-26 Akim Demaille maint: be compilable with GCC 4.0 The "shadows a global declaration" warning in GCC 4.0 was a bit annoying. It does not like that a type name be used in a prototype of a function (not the implementation, just the declaration): In file included from src/LR0.c:38: src/reader.h:56: warning: declaration of 'named_ref' shadows a global declaration src/named-ref.h:35: warning: shadowed declaration is here It does not like either when a global variable name is used in a prototype. Flex 2.5.37 generates this prototype: void gram_set_debug (int debug_flag ); * src/getargs.h, src/getargs.c (debug_flag): Rename as... (debug): this. Adjust dependencies. * src/reader.h: Don't use "named_ref" as a formal argument name. 2012-10-26 Theophile Ranquet misc: document TESTSUITEFLAGS in README-hacking * README-hacking: Document -j and -k flags. 2012-10-26 Theophile Ranquet deprecation: add tests * tests/input.at (Deprecated directives warn, Non-deprecated directives don't, Unput doesn't mess up locations): New tests. 2012-10-25 Akim Demaille tests: address a warning from GCC 4.4 236. torture.at:465: testing Exploding the Stack Size with Alloca ... ../../../tests/torture.at:474: bison -o input.c input.y ../../../tests/torture.at:474: $CC $CFLAGS $CPPFLAGS $LDFLAGS -o input input.c $LIBS stderr: cc1: warnings being treated as errors input.y: In function 'main': input.y:60: error: 'status' may be used uninitialized in this function * tests/torture.at (AT_DATA_STACK_TORTURE): Initial status to avoid the previous error. 2012-10-25 Akim Demaille tests: don't use options that Clang does not support * configure.ac (WARN_CFLAGS, WARN_CXXFLAGS): Do not include options that Clang does not support. 2012-10-25 Akim Demaille tests: restore the tests on -Werror When run as /bin/sh, Bash sets the shell variable POSIXLY_CORRECT to y. The test suite checks for the envvar POSIXLY_CORRECT to turn of some tests not supported in POSIX mode. Restore these tests. Reported by the Hydra build farm, from Rob Vermaas. * tests/local.at (AT_BISON_CHECK_WARNINGS_): Check the envvar POSIXLY_CORRECT, not the shell variable. 2012-10-25 Akim Demaille regen 2012-10-25 Akim Demaille parse-gram: update the Bison interface * src/parse-gram.y (%pure-parser, %name-prefix): Replace with... (%define api.pure, %define api.prefix) * src/location.h, src/scan-gram.h: Adjust to api.prefix. 2012-10-25 Akim Demaille fix comment * data/c.m4 (b4_YYDEBUG_define): here. 2012-10-24 Theophile Ranquet regen 2012-10-24 Theophile Ranquet deprecation: issue warnings in scanner * src/parse-gram.y: Move the handling of (three) deprecated constructs ... * src/scan-gram.l: ...Here, and issue warnings. (DEPRECATED): New. 2012-10-23 Akim Demaille Merge branch 'branch-2.6' into maint * origin/branch-2.6: maint: post-release administrivia version 2.6.4 regen 2.6.4: botched 2.6.3 2012-10-23 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2012-10-23 Akim Demaille version 2.6.4 * NEWS: Record release date. 2012-10-22 Akim Demaille regen 2012-10-22 Akim Demaille 2.6.4: botched 2.6.3 * NEWS: here. 2012-10-22 Akim Demaille Merge branch '2.6.3' into maint * 2.6.3: (22 commits) maint: post-release administrivia version 2.6.3 gnulib: update tests: check %no-lines NEWS: warnings with clang warnings: avoid warnings from clang tests: no longer disable -O compiler options yacc.c: initialize yylval in pure-parser mode skeletons: style changes tests: minor improvements tests: use $PERL instead of perl build: look for Perl in configure. tests: fix sed portability issues tests: diff -u is not portable maint: word changes lalr1.cc: fix test suite portability maint: fix an erroneous include tests: check that headers are self contained doc: add missing documentation for --report headers: move CPP guards into YY_*_INCLUDED to avoid collisions ... 2012-10-22 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2012-10-22 Akim Demaille version 2.6.3 * NEWS: Record release date. 2012-10-22 Akim Demaille gnulib: update 2012-10-22 Akim Demaille tests: check %no-lines * tests/synclines.at: here. 2012-10-22 Akim Demaille NEWS: warnings with clang * NEWS: here. 2012-10-22 Akim Demaille warnings: avoid warnings from clang Fix the following warning parse-gram.c:2078:14: error: equality comparison with extraneous parentheses [-Werror,-Wparentheses-equality] if (((yyn) == (-91))) ~~~~~~^~~~~~~~ parse-gram.c:2078:14: note: remove extraneous parentheses around the comparison to silence this warning if (((yyn) == (-91))) ~ ^ ~ parse-gram.c:2078:14: note: use '=' to turn this equality comparison into an assignment if (((yyn) == (-91))) ^~ = 1 error generated. and the following one: input.cc:740:1: error: function declared 'noreturn' should not return [-Werror,-Winvalid-noreturn] static void yyMemoryExhausted (yyGLRStack* yystackp) __attribute__ ((__noreturn__)); static void yyMemoryExhausted (yyGLRStack* yystackp) { YYLONGJMP (yystackp->yyexception_buffer, 2); } ^ 1 warning and 1 error generated. This is Apple clang version 3.1 (tags/Apple/clang-318.0.61). * data/c.m4 (b4_table_value_equals): Use (!!(A == B)) instead of (A == B) to avoid this warning. Any reasonable compiler should generate the same code. * src/uniqstr.h (UNIQSTR_EQ): Likewise. * data/glr.c (LONGJMP): abort after longjmp to pacify clang. 2012-10-22 Akim Demaille tests: no longer disable -O compiler options Tests are running without -O since f377f69fec28013c79db4efe12bbb9d48987fb2c because some warnings (about yylval not being initialized) show only when GCC is given -O2. The previous patch fixes the warnings. Run the test suite with compiler options unmodified. * tests/atlocal.in (O0CFLAGS, O0CXXFLAGS): Remove, use CFLAGS and CXXFLAGS. 2012-10-22 Paul Eggert yacc.c: initialize yylval in pure-parser mode See http://lists.gnu.org/archive/html/bison-patches/2012-08/msg00024.html (spreading over September and October). * data/yacc.c (YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN) (YY_IGNORE_MAYBE_UNINITIALIZED_END, YYLVAL_INITIALIZE): New macros. Use them to suppress an unwanted GCC diagnostic. 2012-10-22 Akim Demaille skeletons: style changes * data/yacc.c, data/glr.c: Prefer Title case for (CPP) macro arguments. 2012-10-22 Akim Demaille tests: minor improvements * tests/c++.at: Space changes. Use AT_YYERROR_DEFINE. * tests/local.at (AT_YYERROR_DEFINE): Issue errors on unknown languages. 2012-10-22 Akim Demaille tests: use $PERL instead of perl * tests/atlocal.in (PERL): New. Sort. * tests/calc.at, tests/input.at, tests/local.at, tests/regression.at, * tests/skeletons.at, tests/synclines.at, tests/torture.at: here. 2012-10-22 Akim Demaille build: look for Perl in configure. Bison uses "/usr/bin/perl" or "perl" in several places, and it does not appear to be a problem. But, at least to make it simpler to change PERL on the make command line, check for perl in configure. * configure.ac (PERL): New. * doc/Doxyfile.in, doc/Makefile.am, tests/bison.in: Use it. 2012-10-22 Akim Demaille tests: fix sed portability issues Reported by Didier Godefroy, . * tests/calc.at (AT_CHECK_SPACES): Use Perl. 2012-10-22 Akim Demaille tests: diff -u is not portable Reported by Didier Godefroy . * tests/existing.at (AT_LALR1_DIFF_CHECK): Skip if diff -u does not work. 2012-10-22 Akim Demaille maint: word changes * README-hacking (Typical errors): Improve wording. 2012-10-22 Akim Demaille lalr1.cc: fix test suite portability Reported by Rob Vermaas' Hydra build farm on x86_64-darwin 10.2.0 with G++ 4.6.3. * tests/headers.at (Several parsers): Include AT_DATA_SOURCE_PROLOGUE in the files to compile. * data/location.cc: Do not include twice string and iostream (once by position.hh, and then by location.hh). * README-hacking (Typical errors): Some hints for other maintainers. 2012-10-22 Theophile Ranquet maint: fix an erroneous include This fixes test 130 (Several parsers). * data/location.cc: Include rather than since we really need << on strings for instance. * NEWS: Document this. 2012-10-22 Akim Demaille tests: check that headers are self contained Reported by Alexandre Duret-Lutz. * tests/headers.at (Several parsers): here. 2012-10-22 Akim Demaille doc: add missing documentation for --report * doc/bison.texi (Bison Options): Document --report's "solved", "all", and "none". 2012-10-22 Akim Demaille headers: move CPP guards into YY_*_INCLUDED to avoid collisions See . * data/c.m4 (b4_cpp_guard): Prepend YY_ and append _INCLUDED. * tests/headers.at: Adjust. * NEWS, doc/bison.texi: Document. 2012-10-22 Akim Demaille minor changes. * NEWS: Word changes. * doc/bison.texi: Spell check. Fix minor issues. * tests/headers.at: Comment and formatting changes. 2012-10-22 Akim Demaille gnulib: update 2012-10-19 Akim Demaille gnulib: update 2012-10-19 Akim Demaille xml: slight improvement of the DOT output This was completely forgotten... Nothing about XML is actually documented... * data/xslt/xml2dot.xsl: Use boxes, and Courier font. 2012-10-19 Akim Demaille maint: check for dot before using it * configure.ac: here. * doc/Makefile.am: Use $(DOT). Ship the generated files, to spare the user the need for Graphviz. 2012-10-18 Theophile Ranquet graphs: documentation Note that 'make web-manual' fails. * NEWS: Document these changes. * doc/Makefile.am: Adjust to generate example files. * doc/bison.texi: Add a Graphviz section after "Understanding::", the section describing the .output file, because these are similar. * doc/figs/example-reduce.dot, doc/figs/example-reduce.txt, doc/figs/example-shift.dot, doc/figs/example-shift.txt: New, minimal examples to illustrate the documentation. 2012-10-18 Theophile Ranquet graphs: add tests, introducing -k graph * tests/output.at (AT_TEST): New. Use it to add 6 --graph tests. 2012-10-18 Theophile Ranquet graphs: change the output format of the rules Use something similar to the report file. * src/print_graph.c (print_lhs): New, obstack equivalent of rule_lhs_print. (print_core): Use here. 2012-10-18 Theophile Ranquet graphs: style changes * src/graphviz.c (start_graph): Use courier font. (conclude_red): Use commas to separate attributes. Show the acceptation as a special reduction, with a blue color and an "Acc" label. Show the lookahead tokens between square brackets. (output_red): No longer label default reductions. * src/print_graph.c (print_core): Refactor spacing, and print an additional space between a rule's rhs and its lookahead tokens. Also, capitalize "State". (print_actions): Style, move a declaration. 2012-10-18 Theophile Ranquet graphs: address an issue with R/R conflicts All disabled reductions should now be shown as such. * src/graphviz.c (output_red): Here. (conclude_red): New. 2012-10-16 Akim Demaille news: spell check * NEWS: here. 2012-10-16 Akim Demaille Merge branch 'maint' * origin/maint: java: use api.location.type and api.position.type 2012-10-16 Akim Demaille variables: use singular in %define variable names See http://lists.gnu.org/archive/html/bison-patches/2012-02/msg00045.html * doc/bison.texi, src/lalr.c, src/main.c, src/muscle-tab.c, * src/print.c, src/reader.c, src/tables.c, tests/conflicts.at, * tests/input.at, tests/reduce.at: s/lr.default-reductions/lr.default-reduction/ s/lr.keep-unreachable-states/lr.keep-unreachable-state/. * NEWS: Document. 2012-10-16 Akim Demaille java: fixes * data/java.m4: Remove stray M4 characters. 2012-10-16 Akim Demaille api.tokens.prefix -> api.token.prefix See http://lists.gnu.org/archive/html/bison-patches/2012-02/msg00045.html Note that api.tokens.prefix has not been released, yet. * NEWS, data/bison.m4, doc/bison.texi, tests/c++.at, * tests/calc.at, tests/java.at, tests/local.at: Do it. * src/muscle-tab.c (muscle_percent_variable_update): Ensure backward compatibility. 2012-10-15 Theophile Ranquet scan-skel.l: shift complain_args arguments Because argv[0] is never used, shift it out from the argument list. * src/complain.c (complain_args): Here. * src/scan-skel.l (at_complain): Adjust argv and argc. 2012-10-15 Theophile Ranquet scan-skel.l: formatting changes * src/scan-skel.l (fail_for_at_directive_too_few_args): Here. 2012-10-12 Akim Demaille java: use api.location.type and api.position.type * data/java.m4: here. * NEWS, doc/bison.texi, tests/java.at: Adjust. 2012-10-12 Akim Demaille Merge branch 'maint' * origin/maint: tests: check %no-lines tests: minor simplification graphs: stylistic changes. graphs: minor style changes graphs: show reductions graphs: style: prefix state number with "state" graphs: style: use left justification for states graphs: style: prefix rules and change shapes obstack: import obstack_finish0 from master c++: api.location.type muscles: a function for backward compatibility maint: more macros 2012-10-12 Akim Demaille tests: check %no-lines * tests/synclines.at: here. 2012-10-12 Akim Demaille tests: minor simplification * tests/headers.at (Several parsers): Use *.y even for C++. 2012-10-11 Akim Demaille graphs: stylistic changes. * src/graphviz.c (output_red): Comment and formatting changes. 2012-10-11 Theophile Ranquet graphs: minor style changes * src/graphviz.c (output_red): Fix C90 issues. Reduce variable scopes. 2012-10-11 Theophile Ranquet graphs: show reductions * src/graphviz.c (output_red): New, show reductions on the graph. (no_reduce_bitset_init): New, initialize a bitset. (print_token): New, print a lookahead token. (escape): New, print "foo" as \"foo\" because Dot doesn't like quotes within a label. * src/graphviz.h : Adjust. * src/print_graph.c (print_actions): Call output_red here. 2012-10-11 Theophile Ranquet graphs: style: prefix state number with "state" * src/print_graph.c (print_core): Here. 2012-10-11 Theophile Ranquet graphs: style: use left justification for states The label text of nodes is centered "by default" (by the use of '\n' as a line feed). This gives bad readability to the grammar rules shown in state nodes, a left justification is much nicer. This is done by using '\l' as the line feed. In order to allow \l in the DOT file, changes to the quoting system seem necessary. * src/print_graph.c (print_core): Escape tokens here, instead of... * src/graphviz.c (output_node): Here... (escape): Using this, new. 2012-10-11 Theophile Ranquet graphs: style: prefix rules and change shapes * src/graphviz.c (start_graph): Use box rather than ellipsis. * src/print_graph.c (print_core): Prefix rules with their number. 2012-10-11 Theophile Ranquet obstack: import obstack_finish0 from master * src/system.h (obstack_finish0): New. 2012-10-11 Akim Demaille Merge branch 'maint' * origin/maint: NEWS: warnings with clang warnings: avoid warnings from clang tests: no longer disable -O compiler options yacc.c: initialize yylval in pure-parser mode skeletons: style changes lalr1.cc: document exception safety lalr1.cc: check exception safety of error handling lalr1.cc: check (and fix) %printer exception safety lalr1.cc: check (and fix) %initial-action exception safety lalr1.cc: fix exception safety lalr1.cc: check exception safety. lalr1.cc: indentation fixes. lalr1.cc: don't leave macros define to nothing tests: minor improvements tests: use $PERL instead of perl build: look for Perl in configure. tests: fix sed portability issues tests: diff -u is not portable 2012-10-09 Akim Demaille c++: api.location.type This feature was introduced in 95a2de5695670ae0df98cb3c42141cad549f0204 (which is part of 2.5), but not documented. Give it a proper name, and make it public. * data/c++.m4, data/lalr1.cc, data/glr.cc, data/java.m4: Use api.location.type instead of location_type. * src/muscle-tab.c (muscle_percent_variable_update): Map the latter to the former. * tests/local.at: Adjust. * tests/calc.at: Use api.location.type. Leave tests/java.at with location_type, at least for the time being, to cover both names. * doc/bison.texi: Document api.location.type. (User Defined Location Type): New. * NEWS: Update. 2012-10-09 Akim Demaille muscles: a function for backward compatibility Based on commit 171ad99d6421935a278656be6dc7161591835d00 from master. * src/muscle-tab.c (muscle_percent_variable_update): New. (muscle_percent_define_insert): Use it. Define the variables with their initial value. 2012-10-09 Akim Demaille maint: more macros * src/output.c (ARRAY_CARDINALITY): Move to... * src/system.h: here. (STREQ, STRNEQ): new. 2012-10-08 Akim Demaille NEWS: warnings with clang * NEWS: here. 2012-10-08 Akim Demaille warnings: avoid warnings from clang Fix the following warning parse-gram.c:2078:14: error: equality comparison with extraneous parentheses [-Werror,-Wparentheses-equality] if (((yyn) == (-91))) ~~~~~~^~~~~~~~ parse-gram.c:2078:14: note: remove extraneous parentheses around the comparison to silence this warning if (((yyn) == (-91))) ~ ^ ~ parse-gram.c:2078:14: note: use '=' to turn this equality comparison into an assignment if (((yyn) == (-91))) ^~ = 1 error generated. and the following one: input.cc:740:1: error: function declared 'noreturn' should not return [-Werror,-Winvalid-noreturn] static void yyMemoryExhausted (yyGLRStack* yystackp) __attribute__ ((__noreturn__)); static void yyMemoryExhausted (yyGLRStack* yystackp) { YYLONGJMP (yystackp->yyexception_buffer, 2); } ^ 1 warning and 1 error generated. This is Apple clang version 3.1 (tags/Apple/clang-318.0.61). * data/c.m4 (b4_table_value_equals): Use (!!(A == B)) instead of (A == B) to avoid this warning. Any reasonable compiler should generate the same code. * src/uniqstr.h (UNIQSTR_EQ): Likewise. * data/glr.c (LONGJMP): abort after longjmp to pacify clang. 2012-10-08 Akim Demaille tests: no longer disable -O compiler options Tests are running without -O since f377f69fec28013c79db4efe12bbb9d48987fb2c because some warnings (about yylval not being initialized) show only when GCC is given -O2. The previous patch fixes the warnings. Run the test suite with compiler options unmodified. * tests/atlocal.in (O0CFLAGS, O0CXXFLAGS): Remove, use CFLAGS and CXXFLAGS. 2012-10-08 Paul Eggert yacc.c: initialize yylval in pure-parser mode See http://lists.gnu.org/archive/html/bison-patches/2012-08/msg00024.html (spreading over September and October). * data/yacc.c (YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN) (YY_IGNORE_MAYBE_UNINITIALIZED_END, YYLVAL_INITIALIZE): New macros. Use them to suppress an unwanted GCC diagnostic. 2012-10-08 Akim Demaille skeletons: style changes * data/yacc.c, data/glr.c: Prefer Title case for (CPP) macro arguments. 2012-10-06 Akim Demaille lalr1.cc: document exception safety * NEWS: here. * doc/bison.texi (Destructor Decl, C++ Parser Interface): and there. 2012-10-06 Akim Demaille lalr1.cc: check exception safety of error handling * tests/c++.at (Exception safety): Don't use swap here, it is useless. Cover more test cases: yyerror, YYERROR, YYABORT, and error recovery. (Object): Instead of just keeping a counter of instances, keep a list of them. 2012-10-06 Akim Demaille lalr1.cc: check (and fix) %printer exception safety * tests/c++.at (Exception safety): Let the parser support the --debug option. On 'p', throw an exception from the %printer. * data/lalr1.cc (yyparse): Do not display the values we discard, as it uses %printer, which might have thrown the exception. 2012-10-06 Akim Demaille lalr1.cc: check (and fix) %initial-action exception safety * data/lalr1.cc: Check size > 1, rather than size != 1, when cleaning the stack, as at the beginning, size is 0. * tests/c++.at (Exception safety): Check exception safety in %initial-action. 2012-10-06 Akim Demaille lalr1.cc: fix exception safety lalr1.cc does not reclaim its memory when ended by an exception. Reported by Oleksii Taran: http://lists.gnu.org/archive/html/help-bison/2012-09/msg00000.html * data/lalr1.cc (yyparse): Protect the whole yyparse by a try-catch block that cleans the stack and the lookahead. 2012-10-06 Akim Demaille lalr1.cc: check exception safety. * tests/c++.at (Exception safety): New. 2012-10-06 Akim Demaille lalr1.cc: indentation fixes. * data/lalr1.cc (yyparse): here. Untabify a block of code. 2012-10-06 Akim Demaille lalr1.cc: don't leave macros define to nothing * data/lalr1.cc (YY_SYMBOL_PRINT, YY_REDUCE_PRINT, YY_STACK_PRINT): Define to something so that, for instance, "if (foo) YY_SYMBOL_PRINT" is valid even when !YYDEBUG. 2012-10-06 Akim Demaille tests: minor improvements * tests/c++.at: Space changes. Use AT_YYERROR_DEFINE. * tests/local.at (AT_YYERROR_DEFINE): Issue errors on unknown languages. 2012-10-05 Akim Demaille tests: use $PERL instead of perl * tests/atlocal.in (PERL): New. Sort. * tests/calc.at, tests/input.at, tests/local.at, tests/regression.at, * tests/skeletons.at, tests/synclines.at, tests/torture.at: here. 2012-10-05 Akim Demaille build: look for Perl in configure. Bison uses "/usr/bin/perl" or "perl" in several places, and it does not appear to be a problem. But, at least to make it simpler to change PERL on the make command line, check for perl in configure. * configure.ac (PERL): New. * doc/Doxyfile.in, doc/Makefile.am, tests/bison.in: Use it. 2012-10-05 Akim Demaille tests: fix sed portability issues Reported by Didier Godefroy, . * tests/calc.at (AT_CHECK_SPACES): Use Perl. 2012-10-05 Akim Demaille tests: diff -u is not portable Reported by Didier Godefroy . * tests/existing.at (AT_LALR1_DIFF_CHECK): Skip if diff -u does not work. 2012-10-04 Akim Demaille Merge branch 'maint' * origin/maint: maint: word changes lalr1.cc: fix test suite portability maint: fix an erroneous include tests: check that headers are self contained doc: add missing documentation for --report 2012-10-04 Akim Demaille scan-skel: use the scanner to reject all invalid directives * src/scan-skel.l: Use a simpler and more consistent pattern escaping scheme. Catch all the invalid directives here by just removing the previous catch-all-but-alphabetical rule. 2012-10-04 Theophile Ranquet scan-skel: recognize the @directives directly in scanner * src/scan-skel.l (at_directive, at_init): New. (at_ptr): New, function pointer used to call the right at_directive function (at_basename, etc.). (outname): Rename as... (out_name): this, for consistency with out_lineno. 2012-10-04 Theophile Ranquet scan-skel: split @directive functions * src/scan-skel.l (at_directive_perform): Split as... (at_basename, at_complain, at_output): these. 2012-10-04 Theophile Ranquet errors: support indented context info in m4 macros * TODO: Address the issue, so remove it. * data/bison.m4: Use b4_error with [[note]] rather than a complain_at for context information. * src/complain.c (complain_args): Take an additional argument, an indentation pointer, to allow the dispatching of context information. * src/complain.h (complain_args): Adjust prototype. * src/scan-skel.l (at_directive_perform): Recognize the new @note mark. * tests/input.at: Adjust. 2012-10-04 Theophile Ranquet errors: factor b4_error @directives Instead of @complain, @warn, and @fatal, use a unique @complain directive. This directive's first argument is "complain", "warn", etc. * data/bison.m4 (m4_error): Here. * src/scan-skel.l (at_directive_perform): Adjust. (flag): Replace the switch by safer and more explicit if branches. 2012-10-04 Theophile Ranquet errors: pointerize complain_at_indent * src/complain.c (complain_at_indent): Rename as... (complaint_indent): This, and take the location as a pointer. * src/complain.h, src/muscle-tab.c, src/reader.c, src/scan-code.l, src/symtab.c: Adjust. 2012-10-04 Akim Demaille maint: word changes * README-hacking (Typical errors): Improve wording. 2012-10-04 Akim Demaille lalr1.cc: fix test suite portability Reported by Rob Vermaas' Hydra build farm on x86_64-darwin 10.2.0 with G++ 4.6.3. * tests/headers.at (Several parsers): Include AT_DATA_SOURCE_PROLOGUE in the files to compile. * data/location.cc: Do not include twice string and iostream (once by position.hh, and then by location.hh). * README-hacking (Typical errors): Some hints for other maintainers. 2012-10-03 Theophile Ranquet maint: fix an erroneous include This fixes test 130 (Several parsers). * data/location.cc: Include rather than since we really need << on strings for instance. * NEWS: Document this. 2012-10-03 Akim Demaille tests: check that headers are self contained Reported by Alexandre Duret-Lutz. * tests/headers.at (Several parsers): here. 2012-10-03 Akim Demaille doc: add missing documentation for --report * doc/bison.texi (Bison Options): Document --report's "solved", "all", and "none". 2012-10-01 Akim Demaille build: use gnulib's non-recursive-gnulib-prefix-hack Suggested by Jim Meyering. * etc/prefix-gnulib-mk: Remove, as it is now provided by... * bootstrap.conf (modules): the non-recursive-gnulib-prefix-hack module. * build-aux/.gitignore, configure.ac, m4/.gitignore: Adjust. 2012-10-01 Akim Demaille warnings: simplify the m4 interface * data/bison.m4 (error_at): Replace... (error): this. (b4_warn, b4_complain, b4_fatal): Bounce to their _at equivalent, with empty location. * src/scan-skel.l (at_directive_perform): Simplify accordingly. 2012-10-01 Theophile Ranquet warnings: separate flags_argmatch This function is now a mere iterator that calls flag_argmatch, a new function, that matches a single option parameter. * src/getargs.c (flag_argmatch): New, taken from... (flags_argmatch): Here. 2012-10-01 Theophile Ranquet warnings: refactoring The code here was too confusing, this seems more natural. * src/complain.c (error_message): Move the indentation check and the category output to complains. Also, no longer take a 'warnings' argument. (complains): Factor calls to error_message. 2012-10-01 Theophile Ranquet formatting changes * src/complain.c: Here. 2012-10-01 Theophile Ranquet warnings: organize variadic complaints call Move the dispatch of variadic complains to complain.c, rather than do it in a scanner. * src/complain.h, src/complain.c (complain_args): New. * src/scan-skel.l (at_directive_perform): Use it. 2012-10-01 Theophile Ranquet warnings: fusion of complain and complain_at These functions are very similar, and keeping them seperate makes future improvements difficult, so merge them. This impacts 89 calls. * src/bootstrap.conf: Adjust. * src/complain.c (complain, complain_at): Merge into... (complain): this. (complain_args): Adjust. * src/complain.h, src/conflicts.c, src/files.c, src/getargs.c, * src/gram.c, src/location.c, src/muscle-tab.c, src/parse-gram.y, * src/reader.c, src/reduce.c, src/scan-code.l, src/scan-gram.l, * src/scan-skel.l, src/symlist.c, src/symtab.c: Adjust. 2012-10-01 Theophile Ranquet warnings: remove spurious suffixes on context Rectify a bug that introduced suffixes out of place. * src/complainc.c (complains): Handle all three special warning bits. * src/scan-code.l (show_sub_message): Remove useless argument. * tests/named-refs.at: Adjust. 2012-10-01 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: headers: move CPP guards into YY_*_INCLUDED to avoid collisions minor changes. 2012-10-01 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: gnulib: update errors: indent "user token number redeclaration" context 2012-10-01 Akim Demaille headers: move CPP guards into YY_*_INCLUDED to avoid collisions See . * data/c.m4 (b4_cpp_guard): Prepend YY_ and append _INCLUDED. * tests/headers.at: Adjust. * NEWS, doc/bison.texi: Document. 2012-10-01 Akim Demaille minor changes. * NEWS: Word changes. * doc/bison.texi: Spell check. Fix minor issues. * tests/headers.at: Comment and formatting changes. 2012-09-28 Akim Demaille gnulib: update 2012-09-28 Theophile Ranquet errors: indent "user token number redeclaration" context This is the continuation of the work on the readability of errors context. * src/symtab.c (user_token_number_redeclaration): Use complain_at_indent to output with increased indentation level. * tests/input:at: Apply this change. 2012-09-27 Theophile Ranquet errors: don't display "warnings treated as errors" This line doesn't add any meaningful information anymore, the appended [-Werror=CATEGORY] is enough. It is actually more insightful, as it allows to distinguish warnings treated as errors from those that aren't. This line is also removed by gcc 4.8. * src/complain.c (set_warnings_issued): The only action left was checking if the error bit corresponding to the warning issued was set, and that function was only called once. Therefore, remove it, and do its job directly in the caller... (complains): here. * src/complains.h: Adjust. * tests/input.at: Adjust. * NEWS: Document this change. 2012-09-27 Akim Demaille errors: change output, and improve -y coherence The prefix of warnings treated as errors is now "error: ". Also, their suffix now reflects the changes in the Werror option format. An output for -Werror=other used to be: bison: warnings being treated as errors input.y:1.1: warning: stray ',' treated as white space [-Wother] It is now: bison: warnings being treated as errors input.y:1.1: error: stray ',' treated as white space [-Werror=other] The line "warnings being treated as errors" no longer adds any info, it will be removed in a forthcoming change. * NEWS: Add entry "Enhancement of the -Werror" * doc/bison.texi: Move the warnings-as-error to a new bullet. * src/complain.c (complains): Refactor, change the prefix of warnings that are treated as errors. (warnings_print_categories): Support for [-Werror=CATEGORY] display * src/getargc.c (getargs): -y implies -Werror=yacc * tests/input.at: Update expected --yacc output for coherence. 2012-09-27 Theophile Ranquet errors: introduce the -Werror=CATEGORY option This new option is a lot more flexible than the previous one. Its details will be discussed in the NEWS and info file, in a forthcoming change. If no category is specified (ie: used as simply "-Werror"), the functionality is the same as before. * src/complain.c (errors_flag): New variable. (set_warning_issued): Accept warning categories as an argument. * src/complain.h (Wall): Better definition. * src/getargs.c (flags_argmatch): Support for the new format. (usage): Update -Werror to -Werror[=CATEGORY] format. * src/complain.c (errors_flag): New variable. (set_warning_issued): Accept warning categories as an argument. * src/complain.h (Wall): Better definition. * src/getargs.c (flags_argmatch): Support for the new format. (usage): Update -Werror to -Werror=[CATEGORY] format. 2012-09-26 Akim Demaille Merge branch 'maint' * maint: warnings: introduce -Wdeprecated in the usage info errors: prefix the output with "error: " errors: indent "invalid value for %define" context errors: indent "%define var" redefinition context errors: indent "symbol redeclaration" context errors: indent "result type clash" error context 2012-09-26 Theophile Ranquet warnings: introduce -Wdeprecated in the usage info The deprecated warning, introduced some time ago, was not displayed in the usage message. This patch addresses the issue. * src/getargs.c (usage): Insert here. 2012-09-26 Akim Demaille regen 2012-09-26 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: regen yacc: fix handling of CPP guards when no header is generated gnulib: update 2012-09-26 Theophile Ranquet errors: prefix the output with "error: " This improves readability. This is also what gcc does. * NEWS: Document this change. * src/complain.c (complain_at): Prefix all errors with "error: ". (complain_at_indent, warn_at_indent): Do not prefix the context information of errors, which are basically just indented errors. * tests/conflicts.at, tests/glr-regression.at, tests/input.at, tests/named-refs.at, tests/output.at, tests/push.at, tests/regression.at, tests/skeletons.at: Apply this change. 2012-09-26 Theophile Ranquet errors: indent "invalid value for %define" context This is the continuation of the work on the readability of errors context. For example, what used to be: input.y:1.9-29: invalid value for %define variable 'foo' : 'bar' input.y:1.9-29: accepted value: 'most' is now: input.y:1.9-29: invalid value for %define variable 'foo' : 'bar' input.y:1.9-29: accepted value: 'most' * src/muscle-tab.c (muscle_percent_define_check_values): Use complain_at_indent to output with increased indentation level. * tests/input:at: Apply this change. 2012-09-26 Theophile Ranquet errors: indent "%define var" redefinition context This is the continuation of the work on the readability of errors context. For example, what used to be: input.y:2.9-11: %define variable 'var' redefined input.y:1.9-11: previous definition is now: input.y:2.9-11: %define variable 'var' redefined input.y:1.9-11: previous definition * src/muscle-tab.c (muscle_percent_define_insert): Use complain_at_indent to output with increased indentation level. * tests/input.at: Apply this change. 2012-09-26 Theophile Ranquet errors: indent "symbol redeclaration" context This is the continuation of the work on the readability of errors context. For example, what used to be: input.y:5.10-24: %printer redeclaration for input.y:3.11-25: previous declaration is now: input.y:5.10-24: %printer redeclaration for input.y:3.11-25: previous declaration * NEWS: Document this change. * src/symtab.c (symbol_redeclaration, semantic_type_redeclaration, user_token_number_redeclaration, default_tagged_destructor_set, default_tagless_destructor_set, default_tagged_printer_set, default_tagless_printer_set): Use complain_at_indent to output with increased indentation level. * tests/input.at: Apply this change. 2012-09-26 Theophile Ranquet errors: indent "result type clash" error context This used to be the format of the error report: input.y:6.5-10: result type clash on merge function 'merge': [...] input.y:2.4-9: previous declaration In order to distinguish the actual error from the context provided, we rather this new output: input.y:6.5-10: result type clash on merge function 'merge': [...] input.y:2.4-9: previous declaration Another patch will introduce an "error: " prefix to all non-indented lines, giving yet better readability to the reports. * src/complain.h (SUB_INDENT): Move to here. * src/reader.c (record_merge_function_type): Use complain_at_indent to output with increased indentation level. * src/scan-code.l (SUB_INDENT): Remove from here. * tests/glr-regression.at: Apply this change. 2012-09-25 Akim Demaille warnings: use the regular interface for s/r and r/r conflicts The current routines used to display s/r and r/r conflicts are both inconvenient from the programmer point of view (they do not use the warning infrastructure) and for the user (the messages are rather terse, not necessarily pleasant to read, and because they don't use the same routines, they look different). It was due to the belief (dating back to the initial checked-in version of Bison) that, at some point, POSIX Yacc mandated the format for these messages. Today, the Open Group's manual page for Yacc, , explicitly states that the format of these messages is unspecified. See commit be7280480c175bed203883f524c7dcd6cf37c13d and . For a discussion on the chosen warning format, see http://lists.gnu.org/archive/html/bison-patches/2012-09/msg00039.html In an effort to factor the handling of errors and warnings, use the Bison warning routines to report these messages. * src/conflicts.c (conflicts_print): Rewrite with clearer sections about S/R and then R/R conflicts. (conflict_report): Remove, inlined in its sole caller... (conflicts_output): here. * tests/conflicts.at, tests/existing.at, tests/glr-regression.at, * tests/reduce.at, tests/regression.at: Adjust the expected results. * NEWS: Update. 2012-09-25 Akim Demaille regen 2012-09-25 Akim Demaille yacc: fix handling of CPP guards when no header is generated When no header was to be generated, Bison would issue: /* In a future release of Bison, this section will be replaced by #include "". */ #ifndef YY_ # define YY_ It now properly generates nothing. * data/c.m4 (b4_cpp_guard_open, b4_cpp_guard_close): Issue nothing when the file name is empty. * data/yacc.c: Do not generate the above comment when there is no header to generate. * NEWS: Update. 2012-09-25 Akim Demaille gnulib: update 2012-09-21 Akim Demaille conflicts: refactor the counting routines * src/conflicts.c (count_sr_conflicts, count_rr_conflicts): Rename as... (count_sr_conflicts, count_rr_conflicts): these. Use size_t for counts. (count_sr_conflicts, count_rr_conflicts): New. Use them. 2012-09-21 Akim Demaille %expect-rr is for GLR only * src/conflicts.c (conflicts_print): Complain about %expect-rr if not in GLR mode, regardless of the number of reduce/reduce conflicts. * tests/conflicts.at (%expect-rr non GLR): New test. * NEWS: Update. 2012-09-21 Akim Demaille TODO: lalr1.cc master vs maint * TODO: here. 2012-09-21 Akim Demaille c++: coding style fixes * data/lalr1.cc, tests/c++.at: Formatting changes. 2012-09-21 Akim Demaille Revert "introduced a GCC-like -Werror=type" This reverts commit 981c53e257f1974854edc4f6ad0e88c7f18e2bea. 2012-09-21 Akim Demaille Revert "made previous commit less hairy" This reverts commit fd01e1d05ea3e627033d148b5400b99a18ac7ba3. 2012-09-21 Akim Demaille Revert "new Werror report format fixed in a test" This reverts commit 41511178a71ebaf81bde7ffc682c575537af45cb. 2012-09-21 Theophile Ranquet new Werror report format fixed in a test * tests/input.at : replaced [-Wyacc] with [-Werror=yacc] todo: fix the other failed test of the suite, tests/conflicts.at:1554 2012-09-21 Theophile Ranquet made previous commit less hairy * src/getargs.c : here 2012-09-20 Theophile Ranquet introduced a GCC-like -Werror=type * src/complain.h : errors_flag variable * src/complain.c : actual stuff happens here * src/conflits.c : differentiated SR and RR conflicts * src/getargs.c : flags_argmatch recognizes the new -Werror format 2012-09-04 Akim Demaille regen 2012-09-04 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: maint: remove useless file update files to ignore remove useless include use locale-indep. c_is* functions for parsing, not isspace, isprint etc gnulib: update --help: include a place to report translation issues tests: style changes tests: fix push-pull test yacc.c: style changes 2012-09-04 Akim Demaille maint: remove useless file * externals/bootstrap.cfg: Remove. This file was used by a specific build system. It was added to the master repository by accident. 2012-09-04 Akim Demaille update files to ignore * doc/.gitignore: Don't ignore split info files as we don't split our info file. See . 2012-09-04 Akim Demaille remove useless include * src/system.h: Don't include sys/types.h. Reported by Eric Blake, . (FUNCTION_PRINT): Remove, unused. 2012-09-03 Jim Meyering use locale-indep. c_is* functions for parsing, not isspace, isprint etc * src/parse-gram.y: Include "c-ctype.h". (add_param): Parse with c_isspace, not isspace. * src/parse-gram.c: Likewise. * src/scan-gram.l: Include c-ctype.h, not ctype.h. (SC_ESCAPED_STRING,SC_ESCAPED_CHARACTER): Use c_isspace and c_isprint, not ctype.h's locale-dependent functions. 2012-09-03 Akim Demaille gnulib: update 2012-09-03 Akim Demaille --help: include a place to report translation issues http://lists.gnu.org/archive/html/bug-bison/2012-08/msg00007.html shows that it is useful to help users report translation issues. While at it, include other informative bits that the coreutils shows. * src/getargs.c (usage): Report more URLs where the user can refer to. Mostly copied/pasted from coreutils' emit_ancillary_info function. 2012-09-03 Akim Demaille news: style changes * NEWS: Minor improvements. 2012-09-03 Akim Demaille use -Wdeprecated for obsolete %define variable names * src/muscle-tab.c (muscle_percent_variable_update): Here. * tests/input.at (%define backward compatibility): Update expectations. 2012-09-03 Akim Demaille introduce -Wdeprecated GCC seems to be using "deprecated" consistently over "obsoleted", so use -Wdeprecated rather than -Wobsolete. * src/complain.h (warnings): Add Wdeprecated. * src/complain.c (warnings_print_categories): Adjust. * src/getargs.c: Likewise. * doc/bison.texi: Document it. * src/scan-code.l: Use this category for the trailing ';' support. * tests/actions.at: Adjust expected output. 2012-09-03 Akim Demaille undefined but unused is a warning * src/symtab.c (symbol_check_defined): Undeclared symbols are only a warning. * tests/input.at (Undeclared symbols used for a printer or destructor): Rename as... (Undefined symbols): this, and check this case. * NEWS: Doc it. 2012-09-03 Akim Demaille glr.cc: %defines is no longer mandatory * data/glr.cc: No longer require %defines. When it is not given, define the position and location classes instead of including their headers. (b4_shared_declarations): Use the original parse-params. * data/glr.c (b4_shared_declarations): Define only if undefined. * tests/actions.at, tests/calc.at: No longer force the use of %defines for glr.cc. * NEWS: Doc it. 2012-09-03 Akim Demaille todo: check push parsers 2012-09-03 Akim Demaille style: remove useless C++ provisio * src/complain.h: here. 2012-09-03 Akim Demaille parser: style changes * src/parse-gram.y: Avoid deprecated directives. 2012-09-03 Akim Demaille doc: address a fixme * doc/bison.texi (Calc++ Parser): Add a cross-reference. 2012-09-03 Akim Demaille style changes * data/glr.cc, tests/actions.at: Fix comments. * src/symtab.h, src/symtab.c: Fix indentation/comments. * src/symlist.c: Fix indentation. 2012-08-31 Akim Demaille tests: style changes * tests/torture.at (AT_DATA_STACK_TORTURE): M4 style changes to improve readability. Fix an assertion which, because of a <= instead of ==, did not check new_status as visibly meant. (get_args): New. 2012-08-31 Akim Demaille tests: fix push-pull test * tests/torture.at: %push-pull-parser is no longer supported. 2012-08-31 Akim Demaille yacc.c: style changes * data/yacc.c: (yytoken): Define with initial value. 2012-08-12 Akim Demaille refactoring: define variables with a value * src/muscle-tab.c: Where possible, fuse definition and initial assignment. 2012-08-12 Akim Demaille minor refactoring: shorten variable names * src/scan-skel.l (at_directive_argc, at_directive_argv) (AT_DIRECTIVE_ARGC_MAX): Rename as... (argc, argv, ARGC_MAX): these, as there is no possible confusion. (flags): New. (QPUTS): Remove, inline its only use. 2012-08-12 Akim Demaille obstacks: simplifications * src/system.h (obstack_finish0): New. Use it to simplify several uses. * src/muscle-tab.h (MUSCLE_INSERTF): New. * src/muscle-tab.c: Use obstack_printf where simpler. 2012-08-12 Akim Demaille minor refactoring in user code scanning * src/scan-code.l (show_sub_message, show_sub_messages): Instead of a Boolean, take a "warnings" argument. Avoid storing printf-like format strings in a variable, so that GCC can check them. 2012-08-12 Akim Demaille minor refactoring in user code scanning * src/scan-code.l (show_sub_message): New, extracted from... (show_sub_messages): here. 2012-08-03 Akim Demaille tests: strengthen the trailing spaces check * tests/calc.at: here. * data/glr.c: Fix accordingly. 2012-08-03 Akim Demaille regen 2012-08-03 Akim Demaille Merge branch 'maint' * origin/maint: maint: post-release administrivia version 2.6.2 NEWS: update. yacc: remove trailing end of line at end of file thanks: fix a contributor name gnulib: update tests: synch line -> syncline, for consistency tests: synclines: style changes tests: synclines: fix perl invocation regen c++: trailing end-of-lines in %parse-param tests: simplify 2012-08-03 Akim Demaille regen 2012-08-03 Akim Demaille remove support for lint Basically revert commit 12ce2df60d16961eaa03a5aa009eeaa645e4e1cb. http://lists.gnu.org/archive/html/bison-patches/2012-08/msg00004.html * data/c.m4, data/glr.c, data/yacc.c (YYID): Remove. No longer use ARGSUSED. * src/getargs.c: Restore simpler inclusion of getopt.h (anyway, since then we now use gnulib which certainly protects us from such issues). 2012-08-03 Akim Demaille skeletons: renamings after knr removal * data/c.m4 (b4_yydestruct_generate, b4_yy_symbol_print_generate): Rename as... (b4_yydestruct_define, b4_yy_symbol_print_define): these, for consistency. * data/glr.c, data/glr.cc, data/yacc.c: Adjust. 2012-08-03 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2012-08-03 Akim Demaille version 2.6.2 * NEWS: Record release date. 2012-08-02 Akim Demaille c++: fix a comment * data/c++.m4: Be sure to attach a ';' to its declaration, otherwise it appears in the preceding comment. 2012-08-02 Akim Demaille skeletons: simplify after knr removal * data/c.m4 (b4_yydestruct_generate, b4_yy_symbol_print_generate): They no longer need an argument, it has a single possible value. * data/glr.c, data/yacc.c: Adjust. 2012-08-02 Akim Demaille skeletons: renamings after knr removal * data/c.m4 (b4_c_comment_, b4_c_args, b4_c_function_def) (b4_c_function_decl, b4_c_formals, b4_c_call, b4_c_arg): Rename as... (b4_comment, b4_args, b4_function_define, b4_function_declare, b4_formals, b4_function_call, b4_arg): these. * data/glr.c, data/glr.cc, data/lalr1.cc, data/yacc.c: Adjust. 2012-08-02 Akim Demaille skeletons: b4_args -> b4_join to prepare forthcoming changes * data/bison.m4 (b4_args, _b4_args): Rename as... (b4_join, _b4_join): these. * data/c++.m4, data/lalr1.cc, data/variant.hh: Adjust. 2012-08-02 Akim Demaille regen 2012-08-02 Akim Demaille YYPARSE_PARAM: drop support * data/yacc.c: No longer support it. * doc/bison.texi, tests/headers.at: Adjust. * NEWS: Document. 2012-08-02 Akim Demaille skeletons: remove K&R C support * data/c.m4 (b4_c_modern, b4_c_knr_formal_names, b4_c_knr_formal_decls) (b4_c_knr_formal_decl, b4_c_formal_names, b4_c_formal_decls) (b4_c_formal_decl): Remove. (b4_c_ansi_formal_names, b4_c_ansi_formal_decls, b4_c_ansi_formal_decl): Rename as... (b4_c_formal_names, b4_c_formal_decls, b4_c_formal_decl): these. * data/glr.c, data/glr.cc, data/yacc.c: Adjust. 2012-08-02 Akim Demaille NEWS: update. * NEWS: Catch up with the other changes from 2.6.1. 2012-08-02 Akim Demaille yacc: remove trailing end of line at end of file There are still spurious spaces at the end of some lines. But this is addressed in the master branch, and I am reluctant to try to backport this. * data/yacc.c, data/glr.c, data/lalr1.cc, data/glr.cc: here. * tests/calc.at (AT_CHECK_SPACES): New. Use it. Be sure not to introduce trailing empty lines in the *.y files. * NEWS: Doc it. * cfg.mk (syntax-check): Remove the exception. 2012-08-02 Akim Demaille thanks: fix a contributor name * THANKS: On his request. 2012-08-01 Akim Demaille gnulib: update 2012-08-01 Akim Demaille tests: synch line -> syncline, for consistency * tests/synclines.at: Do it, as "syncline" is used consistently everywhere else in Bison. 2012-08-01 Akim Demaille tests: synclines: style changes * tests/synclines.at (AT_TEST_SYNCLINE): Rename as... (AT_TEST): this. Use pushdef/popdef. Formatting changes. Use '+' instead of '*' where appropriate. 2012-08-01 Akim Demaille tests: synclines: fix perl invocation Reported by Summum Bonum. * tests/synclines.at: Fix Perl invocation: its -f is not like sed's. 2012-08-01 Akim Demaille regen 2012-08-01 Akim Demaille c++: trailing end-of-lines in %parse-param * src/parse-gram.y (add_param): No only skip ' ' and '\t', skip all leading and trailing spaces. * tests/regression.at (Lex and parse params): Check it. * NEWS: Document it. 2012-08-01 Akim Demaille tests: simplify * tests/regression.at: Remove useless compilations: AT_FULL_COMPILE includes the compilation by bison. 2012-07-31 Akim Demaille todo: more items * TODO: $ in the epilogue, and obstack_copy. 2012-07-31 Akim Demaille Merge branch 'maint' * maint: use obstack_printf scanner: restore a missing start condition gnulib: update maint: post-release administrivia version 2.6.1 gnulib: update maint: fix some syntax-check issues tests: do not depend on __cplusplus to decide for C++ or C output 2012-07-31 Akim Demaille tests: comment changes * tests/actions.at, tests/input.at: here. 2012-07-31 Akim Demaille tests: really check the set of generated files * tests/output.at (AT_CHECK_OUTPUT): It used to check that the expected files are indeed generated, but it did not check that there are no additional ones. Do that, and adjust expectations (in particular alphabetical order). 2012-07-31 Akim Demaille lalr1.cc: do not create stack.hh without %defines * data/stack.hh (b4_stack_define): New. * data/lalr1.cc: Use it when %defines is not passed. * tests/output.at: Adjust expected output. 2012-07-31 Akim Demaille lalr1.cc: location.hh and position.hh are not generated without %defines * data/location.cc (b4_position_define, b4_location_define): New. (location.hh, position.hh): Generate only if %defines. * data/lalr1.cc: therefore, define these classes when locations are needed, but headers are not generated. * tests/output.at: Check that these files are not generated. * NEWS: Document. 2012-07-31 Akim Demaille lalr1.cc: no longer require %defines. * data/lalr1.cc: Generate the parser header only when %defines is passed. * tests/calc.at: Check it. 2012-07-31 Akim Demaille skeletons: style changes * data/glr.c, data/lalr1.cc: Use more consistent comments, and YY_NULL declaration. 2012-07-31 Akim Demaille glr.cc, lalr1.cc: define b4_shared_declarations * data/glr.cc, data/lalr1.cc: here. The name is no longer right, but at least it is consistent with the other skeletons. 2012-07-31 Akim Demaille glr.cc: no longer require location support * data/glr.cc: Use b4_locations_if where appropriate. * data/lalr1.cc: M4 quotation changes to highlight code duplication with glr.cc. * tests/calc.at: Check glr.cc with and without %location. While at it, fuse multiple %parse-params into one. * tests/actions.at: Simplify. * NEWS: Doc this. Some other wording changes. 2012-07-31 Akim Demaille use obstack_printf This is not just nicer, it is also much safer, since we were using sprintf... * bootstrap.conf: Require it. * src/system.h (obstack_fgrow1, obstack_fgrow2, obstack_fgrow3) (obstack_fgrow4): Remove. Adjust dependencies. 2012-07-30 Akim Demaille scanner: restore a missing start condition $ flex src/scan-skel.l src/scan-skel.l:145: multiple <> rules for start condition SC_AT_DIRECTIVE_ARGS src/scan-skel.l:145: multiple <> rules for start condition SC_AT_DIRECTIVE_SKIP_WS This is warning, and it seems there are no means to make it an error. * src/scan-skel.l: Restore the start-condition INITIAL for an <> clause. 2012-07-30 Akim Demaille gnulib: update 2012-07-30 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2012-07-30 Akim Demaille version 2.6.1 * NEWS: Record release date. 2012-07-30 Akim Demaille gnulib: update 2012-07-27 Akim Demaille maint: fix some syntax-check issues * cfg.mk: Nuke the following warnings which are confused by our text reports (that state that the error token is number 256). prohibit_magic_number_exit ../../doc/bison.texi:8170:error (256) ../../tests/conflicts.at:570:error (256) ../../tests/conflicts.at:673:error (256) ../../tests/conflicts.at:811:error (256) ../../tests/conflicts.at:1154:error (256) ../../tests/regression.at:281:error (256) ../../tests/regression.at:582:error (256) maint.mk: use EXIT_* values rather than magic number 2012-07-27 Akim Demaille regen 2012-07-27 Akim Demaille tests: do not depend on __cplusplus to decide for C++ or C output Since we do support compiling C code with a C++ compiler. * tests/actions.at (Qualified $$ in actions): Use AT_SKEL_CC_IF. 2012-07-27 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: (29 commits) regen synclines: remove spurious empty line also support $$ in the %initial-action skeletons: b4_dollar_pushdef and popdef to simpify complex definitions regen printer/destructor: translate only once factor the handling of m4 escaping news: schedule the removal of the ";" hack style changes in the scanners regen support $$ in printers and destructors scan-code: factor the handling of the type in $$ muscles: fix another occurrence of unescaped type name glr.cc: fix the handling of yydebug gnulib: update formatting changes tests: fix an assertion tests: adjust to GCC 4.8, which displays caret errors be sure to properly escape type names obstack_quote: escape and quote for M4 muscles: shuffle responsabilities muscles: make private functions static muscles: rename private functions/macros obstack_escape: escape M4 characters remove dead macro maint: style changes doc: avoid problems with case insensitive file systems configure: fix botched quoting news: fix typo. 2012-07-27 Akim Demaille regen 2012-07-27 Akim Demaille synclines: remove spurious empty line * data/bison.m4 (b4_syncline): Do not start with an empty line. 2012-07-27 Akim Demaille also support $$ in the %initial-action scan-code.l is already passing argument to b4_dollar_dollar for the initial acton, but its definition (of b4_dollar_dollar) does not use this argument. Generalize this definition, and use it for the %initial-action too. * data/c.m4 (b4_dollar_dollar_, b4_dollar_pushdef, b4_dollar_popdef): Instead of expecting a pointer, require a value, and use ".". Since they are now generic enough, move to... * data/c-like.m4: this new file. * data/c.m4, data/java.m4: Load it. * data/glr.c, data/lalr1.cc, data/lalr1.java, data/yacc.c: Use b4_dollar_pushdef for the %initial-action. * tests/actions.at: Check that. * data/Makefile.am: Adjust. * NEWS, doc/bison.texi: Document. 2012-07-27 Akim Demaille skeletons: b4_dollar_pushdef and popdef to simpify complex definitions M4 is really making it uselessly hard to define macros that define macros. * data/c.m4 (b4_dollar_pushdef, b4_dollar_popdef): New. Use it. 2012-07-27 Akim Demaille regen 2012-07-27 Akim Demaille printer/destructor: translate only once Currently "%printer {...} a b c d e f" translates the {...} six times. Not only is this bad for time and space, it also issues six times the same warnings. * src/symlist.h, src/symlist.c (symbol_list_destructor_set) (symbol_list_printer_set): Take the action as code_props instead of const char *. * src/parse-gram.y: Translate these actions here. * src/scan-code.h: Comment change. * tests/input.at: Check that warnings are issued only once. 2012-07-27 Akim Demaille factor the handling of m4 escaping The conversion from @ to @@ and so forth is coded is too many different places. Factor, a bit. * src/scan-code.l: Instead of duplicating the logic of obstack_escape, use it. It sure is less efficient, but the cost is negligible. This allows to factor rules that are alike. And to factor some start-condition clauses. * tests/input.at (Stray $ or @): New. * NEWS: Document it. 2012-07-27 Akim Demaille news: schedule the removal of the ";" hack scan-code.l is significantly more complex because of this. * NEWS: Doc it. 2012-07-27 Akim Demaille style changes in the scanners * src/scan-code.l, src/scan-skel.l: Use a more traditional indentation style for start-conditions. Prefer "continue" to a comment, for empty actions. Strip useless {}. Remove useless start-condition clauses. 2012-07-26 Akim Demaille regen 2012-07-26 Akim Demaille support $$ in printers and destructors * src/scan-code.l (SC_SYMBOL_ACTION): Accept $$, not just $$. * data/c.m4 (b4_dollar_dollar_): New. (b4_symbol_actions): Let b4_dollar_dollar use b4_dollar_dollar_. * NEWS, doc/bison.texi: Document it. * tests/actions.at: Check this for C and C++. 2012-07-26 Akim Demaille scan-code: factor the handling of the type in $$ * src/scan-code.l (fetch_type_name): New. (handle_action_dollar): Use it. (gt_ptr): Remove, useless. 2012-07-26 Akim Demaille muscles: fix another occurrence of unescaped type name * src/output.c (quoted_output): Split into... (quoted_output, string_output): these. Use the former when outputting a type_name. * tests/input.at: Check this case. * src/symtab.h: Comment changes. 2012-07-26 Akim Demaille glr.cc: fix the handling of yydebug * data/glr.cc (yydebug_): Remove, unused. (set_debug_level, debug_level): Work on yydebug instead. * doc/bison.texi, NEWS: Document this. 2012-07-26 Akim Demaille gnulib: update 2012-07-26 Akim Demaille formatting changes * src/symtab.h: here. 2012-07-26 Akim Demaille tests: fix an assertion * tests/local.at (AT_YYLEX_DEFINE): Be sure to check the array against its length, not its size in bytes. 2012-07-26 Akim Demaille tests: adjust to GCC 4.8, which displays caret errors With GCC 4.8, the tests on synclines are skipped. Transform input.y:1:2: error: #error "1" #error "1" ^ into input.y:1: #error "1" * tests/synclines.at (AT_SYNCLINES_COMPILE): Do it, using Perl instead of sed. 2012-07-26 Akim Demaille be sure to properly escape type names * src/scan-code.l: Use obstack_quote when passing type_name to m4. * tests/input.at (Code injection): New. * NEWS: Document it. Thanks to Paul Eggert for the wording. 2012-07-26 Akim Demaille obstack_quote: escape and quote for M4 * src/system.h (obstack_quote): New. * src/muscle-tab.c: Use it instead of obstack_escape where applicable. * src/scan-code.l: Since obstack_quote supports NULL, leave type_name as NULL instead of defaulting to "". 2012-07-26 Akim Demaille muscles: shuffle responsabilities * src/muscle-tab.c (muscle_boundary_grow): Be in charge of quotation, instead of leaving this to the caller. 2012-07-26 Akim Demaille muscles: make private functions static * src/muscle-tab.h, src/muscle-tab.c (muscle_boundary_grow) (muscle_location_grow): Now static. 2012-07-26 Akim Demaille muscles: rename private functions/macros * src/muscle-tab.c (MUSCLE_COMMON_DECODE, muscle_string_decode) (muscle_location_decode): Not related to muscles, rename as... (COMMON_DECODE, string_decode, location_decode): these. 2012-07-26 Akim Demaille obstack_escape: escape M4 characters * src/muscle-tab.h (MUSCLE_OBSTACK_SGROW): This is not related to muscles, so move to, and rename as... * src/system.h (obstack_escape): this. Adjust dependencies. 2012-07-26 Akim Demaille remove dead macro * src/system.h (DEFAULT_TMPDIR): Remove, unused. 2012-07-26 Akim Demaille maint: style changes * src/scan-code.l: Remove useless braces. Formatting changes. Prefer NULL to 0. * src/muscle-tab.c, src/system.h: Formatting changes. 2012-07-24 Akim Demaille doc: avoid problems with case insensitive file systems makeinfo --html generates index.html, and the node "Index" will result in Index.html. On case insensitive file systems, such as on Mac OS X by default, this results in a single, invalid, file (Texinfo 4.13). See http://lists.gnu.org/archive/html/bug-texinfo/2012-07/msg00032.html * doc/bison.texi (Index): Rename as... (Index of Terms): this. 2012-07-24 Stefano Lattarini (tiny change) configure: fix botched quoting * configure.ac: In the AC_SUBST call on 'VALGRIND_PREBISON'. Without this change, when running ./configure, I see: ... checking for valgrind... valgrind ./configure: line 35221: -q: command not found checking for Java compiler... gcj -C -fsource=1.3 -ftarget=1.4 ... 2012-07-24 Akim Demaille regen 2012-07-24 Akim Demaille yystype, yyltype: remove. * data/c.m4: here. * NEWS: Doc it. 2012-07-22 Akim Demaille regen 2012-07-22 Akim Demaille YYFAIL: remove. * data/lalr1.java, data/yacc.c, src/scan-code.l: Remove YYFAIL support. * NEWS, TODO: Update. 2012-07-22 Akim Demaille todo: update. * TODO: obsolete items. 2012-07-22 Akim Demaille regen. 2012-07-22 Akim Demaille space changes. * data/bison.m4 (b4_symbol_action): Remove spurious eol in the output. 2012-07-22 Akim Demaille parser: fix %printer usage. * src/parse-gram.y: Instead of stderr, using yyo. 2012-07-22 Akim Demaille parser: factor the handling of code_props * src/parse-gram.y: Now that %printer and %destructor are treated equally, let... (code_props_type): handle them. 2012-07-22 Akim Demaille parser: factor handling of type tags * src/parse-gram.y: Now that <*> and <> are processed like regular tags, let... (tag): handle them. 2012-07-22 Akim Demaille regen. 2012-07-22 Akim Demaille simplify the handling of <> and <*>'s code_props. Currently they are treated in separated variables, contrary to other code_props. This duplicates code (and messages for translators) uselessly, as demonstrated by the fact that thanks to this patch, now useless <*> and <> code_props are reported like the others. * src/parse-gram.y (generic_symlist_item): Treat "<*>" and "<>" as regular type tags. * src/symlist.h, src/symlist.c (symbol_list_default_tagged_new) (symbol_list_default_tagless_new,SYMLIST_DEFAULT_TAGGED) (SYMLIST_DEFAULT_TAGLESS): Remove. * src/symtab.h, src/symtab.c (default_tagged_code_props) (default_tagless_code_props, default_tagged_code_props_set) (default_tagless_code_props_set): Remove. (symbol_code_props_get): Default to <*> or <>'s code_props. * tests/actions.at: Complete expected errors: there are new warnings. * tests/input.at: Likewise. (Useless printers or destructors): Extend. 2012-07-22 Akim Demaille allow modification on retrieved code_props. The logic to compute the %printer or %destructor to used (i.e., a code_props) is implemented twice: one, of course, in symbol_code_props_get, and another time in symbol_check_defined to record the fact that a code_props is used (so that we can reported unused ones). Let the former use the latter. I would probably use "mutable" in C++ and keep these guys const, but this is C. And casting away constness triggers warnings. * src/scan-code.h, src/scan-code.l (code_props_none): Is not const. * src/symtab.h, src/symtab.c (symbol_code_props_get): The symbol is not const. (symbol_check_defined): Use it. 2012-07-22 Akim Demaille maint: regen. 2012-07-22 Akim Demaille maint: fix bison's own header guards. Because I'm using a VPATH build with an absolute srcdir, I have GRAM__USERS_AKIM_SRC_GNU_BISON_SRC_PARSE_GRAM_H. Before, I was using a relative srcdir, and had GRAM_______SRC_PARSE_GRAM_H (coming from ../../). Let it be GRAM_SRC_PARSE_GRAM_H. * tests/bison.in: Do not depend on the value of $top_srcdir for Bison itself. If we were to use relative paths from .c to .y, we would not have this problem. 2012-07-22 Akim Demaille maint: add missing const. * src/symtab.h, src/symtab.c (symbol_print): here. 2012-07-22 Akim Demaille style changes. * src/parse-gram.y, src/symtab.c: Space changes. * src/symtab.h: Comment changes. 2012-07-22 Akim Demaille autoconf: update. * submodules/autoconf: here. No significant changes for our use of m4sugar.m4. 2012-07-22 Akim Demaille output: no longer use b4_tokens. * data/glr.c, data/glr.cc, data/lalr1.cc, data/lalr1.java, data/yacc.c: Since the previous commit, b4_tokens_define and the like no longer need b4_tokens. * src/output.c (token_definitions_output): Remove. 2012-07-22 Akim Demaille output: use the token list to define the yytokentype There are currently two systems used to pass information about tokens to m4: the original one, and another, which is used for instance for printers and destructors, variants etc. Move to using only the latter. * data/bison.m4 (b4_symbol_map, b4_token_visible_if) (b4_token_has_definition, b4_any_token_visible_if, b4_token_format): New. * data/c++.m4, data/c.m4, data/glr.c, data/java.m4: Adjust to use them. 2012-07-20 Akim Demaille tests: fix VPATH issue * examples/test: With an absolute VPATH build, "../" is incorrect. 2012-07-20 Akim Demaille news: fix typo. * NEWS: here. Reported by Ben Pfaff. 2012-07-19 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: maint: update gnu-web-doc-update. maint: post-release administrivia version 2.6 maint: prepare for release 2.6 maint: post-release administrivia version 2.5.91 maint: prepare NEWS. maint: fix spaces. tests: adjust to case where the C compiler is actually a C++ compiler tests: fix dependencies doc: fix Texinfo command maint: Valgrind on OS X. tests: be sure that backups are safe. maint: dead comment. tests: refactor for legibility. tests: refactor the bison invocations. maint: fix syntax-check ignore patterns. gnulib: update gnulib: update. gnulib: update 2012-07-19 Akim Demaille maint: update gnu-web-doc-update. * gnulib: here. 2012-07-19 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2012-07-19 Akim Demaille version 2.6 * NEWS: Record release date. 2012-07-19 Akim Demaille maint: prepare for release 2.6 * NEWS: here. 2012-07-18 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2012-07-18 Akim Demaille version 2.5.91 * NEWS: Record release date. 2012-07-18 Akim Demaille maint: prepare NEWS. 2012-07-18 Akim Demaille maint: fix spaces. * build-aux/Makefile.am: here. 2012-07-18 Akim Demaille tests: adjust to case where the C compiler is actually a C++ compiler * tests/atlocal.in (CC_IS_CXX): New. * tests/headers.at (Several parsers): Use it. 2012-07-18 Akim Demaille tests: fix dependencies * tests/Makefile.am: we need atconfig and atlocal to be up to date when calling testsuite. 2012-07-18 Akim Demaille doc: fix Texinfo command * doc/bison.texi: In parens, use @pxref. 2012-07-18 Akim Demaille maint: Valgrind on OS X. * configure.ac (VALGRIND_PREBISON): New. * tests/Makefile.am (maintainer-check-valgrind): Use it. * etc/darwin11.4.0.supp: New. * configure.ac, etc/Makefile.am: Use it. * configure.ac: Disable Valgrind on Mac OS X. * README-hacking: Explain why. 2012-07-17 Akim Demaille tests: be sure that backups are safe. * tests/local.at (at_save_special_files): here. 2012-07-17 Akim Demaille maint: dead comment. * etc/README: here. 2012-07-17 Akim Demaille tests: refactor for legibility. * tests/local.at (AT_BISON_CHECK_WARNINGS, AT_BISON_CHECK_WARNINGS_): New. 2012-07-17 Akim Demaille tests: refactor the bison invocations. * tests/local.at (m4_null_if, AT_BISON_CHECK_): New. 2012-07-17 Akim Demaille maint: fix syntax-check ignore patterns. * cfg.mk: here. 2012-07-17 Akim Demaille gnulib: update 2012-07-16 Akim Demaille gnulib: update. * gnulib: Update so that gitlog-to-changelog support --srcdir. * Makefile.am: Use it. 2012-07-10 Akim Demaille gnulib: update * bootstrap, build-aux/.gitignore, gnulib, m4/.gitignore: update. 2012-07-06 Akim Demaille maint: minor fixes * NEWS: restore missing entry. * cfg.mk: Adjust to *.texinfo -> *.texi. * src/symtab.c: Spaces fixes. 2012-07-06 Akim Demaille tests: address g++-4.8 warnings. list.yy: In function 'yy::parser::symbol_type yylex()': list.yy:107:29: error: typedef 'token' locally defined but not used [-Werror=unused-local-typedefs] typedef yy::parser::token token; ^ * tests/c++.at (AT_CHECK_VARIANTS): here. 2012-07-06 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: maint: update release instructions maint: post-release administrivia version 2.5.90 build: fix gen-ChangeLog call. gnulib: update. tests: fix SKIP_IF for Java. api.prefix: incompatible with %name-prefix. api.prefix: strengthen the tests and fix push-parsers. skeletons: style changes. NEWS: minor changes. api.prefix: improve the documentation for YYDEBUG. gnulib: update. 2012-07-06 Akim Demaille maint: update release instructions * README-hacking: here. 2012-07-05 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2012-07-05 Akim Demaille version 2.5.90 * NEWS: Record release date. 2012-07-05 Akim Demaille build: fix gen-ChangeLog call. * Makefile.am: Be sure to catch errors, and fix option name 2012-07-05 Akim Demaille gnulib: update. * gnulib/build-aux/do-release-commit-and-tag: Fix. 2012-07-05 Akim Demaille tests: fix SKIP_IF for Java. * tests/local.at (AT_JAVA_COMPILE): here. 2012-07-05 Akim Demaille api.prefix: incompatible with %name-prefix. * data/bison.m4: Make it incompatible. * tests/input.at: Check that it is. 2012-07-05 Akim Demaille api.prefix: strengthen the tests and fix push-parsers. * tests/calc.at: Check api.prefix in addition to %name-prefix. * tests/headers.at: Check push parsers and pure interface. * tests/local.at: Use YYLTYPE renamed. * data/yacc.c (b4_declare_yyparse_push_): Handle api.prefix. * doc/bison.texi: Style changes. 2012-07-05 Akim Demaille skeletons: style changes. * data/bison.m4: Define default values after having defined the support macros. Kill a dead comment. 2012-07-05 Akim Demaille NEWS: minor changes. * NEWS: style changes. 2012-07-05 Akim Demaille api.prefix: improve the documentation for YYDEBUG. * doc/bison.texi: Explain how api.prefix is applied to YYDEBUG. 2012-07-05 Akim Demaille gnulib: update. * bootstrap, gnulib: Update. * cfg.mk (syntax-check): Don't check "error" usage in bison.texi. 2012-07-04 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: tests: headers.at: strengthen. glr.cc: do not override C++ definitions by C macros. YYLLOC_DEFAULT: factor, and don't export it in headers. api.prefix: do not use #define to handle YYSTYPE_IS_TRIVIAL etc. tests: portability fixes. c++: fewer #includes in the headers. glr.cc: formatting changes. tests: more logs. api.prefix: also rename YYDEBUG. 2012-07-04 Akim Demaille tests: headers.at: strengthen. * tests/headers.at (Several headers): Be stricter when checking the exported macros. 2012-07-04 Akim Demaille glr.cc: do not override C++ definitions by C macros. * data/glr.c: here. * data/glr.cc: Fix overquotation. * tests/headers.at: Comment changes. 2012-07-04 Akim Demaille YYLLOC_DEFAULT: factor, and don't export it in headers. * data/c++.m4, data/c.m4 (b4_yylloc_default_define): New. * data/glr.c, data/glr.cc, data/lalr1.cc, data/yacc.c: Use it. * data/glr.cc: Do not define YYLLOC_DEFAULT in the header file, but in the implementation one. 2012-07-04 Akim Demaille api.prefix: do not use #define to handle YYSTYPE_IS_TRIVIAL etc. The following mixture is insane: #define YYSTYPE_IS_TRIVIAL PREFIX_STYPE_IS_TRIVIAL #if (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL) since, of course YYSTYPE_IS_TRIVIAL is defined. Instead we could define YYSTYPE_IS_TRIVIAL as PREFIX_STYPE_IS_TRIVIAL only when the later is defined, but let's avoid stacking CPP on top of M4: rather, use #if (defined PREFIX_STYPE_IS_TRIVIAL && PREFIX_STYPE_IS_TRIVIAL) * data/glr.c, data/yacc.c: Use YYSTYPE_IS_TRIVIAL, YYSTYPE_IS_DECLARED, YYLTYPE_IS_TRIVIAL and YYLTYPE_IS_DECLARED under their api.prefix-renamed name. 2012-07-04 Akim Demaille tests: portability fixes. Reported by Hydra. * tests/headers.at (Several headers): Be sure to include config.h in the files to compile. 2012-07-04 Akim Demaille c++: fewer #includes in the headers. * data/lalr1.cc: Define YY_NULL in the *.cc file, it is not needed in the header. * data/location.cc: iosfwd suffices. 2012-07-04 Akim Demaille glr.cc: formatting changes. * data/glr.cc: here. 2012-07-04 Akim Demaille tests: more logs. * tests/headers.at (Several parsers): Here. 2012-07-04 Akim Demaille api.prefix: also rename YYDEBUG. The testsuite in master has shown weird errors for the "Mulitple Parsers" tests: the caller of p5.parse() received some apparently random value, while tracing p5.parse() showed that the function was consistently returning 0. It happens when mixing several parser headers, some generated without %debug, others with. In particular the C++ parser was generated with %debug, i.e., with: #ifndef YYDEBUG # define YYDEBUG 1 #endif and compiled separatedly. Yet, its header was included after the one of another parser, this time without %debug, i.e., with #ifndef YYDEBUG # define YYDEBUG 0 #endif in its header. As a result, the parser was compiled with YYDEBUG set, but its header was used without. Since the layout of the objects are then completely different, boom. Therefore, do not change the value of YYDEBUG. Rather, use it as a default value for DEBUG. * data/c.m4 (b4_YYDEBUG_define): New. (b4_declare_yydebug): Rename as... (b4_yydebug_declare): this, for consistency. * data/glr.c, data/glr.cc, data/lalr1.cc, data/yacc.c: Use it. * NEWS: Document it. 2012-07-02 Akim Demaille formatting changes. * data/lalr1.cc: here. 2012-07-02 Akim Demaille NEWS: spell fixes. * NEWS: here. Reported by Stefano Lattarini. 2012-07-02 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: NEWS: spell check. api.prefix. 2012-07-02 Akim Demaille NEWS: spell check. * NEWS: here. 2012-06-29 Akim Demaille api.prefix. * data/c.m4 (b4_api_prefix, b4_api_PREFIX): New. (b4_prefix, b4_union_name, b4_token_enums, b4_declare_yylstype): Use them. * data/glr.c, data/yacc.c, data/glr.cc, data/lalr1.cc: Use them to change the prefix of exported preprocessor symbols. * src/getargs.c (usage): Ditto. * tests/headers.at (Several parsers): New. * tests/local.at (AT_API_PREFIX): New. AT_YYSTYPE, AT_YYLTYPE): Adjust. * doc/bison.texi (Multiple Parsers): Move documentation of %name-prefix to... (Table of Symbols): here. (Multiple Parsers): Document api.prefix. (%define Summary): Point to it. Use @code for variable names. (Bison Options): -p/--name-prefix are obsoleted. * NEWS: Announce api.prefix. 2012-06-29 Victor Santet warnings: display warnings categories * src/complain.c (error_message): Call 'warnings_print_categories'. * src/gram.c (grammar_rules_useless_report): Display itself warning category. * tests/actions.at, tests/conflicts.at, tests/existing.at, tests/input.at, tests/named-refs.at, tests/output.at, tests/reduce.at, tests/regression.at, tests/skeletons.at: Adjust. * NEWS: Document this. 2012-06-29 Victor Santet warnings: be ready to print warnings categories A function to print warnings categories, like -Wyacc, -Wother, etc. * src/complain.h, src/complain.c (print_warning_categories): New function. * src/output.c (ARRAY_CARDINALITY): Move it to file 'src/system.h'. * src/complain.h (enum warnings): New value, 'silent', "complain" must not display the warning type. 2012-06-29 Akim Demaille maint: prepare forthcoming changes * src/gram.c (rule_rhs_print): Do not print new line anymore. (rule_print): Make it static. * src/closure.c, src/derives.c, src/gram.c: Adjust. 2012-06-29 Victor Santet style changes * src/complain.c, src/reader.c, src/reduce.c, src/main.c: Fix indentation. Simplify a bit. 2012-06-28 Akim Demaille regen. 2012-06-28 Victor Santet warnings: factoring: complaints * src/complain.c (error_message): Accept warning categories (an integer) as argument. Location is a 'const location *' instead of 'location *'. (ERROR_MESSAGE): Delete it. * src/complain.c, src/complain.h (complains): New function. (complain, complain_at, complain_at_indent): Generic functions for complaints. Call 'complains'. (warn_at, warn_at_indent, warn, yacc_at, midrule_value_at) (fatal_at, fatal): Delete them. Adjust dependencies. * src/complain.h (enum warnings): New fields 'complaint' and 'fatal'. * bootstrap.conf (XGETTEXT_OPTIONS): Adjust. 2012-06-28 Victor Santet warnings: move them to complain.c. * src/getargs.h, src/getargs.c (warnings, warnings_flags): Move to... * src/complain.h, src/complain.c: Here. 2012-06-28 Victor Santet warnings: rename the categories Forthcoming changes will use the warning categories much more often, so shortening them will improve readability. * src/complain.c, src/complain.h, src/conflicts.c, * src/getargs.c, src/getargs.h, src/gram.c (enum warnings): s/warnings_/W/g. 2012-06-28 Akim Demaille fix merge. * data/bison.m4: Use b4_error_verbose_if after it was defined. 2012-06-28 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: tests: use the generalized default yylex. tests: AT_YYERROR_DEFINE: prepare for list of ints. skeletons: no longer define YYLSP_NEEDED. c++: do not export YYTOKEN_TABLE and YYERROR_VERBOSE. 2012-06-28 Akim Demaille tests: use the generalized default yylex. * tests/actions.at, tests/glr-regression.at, tests/regression.at: here. 2012-06-28 Akim Demaille tests: AT_YYERROR_DEFINE: prepare for list of ints. * tests/local.at (AT_YYERROR_DEFINE): Don't add quotes, check their presence to detect char/int types. * tests/actions.at, tests/conflicts.at, tests/glr-regression.at, * tests/push.at, tests/regression.at: Adjust. 2012-06-27 Akim Demaille skeletons: no longer define YYLSP_NEEDED. * data/c.m4, data/glr.cc: here. * NEWS, TODO: Adjust. 2012-06-27 Akim Demaille c++: do not export YYTOKEN_TABLE and YYERROR_VERBOSE. * src/output.c (prepare_symbols): Do not define b4_token_table. (prepare): Define b4_token_table_flag. * data/bison.m4 (b4_token_table_if): New. Arm it when error-verbose. * data/glr.c, data/yacc.c (YYTOKEN_TABLE): Remove. Use m4. * data/lalr1.cc: Likewise. (YYERROR_VERBOSE): Remove. * NEWS, doc/bison.texi: Document this. 2012-06-26 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: maint: use *.texi. 2012-06-26 Akim Demaille maint: use *.texi. This is more consistent with the other packages, and Automake-NG supports only *.texi. * doc/bison.texinfo: Rename as... * doc/bison.texi: this. * doc/Makefile.am, examples/calc++/Makefile.am: Adjust. 2012-06-26 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: tests: do not output m4 set up. tests: use the generic yyerror function. tests: use assert instead of plain abort. tests: improve the generic yylex implementation. tests: generalize the compilation macros. tests: fix confusion between api.prefix and name-prefix. maint: gitignores. yacc: work around the ylwrap limitation. 2012-06-26 Victor Santet warnings: raise warning for useless printers or destructors * src/scan-code.h (code_props): Add field 'is_used'. (CODE_PROPS_NONE_INIT): Adjust. * src/scan-code.l (code_props_plain_init, code_props_symbol_action_init) (code_props_rule_action_init): Instead of implementing several times the initialization of the code_props structures, use code_props_none_init. * src/symtab.c (symbol_check_defined): If a symbol does not have a destructor (resp. printer) but has a type which has a destructor (resp. printer), then set field 'is_used' to true. (semantic_type_check_defined): If a type has a destructor (resp. printer) but all symbols of this type have already a destructor (resp. printer), then raise a warning. * tests/input.at (Useless printers or destructors): New. 2012-06-26 Akim Demaille tests: do not output m4 set up. * tests/local.at (AT_BISON_OPTION_PUSHDEFS, AT_BISON_OPTION_POPDEFS): Use a diversion to avoid outputting comments etc. Removes 17k lines from testsuite (10% of the number of lines). 2012-06-26 Akim Demaille tests: use the generic yyerror function. * tests/actions.at (_AT_CHECK_PRINTER_AND_DESTRUCTOR): Factor. Use AT_YYERROR_DEFINE. Therefore, instead of using stdout, use and check stderr. * tests/glr-regression.at (Uninitialized location when reporting ambiguity): Use AT_YYERROR_DEFINE. 2012-06-26 Akim Demaille tests: use assert instead of plain abort. * tests/actions.at, tests/calc.at, tests/conflicts.at, * tests/cxx-type.at, tests/glr-regression.at, tests/input.at, * tests/named-refs.at, tests/regression.at, tests/torture.at, * tests/local.at: Prefer assert to abort. 2012-06-26 Akim Demaille tests: improve the generic yylex implementation. * tests/local.at (AT_YYSTYPE, AT_YYLTYPE): New. (AT_YYLEX_FORMALS): Use them. (AT_YYLEX_DEFINE): Be independent of the location implementation. 2012-06-26 Akim Demaille tests: generalize the compilation macros. * tests/local.at (AT_COMPILE, AT_COMPILE_CXX): If OUTPUT ends with ".o", then append the "natural" extension for the input file (.c or .cc). If there is no source, pass -c. * tests/headers.at, tests/input.at, tests/regression.at: Adjust. 2012-06-26 Akim Demaille tests: fix confusion between api.prefix and name-prefix. * tests/local.at (AT_NAME_PREFIX): Take api.prefix into account. (AT_API_PREFIX): Rename as... (AT_API_prefix): this. Do not take %name-prefix into account. Fix misuses. 2012-06-26 Akim Demaille maint: gitignores. 2012-06-25 Victor Santet warnings: useless semantic types * src/symtab.h (symbol_list): Represent semantic types as structure 'semantic_type'. * src/symlist.c (symbol_list_type_new): Allocate this structure. (symbol_list_code_props_set): Set this semantic type's status to used if it was not declared. * src/symtab.c (semantic_types_sorted): New. (semantic_type_new): Set the new semantic type's location appropriately. (symbol_check_defined): If a symbol has a type, then set this type's status to "declared". (semantic_type_check_defined, semantic_type_check_defined_processor): Same as symbol_check_defined and symbol_check_defined_processor, but for semantic types. (symbol_check_defined): Check semantic types usefulness. * src/symtab.h (semantic_type): New fields 'location' and 'status'. * src/symtab.h, src/symtab.c (semantic_type_new) (semantic_type_from_uniqstr, semantic_type_get): Accept a location as a supplementary argument. * tests/input.at (Unassociated types used for printer of destructor): New. * tests/c++.at (AT_CHECK_VARIANTS): Fix an error caught by this commit. 2012-06-25 Akim Demaille yacc: work around the ylwrap limitation. * data/yacc.c (b4_shared_declarations): Include the header guards. Do not include the header in the *.c file, duplicate it. * NEWS (Future Changes): Extend, and announce the forthcoming change about the use of the parser header. 2012-06-25 Akim Demaille fix for printers and destructors. The previous "code_props: factor more" patch sends has_%printer etc. to m4, instead of has_printer. * src/output.c (prepare_symbol_definitions): Fix value of pname. 2012-06-25 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: tests: more uniformity. tests: handle locations in a more generic way. tests: handle locations in the generic yyerror functions. tests: fix AT_CHECK_CALC. tests: improve infrastructure tests: factor. skeletons: minor style changes tests: AT_LANG. c skeletons: factor the declaration of yylloc and yylval. news: condemn YYPARSE_PARAM and YYLEX_PARAM. maint: regen. 2012-06-22 Akim Demaille code_props: factor more. * src/symtab.h, src/symtab.c (code_props_type_string): No longer static. * src/output.c (CODE_PROPS): Remove, we can now iterate on both the destructor and the printer. (SET_KEY2): New. 2012-06-22 Victor Santet maint: factor the handling of %printer and %destructor There is too much code duplication between %printer and %destructor. We used to have two functions for each action: the first one for destructors, the second one for printers. Factor using a 'code_props_type', and an array of code_props instead of two members. * src/symlist.h, src/symlist.c (symbol_list_destructor_set) (symbol_list_printer_set): Fuse into... (symbol_list_code_props_set): this. * src/symtab.h, src/symtab.c (default_tagged_destructor) (default_tagged_printer): Fuse into... (default_tagged_code_props): this. (default_tagless_destructor, default_tagless_printer) (default_tagless_code_props): Likewise. (code_props_type_string): new. (symbol_destructor_set, symbol_destructor_get, semantic_type_destructor_set) (default_tagged_destructor_set, default_tagless_destructor_set) (symbol_printer_set, symbol_printer_get, semantic_type_printer_set) (default_tagged_printer_set, default_tagless_printer_set): Replace by... (symbol_code_props_set, symbol_code_props_get, semantic_type_code_props_set) (default_tagged_code_props_set, default_tagless_code_props_set): these. * src/parse-gram.y (grammar_declaration): Adjust. * src/output.c (CODE_PROP, grammar_declaration): Ditto. * src/reader.c (symbol_should_be_used): Ditto. 2012-06-22 Akim Demaille tests: more uniformity. * tests/local.at (AT_LEX_FORMALS, AT_LEX_ARGS, AT_LEX_PRE_FORMALS) (AT_LEX_PRE_ARGS): Rename as... (AT_YYLEX_FORMALS, AT_YYLEX_ARGS, AT_YYLEX_PRE_FORMALS) (AT_YYLEX_PRE_ARGS): these, for consistency. (AT_API_PREFIX): Take %name-prefix into account. (AT_YYLEX_PROTOTYPE): New. Use it. * tests/actions.at, tests/calc.at, tests/cxx-type.at: Adjust to use them. 2012-06-22 Akim Demaille tests: handle locations in a more generic way. * tests/local.at (AT_YYERROR_PROTOTYPE): New. Use it. * tests/cxx-type.at: Extensive revamp to use a more traditional quotation scheme, and to use the generic yyerror implementation. Prefer Autotest macros to CPP macros. * tests/java.at: . 2012-06-22 Akim Demaille tests: handle locations in the generic yyerror functions. * tests/local.at (AT_YYERROR_DECLARE_EXTERN, AT_YYERROR_DECLARE) (AT_YYERROR_DEFINE): Handle locations for C and C++. * tests/calc.at: Use it for C++ (as C has extra arguments which are not yet handled by AT_BISON_OPTION_PUSHDEFS). * tests/actions.at: Adjust. 2012-06-22 Akim Demaille tests: fix AT_CHECK_CALC. * tests/calc.at (AT_CHECK_CALC): Contrary to its documentation, the test was skipped if given a second argument. Unused feature, remove it. 2012-06-22 Akim Demaille tests: improve infrastructure * tests/local.at (AT_LANG): Use c++ instead of cxx for C++. Adjust dependencies. (AT_YYERROR_DECLARE_EXTERN, AT_YYERROR_DECLARE): Issue nothing for C++/Java. (AT_YYERROR_DEFINE): Use m4_case. (AT_JAVA_COMPILE): Use AT_SKIP_IF. 2012-06-21 Akim Demaille tests: factor. * tests/glr-regression.at, tests/output.at, tests/push.at, * tests/regression.at, tests/torture.at, tests/actions.at: Use AT_YYLEX_* and AT_YYERROR_*. 2012-06-21 Akim Demaille skeletons: minor style changes * data/glr.c, data/yacc.c: here. 2012-06-21 Akim Demaille tests: AT_LANG. * tests/local.at (AT_BISON_OPTION_PUSHDEFS, AT_BISON_OPTION_POPDEFS): Define/undefine AT_LANGE (AT_LANG_COMPILE): New. (AT_FULL_COMPILE): Use AT_LANG. 2012-06-21 Victor Santet symtab: refactoring Prepares forthcoming changes. * src/symtab.c (symbols_do): Accept the hash table and the sorted list as arguments. Adjust dependencies. 2012-06-21 Akim Demaille maint: address syntax-check issues. * examples/calc++/local.mk: Space changes. * src/files.c: Avoid unmarked_diagnostics. * src/output.c: Remove useless include. 2012-06-21 Akim Demaille c skeletons: factor the declaration of yylloc and yylval. There is one difference: now, even without --defines, we generate extern declarations for these variables. The factoring is worth it. * data/c.m4 (b4_declare_yylstype): Declare them. * data/glr.c, data/yacc.c: Adjust. 2012-06-21 Akim Demaille news: condemn YYPARSE_PARAM and YYLEX_PARAM. * NEWS: here. (Bison 1.875): Add %parse-param and %lex-param. * doc/bison.texinfo: Spello. 2012-06-20 Akim Demaille fix warnings for useless %printer/%destructor The previous commit, which turns into a warning what used to be an error: %printer {} foo; %% exp: '0'; has two shortcomings: the warning is way too long (foo is reported to be useless later), and besides, it also turns into a warning much more serious errors: %printer {} foo; %% exp: foo; Reduce the amount to warnings in the first case, restore the error in the second. * src/symtab.h (status): Add a new inital state: undeclared. * src/symtab.c (symbol_new): Initialize to undeclared. (symbol_class_set): Simplify the logic of the code that neutralize the "redeclared" warning after the "redefined" one. (symbol_check_defined): "undeclared" is also an error. * src/reader.c (grammar_current_rule_symbol_append): Symbols appearing in a rule are "needed". * src/symlist.c (symbol_list_destructor_set, symbol_list_printer_set): An unknown symbol appearing in a %printer/%destructor is "used". * src/reduce.c (nonterminals_reduce): Do not report as "useless" symbols that are not used (e.g., those that for instance appeared only in a %printer). * tests/input.at (Undeclared symbols used for a printer or destructor): Improve the cover the cases described above. 2012-06-20 Akim Demaille gitignore: test-driver. 2012-06-20 Akim Demaille maint: style changes. * src/reduce.c (reduce_grammar_tables): Define variables with their initial value. 2012-06-20 Akim Demaille news: fixes. * NEWS: Fix spelling. 2012-06-20 Victor Santet warnings: used but undeclared symbols are warnings We used to raise an error if a symbol appears only in a %printer or %destructor. Make it a warning. * src/symtab.h (status): New enum. (symbol): Replace the binary "declared" with the three-state "status". Adjust dependencies. * src/symtab.c (symbol_check_defined): Needed symbols are an error, whereas "used" are simply warnings. * src/symlist.c (symbol_list_destructor_set, symbol_list_printer): Set symbol status to 'used' when associated to destructors or printers. * input.at (Undeclared symbols used for a printer or destructor): New. 2012-06-20 Akim Demaille maint: regen. * Makefile.am (regen): New target. 2012-06-20 Akim Demaille regen. 2012-06-20 Akim Demaille maint: regen. * Makefile.am (regen): New target. 2012-06-19 Akim Demaille tests: enhance AT_YYERROR_DEFINE. * tests/local.at: Handle the fact that locations are no longer needed with lalr1.cc. 2012-06-19 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: maint: formatting changes. tests: support api.prefix. tests: pacify font-lock-mode. tests: remove test covered elsewhere. tests: factor the declaration/definition of yyerror and yylex. regen. tests: portability issues. tests: call the parser from another compilation unit. glr.c, yacc.c: declare yydebug in the header. skeletons: use header guards. tests: improve AT_FULL_COMPILE. tests: reorder. tests: strengthen the test on generated headers inclusion yacc.c: instead of duplicating y.tab.h inside y.tac.c, include it. yacc.c: factor. 2012-06-19 Akim Demaille maint: formatting changes. * NEWS: Fix indentation of code snippets. Untabify. 2012-06-17 Akim Demaille tests: support api.prefix. * tests/local.at (AT_BISON_OPTION_PUSHDEFS, AT_BISON_OPTION_POPDEFS): Define AT_API_PREFIX. (AT_YYERROR_DEFINE, AT_YYERROR_DECLARE_EXTERN, AT_YYLEX_DECLARE_EXTERN) (AT_YYLEX_DEFINE): Use it. * tests/input.at, tests/regression.at, tests/torture.at: Add AT_BISON_OPTION_PUSHDEFS/POPDEFS. 2012-06-17 Akim Demaille tests: pacify font-lock-mode. * tests/local.at: here. 2012-06-17 Akim Demaille tests: remove test covered elsewhere. * tests/headers.at (%union and --defines): Remove, pretty useless and insignificant. 2012-06-17 Akim Demaille tests: factor the declaration/definition of yyerror and yylex. * tests/local.at (AT_YYERROR_DECLARE, AT_YYERROR_DECLARE_EXTERN) (AT_YYERROR_DEFINE, AT_YYLEX_DECLARE, AT_YYLEX_DECLARE_EXTERN) (AT_YYLEX_DEFINE): New. Must be used inside AT_BISON_OPTION_PUSHDEFS/POPDEFS pair. * tests/actions.at, tests/conflicts.at, tests/glr-regression.at, * tests/headers.at, tests/input.at, tests/named-refs.at, * tests/regression.at, tests/skeletons.at, tests/synclines.at, * tests/torture.at: Use them. 2012-06-17 Akim Demaille regen. 2012-06-17 Akim Demaille tests: portability issues. * tests/calc.at (AT_CALC_MAIN): Missing include reported by Hydra. 2012-06-15 Akim Demaille tests: call the parser from another compilation unit. In order to improve the testing of %defines, which exports the interface of the generated parser, change the calc.at tests so that when %defines is passed, main will be in another compilation unit. It loads the generated header. * tests/calc.at (AT_CALC_MAIN): New. Includes the definition of the global variables. Therefore, now declare them from the %requires section of the parser. Adjust to yydebug and yyparse being renamed by %name-prefix. 2012-06-15 Akim Demaille glr.c, yacc.c: declare yydebug in the header. * data/c.m4 (b4_declare_yydebug): New. * data/glr.c, data/yacc.c (b4_shared_declarations): Use it. Remove the corresponding code from the parser body. * NEWS: Doc this. 2012-06-15 Akim Demaille skeletons: use header guards. * data/glr.c, data/glr.cc, data/yacc.c: here. * NEWS: Document it. 2012-06-15 Akim Demaille tests: improve AT_FULL_COMPILE. * tests/local.at: Accept a third argument. Simplify quotation pattern. Calls for better refactoring, but will suffice for a while. 2012-06-15 Akim Demaille tests: reorder. * tests/calc.at (power): Move its definition, as a preparation for forthcoming changes. And space changes. 2012-06-15 Akim Demaille tests: strengthen the test on generated headers inclusion * tests/headers.at (AT_TEST_CPP_GUARD_H): Accept Bison directives. (Invalid CPP headers): Check glr. 2012-06-15 Akim Demaille yacc.c: instead of duplicating y.tab.h inside y.tac.c, include it. This is already what glr.c and lalr1.cc do. * data/yacc.c: here. 2012-06-15 Akim Demaille maint: xfdopen, and scope reduction. * src/files.h, src/files.c (xfdopen): New. * src/output.c (output_skeleton): Use it. Reduce the scope of argv. 2012-06-15 Akim Demaille maint: space changes * configure.ac, src/complain.c: space changes. 2012-06-13 Akim Demaille yacc.c: factor. yacc.c used to include two almost identical sections: one for the *.h file, and another for the *.c file. The main difference is that in the *.c file we used the yy* names (as %name-prefix is handled by "#define yy* *" before), while the *.hh used * names. Keep only the later. If this is troublesome, b4_shared_declarations can easily take the desired prefix as argument. * data/yacc.c (b4_shared_declarations): New. Use it to factor duplicated declarations. 2012-06-13 Stefano Lattarini (tiny change) cosmetics: prettify names for compiled object for bison * src/local.mk (src_bison_SHORTNAME): Define to "bison". 2012-06-13 Akim Demaille lalr1.cc: spello. * data/lalr1.cc: Reported by Gilles Espinasse. 2012-06-13 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: skeletons: factor yacc.c and glr.c. glr.c: minor refactoring. tests: remove all the -On flags. maint: fix spello. maint: improve release procedure instructions. gnulib: update readme-release. maint: cfg.mk: manual title. maint: cfg.mk: simplify maint: post-release administrivia 2012-06-12 Akim Demaille skeletons: factor yacc.c and glr.c. yacc.c and glr.c share common declarations. Their YYLTYPE are exactly equal, and their YYSTYPE are sufficiently alike to be fused (its declaration was protected by YYSTYPE_IS_DECLARED in yacc.c, but not in glr.c). Besides, yacc.c duplicated the definitions of YYLTYPE and YYSTYPE (*.h/*.c). * data/c.m4 (b4_declare_yylstype): New. * data/yacc.c, data/glr.c: Use it. 2012-06-12 Akim Demaille glr.c: minor refactoring. * data/glr.c (b4_shared_declarations): Move from the generated file section, to the M4 prologue. 2012-06-12 Akim Demaille tests: remove all the -On flags. * tests/atlocal.in: Here. Reported by Gilles Espinasse. 2012-06-12 Akim Demaille maint: fix spello. * README-hacking: Here. * THANKS: Reported by Gilles Espinasse. 2012-06-12 Akim Demaille maint: improve release procedure instructions. * gnulib: Update, in particular (README-release). * bootstrap.conf: don't require gendocs, provided by gnu-web-doc-update, provided by readme-release. * README-hacking: Update accordingly. 2012-06-07 Akim Demaille gnulib: update readme-release. * gnulib (readme-release): Now includes the modules it promotes. * bootstrap.conf: Simplify accordingly. 2012-06-07 Akim Demaille maint: cfg.mk: manual title. * cfg.mk (manuel_title): New. 2012-06-07 Akim Demaille maint: cfg.mk: simplify * cfg.mk: Remove bits provided by maint.mk. 2012-06-07 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2012-06-05 Akim Demaille maint: an envvar equal to "00" is 0. * src/output.c (prepare): here. Reported by Paul Eggert. 2012-06-05 Akim Demaille maint: don't use mbsr?chr. Basically, revert ba60c39547a445dee3e07920931b4d7a81843868's move to mbs* functions, which was prompted by -DGNULIB_POSIXCHECK. See and following. * bootstrap.conf: No longer ask for them. * src/files.c, src/getargs.c, src/location.c, * src/parse-gram.c, src/parse-gram.y, src/scan-gram.l, * src/symtab.c: s/mbs(r?chr)/str$1/g. 2012-06-05 Akim Demaille maint: use xconcat-filename. * bootstrap.conf (gnulib_modules): Request it. * src/output.h, src/output.c (compute_pkgdatadir): Rename as... (pkgdatadir): this. Adjust dependencies. * src/output.c (output_skeleton): Reduce the scope of "in". Use xconcatenated_filename to simplify the construction of the qualified paths to m4sugar.m4, bison.m4, and the selected skeleton. There are a few minor differences: the new code uses strchr instead of mbschr (but this was not really justified), and the new code does not garantee a single slash even if $BISON_PKGDATADIR ends with several (which was considered more accurate). See the discussion at . 2012-06-05 Akim Demaille maint: minor simplification * src/output.c (prepare): Assign use_push_for_pull_flag's value at its declaration. 2012-06-05 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: version 2.5.1 NEWS: prepare for 2.5.1. maint: update release procedure maint: fix comment typos maint: post-release administrivia 2012-06-05 Akim Demaille version 2.5.1 * NEWS: Record release date. 2012-06-05 Akim Demaille NEWS: prepare for 2.5.1. * NEWS: Be compliant with do-release-commit-and-tag. 2012-06-05 Akim Demaille maint: update release procedure * bootstrap.conf: Request do-release-commit-and-tag and readme-release. * README-hacking: Adjust. 2012-06-05 Jim Meyering maint: fix comment typos Using http://github.com/lyda/misspell-check, massage its output into sed commands to perform the suggested changes. Initially, I filtered out the THRU->Through changes, because that failed to retain capitalization in the grammar token. Instead, do this manually, beforehand: sed -i s/THRU/THROUGH/ tests/existing.at git ls-files|misspellings -f -|perl -nl \ -e '/^(.*?)\[(\d+)\]: (\w+) -> "(.*?)"$/ or next;' \ -e '($file,$n,$l,$r)=($1,$2,$3,$4); $q="'\''"; $r=~s/$q/$q\\$q$q/g;'\ -e 'print "sed -i $q${n}s!$l!$r!$q $file"'|bash 2012-05-24 Akim Demaille build: regen. 2012-05-24 Akim Demaille Merge tag 'v2.5.1_rc2' Bison 2.5.1_rc2. * tag 'v2.5.1_rc2': (34 commits) Bison 2.5.1_rc2. doc: fixes. build: fix ChangeLog generation. c++: compute the header guards. skeletons: remove support for unused directive. lalr1.cc: improve Doxygen documentation. lalr1.cc: extract stack.hh. news: convert to double quotes. space changes. build: do not prototype flex-generated functions. build: fix ChangeLog generation. Bison 2.5.1_rc1. tests: save/restore Autotest special files when checking XML support. tests: AT_SAVE_SPECIAL_FILES / AT_RESTORE_SPECIAL_FILES. tests: honor TESTSUITEFLAGS in all the check targets. build: do not enable c++ warnings on 0 when nullptr is not supported. maint: update gnulib. build: config.in.h. build: move silent rules. glr.c: reduce variable scopes. maint: maintainer-release-check. maint: shush a syntax-check. maint: prefer "commit message" to "log entry". command line: fix minor leaks. maint: we no longer maintain the ChangeLog. maint: fix the generation of the synclines for bison's parser. maint: regen. maint: import the xmemdup0 gnulib module. maint: remove left-over gnulib modules. maint: ignore files imported by autopoint. build: AC_PROG_LEX: use more readable variable names. maint: regen src/parse-gram.[ch] maint: simplify parse-gram.y maint: s/strncpy/memcpy/, when equivalent 2012-05-23 Akim Demaille maint: post-release administrivia * NEWS: Add header line for next release. * .prev-version: Record previous version. * cfg.mk (old_NEWS_hash): Auto-update. 2012-05-23 Akim Demaille Bison 2.5.1_rc2. * NEWS: Update. 2012-05-23 Akim Demaille doc: fixes. * doc/bison.texinfo: Fix errors spotted by syntax-check. 2012-05-23 Akim Demaille build: fix ChangeLog generation. * gnulib: Update to get newest gitlog-to-changelog. * bootstrap: Update. * Makefile.am (gen-ChangeLog): Fix for Bison's git log style. 2012-05-21 Akim Demaille c++: compute the header guards. This is a frequent request. Recently pointed out by Wei Song, . * data/c.m4 (b4_tocpp, b4_cpp_guard, b4_cpp_guard_open) (b4_cpp_guard_close): New. * data/lalr1.cc, data/location.cc, data/stack.hh: Use them. * TODO (Header Guards): Move to... * NEWS: here. Formatting changes. 2012-05-21 Akim Demaille skeletons: remove support for unused directive. * src/scan-skel.l (@dir_prefix@): Remove support, has never been used, not even in the commit that introduced it, 2b81e969ea04c1a6502928ba7e847ec8ff7dcb2f. 2012-05-21 Akim Demaille lalr1.cc: improve Doxygen documentation. * data/location.cc: Qualify file names with directory name. 2012-05-21 Akim Demaille lalr1.cc: extract stack.hh. See commit 51bacae6b58fd5c6cce861f00440dc917384625e. * data/stack.hh: New, extracted from... * data/lalr1.cc: here. * data/Makefile.am: Adjust. 2012-05-21 Akim Demaille news: convert to double quotes. * NEWS: Convert from `quoted' to "quoted". Reported by Stefano Lattarini. http://lists.gnu.org/archive/html/bison-patches/2012-05/msg00039.html 2012-05-21 Akim Demaille space changes. * src/flex-scanner.h: Indent nested cpp directives. 2012-05-21 Akim Demaille build: do not prototype flex-generated functions. Some versions of Flex, possibly modified by the distribution package maintainers, have incompatible signatures. Since newer versions of Flex prototype their functions, avoid the conflicts in that case. Reported by Stefano Lattarini. . * src/flex-scanner.h (FLEX_VERSION_GT): New. Use it to issue prototypes for flex-generated functions only for versions up to 2.5.31, in accordance with the comment. See commit dc9701e848f27ae64b6ddcf809580998667d60f2. Use it to define yylex_destroy when needed. 2012-05-16 Akim Demaille build: fix ChangeLog generation. * Makefile.am (gen-ChangeLog): Fix for VPATH builds. 2012-05-14 Akim Demaille Bison 2.5.1_rc1. * NEWS: Update. * src/parse-gram.c, src/parse-gram.h: Regen. 2012-05-11 Akim Demaille tests: save/restore Autotest special files when checking XML support. Currently the test 248, "parse-gram.y: LALR = IELR", fails BISON_TEST_XML is set. * tests/local.at (AT_BISON_CHECK_XML): Belt: Save/restore files. * tests/regression.at (parse-gram.y: LALR = IELR): Suspenders: Don't rely on expout. Each one of these changes suffices. 2012-05-11 Akim Demaille tests: AT_SAVE_SPECIAL_FILES / AT_RESTORE_SPECIAL_FILES. Some of our macros play with expout and other Autotest special files, which may break their callers (e.g., currently TESTSUITEFLAGS='248 BISON_TEST_XML=1' fails). There is already some support for this. Expand it to be ready to use it elsewhere. * tests/local.at (AT_RESTORE_SPECIAL_FILES, AT_SAVE_SPECIAL_FILES) (at_save_special_files, at_restore_special_files): New. (AT_BISON_CHECK_NO_XML): Use them. 2012-05-11 Akim Demaille tests: honor TESTSUITEFLAGS in all the check targets. * tests/Makefile.am (installcheck-local): Simplify. (maintainer-check-posix, maintainer-check-valgrind): Honor $(TESTSUITEFLAGS). 2012-05-11 Akim Demaille build: do not enable c++ warnings on 0 when nullptr is not supported. * configure.ac (WARN_CXXFLAGS): Enable -Wzero-as-null-pointer-constant only when nullptr is supported.. 2012-05-11 Akim Demaille maint: update gnulib. * bootstrap, gnulib: Update. 2012-05-09 Akim Demaille build: config.in.h. Historically we used config.hin (where everybody else used config.h.in) to please DOS. Now that we use gnulib, there are already tons of files with several dots, especially *.in.h. * configure.ac: Rename config.hin as config.in.h. 2012-05-09 Akim Demaille build: move silent rules. * tests/Makefile.am: In the generation of the test suite. 2012-05-09 Akim Demaille glr.c: reduce variable scopes. * data/glr.c: Where appropriate, fuse variable declarations followed by assignments by variable declarations with a value. Where appropriate, introduce new scopes to limit variable spans. 2012-05-08 Akim Demaille maint: maintainer-release-check. * tests/Makefile.am (maintainer-release-check): New. * Makefile.am (MAINTAINER_CHECKS): New. Support maintainer-release-check. * README-hacking: Document it, and syntax-check too. 2012-05-08 Akim Demaille maint: shush a syntax-check. * cfg.mk: lib/timevar is not planned to be gnulib'ed, as it comes from GCC. 2012-05-08 Akim Demaille maint: prefer "commit message" to "log entry". * README-hacking: here. Suggested by Stefano Lattarini. 2012-05-08 Akim Demaille command line: fix minor leaks. * src/getargs.c (getargs): Free pointers before allocating them new content. 2012-05-08 Akim Demaille maint: we no longer maintain the ChangeLog. * .gitattributes: No need to merge it. * README-hacking: Update release instructions. 2012-05-06 Akim Demaille maint: fix the generation of the synclines for bison's parser. * tests/bison.in: Import from master the changes that make this script generate synclines that are independant of the builddir/srcdir user's set up. 2012-05-06 Akim Demaille maint: regen. * src/parse-gram.c, src/parse-gram.h: Regen. 2012-05-06 Akim Demaille maint: import the xmemdup0 gnulib module. * bootstrap.conf: Require this module. * src/parse-gram.y: Include xmemdup0.h. 2012-05-06 Akim Demaille maint: remove left-over gnulib modules. * bootstrap.conf (gnulib_modules): Remove pipe-posix. * lib/.gitignore, m4/.gitignore: Remove files that we no longer use. 2012-05-06 Akim Demaille maint: ignore files imported by autopoint. * m4/.gitignore: here. 2012-05-06 Akim Demaille build: AC_PROG_LEX: use more readable variable names. * m4/flex.m4 (AC_PROG_LEX): Prefer LEX_IS_FLEX to FLEX. Prefer true/false to yes/no for such variables. * configure.ac: Adjust. 2012-05-06 Jim Meyering maint: regen src/parse-gram.[ch] 2012-05-06 Jim Meyering Akim Demaille maint: simplify parse-gram.y * src/parse-gram.y (add_param): Use xmemdup0 in place of xmalloc+memcpy, and strspn in place of an open-coded loop. 2012-05-06 Jim Meyering maint: s/strncpy/memcpy/, when equivalent * src/output.c (output_skeleton): Use memcpy, not strncpy, since the source is known to fit in the destination buffer. * src/parse-gram.y (%skeleton): Likewise. 2012-05-04 Akim Demaille glr.c: formatting changes. * data/glr.c: Fix indentation. 2012-05-04 Akim Demaille Merge remote-tracking branch 'origin/master' * origin/master: glr.c: untabify. glr.cc: untabify. glr.cc: formatting changes. glr.cc: remove unused signature. glr.cc: properly declare locations are const where appropriate. doc: fix @xref. 2012-05-04 Akim Demaille glr.c: untabify. * data/glr.c: here. 2012-05-04 Akim Demaille glr.cc: untabify. * data/glr.cc: here. 2012-05-04 Akim Demaille glr.cc: formatting changes. * data/glr.cc: Fit in 80 columns. 2012-05-04 Akim Demaille glr.cc: remove unused signature. * data/glr.cc (yydestruct_): Not used, remove. It is yydestruct which is used. 2012-05-04 Akim Demaille glr.cc: properly declare locations are const where appropriate. * data/glr.cc (yyerror): The location is const. 2012-05-04 Akim Demaille doc: fix @xref. * doc/bison.texinfo: here. 2012-05-04 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: (22 commits) tests: ignore code coverage/profiling failure messages doc: fix some invalid @ref. build: fix previous commit. install-pdf: fix. NEWS: Update. %printer: support both yyo and yyoutput. doc: mfcalc: demonstrate %printer. tests: style changes. build: require Flex. build: flex.m4: check for Flex. build: flex.m4: quote properly. build: flex.m4. build: autoconf: update. glr: eliminate last bits of unwanted locations. NEWS: 2.6 will drop K&R. TODO: remove dead items. TODO: import from master. gnulib: update. maint: update NEWS. doc: fix index. doc: fix documentation of YYERROR. c++: more YY_NULL 2012-05-02 Akim Demaille tests: ignore code coverage/profiling failure messages The Hydra buildfarm provides code coverage analysis. For some reason, in some test cases, code coverage data seem to be incompatible, and generate error messages at parser run-time. Ignore these messages so that (i) these tests do pass, (ii) coverage results be provided by Hydra. * tests/local.at (AT_PARSER_CHECK): Ignore messages for failed merges of code coverage/profiling results. 2012-04-16 Akim Demaille doc: fix some invalid @ref. * doc/bison.texinfo: Fix incorrect @ref uses. 2012-04-16 Akim Demaille build: fix previous commit. * bootstrap: Update from gnulib. 2012-04-16 Akim Demaille install-pdf: fix. * gnulib: Fix install-pdf in po/ and runtime-po/. Reported by Hans Aberg. Fixed by Joel E. Denny. http://lists.gnu.org/archive/html/bug-bison/2011-05/msg00008.html 2012-04-16 Akim Demaille NEWS: Update. * NEWS: Spell check. (%printer): is now documented. 2012-04-16 Akim Demaille %printer: support both yyo and yyoutput. lalr1.cc used to support yyo, but not yyoutput. Support both, but document only yyoutput (at least until there is some consensus on this). * data/c.m4 (yy_symbol_value_print): Also support yyo. * data/glr.cc (yy_symbol_value_print_): Support both yyo and yyoutput. * data/lalr1.cc: Also support yyoutput. * doc/bison.texinfo: Explicitly use yyoutput in the examples. * examples/mfcalc/mfcalc.test: Test the -p option. 2012-04-16 Akim Demaille doc: mfcalc: demonstrate %printer. * doc/bison.texinfo (Printer Decl): New. Number mfcalc.y snippets so that they are output in the proper order. (The mfcalc Main): Use yydebug. (Debugging): Simplify the text. (Enabling Traces, Mfcalc Traces, The YYPRINT Macro): New. (Table of Symbols): Document YYPRINT and YYFPRINTF. 2012-04-16 Akim Demaille tests: style changes. * tests/input.at: Use "print" in %printer instead of "destroy". It is unused, so we don't care, yet it is less surprising. * tests/actions.at: Comment changes. 2012-04-16 Akim Demaille %printer: support both yyo and yyoutput. lalr1.cc used to support yyo, but not yyoutput. Support both, but document only yyoutput (at least until there is some consensus on this). * data/c.m4 (yy_symbol_value_print): Also support yyo. * data/glr.cc (yy_symbol_value_print_): Support both yyo and yyoutput. * data/lalr1.cc: Also support yyoutput. * doc/bison.texinfo: Explicitly use yyoutput in the examples. * examples/mfcalc/mfcalc.test: Test the -p option. 2012-04-16 Akim Demaille doc: mfcalc: demonstrate %printer. * doc/bison.texinfo (Printer Decl): New. Number mfcalc.y snippets so that they are output in the proper order. (The mfcalc Main): Use yydebug. (Debugging): Simplify the text. (Enabling Traces, Mfcalc Traces, The YYPRINT Macro): New. (Table of Symbols): Document YYPRINT and YYFPRINTF. 2012-04-16 Akim Demaille tests: style changes. * tests/input.at: Use "print" in %printer instead of "destroy". It is unused, so we don't care, yet it is less surprising. * tests/actions.at: Comment changes. 2012-04-10 Akim Demaille build: require Flex. * configure.ac: Require Flex. 2012-04-10 Akim Demaille build: flex.m4: check for Flex. * m4/flex.m4 (_AC_PROG_LEX_YYTEXT_DECL): Check that $LEX supports some of the Flex options, and exclusive start conditions. Define FLEX to 'yes'/'', as AC_PROG_CC does for GCC. 2012-04-10 Akim Demaille build: flex.m4: quote properly. * m4/flex.m4: Use quotes more systematically. 2012-04-10 Akim Demaille build: flex.m4. * m4/flex.m4: New. An exact copy of what is in Autoconf currently. 2012-04-10 Akim Demaille build: autoconf: update. * submodules/autoconf: Update. There are no changes in data/m4sugar/foreach.m4, and the changes in data/m4sugar/m4sugar.m4 are minor. 2012-04-10 Akim Demaille glr: eliminate last bits of unwanted locations. * data/glr.c (YYLTYPE): Do not define when locations are not demanded. Adjust all dependencies. 2012-04-10 Akim Demaille NEWS: 2.6 will drop K&R. * NEWS: here. (glr.c): Fix a spello. 2012-04-09 Akim Demaille TODO: remove dead items. * TODO (Documentation, %printer, Java): Remove, already done (or just waiting for approval). (Fortran, BTYacc): Remove, there does not seem to be demand. 2012-04-09 Akim Demaille TODO: import from master. * TODO: Copy the current version. 2012-04-08 Akim Demaille tests: fix bison wrapper. * tests/bison.in (PERL): Fix. 2012-04-08 Akim Demaille doc: fix some invalid @ref. * doc/bison.texinfo: Fix incorrect @ref uses. 2012-04-08 Akim Demaille build: extexi: support out-of-order blocks. * examples/extexi (%file_output): Remove. (&process): Accept "FILE: BLOCK-NUM" requests. 2012-04-08 Akim Demaille build: look for Perl in configure. Bison uses "/usr/bin/perl" or "perl" in several places, and it does not appear to be a problem. But, at least to make it simpler to change PERL on the make command line, check for perl in configure. * configure.ac (PERL): New. * doc/Doxyfile.in, doc/local.mk, examples/local.mk, * tests/bison.in: Use it. 2012-04-08 Akim Demaille maint: rewrite extexi in Perl. * examples/extexi: Rewrite in Perl. * examples/local.mk (extract): Adjust. 2012-04-07 Akim Demaille build: simplify clean. * doc/local.mk (CLEANFILES): Since the previous commit, there a no longer such files. * Makefile.in (CLEANFILES): Initialize here. 2012-04-07 Akim Demaille gnulib: update. * bootstrap.conf (bootstrap_sync): True again. It was disabled while waiting for changes to be integrated in gnulib's bootstrap, which was done long ago. * bootstrap, gnulib: Update. 2012-04-04 Akim Demaille maint: update NEWS. * NEWS: Fix entry about __attribute__. Reorder by "decreasing" order of importance. 2012-04-04 Akim Demaille doc: fix index. http://lists.gnu.org/archive/html/bison-patches/2012-04/msg00006.html * doc/bison.texinfo: Avoid using @def* variant with more than the defined entity as main entity, as it results in an incorrect index. For instance, don't document {return YYERROR;}, which results in a single index entry "return YYERROR;", but rather as typed function whose return type is "type", and whose argument list is ";". 2012-04-04 Akim Demaille doc: fix documentation of YYERROR. * doc/bison.texinfo (Table of Symbols): Fix the documentation of YYERROR by copying that from "Action Features". 2012-04-01 Akim Demaille build: fix distcheck issues. For some reason it seems that texi2dvi -o no longer forces --clean mode, so we have stray TeX compilation files staying in top_builddir since TeX is run from there. While at it, upgrade the generation of the (completely obsolete) reference card. Target PDF. * doc/local.mk (TEXI2DVI): Pass --build-dir. (CLEANDIRS): More accurate. (doc/refcard.dvi): Replace with... (doc/refcard.pdf): this. Adjust dependencies. 2012-04-01 Akim Demaille build: don't rely on $< in non-pattern rules. * doc/local.mk, tests/local.mk: here. Reported by Stefano Lattarini. 2012-04-01 Akim Demaille doc: upgrade Doxyfile. * doc/Doxyfile.in: Run doxygen -u. Prompted by Tim Landscheidt. 2012-04-01 Akim Demaille doc: help Doxygen find our files. * doc/Doxyfile.in (INCLUDE_PATH): here. 2012-04-01 Tim Landscheidt Fix Doxygen generation and clean-up. * doc/Doxyfile.in: Amend OUTPUT_DIRECTORY. * doc/local.mk (html-local): Amend working directory. (CLEANDIRS): Fix "html", remove "latex". 2012-04-01 Tim Landscheidt Fix Doxygen comment. * src/InadequacyList.h: s###. 2012-04-01 Akim Demaille c++: more YY_NULL Caught by maintainer-check-g++. * data/glr.c, data/lalr1.cc, data/yacc.c, tests/cxx-type.at, * tests/glr-regression.at, tests/push.at: When simple to do, avoid expliciting the null ptr. Otherwise use YY_NULL. 2012-04-01 Akim Demaille c++: more YY_NULL Caught by maintainer-check-g++. * data/glr.c, data/lalr1.cc, data/yacc.c, tests/cxx-type.at, * tests/glr-regression.at, tests/push.at: When simple to do, avoid expliciting the null ptr. Otherwise use YY_NULL. 2012-04-01 Akim Demaille Merge remote-tracking branch 'origin/maint' * origin/maint: bump to 2012 in skeletons. build: remove ancient Autoconf tests. doc: c++: complete the location documentation. c++: locations: provide convenience constructors. c++: locations: remove useless "inline". glr: do not use locations when they are not requested c++: use nullptr for C++11. build: simplify and improve the compiler warnings for tests. gnulib: update. maint: formatting changes. NEWS: update. Java: Fix syntax error handling without error token. tests: beware of -pedantic on large #line numbers. tests: when using the C++ compiler, use its flags too. 2012-04-01 Akim Demaille bump to 2012 in skeletons. * data/glr.c, data/glr.cc, data/lalr1.cc, data/lalr1.java, * data/location.cc, data/yacc.c: Bump copyright year ranges. 2012-04-01 Akim Demaille build: remove ancient Autoconf tests. lib/subpipe.c was removed in 47fa574761319b0a422691223c9b8a9a72f36aa2. * m4/subpipe.m4: Remove. * configure.ac (BISON_PREREQ_SUBPIPE): Remove. 2012-03-31 Akim Demaille doc: c++: complete the location documentation. * data/location.cc (position::initialize, location::initialize): Also accept line and column, with default values. * doc/bison.texinfo (C++ position, C++ location): New nodes. Describe more thoroughly these classes. Fix several Texinfo misuses. 2012-03-31 Akim Demaille c++: locations: provide convenience constructors. * data/location.cc (position::position): Accept file, line and column as arguments with default values. Always qualify initial line and column literals as unsigned. (location::location): Provide convenience constructors. 2012-03-31 Akim Demaille c++: locations: remove useless "inline". * data/location.cc: "inline" is implicit when defining methods in the class definition. 2012-03-31 Akim Demaille glr: do not use locations when they are not requested When the test suite runs with -O2 and warnings enabled, G++ complains of locations being used, but not initialized. The simplest is to not use locations. * data/glr.c (b4_locuser_formals, b4_locuser_args): New. Use them when locations should not be used. Use b4_locations_if where appropriate. (yyuserAction): Modify the order to the arguments to make it more alike the other routines, and to make use of b4_locuser_args simpler. 2012-03-31 Akim Demaille c++: use nullptr for C++11. C++11 introduces "nullptr" which plays the role of C's NULL, in replacement of "0". Fix the C++ skeletons to avoid warnings about uses of "0" in place of "nullptr", and improve C skeletons to also use this "nullptr" when compiled with a C++11 compiler. * configure.ac: More C++ warnings. * NEWS (2.5.1): Document this. * data/c++.m4, data/c.m4 (b4_null_define): New. (b4_null): Use YY_NULL instead of 0. * data/glr.c, data/lalr1.cc, data/location.cc, data/yacc.c: Call b4_null_define/b4_null where appropriate. Use YY_NULL instead of NULL. * data/location.cc (initialize): Accept a default argument, YY_NULL. * tests/actions.at, tests/calc.at: Adjust. * data/glr.c, lib/libiberty.h, src/system.h (__attribute__): Do not disable it when __STRICT_ANSI__ is defined, as, for instance, it disables the __attribute__((unused)) which protects us from some compiler warnings. This was already done elsewhere in Bison, in 2001, see 4a0d89369599a2cea01f4fbdf791f426a02cb5a3. * tests/regression.at: Adjust output. 2012-03-30 Akim Demaille build: simplify and improve the compiler warnings for tests. * configure.ac (warn_common, warn_c, warn_cxx): New. Use them to compute independently the options supported by the C and C++ compilers. Don't AC_SUBST the variables passed to gl_WARN_ADD: it does it for us. (WARN_CFLAGS_TEST, WARN_CXXFLAGS_TEST): Don't aggregate $WARN_CFLAGS and $WARN_CXXFLAGS in them now, leave it to atlocal.in. (O0CFLAGS, O0CXXFLAGS): Move their definition to... * tests/atlocal.in: here. Be more systematic between C and C++. Reorder to factor between variables. Propagate all of the variables when --compile-c-with-cxx. 2012-03-30 Akim Demaille gnulib: update. 2012-03-30 Akim Demaille maint: formatting changes. * src/system.h: Indent CPP directives using cppi. 2012-03-27 Akim Demaille NEWS: update. * NEWS: Java fixes, more about the doc changes, liby issues. 2012-03-27 Tim Landscheidt Java: Fix syntax error handling without error token. * data/lalr1.java (YYParser::parse): Here. * tests/java.at: Add test case. 2012-03-24 Akim Demaille tests: beware of -pedantic on large #line numbers. * tests/local.at (AT_TEST_TABLES_AND_PARSE): Don't pass -pedantic when compiling large canonical-LR parsers. Reported by Tys Lefering. http://lists.gnu.org/archive/html/bug-bison/2012-03/msg00025.html 2012-03-24 Akim Demaille tests: when using the C++ compiler, use its flags too. * tests/local.at: Go for colors. (--compile-c-with-cxx): New option. We used to pass "CC=$CXX" as command line argument, but it was not possible to adjust CFLAGS accordingly in atlocal, since it is loaded before assignments on the command line are honored (so that the command line takes precedence). * tests/atlocal.in: Implement it. * tests/local.mk: Use it. 2012-03-24 Akim Demaille tests: style changes in the Makefile. * tests/local.mk: Prefer passing variable assignment by the command line, instead of the environment, so that it is reported in the logs. Prefer single quotes for shell literal strings. 2012-03-24 Akim Demaille tests: beware of -pedantic on large #line numbers. * tests/local.at (AT_TEST_TABLES_AND_PARSE): Don't pass -pedantic when compiling large canonical-LR parsers. Reported by Tys Lefering. http://lists.gnu.org/archive/html/bug-bison/2012-03/msg00025.html 2012-03-24 Akim Demaille tests: when using the C++ compiler, use its flags too. * tests/local.at: Go for colors. (--compile-c-with-cxx): New option. We used to pass "CC=$CXX" as command line argument, but it was not possible to adjust CFLAGS accordingly in atlocal, since it is loaded before assignments on the command line are honored (so that the command line takes precedence). * tests/atlocal.in: Implement it. * tests/local.mk: Use it. 2012-03-24 Akim Demaille tests: fix dependencies. * tests/local.mk (check_SCRIPTS): Add atlocal and atconfig so that they are properly updated before running tests. (RUN_TESTSUITE_deps): New. Use it to factor the dependencies of "*-check" targets, especially those that don't bounce to the regular "check-local" target, since then they don't benefit from the proper dependencies (such as atlocal). 2012-03-19 Akim Demaille Merge remote-tracking branch 'fsf/maint' * fsf/maint: (404 commits) doc: update the --verbose report format. doc: spell check. doc: stmt, not stmnt. doc: save width. doc: reformat grammar snippets. doc: use only @example, not @smallexample. doc: style changes. doc: minor fixes to "Understanding" section tests: minor fixes/simplifications tests: be robust to quote style. maint: update gnulib. tests: be robust to POSIXLY_CORRECT being defined. doc: fix environment issues. regen. tests: fix regressions. glr: fix ambiguity reports. doc: stylistic improvements. maint: address sc_prohibit_doubled_word. maint: address sc_prohibit_always-defined_macros. maint: address sc_bindtextdomain, sc_program_name and sc_prohibit_HAVE_MBRTOWC. ... 2012-03-19 Akim Demaille doc: spell fix. * doc/bison.texinfo: here. Reported by Tim Landscheidt. 2012-03-19 Akim Demaille doc: update the --verbose report format. * doc/bison.texinfo (Understanding): Adjust to match the current format. 2012-03-19 Akim Demaille doc: spell check. * doc/bison.texinfo: here. 2012-03-19 Akim Demaille doc: stmt, not stmnt. * doc/bison.texinfo: s/stmnt/stmt/g. This is a much more common abbreviation for "statement". 2012-03-19 Akim Demaille doc: save width. * doc/bison.texinfo (Language and Grammar): Use the same layout for an example in all the versions, i.e., keep as general case what used to be used only for Info. 2012-03-19 Akim Demaille doc: reformat grammar snippets. * doc/bison.texinfo: Convert the grammar examples to use a narrower style. This helps fitting into the @smallbook constraints. http://lists.gnu.org/archive/html/bison-patches/2012-03/msg00011.html 2012-03-19 Akim Demaille doc: use only @example, not @smallexample. * doc/bison.texinfo: Convert all @smallexamples into @examples. Adjust layout where needed. 2012-03-19 Akim Demaille doc: style changes. * doc/bison.texinfo: Avoid line width issues with TeX. Upgrade ancient messages. Move some comments to better looking places. Add more @group. (Mfcalc Symbol Table): Reduce variable scopes. Prefer size_t for sizes. Prefer declarations with an initial value. Fix a @group environment. 2012-03-19 Paul Eggert doc: minor fixes to "Understanding" section * doc/bison.texinfo (Understanding): Minor wording fixes and improvements. Fixes problems reported in . 2012-03-19 Akim Demaille doc: update the --verbose report format. * doc/bison.texinfo (Understanding): Adjust to match the current format. 2012-03-19 Akim Demaille doc: spell check. * doc/bison.texinfo: here. 2012-03-19 Akim Demaille doc: stmt, not stmnt. * doc/bison.texinfo: s/stmnt/stmt/g. This is a much more common abbreviation for "statement". 2012-03-19 Akim Demaille doc: save width. * doc/bison.texinfo (Language and Grammar): Use the same layout for an example in all the versions, i.e., keep as general case what used to be used only for Info. 2012-03-19 Akim Demaille doc: reformat grammar snippets. * doc/bison.texinfo: Convert the grammar examples to use a narrower style. This helps fitting into the @smallbook constraints. http://lists.gnu.org/archive/html/bison-patches/2012-03/msg00011.html 2012-03-19 Akim Demaille doc: use only @example, not @smallexample. * doc/bison.texinfo: Convert all @smallexamples into @examples. Adjust layout where needed. 2012-03-19 Akim Demaille doc: style changes. * doc/bison.texinfo: Avoid line width issues with TeX. Upgrade ancient messages. Move some comments to better looking places. Add more @group. (Mfcalc Symbol Table): Reduce variable scopes. Prefer size_t for sizes. Prefer declarations with an initial value. Fix a @group environment. 2012-03-19 Akim Demaille c.m4: better newline control with b4_parse_param_use. * data/c.m4: Use m4_ifvaln instead of m4_ifval where applicable. (b4_parse_param_use): Switch order between two nested "if"s to avoid useless empty lines. Adjust callers to avoid useless lines. 2012-03-19 Akim Demaille glr.c: remove (broken) support for YYPRINT. YYPRINT uses yytoknum which glr does not define. Since YYPRINT is considered obsolete, and did not work, don't fix its support, remove it from glr.c. * data/c.m4 (yy_symbol_value_print): Use YYPRINT only for yacc.c. * TODO: Done. 2012-03-17 Paul Eggert doc: minor fixes to "Understanding" section * doc/bison.texinfo (Understanding): Minor wording fixes and improvements. Fixes problems reported in . 2012-03-15 Akim Demaille TODO: update. 2012-03-15 Akim Demaille gnulib: update. 2012-03-13 Akim Demaille tests: minor fixes/simplifications * tests/local.at (AT_BISON_CHECK_NO_XML): Simplify sed programs, quotation, and default value assignments. Ensure a proper value to the numeric variables. Reported by Lie Yan. http://lists.gnu.org/archive/html/bug-bison/2012-03/msg00000.html 2012-03-13 Akim Demaille maint: fix distcheck. * examples/local.mk (MAINTAINERCLEANFILES): Complete, and rename as... (CLEANFILES): this, * examples/calc++/local.mk, examples/mfcalc/local.mk, * examples/rpcalc/local.mk (CLEANFILES): Add the generated files. 2012-03-13 Akim Demaille tests: minor fixes/simplifications * tests/local.at (AT_BISON_CHECK_NO_XML): Simplify sed programs, quotation, and default value assignments. Ensure a proper value to the numeric variables. Reported by Lie Yan. http://lists.gnu.org/archive/html/bug-bison/2012-03/msg00000.html 2012-03-09 Akim Demaille tests: be robust to POSIXLY_CORRECT being defined. * tests/local.at (AT_BISON_CHECK_NO_XML): Check if POSIXLY_CORRECT is defined, not if it is defined to 1. Reported by Lie Yan. http://lists.gnu.org/archive/html/bug-bison/2012-03/msg00000.html 2012-03-09 Akim Demaille tests: be robust to quote style. See . * src/main.c (main): Define the quoting style we use. * tests/atlocal.in: Use ASCII style quotes during the tests. 2012-03-09 Akim Demaille maint: update gnulib. * gnulib: update. * src/scan-gram.l: Don't use the (former version of) STREQ. 2012-03-09 Akim Demaille tests: remove quote magic from the bison test wrapper. Basically, revert 4c4d35394d1bdb4dc3392482ab002bc111a3378f. * tests/bison.in: Leave bison's stderr as is. 2012-03-09 Akim Demaille tests: be robust to quote style. See . * src/main.c (main): Define the quoting style we use. * tests/atlocal.in: Use ASCII style quotes during the tests. 2012-03-09 Akim Demaille avoid direct strncmp calls. Before this change, bison would accept either .tab and _tab equivalently, whatever the current platform. Besides, it was not obeying everywhere to the possible definition of TAB_EXT to something else than .tab. For consistency, handle only TAB_EXT (".tab" on non DJGPP platforms). Support for "_tab" is neither documented, nor tested. * src/system.h (STRNCMP_LIT): New. From Jim Meyering. (STRPREFIX_LIT): New. * src/files.c, src/getargs.c: Use it. 2012-03-06 Akim Demaille tests: be robust to POSIXLY_CORRECT being defined. * tests/local.at (AT_BISON_CHECK_NO_XML): Check if POSIXLY_CORRECT is defined, not if it is defined to 1. Reported by Lie Yan. http://lists.gnu.org/archive/html/bug-bison/2012-03/msg00000.html 2012-02-24 Akim Demaille build: comment changes. * Makefile.am, examples/calc++/local.mk, examples/local.mk, * examples/mfcalc/local.mk, examples/rpcalc/local.mk, * lib/local.mk, src/local.mk, tests/local.mk: Make the copyright licenses more uniform. 2012-02-24 Akim Demaille build: fix more example extraction issues. * Makefile.am (dist_TESTS): New. (TESTS, EXTRA_DIST): Run and ship them. * examples/calc++/local.mk: examples/calc++/calc++.stamp no longer exists, don't try to ship it. (.yy.stamp): New recipe. Use it. * examples/calc++/local.mk, examples/mfcalc/local.mk, * examples/rpcalc/local.mk: Don't ship the sources. Adjust the CPPFLAGS: there is nothing left in srcdir. (MAINTAINERCLEANFILES): Remove, now we are in builddir. (TESTS): Rename as... (dist_TESTS): this. 2012-02-24 Akim Demaille maint: fix example extraction issues. calc++: don't rely on Automake to compile a C++ parser. Basically, revert commit 609b3d8096fb0cc1fa4d908b6e1a860ced260bda, Automake 1.11.3 is not safe enough for C++ parser. * examples/calc++/calc++-parser.hh: Remove. * examples/calc++/local.mk (examples/calc++/calc++-parser.stamp): New. examples: factor the extractions into a single step extexi had to be run in the extraction directory. Now, it can be given the files with expected output directory. This allows to use $(*_extracted) variables (before we had to list again their members, but limited to their base names). In turn, this also allows fusing the extraction recipes into a single one. Also, it is currently too hard (or requires too much duplication, since Make wants all the occurrences of the files to be prefixed with $(srcdir)/, which is something Automake cannot support for *_SOURCES) to work in the source tree. So extract, and compile scanners and parsers in the build tree. * examples/extexi (basename): New. (BEGIN): Now "file_wanted" maps base name to extracted file name. * examples/calc++/local.mk, examples/mfcalc/local.mk, * examples/rpcalc/local.mk: Fuse extraction rules into... * examples/local.mk: Here. (extract, extracted): New. 2012-02-23 Akim Demaille maint: use STREQ/STRNEQ. * doc/bison.texinfo: Space change. * src/system.h (STREQ, STRNEQ): New. * src/files.c, src/ielr.c, src/lalr.c, src/muscle-tab.c, * src/output.c, src/print.c, src/print_graph.c, * src/reader.c, src/scan-skel.l, src/tables.c, * src/uniqstr.c: Use them. * src/scan-gram.l: Do not use streq.h, use system.h's STREQ. * cfg.mk: The documentation is an exception. 2012-02-23 Akim Demaille doc: fix environment issues. * doc/bison.texinfo: Do not use @verbatim, in particular when we use @group inside. Use @quotation instead of @display for frequently asked questions, it looks much nicer. 2012-02-23 Akim Demaille doc: fix environment issues. * doc/bison.texinfo: Do not use @verbatim, in particular when we use @group inside. Use @quotation instead of @display for frequently asked questions, it looks much nicer. 2012-02-23 Akim Demaille regen. * src/parse-gram.h, src/parse-gram.c: regen. 2012-02-23 Akim Demaille tests: fix regressions. Exit status 63 is documented for version-mismatch. * bootstrap.conf (gnulib_modules): Remove sysexits. * src/system.h (EX_MISMATCH): Define. * src/parse-gram.y (version_check): Use it instead of EX_CONFIG. Missing includes. * tests/calc.at, tests/named-refs.at: Include assert.h. 2012-02-22 Akim Demaille maint: gitignore. * examples/mfcalc/.gitignore, examples/rpcalc/.gitignore: Fix. 2012-02-21 Akim Demaille regen. * src/parse-gram.c, src/parse-gram.h: regen. 2012-02-21 Akim Demaille tests: fix regressions. Exit status 63 is documented for version-mismatch. * bootstrap.conf (gnulib_modules): Remove sysexits. * src/system.h (EX_MISMATCH): Define. * src/parse-gram.y (version_check): Use it instead of EX_CONFIG. Missing includes. * tests/calc.at, tests/named-refs.at: Include assert.h. 2012-02-21 Akim Demaille tests: post-process stderr to normalize quotes. * tests/bison.in: Save bison's stderr, and convert gettextized quotes to plain ASCII. 2012-02-21 Akim Demaille glr: fix ambiguity reports. * tests/glr-regression.at (Ambiguity reports): New. 2012-02-21 Akim Demaille glr: fix ambiguity reports. Fix a regression introduced in commit 783aa653f4ca70a75919c8516b950494c612cbfe. * tests/glr-regression.at (Ambiguity reports): New. * data/glr.c (yyreportTree): Fix an offset error. 2012-02-19 Akim Demaille doc: stylistic improvements. * doc/bison.texinfo: Prefer "continue" to empty loop bodies. Add some @group/@end group to avoid poor page breaks. 2012-02-19 Akim Demaille maint: address sc_prohibit_doubled_word. * data/yacc.c, doc/bison.texinfo: Reword to avoid having to disable that check. * cfg.mk: No longer skip this test. 2012-02-19 Akim Demaille maint: address sc_prohibit_always-defined_macros. * cfg.mk: No longer skip it, except where EXIT_SUCCESS is used as a witness for stdlib.h. Skip this test when appropriate. * data/yacc.c: Drop a note about why EXIT_SUCCESS is defined here. 2012-02-19 Akim Demaille maint: address sc_bindtextdomain, sc_program_name and sc_prohibit_HAVE_MBRTOWC. * bootstrap.conf (gnulib_modules): Require progname. * src/complain.c, src/getargs.c, src/getargs.h, src/main.c: Use it. * cfg.mk (exclude): New. Use it. Skip lib/main.c for bindtextdomain and set_program_name. 2012-02-19 Akim Demaille maint: remove stray file. * config.hin: Remove. 2012-02-19 Akim Demaille doc: stylistic improvements. * doc/bison.texinfo: Prefer "continue" to empty loop bodies. Add some @group/@end group to avoid poor page breaks. 2012-02-19 Akim Demaille doc: check the rpcalc. * doc/bison.texinfo: Tag rpcalc.y snippets. Add missing includes. (Rpcalc Rules): Don't issue leading tabs. Complete an Info menu. Use @result. * examples/rpcalc/local.mk: New. * examples/rpcalc/rpcalc.test: New. * examples/local.mk: Use them. * examples/mfcalc/mfcalc.test: Remove dup test. * examples/test: Disable debug traces. 2012-02-19 Akim Demaille regen. * src/parse-gram.c, src/parse-gram.h: Regen. 2012-02-19 Akim Demaille maint: address sc_prohibit_doubled_word. * data/yacc.c, doc/bison.texinfo: Reword to avoid having to disable that check. * cfg.mk: No longer skip this test. 2012-02-19 Akim Demaille maint: address sc_prohibit_always-defined_macros. * cfg.mk: No longer skip it, except where EXIT_SUCCESS is used as a witness for stdlib.h. Skip this test when appropriate. * data/yacc.c: Drop a note about why EXIT_SUCCESS is defined here. 2012-02-19 Akim Demaille maint: address sc_bindtextdomain, sc_program_name and sc_prohibit_HAVE_MBRTOWC. * bootstrap.conf (gnulib_modules): Require progname. * src/complain.c, src/getargs.c, src/getargs.h, src/main.c: Use it. * cfg.mk (exclude): New. Use it. Skip lib/main.c for bindtextdomain and set_program_name. 2012-02-19 Akim Demaille maint: remove stray file. * config.hin: Remove. 2012-02-19 Akim Demaille bitset: fix an incorrect error message. * lib/bitset_stats.c: here. Reported by Stefano Lattarini. 2012-02-19 Akim Demaille maint: address some syntax-issues remaining after cherry-picking from master. * cfg.mk: Skip bison generated files, 2.5 is generating trailing blanks. This is already fixed in master. * tests/conflicts.at, tests/java.at: Fix white space issues. 2012-02-19 Akim Demaille regen. * src/parse-gram.c, src/parse-gram.h: Regen. 2012-02-19 Akim Demaille bitset: fix an incorrect error message. * lib/bitset_stats.c: here. Reported by Stefano Lattarini. 2012-02-19 Jim Meyering maint: reenable sc_m4_quote_check * cfg.mk (local-checks-to-skip): Reenable sc_m4_quote_check. * m4/dmalloc.m4: Add quotes. 2012-02-19 Akim Demaille maint: remove trailing empty lines. * cfg.mk: No longer skip sc_prohibit_empty_lines_at_EOF, except for parse-gram.h (generated). * examples/mfcalc/.gitignore, lib/.gitignore, m4/.gitignore, * po/.gitignore, runtime-po/.gitignore: Remove trailing/leading empty lines. 2012-02-19 Akim Demaille maint: avoid "magic number exit". * cfg.mk (local-checks-to-skip): No longer skip it. * bootstrap.conf (gnulib_modules): Add sysexits. * doc/bison.texinfo, etc/bench.pl.in, src/parse-gram.y, * src/system.h, tests/calc.at, tests/named-refs.at: Use assert where appropriate instead of "if (...) exit". Use symbolic exit status elsewhere. 2012-02-19 Akim Demaille maint: fix some syntax-check issues. * cfg.mk (local-checks-to-skip): Remove sc_prohibit_quotearg_without_use, sc_prohibit_strcmp, sc_unmarked_diagnostics, sc_useless_cpp_parens. (sc_unmarked_diagnostics): Skip DJGPP. * data/yacc.c, src/LR0.c, src/closure.c, * src/flex-scanner.h, src/gram.c, src/lalr.c, * src/print-xml.c, src/print.c, src/print_graph.c, * src/reader.c, src/reduce.c, src/tables.c: Don't use parens with cpp's defined. Remove useless includes. 2012-02-19 Akim Demaille maint: address a couple of syntax-check errors. * cfg.mk (local-checks-to-skip): Remove sc_error_message_period and sc_error_message_uppercase. Address the uncovered issues. * po/POTFILES.in: Add missing files. * src/symtab.c: Remove useless includes. * lib/bitset_stats.c, src/files.c, tests/glr-regression.at: Use conformant error messages. 2012-02-19 Akim Demaille maint: gnulib: upgrade. 2012-02-18 Akim Demaille maint: remove trailing empty lines. * cfg.mk: No longer skip sc_prohibit_empty_lines_at_EOF, except for parse-gram.h (generated). * examples/mfcalc/.gitignore, lib/.gitignore, m4/.gitignore, * po/.gitignore, runtime-po/.gitignore: Remove trailing/leading empty lines. 2012-02-18 Akim Demaille maint: regen. * src/parse-gram.c, src/parse-gram.h: regen. 2012-02-18 Akim Demaille maint: avoid "magic number exit". * cfg.mk (local-checks-to-skip): No longer skip it. * bootstrap.conf (gnulib_modules): Add sysexits. * doc/bison.texinfo, etc/bench.pl.in, src/parse-gram.y, * src/system.h, tests/calc.at, tests/named-refs.at: Use assert where appropriate instead of "if (...) exit". Use symbolic exit status elsewhere. 2012-02-18 Akim Demaille maint: fix some syntax-check issues. * cfg.mk (local-checks-to-skip): Remove sc_prohibit_quotearg_without_use, sc_prohibit_strcmp, sc_unmarked_diagnostics, sc_useless_cpp_parens. (sc_unmarked_diagnostics): Skip DJGPP. * data/yacc.c, src/LR0.c, src/closure.c, * src/flex-scanner.h, src/gram.c, src/lalr.c, * src/print-xml.c, src/print.c, src/print_graph.c, * src/reader.c, src/reduce.c, src/tables.c: Don't use parens with cpp's defined. Remove useless includes. 2012-02-18 Akim Demaille maint: address a couple of syntax-check errors. * cfg.mk (local-checks-to-skip): Remove sc_error_message_period and sc_error_message_uppercase. Address the uncovered issues. * po/POTFILES.in: Add missing files. * src/symtab.c: Remove useless includes. * lib/bitset_stats.c, src/files.c, tests/glr-regression.at: Use conformant error messages. 2012-02-18 Akim Demaille maint: gnulib: upgrade. 2012-02-17 Akim Demaille doc: mfcalc: fix includes. * doc/bison.texinfo: math.h is needed early. 2012-02-17 Akim Demaille examples: factor the test suite. * examples/mfcalc/test, examples/calc++/test: Extract the common bits into... * examples/test: here. (cwd): New. Use it to avoid a race on the temporary directory. Reported by Jim Meyering. * examples/mfcalc/test, examples/calc++/test: Rename into... * examples/mfcalc/mfcalc.test, examples/calc++/calc++.test: these. * examples/calc++/local.mk, examples/mfcalc/local.mk, * examples/local.mk: Adjust. 2012-02-17 Akim Demaille examples: fix the test suites. * examples/calc++/test, examples/mfcalc/test (me): Be more meaningfull: include the example name. (prog): Factor. (run): Avoid printf, use echo. Add missing parens. (cleanup): New. Call it on trap. Remove the previous "rm" that did the cleanup. Move into a private directory to avoid concurrency issues. Reported by Jim Meyering. 2012-02-17 Jim Meyering examples: link mfcalc with -lm for uses of pow, cos, atan, etc. * examples/mfcalc/local.mk (examples_mfcalc_mfcalc_LDADD): Define. 2012-02-16 Akim Demaille mfcalc: extract and exercise. * examples/mfcalc/local.mk, examples/mfcalc/test: New, based on calc++'s ones. * examples/local.mk: Include mfcalc/local.mk. 2012-02-16 Akim Demaille calc++: factor for other extracted tests. * Makefile.am (TESTS, check_PROGRAMS): Initialize here. * examples/local.mk (doc, extexi): Define here. * examples/calc++/local.mk: Adjust accordingly. * configure.ac: Ask for parallel-tests (for the way the logs are handled). * examples/calc++/test: As a consequence, always be verbose. ($prog): New. (run): Use it. Sort the tests in a more natural order (simplest first). 2012-02-16 Akim Demaille doc: mfcalc: send errors to stderr. * doc/bison.texinfo (Mfcalc Lexer): New. (Mfcalc Main): Move the definition of main and yyerror here, for clarity. Let yyerror report on stderr. 2012-02-16 Akim Demaille doc: fix mfcalc code. * doc/bison.texinfo (Multi-function Calc): Add missing includes. Fix the rendering of the result: use @result and remove the initial tabulation in the actual code. Fix stylistic issues: avoid the , operator. Add extexi mark-up. * examples/extexi: Also support @smallexample. 2012-02-16 Akim Demaille tests: c++: stylistic changes. * tests/c++.at: Don't use void for incoming arguments. Prefer cstdlib to stdlib.h. 2012-02-16 Jim Meyering tests: avoid c++ failure due to lack of getenv decl * tests/c++.at (Syntax error as exception): Avoid spurious failure at least when compiling with g++-4.7.x due to lack of declaration of getenv. Include . 2012-02-15 Akim Demaille maint: rely on Automake for parsers. * Makefile.am (AM_YFLAGS): Automake looks for "-d" alone. Move other options in here. (BISON): New. (YACC): Use it. (bison_SOURCES): Now that automake can see `-d' in AM_YFLAGS, we can rely on it to compile and ship the parser header files. Based on commit 737406a32c201471699bfa0843d1f432f3ec29ab and commit 3d6ca339083c278d907c9f030f4ba6bc5ecb07f2. 2012-02-15 Akim Demaille maint: trust Automake for parser headers. * examples/calc++/local.mk, src/local.mk: Now that automake can see `-d' in AM_YFLAGS, we can rely on it to compile and ship the parser header files. 2012-02-15 Akim Demaille maint: help Automake reading Yacc flags. * Makefile.am (AM_YFLAGS): Automake looks for "-d" alone. 2012-02-15 Akim Demaille calc++: rely on Automake. Rely on $(YACC) being the bison being built, and let Automake do the rest. It turned out to be much more difficult than anticipated, for various reasons, including some bad behavior from Automake 1.11.2 which (i) generates calc++-parser.h instead of calc++-parser.hh, and (ii) leaves an #include "y.tab.h" in the generated parser instead of #include "calc++-parser.h". The authors of Automake appear to be aware of the problem, http://lists.gnu.org/archive/html/automake/2011-05/msg00008.html so a simple work around will suffice for the time being. * examples/calc++/y.tab.h, examples/calc++/calc++-parser.hh: New. To work around Automake 1.11.2 issues. * examples/calc++/local.mk: Remove all the rules for compilation with bison, leave them to Automake. So provide it with "calc++-parse.yy" as a source file. (calc_sources_generated, calc_sources_extracted): Rename as. (calc_generated, calc_extracted): these. (calc_sources): New. Fix them. 2012-02-14 Akim Demaille maint: tidy the Makefile a bit. * src/local.mk: Put yacc related variables together. (AUTOMAKE_OPTIONS): Move to... * Makefile.am: here. Remove an old Emacs mode request which disables Automake support. * src/local.mk (YACC, AM_YFLAGS): Move to... * Makefile.am: here, as they will be used by other local.mks. 2012-02-14 Akim Demaille maint: de-recurse the handling of examples The directory was still using a local Makefile.am because it provides "scoped" Make variables: these examples are not meant to use the same CPPFLAGS etc. If we were to use the same -I set, we'd pick up gnulib's stdio.h for instance, which we do not want for these simple examples. Yet, as a result, the dependencies are less accurate, there is code duplication, etc. This is especially perceptible when trying to extract more examples from the documentation, as will be done in forthcoming changes. In order to make the tuning of CPPFLAGS easier, discard the predefined -I from Automake. * examples/calc++/Makefile.am: Rename as... * examples/calc++/local.mk: this. Adjust the paths which are now rooted in top_srcdir/top_builddir. Handle BISON_CXX_WORKS here, instead of the too crude previous approach that completely discarded the whole directory. ($(BISON)): Remove now useless bouncing recipe. (calc___CPPFLAGS): New. Stay away from -Ilib. * Makefile.am, configure.ac, examples/local.mk, * examples/calc++/test: Adjust. * configure.ac: Pass nostdinc to Automake. * src/local.mk, lib/local.mk (AM_CPPFLAGS): Move to... * Makefile.am: here. * src/local.mk, examples/calc++/Makefile.am (BISON, BISON_IN): Factor to... * Makefile.am: here. * tests/local.mk: Use it. 2012-02-14 Akim Demaille variant: fix the example. * examples/variant.yy: Adjust to "assert" being now "parse.assert". 2012-02-14 Akim Demaille maint: more authors. * AUTHORS: here. Suggested by Tys Lefering. 2012-02-14 Akim Demaille maint: add license headers. * examples/calc++/test, examples/variant.yy, AUTHORS, THANKS, * tests/atlocal.in, tests/bison.in: Add license headers. Reported by Tys Lefering. 2012-02-14 Akim Demaille maint: remove obsolete file. * etc/make-ChangeLogs: Remove (used for rcs to cvs migration!). Reported by Tys Lefering. 2012-02-14 Akim Demaille maint: more authors. * AUTHORS: here. Suggested by Tys Lefering. 2012-02-14 Akim Demaille maint: add license headers. * examples/calc++/test, examples/variant.yy, AUTHORS, THANKS, * tests/atlocal.in, tests/bison.in: Add license headers. Reported by Tys Lefering. 2012-02-14 Akim Demaille maint: remove obsolete file. * etc/make-ChangeLogs: Remove (used for rcs to cvs migration!). Reported by Tys Lefering. 2012-02-10 Akim Demaille lalr1.cc: also handle syntax_error when calling yylex. * data/lalr1.cc (parse): Catch syntax_error around yylex and forward them to errlab1. * tests/c++.at (Syntax error as exception): Check support for syntax exceptions raised by the scanner. * NEWS, doc/bison.texinfo: Document it. 2012-02-10 Akim Demaille tests: lalr1.cc: check syntax_error. * tests/c++.at (Syntax error as exception): New. 2012-02-10 Akim Demaille tests: don't require locations uselessly. * tests/c++.at (Syntax error discarding no lookahead): Contrary to 2.5, C++ parsers can work without locations. 2012-02-10 Akim Demaille maint: more silent rules. * tests/local.mk (TESTSUITE_AT): Include plackage.m4. Adjust dependencies. Make testsuite.at its first argument. (package.m4): Be silent. (testsuite): Be silent. Use $<. 2012-02-10 Akim Demaille skeletons: simplify the protections against "unused" warnings. * data/c.m4 (b4_parse_param_use): Also accept optional arguments to "use". Simplify callers. * data/glr.c (yyuserAction): Simplify use of b4_parse_param_use. (yy_reduce_print): Don't use b4_parse_param_use, as all the arguments _are_ used. * data/lalr1.cc (YY_SYMBOL_PRINT): Even when disabled, "use" the symbol argument. This neutralizes a warning in yypush_ when there are no symbols with a semantic values. (yy_destroy_): Remove useless "use" of yymsg. 2012-02-10 Akim Demaille glr: formatting changes. * data/glr.c: Split long strings. 2012-02-08 Akim Demaille use a more consistent quoting style. See . Use quotearg as often as possible instead of leaving the choice of the quotes to the translators. Use shorter messages. Factor similar messages to a single format, to make localization easier. * src/files.c, src/getargs.c, src/muscle-tab.c, src/reader.c * src/scan-code.l, src/scan-gram.l, src/symtab.c: Use quote() or quotearg_colon() on printf arguments instead of quotes in the format string. * data/bison.m4: Keep sync with the changes in muscle-tab.c. * tests/skeletons.at, tests/input.at, tests/regression.at: Adjust expected messages. 2012-02-08 Akim Demaille use a more consistent quoting style. See . Use quotearg as often as possible instead of leaving the choice of the quotes to the translators. Use shorter messages. Factor similar messages to a single format, to make localization easier. * src/files.c, src/getargs.c, src/muscle-tab.c, src/reader.c * src/scan-code.l, src/scan-gram.l, src/symtab.c: Use quote() or quotearg_colon() on printf arguments instead of quotes in the format string. * data/bison.m4: Keep sync with the changes in muscle-tab.c. * tests/skeletons.at, tests/input.at, tests/regression.at: Adjust expected messages. 2012-01-31 Jim Meyering maint: reenable sc_m4_quote_check * cfg.mk (local-checks-to-skip): Reenable sc_m4_quote_check. * m4/dmalloc.m4: Add quotes. 2012-01-31 Jim Meyering maint: force "make syntax-check" to pass by skipping failing tests * cfg.mk (local-checks-to-skip): Skip all currently-failing tests. Remove changelog-check; it's long gone. 2012-01-31 Akim Demaille maint: remove stray debug code. * src/Makefile.am (echo): Remove. 2012-01-31 Akim Demaille maint: space changes. * src/Makefile.am: Use 2 leading spaces for variable definition spreading over several lines. 2012-01-31 Akim Demaille maint: more silent-rules. * doc/local.mk, src/local.mk, examples/calc++/Makefile.am: Use $(AM_V_GEN) and $(AM_V_at) where appropriate. 2012-01-31 Jim Meyering do not ignore errors like ENOSPC,EIO when writing to stdout Standard output was never explicitly closed, so we could not detect failure. Thus, bison would ignore the errors of writing to a full file system and getting an I/O error on write, but only for standard output, e.g., for --print-localedir, --print-datadir, --help and some verbose output. Now, "bison --print-datadir > /dev/full" reports the write failure: bison: write error: No space left on device Before, it would exit 0 with no diagnostic, implying success. This is not an issue for "--output=-" or the other FILE-accepting command-line options, because unlike most other GNU programs, an output file argument of "-" is treated as the literal "./-", rather than standard output. * bootstrap.conf (gnulib_modules): Add closeout. * src/main.c: Include "closeout.h". Use atexit to ensure we close stdout. * .gitignore: Ignore new files pulled in via gnulib-tool. 2012-01-31 Akim Demaille maint: more silent-rules. * doc/local.mk, src/local.mk, examples/calc++/Makefile.am: Use $(AM_V_GEN) and $(AM_V_at) where appropriate. 2012-01-29 Jim Meyering do not ignore errors like ENOSPC,EIO when writing to stdout Standard output was never explicitly closed, so we could not detect failure. Thus, bison would ignore the errors of writing to a full file system and getting an I/O error on write, but only for standard output, e.g., for --print-localedir, --print-datadir, --help and some verbose output. Now, "bison --print-datadir > /dev/full" reports the write failure: bison: write error: No space left on device Before, it would exit 0 with no diagnostic, implying success. This is not an issue for "--output=-" or the other FILE-accepting command-line options, because unlike most other GNU programs, an output file argument of "-" is treated as the literal "./-", rather than standard output. * bootstrap.conf (gnulib_modules): Add closeout. * src/main.c: Include "closeout.h". Use atexit to ensure we close stdout. * .gitignore: Ignore new files pulled in via gnulib-tool. 2012-01-26 Akim Demaille tests: fix expected output. * tests/actions.at (YYBACKUP): here. 2012-01-26 Akim Demaille tests: fix expected output. * tests/actions.at (YYBACKUP): here. 2012-01-26 Akim Demaille maint: fix configure.ac Fix commit 1890a2a816dab86c23cc1d0af8fac3986335deb7. * configure.ac: Fix variable assignment. 2012-01-26 Akim Demaille yacc: fix YYBACKUP. Reported by David Kastrup: https://lists.gnu.org/archive/html/bug-bison/2011-10/msg00002.html. * data/yacc.c (YYBACKUP): Accept rhs size. Restore the proper state value. * TODO (YYBACKUP): Make it... * tests/actions.at: a new test case. * NEWS, THANKS: Update. 2012-01-26 Akim Demaille maint: update TODO. * TODO (Labeling the symbols): Remove, it's done ("Name references"). 2012-01-26 Akim Demaille maint: update THANKS. * THANKS: Update Tys's address, on his request. 2012-01-26 Akim Demaille maint: fix --gcc-warnings support. * configure.ac: Use enable_gcc_warnings instead of enableval, which is valid only with AC_ARG_ENABLE. 2012-01-26 Akim Demaille maint: silent-rules. * configure.ac: Ask for silent-rules support. Enable it by default. 2012-01-26 Akim Demaille maint: remove trailing blanks. * src/scan-code.l: Here. 2012-01-26 Akim Demaille yacc: fix YYBACKUP. Reported by David Kastrup: https://lists.gnu.org/archive/html/bug-bison/2011-10/msg00002.html. * data/yacc.c (YYBACKUP): Accept rhs size. Restore the proper state value. * TODO (YYBACKUP): Make it... * tests/actions.at: a new test case. * NEWS, THANKS: Update. 2012-01-25 Akim Demaille maint: update TODO. * TODO (Labeling the symbols): Remove, it's done ("Name references"). 2012-01-25 Akim Demaille maint: update THANKS. * THANKS: Update Tys's address, on his request. 2012-01-25 Akim Demaille maint: fix --gcc-warnings support. * configure.ac: Use enable_gcc_warnings instead of enableval, which is valid only with AC_ARG_ENABLE. 2012-01-25 Akim Demaille maint: silent-rules. * configure.ac: Ask for silent-rules support. Enable it by default. 2012-01-25 Paul Eggert tests: port to Solaris 10 'diff -u' * tests/regression.at (parse-gram.y: LALR = IELR): Port to Solaris 10, where "diff -u X X" outputs "No differences encountered" instead of outputting nothing. Reported by Tomohiro Suzuki in . 2012-01-25 Jim Meyering build: avoid possibly-replaced fprintf in liby-source, yyerror.c * lib/yyerror.c (yyerror): Use fputs and fputc rather than fprintf with a mere "%s\n" format. Always return 0 now, on the assumption that the return value was never used anyway. Don't include after all. This avoids a problem reported by Thiru Ramakrishnan in http://lists.gnu.org/archive/html/help-bison/2011-11/msg00000.html * cfg.mk: Exempt lib/yyerror.c from the sc_require_config_h_first test. * THANKS: Update. 2012-01-24 Paul Eggert tests: port to Solaris 10 'diff -u' * tests/regression.at (parse-gram.y: LALR = IELR): Port to Solaris 10, where "diff -u X X" outputs "No differences encountered" instead of outputting nothing. Reported by Tomohiro Suzuki in . 2012-01-24 Jim Meyering maint: generate ChangeLog from git log * Makefile.am (gen-ChangeLog): New rule. (dist-hook): Depend on it. (EXTRA_DIST): Distribute the two ChangeLog-* files. * bootstrap.conf (gnulib_modules): Add gitlog-to-changelog. (bootstrap_post_import_hook): Ensure that ChangeLog exists. * build-aux/git-log-fix: New file. * ChangeLog-2012: Renamed ... * ChangeLog: ... from this. * ChangeLog-1998: Renamed ... * OChangeLog: ...from this * .gitignore: Add ChangeLog. 2012-01-24 Jim Meyering change more quotes in source, and adjust tests to match Run this command to change each `%s' to '%s' in source directories: git grep -l '`%s'\' src djgpp data \ |xargs perl -pi -e '$q="'\''";s/`%s$q/$q%s$q/g' * data/bison.m4: Affected per the above. * djgpp/subpipe.c: Likewise. * src/files.c: Likewise. * src/getargs.c: Likewise. * src/muscle-tab.c: Likewise. * src/reader.c: Likewise. * tests/glr-regression.at: Adjust to match. * tests/input.at: Likewise. * tests/push.at: Likewise. * tests/skeletons.at: Likewise. 2012-01-23 Jim Meyering quote consistently and make tests pass with new quoting from gnulib Updating to gnulib pulled in new quote and quotarg modules, by which quoting is now done like 'this' rather than `this'. That change induces many "make check" test failures. This change adapts code and tests so that "make check" passes once again. * src/scan-code.l: Quote like 'this', not like `this'. * src/scan-gram.l: Likewise. * src/symtab.c: Likewise. * tests/actions.at: Adjust tests to match. * tests/input.at: Likewise. * tests/named-refs.at: Likewise. * tests/output.at: Likewise. * tests/regression.at: Likewise. * lib/.gitignore: Regenerate. * m4/.gitignore: Likewise. 2012-01-23 Jim Meyering build: avoid possibly-replaced fprintf in liby-source, yyerror.c * lib/yyerror.c (yyerror): Use fputs and fputc rather than fprintf with a mere "%s\n" format. Always return 0 now, on the assumption that the return value was never used anyway. Don't include after all. This avoids a problem reported by Thiru Ramakrishnan in http://lists.gnu.org/archive/html/help-bison/2011-11/msg00000.html * cfg.mk: Exempt lib/yyerror.c from the sc_require_config_h_first test. * THANKS: Update. 2012-01-23 Jim Meyering build: update gnulib and autoconf submodules to latest (cherry picked from commit 728415f885e5cb8e518c8576fa6e1f541e384130) 2012-01-23 Jim Meyering build: manually update bootstrap from gnulib, and adapt Updating to the latest bootstrap from gnulib involves more of a change than usual, and updating to the latest gnulib would involve its own set of challenges with the upcoming quoting changes, so we update bootstrap manually and separately. * bootstrap: Update from gnulib. * lib/Makefile.am: Initialize more variables to empty, so that gnulib.mk can append to them with "+=". * bootstrap.conf (gnulib_mk_hook): Remove. No longer honored. (gnulib_tool_option_extras): Generate gnulib.mk. 2012-01-23 Jim Meyering maint: include first * cfg.mk (exclude_file_name_regexp--sc_require_config_h_first): Exempt data/glr.c and data/yacc.c from the include-config.h-first requirement. 2012-01-23 Jim Meyering build: include from lib/yyerror.c * lib/yyerror.c: Include . 2012-01-23 Jim Meyering maint: list djgpp/subpipe.c in po/POTFILES.in * po/POTFILES.in: Add djgpp/subpipe.c. 2012-01-23 Jim Meyering maint: placate the space-TAB syntax-check * cfg.mk (exclude_file_name_regexp--sc_space_tab): Exempt tests/input.at and tests/c++.at, since they appear to use SP-TAB sequences deliberately. * OChangeLog: Remove space-before-TAB. 2012-01-23 Jim Meyering doc: correct typo: s/can not/cannot/ * doc/bison.texinfo (Bug Reports): s/can not/cannot/ And remove trailing blanks. 2012-01-23 Jim Meyering build: generalize etc/prefix-gnulib-mk This script hard-coded "libbison" and lib/gnulib.mk. Adjust the script to require a --lib-name=$gnulib_name option and a FILE argument like lib/$gnulib_mk. Also add support for --help and --version. * etc/prefix-gnulib-mk: Generalize. * bootstrap.conf (bootstrap_post_import_hook): Update its invocation. 2012-01-22 Jim Meyering maint: get gpl-3.0 from gnulib * bootstrap.conf (gnulib_modules): Add gpl-3.0. * doc/gpl-3.0.texi: Remove from version control, now that we get it via gnulib. * doc/.gitignore: Ignore it. 2012-01-20 Akim Demaille maint: be more robust to gnulib's FOO_H variables. * configure.ac: Instead of listing gnulib's variables, look for them among AC_SUBST variables. 2012-01-20 Jim Meyering maint: generate ChangeLog from git log * Makefile.am (gen-ChangeLog): New rule. (dist-hook): Depend on it. (EXTRA_DIST): Distribute the two ChangeLog-* files. * bootstrap.conf (gnulib_modules): Add gitlog-to-changelog. (bootstrap_post_import_hook): Ensure that ChangeLog exists. * build-aux/git-log-fix: New file. * ChangeLog-2012: Renamed ... * ChangeLog: ... from this. * ChangeLog-1998: Renamed ... * OChangeLog: ...from this * .gitignore: Add ChangeLog. 2012-01-19 Jim Meyering change more quotes in source, and adjust tests to match Run this command to change each `%s' to '%s' in source directories: git grep -l '`%s'\' src djgpp data \ |xargs perl -pi -e '$q="'\''";s/`%s$q/$q%s$q/g' * data/bison.m4: Affected per the above. * djgpp/subpipe.c: Likewise. * src/files.c: Likewise. * src/getargs.c: Likewise. * src/muscle-tab.c: Likewise. * src/reader.c: Likewise. * tests/glr-regression.at: Adjust to match. * tests/input.at: Likewise. * tests/push.at: Likewise. * tests/skeletons.at: Likewise. 2012-01-19 Jim Meyering quote consistently and make tests pass with new quoting from gnulib Updating to gnulib pulled in new quote and quotarg modules, by which quoting is now done like 'this' rather than `this'. That change induces many "make check" test failures. This change adapts code and tests so that "make check" passes once again. * src/scan-code.l: Quote like 'this', not like `this'. * src/scan-gram.l: Likewise. * src/symtab.c: Likewise. * tests/actions.at: Adjust tests to match. * tests/input.at: Likewise. * tests/named-refs.at: Likewise. * tests/output.at: Likewise. * tests/regression.at: Likewise. * lib/.gitignore: Regenerate. * m4/.gitignore: Likewise. 2012-01-19 Jim Meyering build: update gnulib and autoconf submodules to latest 2012-01-19 Jim Meyering build: manually update bootstrap from gnulib, and adapt Updating to the latest bootstrap from gnulib involves more of a change than usual, and updating to the latest gnulib would involve its own set of challenges with the upcoming quoting changes, so we update bootstrap manually and separately. * bootstrap: Update from gnulib. * Makefile.am: Initialize more variables to empty, so that gnulib.mk can append to them with "+=". * bootstrap.conf (gnulib_mk_hook): Remove. No longer honored. (bootstrap_post_import_hook): Instead, run the same command, etc/prefix-gnulib-mk lib/$gnulib_mk, via slightly different API. Temporarily disable "bootstrap_sync=true". * etc/prefix-gnulib-mk: Don't prepend "lib/" to tokens like -I$(... or "\". 2012-01-19 Jim Meyering maint: include first * cfg.mk (exclude_file_name_regexp--sc_require_config_h_first): Exempt data/glr.c and data/yacc.c from the include-config.h-first requirement. 2012-01-19 Jim Meyering build: include from lib/yyerror.c * lib/yyerror.c: Include . 2012-01-19 Jim Meyering maint: list djgpp/subpipe.c in po/POTFILES.in * po/POTFILES.in: Add djgpp/subpipe.c. 2012-01-19 Jim Meyering maint: placate the space-TAB syntax-check * cfg.mk (exclude_file_name_regexp--sc_space_tab): Exempt tests/input.at and tests/c++.at, since they appear to use SP-TAB sequences deliberately. * OChangeLog: Remove space-before-TAB. 2012-01-19 Jim Meyering maint: remove final trailing space * src/scan-gram.l (%): Remove single space at end of line. 2012-01-19 Jim Meyering maint: get gpl-3.0 from gnulib * bootstrap.conf (gnulib_modules): Add gpl-3.0. * doc/gpl-3.0.texi: Remove from version control, now that we get it via gnulib. * doc/.gitignore: Ignore it. 2012-01-19 Jim Meyering doc: correct typo: s/can not/cannot/ * doc/bison.texinfo (Bug Reports): s/can not/cannot/ And remove trailing blanks. PKy0]V$.NEWSnu[GNU Bison NEWS * Noteworthy changes in release 3.0.4 (2015-01-23) [stable] ** Bug fixes *** C++ with Variants (lalr1.cc) Fix a compiler warning when no %destructor use $$. *** Test suites Several portability issues in tests were fixed. * Noteworthy changes in release 3.0.3 (2015-01-15) [stable] ** Bug fixes *** C++ with Variants (lalr1.cc) Problems with %destructor and '%define parse.assert' have been fixed. *** Named %union support (yacc.c, glr.c) Bison 3.0 introduced a regression on named %union such as %union foo { int ival; }; The possibility to use a name was introduced "for Yacc compatibility". It is however not required by POSIX Yacc, and its usefulness is not clear. *** %define api.value.type union with %defines (yacc.c, glr.c) The C parsers were broken when %defines was used together with "%define api.value.type union". *** Redeclarations are reported in proper order On %token FOO "foo" %printer {} "foo" %printer {} FOO bison used to report: /tmp/foo.yy:2.10-11: error: %printer redeclaration for FOO %printer {} "foo" ^^ /tmp/foo.yy:3.10-11: previous declaration %printer {} FOO ^^ Now, the "previous" declaration is always the first one. ** Documentation Bison now installs various files in its docdir (which defaults to '/usr/local/share/doc/bison'), including the three fully blown examples extracted from the documentation: - rpcalc Reverse polish calculator, a simple introductory example. - mfcalc Multi-function Calc, a calculator with memory and functions and located error messages. - calc++ a calculator in C++ using variant support and token constructors. * Noteworthy changes in release 3.0.2 (2013-12-05) [stable] ** Bug fixes *** Generated source files when errors are reported When warnings are issued and -Werror is set, bison would still generate the source files (*.c, *.h...). As a consequence, some runs of "make" could fail the first time, but not the second (as the files were generated anyway). This is fixed: bison no longer generates this source files, but, of course, still produces the various reports (*.output, *.xml, etc.). *** %empty is used in reports Empty right-hand sides are denoted by '%empty' in all the reports (text, dot, XML and formats derived from it). *** YYERROR and variants When C++ variant support is enabled, an error triggered via YYERROR, but not caught via error recovery, resulted in a double deletion. * Noteworthy changes in release 3.0.1 (2013-11-12) [stable] ** Bug fixes *** Errors in caret diagnostics On some platforms, some errors could result in endless diagnostics. *** Fixes of the -Werror option Options such as "-Werror -Wno-error=foo" were still turning "foo" diagnostics into errors instead of warnings. This is fixed. Actually, for consistency with GCC, "-Wno-error=foo -Werror" now also leaves "foo" diagnostics as warnings. Similarly, with "-Werror=foo -Wno-error", "foo" diagnostics are now errors. *** GLR Predicates As demonstrated in the documentation, one can now leave spaces between "%?" and its "{". *** Installation The yacc.1 man page is no longer installed if --disable-yacc was specified. *** Fixes in the test suite Bugs and portability issues. * Noteworthy changes in release 3.0 (2013-07-25) [stable] ** WARNING: Future backward-incompatibilities! Like other GNU packages, Bison will start using some of the C99 features for its own code, especially the definition of variables after statements. The generated C parsers still aim at C90. ** Backward incompatible changes *** Obsolete features Support for YYFAIL is removed (deprecated in Bison 2.4.2): use YYERROR. Support for yystype and yyltype is removed (deprecated in Bison 1.875): use YYSTYPE and YYLTYPE. Support for YYLEX_PARAM and YYPARSE_PARAM is removed (deprecated in Bison 1.875): use %lex-param, %parse-param, or %param. Missing semicolons at the end of actions are no longer added (as announced in the release 2.5). *** Use of YACC='bison -y' TL;DR: With Autoconf <= 2.69, pass -Wno-yacc to (AM_)YFLAGS if you use Bison extensions. Traditional Yacc generates 'y.tab.c' whatever the name of the input file. Therefore Makefiles written for Yacc expect 'y.tab.c' (and possibly 'y.tab.h' and 'y.outout') to be generated from 'foo.y'. To this end, for ages, AC_PROG_YACC, Autoconf's macro to look for an implementation of Yacc, was using Bison as 'bison -y'. While it does ensure compatible output file names, it also enables warnings for incompatibilities with POSIX Yacc. In other words, 'bison -y' triggers warnings for Bison extensions. Autoconf 2.70+ fixes this incompatibility by using YACC='bison -o y.tab.c' (which also generates 'y.tab.h' and 'y.output' when needed). Alternatively, disable Yacc warnings by passing '-Wno-yacc' to your Yacc flags (YFLAGS, or AM_YFLAGS with Automake). ** Bug fixes *** The epilogue is no longer affected by internal #defines (glr.c) The glr.c skeleton uses defines such as #define yylval (yystackp->yyval) in generated code. These weren't properly undefined before the inclusion of the user epilogue, so functions such as the following were butchered by the preprocessor expansion: int yylex (YYSTYPE *yylval); This is fixed: yylval, yynerrs, yychar, and yylloc are now valid identifiers for user-provided variables. *** stdio.h is no longer needed when locations are enabled (yacc.c) Changes in Bison 2.7 introduced a dependency on FILE and fprintf when locations are enabled. This is fixed. *** Warnings about useless %pure-parser/%define api.pure are restored ** Diagnostics reported by Bison Most of these features were contributed by Théophile Ranquet and Victor Santet. *** Carets Version 2.7 introduced caret errors, for a prettier output. These are now activated by default. The old format can still be used by invoking Bison with -fno-caret (or -fnone). Some error messages that reproduced excerpts of the grammar are now using the caret information only. For instance on: %% exp: 'a' | 'a'; Bison 2.7 reports: in.y: warning: 1 reduce/reduce conflict [-Wconflicts-rr] in.y:2.12-14: warning: rule useless in parser due to conflicts: exp: 'a' [-Wother] Now bison reports: in.y: warning: 1 reduce/reduce conflict [-Wconflicts-rr] in.y:2.12-14: warning: rule useless in parser due to conflicts [-Wother] exp: 'a' | 'a'; ^^^ and "bison -fno-caret" reports: in.y: warning: 1 reduce/reduce conflict [-Wconflicts-rr] in.y:2.12-14: warning: rule useless in parser due to conflicts [-Wother] *** Enhancements of the -Werror option The -Werror=CATEGORY option is now recognized, and will treat specified warnings as errors. The warnings need not have been explicitly activated using the -W option, this is similar to what GCC 4.7 does. For example, given the following command line, Bison will treat both warnings related to POSIX Yacc incompatibilities and S/R conflicts as errors (and only those): $ bison -Werror=yacc,error=conflicts-sr input.y If no categories are specified, -Werror will make all active warnings into errors. For example, the following line does the same the previous example: $ bison -Werror -Wnone -Wyacc -Wconflicts-sr input.y (By default -Wconflicts-sr,conflicts-rr,deprecated,other is enabled.) Note that the categories in this -Werror option may not be prefixed with "no-". However, -Wno-error[=CATEGORY] is valid. Note that -y enables -Werror=yacc. Therefore it is now possible to require Yacc-like behavior (e.g., always generate y.tab.c), but to report incompatibilities as warnings: "-y -Wno-error=yacc". *** The display of warnings is now richer The option that controls a given warning is now displayed: foo.y:4.6: warning: type clash on default action: != [-Wother] In the case of warnings treated as errors, the prefix is changed from "warning: " to "error: ", and the suffix is displayed, in a manner similar to GCC, as [-Werror=CATEGORY]. For instance, where the previous version of Bison would report (and exit with failure): bison: warnings being treated as errors input.y:1.1: warning: stray ',' treated as white space it now reports: input.y:1.1: error: stray ',' treated as white space [-Werror=other] *** Deprecated constructs The new 'deprecated' warning category flags obsolete constructs whose support will be discontinued. It is enabled by default. These warnings used to be reported as 'other' warnings. *** Useless semantic types Bison now warns about useless (uninhabited) semantic types. Since semantic types are not declared to Bison (they are defined in the opaque %union structure), it is %printer/%destructor directives about useless types that trigger the warning: %token term %type nterm %printer {} %destructor {} %% nterm: term { $$ = $1; }; 3.28-34: warning: type is used, but is not associated to any symbol 4.28-34: warning: type is used, but is not associated to any symbol *** Undefined but unused symbols Bison used to raise an error for undefined symbols that are not used in the grammar. This is now only a warning. %printer {} symbol1 %destructor {} symbol2 %type symbol3 %% exp: "a"; *** Useless destructors or printers Bison now warns about useless destructors or printers. In the following example, the printer for , and the destructor for are useless: all symbols of (token1) already have a printer, and all symbols of type (token2) already have a destructor. %token token1 token2 token3 token4 %printer {} token1 %destructor {} token2 *** Conflicts The warnings and error messages about shift/reduce and reduce/reduce conflicts have been normalized. For instance on the following foo.y file: %glr-parser %% exp: exp '+' exp | '0' | '0'; compare the previous version of bison: $ bison foo.y foo.y: conflicts: 1 shift/reduce, 2 reduce/reduce $ bison -Werror foo.y bison: warnings being treated as errors foo.y: conflicts: 1 shift/reduce, 2 reduce/reduce with the new behavior: $ bison foo.y foo.y: warning: 1 shift/reduce conflict [-Wconflicts-sr] foo.y: warning: 2 reduce/reduce conflicts [-Wconflicts-rr] $ bison -Werror foo.y foo.y: error: 1 shift/reduce conflict [-Werror=conflicts-sr] foo.y: error: 2 reduce/reduce conflicts [-Werror=conflicts-rr] When %expect or %expect-rr is used, such as with bar.y: %expect 0 %glr-parser %% exp: exp '+' exp | '0' | '0'; Former behavior: $ bison bar.y bar.y: conflicts: 1 shift/reduce, 2 reduce/reduce bar.y: expected 0 shift/reduce conflicts bar.y: expected 0 reduce/reduce conflicts New one: $ bison bar.y bar.y: error: shift/reduce conflicts: 1 found, 0 expected bar.y: error: reduce/reduce conflicts: 2 found, 0 expected ** Incompatibilities with POSIX Yacc The 'yacc' category is no longer part of '-Wall', enable it explicitly with '-Wyacc'. ** Additional yylex/yyparse arguments The new directive %param declares additional arguments to both yylex and yyparse. The %lex-param, %parse-param, and %param directives support one or more arguments. Instead of %lex-param {arg1_type *arg1} %lex-param {arg2_type *arg2} %parse-param {arg1_type *arg1} %parse-param {arg2_type *arg2} one may now declare %param {arg1_type *arg1} {arg2_type *arg2} ** Types of values for %define variables Bison used to make no difference between '%define foo bar' and '%define foo "bar"'. The former is now called a 'keyword value', and the latter a 'string value'. A third kind was added: 'code values', such as '%define foo {bar}'. Keyword variables are used for fixed value sets, e.g., %define lr.type lalr Code variables are used for value in the target language, e.g., %define api.value.type {struct semantic_type} String variables are used remaining cases, e.g. file names. ** Variable api.token.prefix The variable api.token.prefix changes the way tokens are identified in the generated files. This is especially useful to avoid collisions with identifiers in the target language. For instance %token FILE for ERROR %define api.token.prefix {TOK_} %% start: FILE for ERROR; will generate the definition of the symbols TOK_FILE, TOK_for, and TOK_ERROR in the generated sources. In particular, the scanner must use these prefixed token names, although the grammar itself still uses the short names (as in the sample rule given above). ** Variable api.value.type This new %define variable supersedes the #define macro YYSTYPE. The use of YYSTYPE is discouraged. In particular, #defining YYSTYPE *and* either using %union or %defining api.value.type results in undefined behavior. Either define api.value.type, or use "%union": %union { int ival; char *sval; } %token INT "integer" %token STRING "string" %printer { fprintf (yyo, "%d", $$); } %destructor { free ($$); } /* In yylex(). */ yylval.ival = 42; return INT; yylval.sval = "42"; return STRING; The %define variable api.value.type supports both keyword and code values. The keyword value 'union' means that the user provides genuine types, not union member names such as "ival" and "sval" above (WARNING: will fail if -y/--yacc/%yacc is enabled). %define api.value.type union %token INT "integer" %token STRING "string" %printer { fprintf (yyo, "%d", $$); } %destructor { free ($$); } /* In yylex(). */ yylval.INT = 42; return INT; yylval.STRING = "42"; return STRING; The keyword value variant is somewhat equivalent, but for C++ special provision is made to allow classes to be used (more about this below). %define api.value.type variant %token INT "integer" %token STRING "string" Code values (in braces) denote user defined types. This is where YYSTYPE used to be used. %code requires { struct my_value { enum { is_int, is_string } kind; union { int ival; char *sval; } u; }; } %define api.value.type {struct my_value} %token INT "integer" %token STRING "string" %printer { fprintf (yyo, "%d", $$); } %destructor { free ($$); } /* In yylex(). */ yylval.u.ival = 42; return INT; yylval.u.sval = "42"; return STRING; ** Variable parse.error This variable controls the verbosity of error messages. The use of the %error-verbose directive is deprecated in favor of "%define parse.error verbose". ** Renamed %define variables The following variables have been renamed for consistency. Backward compatibility is ensured, but upgrading is recommended. lr.default-reductions -> lr.default-reduction lr.keep-unreachable-states -> lr.keep-unreachable-state namespace -> api.namespace stype -> api.value.type ** Semantic predicates Contributed by Paul Hilfinger. The new, experimental, semantic-predicate feature allows actions of the form "%?{ BOOLEAN-EXPRESSION }", which cause syntax errors (as for YYERROR) if the expression evaluates to 0, and are evaluated immediately in GLR parsers, rather than being deferred. The result is that they allow the programmer to prune possible parses based on the values of run-time expressions. ** The directive %expect-rr is now an error in non GLR mode It used to be an error only if used in non GLR mode, _and_ if there are reduce/reduce conflicts. ** Tokens are numbered in their order of appearance Contributed by Valentin Tolmer. With '%token A B', A had a number less than the one of B. However, precedence declarations used to generate a reversed order. This is now fixed, and introducing tokens with any of %token, %left, %right, %precedence, or %nonassoc yields the same result. When mixing declarations of tokens with a litteral character (e.g., 'a') or with an identifier (e.g., B) in a precedence declaration, Bison numbered the litteral characters first. For example %right A B 'c' 'd' would lead to the tokens declared in this order: 'c' 'd' A B. Again, the input order is now preserved. These changes were made so that one can remove useless precedence and associativity declarations (i.e., map %nonassoc, %left or %right to %precedence, or to %token) and get exactly the same output. ** Useless precedence and associativity Contributed by Valentin Tolmer. When developing and maintaining a grammar, useless associativity and precedence directives are common. They can be a nuisance: new ambiguities arising are sometimes masked because their conflicts are resolved due to the extra precedence or associativity information. Furthermore, it can hinder the comprehension of a new grammar: one will wonder about the role of a precedence, where in fact it is useless. The following changes aim at detecting and reporting these extra directives. *** Precedence warning category A new category of warning, -Wprecedence, was introduced. It flags the useless precedence and associativity directives. *** Useless associativity Bison now warns about symbols with a declared associativity that is never used to resolve conflicts. In that case, using %precedence is sufficient; the parsing tables will remain unchanged. Solving these warnings may raise useless precedence warnings, as the symbols no longer have associativity. For example: %left '+' %left '*' %% exp: "number" | exp '+' "number" | exp '*' exp ; will produce a warning: useless associativity for '+', use %precedence [-Wprecedence] %left '+' ^^^ *** Useless precedence Bison now warns about symbols with a declared precedence and no declared associativity (i.e., declared with %precedence), and whose precedence is never used. In that case, the symbol can be safely declared with %token instead, without modifying the parsing tables. For example: %precedence '=' %% exp: "var" '=' "number"; will produce a warning: useless precedence for '=' [-Wprecedence] %precedence '=' ^^^ *** Useless precedence and associativity In case of both useless precedence and associativity, the issue is flagged as follows: %nonassoc '=' %% exp: "var" '=' "number"; The warning is: warning: useless precedence and associativity for '=' [-Wprecedence] %nonassoc '=' ^^^ ** Empty rules With help from Joel E. Denny and Gabriel Rassoul. Empty rules (i.e., with an empty right-hand side) can now be explicitly marked by the new %empty directive. Using %empty on a non-empty rule is an error. The new -Wempty-rule warning reports empty rules without %empty. On the following grammar: %% s: a b c; a: ; b: %empty; c: 'a' %empty; bison reports: 3.4-5: warning: empty rule without %empty [-Wempty-rule] a: {} ^^ 5.8-13: error: %empty on non-empty rule c: 'a' %empty {}; ^^^^^^ ** Java skeleton improvements The constants for token names were moved to the Lexer interface. Also, it is possible to add code to the parser's constructors using "%code init" and "%define init_throws". Contributed by Paolo Bonzini. The Java skeleton now supports push parsing. Contributed by Dennis Heimbigner. ** C++ skeletons improvements *** The parser header is no longer mandatory (lalr1.cc, glr.cc) Using %defines is now optional. Without it, the needed support classes are defined in the generated parser, instead of additional files (such as location.hh, position.hh and stack.hh). *** Locations are no longer mandatory (lalr1.cc, glr.cc) Both lalr1.cc and glr.cc no longer require %location. *** syntax_error exception (lalr1.cc) The C++ parser features a syntax_error exception, which can be thrown from the scanner or from user rules to raise syntax errors. This facilitates reporting errors caught in sub-functions (e.g., rejecting too large integral literals from a conversion function used by the scanner, or rejecting invalid combinations from a factory invoked by the user actions). *** %define api.value.type variant This is based on a submission from Michiel De Wilde. With help from Théophile Ranquet. In this mode, complex C++ objects can be used as semantic values. For instance: %token <::std::string> TEXT; %token NUMBER; %token SEMICOLON ";" %type <::std::string> item; %type <::std::list> list; %% result: list { std::cout << $1 << std::endl; } ; list: %empty { /* Generates an empty string list. */ } | list item ";" { std::swap ($$, $1); $$.push_back ($2); } ; item: TEXT { std::swap ($$, $1); } | NUMBER { $$ = string_cast ($1); } ; *** %define api.token.constructor When variants are enabled, Bison can generate functions to build the tokens. This guarantees that the token type (e.g., NUMBER) is consistent with the semantic value (e.g., int): parser::symbol_type yylex () { parser::location_type loc = ...; ... return parser::make_TEXT ("Hello, world!", loc); ... return parser::make_NUMBER (42, loc); ... return parser::make_SEMICOLON (loc); ... } *** C++ locations There are operator- and operator-= for 'location'. Negative line/column increments can no longer underflow the resulting value. * Noteworthy changes in release 2.7.1 (2013-04-15) [stable] ** Bug fixes *** Fix compiler attribute portability (yacc.c) With locations enabled, __attribute__ was used unprotected. *** Fix some compiler warnings (lalr1.cc) * Noteworthy changes in release 2.7 (2012-12-12) [stable] ** Bug fixes Warnings about uninitialized yylloc in yyparse have been fixed. Restored C90 compliance (yet no report was ever made). ** Diagnostics are improved Contributed by Théophile Ranquet. *** Changes in the format of error messages This used to be the format of many error reports: input.y:2.7-12: %type redeclaration for exp input.y:1.7-12: previous declaration It is now: input.y:2.7-12: error: %type redeclaration for exp input.y:1.7-12: previous declaration *** New format for error reports: carets Caret errors have been added to Bison: input.y:2.7-12: error: %type redeclaration for exp %type exp ^^^^^^ input.y:1.7-12: previous declaration %type exp ^^^^^^ or input.y:3.20-23: error: ambiguous reference: '$exp' exp: exp '+' exp { $exp = $1 + $3; }; ^^^^ input.y:3.1-3: refers to: $exp at $$ exp: exp '+' exp { $exp = $1 + $3; }; ^^^ input.y:3.6-8: refers to: $exp at $1 exp: exp '+' exp { $exp = $1 + $3; }; ^^^ input.y:3.14-16: refers to: $exp at $3 exp: exp '+' exp { $exp = $1 + $3; }; ^^^ The default behavior for now is still not to display these unless explicitly asked with -fcaret (or -fall). However, in a later release, it will be made the default behavior (but may still be deactivated with -fno-caret). ** New value for %define variable: api.pure full The %define variable api.pure requests a pure (reentrant) parser. However, for historical reasons, using it in a location-tracking Yacc parser resulted in a yyerror function that did not take a location as a parameter. With this new value, the user may request a better pure parser, where yyerror does take a location as a parameter (in location-tracking parsers). The use of "%define api.pure true" is deprecated in favor of this new "%define api.pure full". ** New %define variable: api.location.type (glr.cc, lalr1.cc, lalr1.java) The %define variable api.location.type defines the name of the type to use for locations. When defined, Bison no longer generates the position.hh and location.hh files, nor does the parser will include them: the user is then responsible to define her type. This can be used in programs with several parsers to factor their location and position files: let one of them generate them, and the others just use them. This feature was actually introduced, but not documented, in Bison 2.5, under the name "location_type" (which is maintained for backward compatibility). For consistency, lalr1.java's %define variables location_type and position_type are deprecated in favor of api.location.type and api.position.type. ** Exception safety (lalr1.cc) The parse function now catches exceptions, uses the %destructors to release memory (the lookahead symbol and the symbols pushed on the stack) before re-throwing the exception. This feature is somewhat experimental. User feedback would be appreciated. ** Graph improvements in DOT and XSLT Contributed by Théophile Ranquet. The graphical presentation of the states is more readable: their shape is now rectangular, the state number is clearly displayed, and the items are numbered and left-justified. The reductions are now explicitly represented as transitions to other diamond shaped nodes. These changes are present in both --graph output and xml2dot.xsl XSLT processing, with minor (documented) differences. ** %language is no longer an experimental feature. The introduction of this feature, in 2.4, was four years ago. The --language option and the %language directive are no longer experimental. ** Documentation The sections about shift/reduce and reduce/reduce conflicts resolution have been fixed and extended. Although introduced more than four years ago, XML and Graphviz reports were not properly documented. The translation of mid-rule actions is now described. * Noteworthy changes in release 2.6.5 (2012-11-07) [stable] We consider compiler warnings about Bison generated parsers to be bugs. Rather than working around them in your own project, please consider reporting them to us. ** Bug fixes Warnings about uninitialized yylval and/or yylloc for push parsers with a pure interface have been fixed for GCC 4.0 up to 4.8, and Clang 2.9 to 3.2. Other issues in the test suite have been addressed. Null characters are correctly displayed in error messages. When possible, yylloc is correctly initialized before calling yylex. It is no longer necessary to initialize it in the %initial-action. * Noteworthy changes in release 2.6.4 (2012-10-23) [stable] Bison 2.6.3's --version was incorrect. This release fixes this issue. * Noteworthy changes in release 2.6.3 (2012-10-22) [stable] ** Bug fixes Bugs and portability issues in the test suite have been fixed. Some errors in translations have been addressed, and --help now directs users to the appropriate place to report them. Stray Info files shipped by accident are removed. Incorrect definitions of YY_, issued by yacc.c when no parser header is generated, are removed. All the generated headers are self-contained. ** Header guards (yacc.c, glr.c, glr.cc) In order to avoid collisions, the header guards are now YY___INCLUDED, instead of merely _. For instance the header generated from %define api.prefix "calc" %defines "lib/parse.h" will use YY_CALC_LIB_PARSE_H_INCLUDED as guard. ** Fix compiler warnings in the generated parser (yacc.c, glr.c) The compilation of pure parsers (%define api.pure) can trigger GCC warnings such as: input.c: In function 'yyparse': input.c:1503:12: warning: 'yylval' may be used uninitialized in this function [-Wmaybe-uninitialized] *++yyvsp = yylval; ^ This is now fixed; pragmas to avoid these warnings are no longer needed. Warnings from clang ("equality comparison with extraneous parentheses" and "function declared 'noreturn' should not return") have also been addressed. * Noteworthy changes in release 2.6.2 (2012-08-03) [stable] ** Bug fixes Buffer overruns, complaints from Flex, and portability issues in the test suite have been fixed. ** Spaces in %lex- and %parse-param (lalr1.cc, glr.cc) Trailing end-of-lines in %parse-param or %lex-param would result in invalid C++. This is fixed. ** Spurious spaces and end-of-lines The generated files no longer end (nor start) with empty lines. * Noteworthy changes in release 2.6.1 (2012-07-30) [stable] Bison no longer executes user-specified M4 code when processing a grammar. ** Future Changes In addition to the removal of the features announced in Bison 2.6, the next major release will remove the "Temporary hack for adding a semicolon to the user action", as announced in the release 2.5. Instead of: exp: exp "+" exp { $$ = $1 + $3 }; write: exp: exp "+" exp { $$ = $1 + $3; }; ** Bug fixes *** Type names are now properly escaped. *** glr.cc: set_debug_level and debug_level work as expected. *** Stray @ or $ in actions While Bison used to warn about stray $ or @ in action rules, it did not for other actions such as printers, destructors, or initial actions. It now does. ** Type names in actions For consistency with rule actions, it is now possible to qualify $$ by a type-name in destructors, printers, and initial actions. For instance: %printer { fprintf (yyo, "(%d, %f)", $$, $$); } <*> <>; will display two values for each typed and untyped symbol (provided that YYSTYPE has both "ival" and "fval" fields). * Noteworthy changes in release 2.6 (2012-07-19) [stable] ** Future changes The next major release of Bison will drop support for the following deprecated features. Please report disagreements to bug-bison@gnu.org. *** K&R C parsers Support for generating parsers in K&R C will be removed. Parsers generated for C support ISO C90, and are tested with ISO C99 and ISO C11 compilers. *** Features deprecated since Bison 1.875 The definitions of yystype and yyltype will be removed; use YYSTYPE and YYLTYPE. YYPARSE_PARAM and YYLEX_PARAM, deprecated in favor of %parse-param and %lex-param, will no longer be supported. Support for the preprocessor symbol YYERROR_VERBOSE will be removed, use %error-verbose. *** The generated header will be included (yacc.c) Instead of duplicating the content of the generated header (definition of YYSTYPE, yyparse declaration etc.), the generated parser will include it, as is already the case for GLR or C++ parsers. This change is deferred because existing versions of ylwrap (e.g., Automake 1.12.1) do not support it. ** Generated Parser Headers *** Guards (yacc.c, glr.c, glr.cc) The generated headers are now guarded, as is already the case for C++ parsers (lalr1.cc). For instance, with --defines=foo.h: #ifndef YY_FOO_H # define YY_FOO_H ... #endif /* !YY_FOO_H */ *** New declarations (yacc.c, glr.c) The generated header now declares yydebug and yyparse. Both honor --name-prefix=bar_, and yield int bar_parse (void); rather than #define yyparse bar_parse int yyparse (void); in order to facilitate the inclusion of several parser headers inside a single compilation unit. *** Exported symbols in C++ The symbols YYTOKEN_TABLE and YYERROR_VERBOSE, which were defined in the header, are removed, as they prevent the possibility of including several generated headers from a single compilation unit. *** YYLSP_NEEDED For the same reasons, the undocumented and unused macro YYLSP_NEEDED is no longer defined. ** New %define variable: api.prefix Now that the generated headers are more complete and properly protected against multiple inclusions, constant names, such as YYSTYPE are a problem. While yyparse and others are properly renamed by %name-prefix, YYSTYPE, YYDEBUG and others have never been affected by it. Because it would introduce backward compatibility issues in projects not expecting YYSTYPE to be renamed, instead of changing the behavior of %name-prefix, it is deprecated in favor of a new %define variable: api.prefix. The following examples compares both: %name-prefix "bar_" | %define api.prefix "bar_" %token FOO %token FOO %union { int ival; } %union { int ival; } %% %% exp: 'a'; exp: 'a'; bison generates: #ifndef BAR_FOO_H #ifndef BAR_FOO_H # define BAR_FOO_H # define BAR_FOO_H /* Enabling traces. */ /* Enabling traces. */ # ifndef YYDEBUG | # ifndef BAR_DEBUG > # if defined YYDEBUG > # if YYDEBUG > # define BAR_DEBUG 1 > # else > # define BAR_DEBUG 0 > # endif > # else # define YYDEBUG 0 | # define BAR_DEBUG 0 > # endif # endif | # endif # if YYDEBUG | # if BAR_DEBUG extern int bar_debug; extern int bar_debug; # endif # endif /* Tokens. */ /* Tokens. */ # ifndef YYTOKENTYPE | # ifndef BAR_TOKENTYPE # define YYTOKENTYPE | # define BAR_TOKENTYPE enum yytokentype { | enum bar_tokentype { FOO = 258 FOO = 258 }; }; # endif # endif #if ! defined YYSTYPE \ | #if ! defined BAR_STYPE \ && ! defined YYSTYPE_IS_DECLARED | && ! defined BAR_STYPE_IS_DECLARED typedef union YYSTYPE | typedef union BAR_STYPE { { int ival; int ival; } YYSTYPE; | } BAR_STYPE; # define YYSTYPE_IS_DECLARED 1 | # define BAR_STYPE_IS_DECLARED 1 #endif #endif extern YYSTYPE bar_lval; | extern BAR_STYPE bar_lval; int bar_parse (void); int bar_parse (void); #endif /* !BAR_FOO_H */ #endif /* !BAR_FOO_H */ * Noteworthy changes in release 2.5.1 (2012-06-05) [stable] ** Future changes: The next major release will drop support for generating parsers in K&R C. ** yacc.c: YYBACKUP works as expected. ** glr.c improvements: *** Location support is eliminated when not requested: GLR parsers used to include location-related code even when locations were not requested, and therefore not even usable. *** __attribute__ is preserved: __attribute__ is no longer disabled when __STRICT_ANSI__ is defined (i.e., when -std is passed to GCC). ** lalr1.java: several fixes: The Java parser no longer throws ArrayIndexOutOfBoundsException if the first token leads to a syntax error. Some minor clean ups. ** Changes for C++: *** C++11 compatibility: C and C++ parsers use "nullptr" instead of "0" when __cplusplus is 201103L or higher. *** Header guards The header files such as "parser.hh", "location.hh", etc. used a constant name for preprocessor guards, for instance: #ifndef BISON_LOCATION_HH # define BISON_LOCATION_HH ... #endif // !BISON_LOCATION_HH The inclusion guard is now computed from "PREFIX/FILE-NAME", where lower case characters are converted to upper case, and series of non-alphanumerical characters are converted to an underscore. With "bison -o lang++/parser.cc", "location.hh" would now include: #ifndef YY_LANG_LOCATION_HH # define YY_LANG_LOCATION_HH ... #endif // !YY_LANG_LOCATION_HH *** C++ locations: The position and location constructors (and their initialize methods) accept new arguments for line and column. Several issues in the documentation were fixed. ** liby is no longer asking for "rpl_fprintf" on some platforms. ** Changes in the manual: *** %printer is documented The "%printer" directive, supported since at least Bison 1.50, is finally documented. The "mfcalc" example is extended to demonstrate it. For consistency with the C skeletons, the C++ parsers now also support "yyoutput" (as an alias to "debug_stream ()"). *** Several improvements have been made: The layout for grammar excerpts was changed to a more compact scheme. Named references are motivated. The description of the automaton description file (*.output) is updated to the current format. Incorrect index entries were fixed. Some other errors were fixed. ** Building bison: *** Conflicting prototypes with recent/modified Flex. Fixed build problems with the current, unreleased, version of Flex, and some modified versions of 2.5.35, which have modified function prototypes. *** Warnings during the build procedure have been eliminated. *** Several portability problems in the test suite have been fixed: This includes warnings with some compilers, unexpected behavior of tools such as diff, warning messages from the test suite itself, etc. *** The install-pdf target works properly: Running "make install-pdf" (or -dvi, -html, -info, and -ps) no longer halts in the middle of its course. * Changes in version 2.5 (2011-05-14): ** Grammar symbol names can now contain non-initial dashes: Consistently with directives (such as %error-verbose) and with %define variables (e.g. push-pull), grammar symbol names may contain dashes in any position except the beginning. This is a GNU extension over POSIX Yacc. Thus, use of this extension is reported by -Wyacc and rejected in Yacc mode (--yacc). ** Named references: Historically, Yacc and Bison have supported positional references ($n, $$) to allow access to symbol values from inside of semantic actions code. Starting from this version, Bison can also accept named references. When no ambiguity is possible, original symbol names may be used as named references: if_stmt : "if" cond_expr "then" then_stmt ';' { $if_stmt = mk_if_stmt($cond_expr, $then_stmt); } In the more common case, explicit names may be declared: stmt[res] : "if" expr[cond] "then" stmt[then] "else" stmt[else] ';' { $res = mk_if_stmt($cond, $then, $else); } Location information is also accessible using @name syntax. When accessing symbol names containing dots or dashes, explicit bracketing ($[sym.1]) must be used. These features are experimental in this version. More user feedback will help to stabilize them. Contributed by Alex Rozenman. ** IELR(1) and canonical LR(1): IELR(1) is a minimal LR(1) parser table generation algorithm. That is, given any context-free grammar, IELR(1) generates parser tables with the full language-recognition power of canonical LR(1) but with nearly the same number of parser states as LALR(1). This reduction in parser states is often an order of magnitude. More importantly, because canonical LR(1)'s extra parser states may contain duplicate conflicts in the case of non-LR(1) grammars, the number of conflicts for IELR(1) is often an order of magnitude less as well. This can significantly reduce the complexity of developing of a grammar. Bison can now generate IELR(1) and canonical LR(1) parser tables in place of its traditional LALR(1) parser tables, which remain the default. You can specify the type of parser tables in the grammar file with these directives: %define lr.type lalr %define lr.type ielr %define lr.type canonical-lr The default-reduction optimization in the parser tables can also be adjusted using "%define lr.default-reductions". For details on both of these features, see the new section "Tuning LR" in the Bison manual. These features are experimental. More user feedback will help to stabilize them. ** LAC (Lookahead Correction) for syntax error handling Contributed by Joel E. Denny. Canonical LR, IELR, and LALR can suffer from a couple of problems upon encountering a syntax error. First, the parser might perform additional parser stack reductions before discovering the syntax error. Such reductions can perform user semantic actions that are unexpected because they are based on an invalid token, and they cause error recovery to begin in a different syntactic context than the one in which the invalid token was encountered. Second, when verbose error messages are enabled (with %error-verbose or the obsolete "#define YYERROR_VERBOSE"), the expected token list in the syntax error message can both contain invalid tokens and omit valid tokens. The culprits for the above problems are %nonassoc, default reductions in inconsistent states, and parser state merging. Thus, IELR and LALR suffer the most. Canonical LR can suffer only if %nonassoc is used or if default reductions are enabled for inconsistent states. LAC is a new mechanism within the parsing algorithm that solves these problems for canonical LR, IELR, and LALR without sacrificing %nonassoc, default reductions, or state merging. When LAC is in use, canonical LR and IELR behave almost exactly the same for both syntactically acceptable and syntactically unacceptable input. While LALR still does not support the full language-recognition power of canonical LR and IELR, LAC at least enables LALR's syntax error handling to correctly reflect LALR's language-recognition power. Currently, LAC is only supported for deterministic parsers in C. You can enable LAC with the following directive: %define parse.lac full See the new section "LAC" in the Bison manual for additional details including a few caveats. LAC is an experimental feature. More user feedback will help to stabilize it. ** %define improvements: *** Can now be invoked via the command line: Each of these command-line options -D NAME[=VALUE] --define=NAME[=VALUE] -F NAME[=VALUE] --force-define=NAME[=VALUE] is equivalent to this grammar file declaration %define NAME ["VALUE"] except that the manner in which Bison processes multiple definitions for the same NAME differs. Most importantly, -F and --force-define quietly override %define, but -D and --define do not. For further details, see the section "Bison Options" in the Bison manual. *** Variables renamed: The following %define variables api.push_pull lr.keep_unreachable_states have been renamed to api.push-pull lr.keep-unreachable-states The old names are now deprecated but will be maintained indefinitely for backward compatibility. *** Values no longer need to be quoted in the grammar file: If a %define value is an identifier, it no longer needs to be placed within quotations marks. For example, %define api.push-pull "push" can be rewritten as %define api.push-pull push *** Unrecognized variables are now errors not warnings. *** Multiple invocations for any variable is now an error not a warning. ** Unrecognized %code qualifiers are now errors not warnings. ** Character literals not of length one: Previously, Bison quietly converted all character literals to length one. For example, without warning, Bison interpreted the operators in the following grammar to be the same token: exp: exp '++' | exp '+' exp ; Bison now warns when a character literal is not of length one. In some future release, Bison will start reporting an error instead. ** Destructor calls fixed for lookaheads altered in semantic actions: Previously for deterministic parsers in C, if a user semantic action altered yychar, the parser in some cases used the old yychar value to determine which destructor to call for the lookahead upon a syntax error or upon parser return. This bug has been fixed. ** C++ parsers use YYRHSLOC: Similarly to the C parsers, the C++ parsers now define the YYRHSLOC macro and use it in the default YYLLOC_DEFAULT. You are encouraged to use it. If, for instance, your location structure has "first" and "last" members, instead of # define YYLLOC_DEFAULT(Current, Rhs, N) \ do \ if (N) \ { \ (Current).first = (Rhs)[1].location.first; \ (Current).last = (Rhs)[N].location.last; \ } \ else \ { \ (Current).first = (Current).last = (Rhs)[0].location.last; \ } \ while (false) use: # define YYLLOC_DEFAULT(Current, Rhs, N) \ do \ if (N) \ { \ (Current).first = YYRHSLOC (Rhs, 1).first; \ (Current).last = YYRHSLOC (Rhs, N).last; \ } \ else \ { \ (Current).first = (Current).last = YYRHSLOC (Rhs, 0).last; \ } \ while (false) ** YYLLOC_DEFAULT in C++: The default implementation of YYLLOC_DEFAULT used to be issued in the header file. It is now output in the implementation file, after the user %code sections so that its #ifndef guard does not try to override the user's YYLLOC_DEFAULT if provided. ** YYFAIL now produces warnings and Java parsers no longer implement it: YYFAIL has existed for many years as an undocumented feature of deterministic parsers in C generated by Bison. More recently, it was a documented feature of Bison's experimental Java parsers. As promised in Bison 2.4.2's NEWS entry, any appearance of YYFAIL in a semantic action now produces a deprecation warning, and Java parsers no longer implement YYFAIL at all. For further details, including a discussion of how to suppress C preprocessor warnings about YYFAIL being unused, see the Bison 2.4.2 NEWS entry. ** Temporary hack for adding a semicolon to the user action: Previously, Bison appended a semicolon to every user action for reductions when the output language defaulted to C (specifically, when neither %yacc, %language, %skeleton, or equivalent command-line options were specified). This allowed actions such as exp: exp "+" exp { $$ = $1 + $3 }; instead of exp: exp "+" exp { $$ = $1 + $3; }; As a first step in removing this misfeature, Bison now issues a warning when it appends a semicolon. Moreover, in cases where Bison cannot easily determine whether a semicolon is needed (for example, an action ending with a cpp directive or a braced compound initializer), it no longer appends one. Thus, the C compiler might now complain about a missing semicolon where it did not before. Future releases of Bison will cease to append semicolons entirely. ** Verbose syntax error message fixes: When %error-verbose or the obsolete "#define YYERROR_VERBOSE" is specified, syntax error messages produced by the generated parser include the unexpected token as well as a list of expected tokens. The effect of %nonassoc on these verbose messages has been corrected in two ways, but a more complete fix requires LAC, described above: *** When %nonassoc is used, there can exist parser states that accept no tokens, and so the parser does not always require a lookahead token in order to detect a syntax error. Because no unexpected token or expected tokens can then be reported, the verbose syntax error message described above is suppressed, and the parser instead reports the simpler message, "syntax error". Previously, this suppression was sometimes erroneously triggered by %nonassoc when a lookahead was actually required. Now verbose messages are suppressed only when all previous lookaheads have already been shifted or discarded. *** Previously, the list of expected tokens erroneously included tokens that would actually induce a syntax error because conflicts for them were resolved with %nonassoc in the current parser state. Such tokens are now properly omitted from the list. *** Expected token lists are still often wrong due to state merging (from LALR or IELR) and default reductions, which can both add invalid tokens and subtract valid tokens. Canonical LR almost completely fixes this problem by eliminating state merging and default reductions. However, there is one minor problem left even when using canonical LR and even after the fixes above. That is, if the resolution of a conflict with %nonassoc appears in a later parser state than the one at which some syntax error is discovered, the conflicted token is still erroneously included in the expected token list. Bison's new LAC implementation, described above, eliminates this problem and the need for canonical LR. However, LAC is still experimental and is disabled by default. ** Java skeleton fixes: *** A location handling bug has been fixed. *** The top element of each of the value stack and location stack is now cleared when popped so that it can be garbage collected. *** Parser traces now print the top element of the stack. ** -W/--warnings fixes: *** Bison now properly recognizes the "no-" versions of categories: For example, given the following command line, Bison now enables all warnings except warnings for incompatibilities with POSIX Yacc: bison -Wall,no-yacc gram.y *** Bison now treats S/R and R/R conflicts like other warnings: Previously, conflict reports were independent of Bison's normal warning system. Now, Bison recognizes the warning categories "conflicts-sr" and "conflicts-rr". This change has important consequences for the -W and --warnings command-line options. For example: bison -Wno-conflicts-sr gram.y # S/R conflicts not reported bison -Wno-conflicts-rr gram.y # R/R conflicts not reported bison -Wnone gram.y # no conflicts are reported bison -Werror gram.y # any conflict is an error However, as before, if the %expect or %expect-rr directive is specified, an unexpected number of conflicts is an error, and an expected number of conflicts is not reported, so -W and --warning then have no effect on the conflict report. *** The "none" category no longer disables a preceding "error": For example, for the following command line, Bison now reports errors instead of warnings for incompatibilities with POSIX Yacc: bison -Werror,none,yacc gram.y *** The "none" category now disables all Bison warnings: Previously, the "none" category disabled only Bison warnings for which there existed a specific -W/--warning category. However, given the following command line, Bison is now guaranteed to suppress all warnings: bison -Wnone gram.y ** Precedence directives can now assign token number 0: Since Bison 2.3b, which restored the ability of precedence directives to assign token numbers, doing so for token number 0 has produced an assertion failure. For example: %left END 0 This bug has been fixed. * Changes in version 2.4.3 (2010-08-05): ** Bison now obeys -Werror and --warnings=error for warnings about grammar rules that are useless in the parser due to conflicts. ** Problems with spawning M4 on at least FreeBSD 8 and FreeBSD 9 have been fixed. ** Failures in the test suite for GCC 4.5 have been fixed. ** Failures in the test suite for some versions of Sun Studio C++ have been fixed. ** Contrary to Bison 2.4.2's NEWS entry, it has been decided that warnings about undefined %prec identifiers will not be converted to errors in Bison 2.5. They will remain warnings, which should be sufficient for POSIX while avoiding backward compatibility issues. ** Minor documentation fixes. * Changes in version 2.4.2 (2010-03-20): ** Some portability problems that resulted in failures and livelocks in the test suite on some versions of at least Solaris, AIX, HP-UX, RHEL4, and Tru64 have been addressed. As a result, fatal Bison errors should no longer cause M4 to report a broken pipe on the affected platforms. ** "%prec IDENTIFIER" requires IDENTIFIER to be defined separately. POSIX specifies that an error be reported for any identifier that does not appear on the LHS of a grammar rule and that is not defined by %token, %left, %right, or %nonassoc. Bison 2.3b and later lost this error report for the case when an identifier appears only after a %prec directive. It is now restored. However, for backward compatibility with recent Bison releases, it is only a warning for now. In Bison 2.5 and later, it will return to being an error. [Between the 2.4.2 and 2.4.3 releases, it was decided that this warning will not be converted to an error in Bison 2.5.] ** Detection of GNU M4 1.4.6 or newer during configure is improved. ** Warnings from gcc's -Wundef option about undefined YYENABLE_NLS, YYLTYPE_IS_TRIVIAL, and __STRICT_ANSI__ in C/C++ parsers are now avoided. ** %code is now a permanent feature. A traditional Yacc prologue directive is written in the form: %{CODE%} To provide a more flexible alternative, Bison 2.3b introduced the %code directive with the following forms for C/C++: %code {CODE} %code requires {CODE} %code provides {CODE} %code top {CODE} These forms are now considered permanent features of Bison. See the %code entries in the section "Bison Declaration Summary" in the Bison manual for a summary of their functionality. See the section "Prologue Alternatives" for a detailed discussion including the advantages of %code over the traditional Yacc prologue directive. Bison's Java feature as a whole including its current usage of %code is still considered experimental. ** YYFAIL is deprecated and will eventually be removed. YYFAIL has existed for many years as an undocumented feature of deterministic parsers in C generated by Bison. Previously, it was documented for Bison's experimental Java parsers. YYFAIL is no longer documented for Java parsers and is formally deprecated in both cases. Users are strongly encouraged to migrate to YYERROR, which is specified by POSIX. Like YYERROR, you can invoke YYFAIL from a semantic action in order to induce a syntax error. The most obvious difference from YYERROR is that YYFAIL will automatically invoke yyerror to report the syntax error so that you don't have to. However, there are several other subtle differences between YYERROR and YYFAIL, and YYFAIL suffers from inherent flaws when %error-verbose or "#define YYERROR_VERBOSE" is used. For a more detailed discussion, see: http://lists.gnu.org/archive/html/bison-patches/2009-12/msg00024.html The upcoming Bison 2.5 will remove YYFAIL from Java parsers, but deterministic parsers in C will continue to implement it. However, because YYFAIL is already flawed, it seems futile to try to make new Bison features compatible with it. Thus, during parser generation, Bison 2.5 will produce a warning whenever it discovers YYFAIL in a rule action. In a later release, YYFAIL will be disabled for %error-verbose and "#define YYERROR_VERBOSE". Eventually, YYFAIL will be removed altogether. There exists at least one case where Bison 2.5's YYFAIL warning will be a false positive. Some projects add phony uses of YYFAIL and other Bison-defined macros for the sole purpose of suppressing C preprocessor warnings (from GCC cpp's -Wunused-macros, for example). To avoid Bison's future warning, such YYFAIL uses can be moved to the epilogue (that is, after the second "%%") in the Bison input file. In this release (2.4.2), Bison already generates its own code to suppress C preprocessor warnings for YYFAIL, so projects can remove their own phony uses of YYFAIL if compatibility with Bison releases prior to 2.4.2 is not necessary. ** Internationalization. Fix a regression introduced in Bison 2.4: Under some circumstances, message translations were not installed although supported by the host system. * Changes in version 2.4.1 (2008-12-11): ** In the GLR defines file, unexpanded M4 macros in the yylval and yylloc declarations have been fixed. ** Temporary hack for adding a semicolon to the user action. Bison used to prepend a trailing semicolon at the end of the user action for reductions. This allowed actions such as exp: exp "+" exp { $$ = $1 + $3 }; instead of exp: exp "+" exp { $$ = $1 + $3; }; Some grammars still depend on this "feature". Bison 2.4.1 restores the previous behavior in the case of C output (specifically, when neither %language or %skeleton or equivalent command-line options are used) to leave more time for grammars depending on the old behavior to be adjusted. Future releases of Bison will disable this feature. ** A few minor improvements to the Bison manual. * Changes in version 2.4 (2008-11-02): ** %language is an experimental feature. We first introduced this feature in test release 2.3b as a cleaner alternative to %skeleton. Since then, we have discussed the possibility of modifying its effect on Bison's output file names. Thus, in this release, we consider %language to be an experimental feature that will likely evolve in future releases. ** Forward compatibility with GNU M4 has been improved. ** Several bugs in the C++ skeleton and the experimental Java skeleton have been fixed. * Changes in version 2.3b (2008-05-27): ** The quotes around NAME that used to be required in the following directive are now deprecated: %define NAME "VALUE" ** The directive "%pure-parser" is now deprecated in favor of: %define api.pure which has the same effect except that Bison is more careful to warn about unreasonable usage in the latter case. ** Push Parsing Bison can now generate an LALR(1) parser in C with a push interface. That is, instead of invoking "yyparse", which pulls tokens from "yylex", you can push one token at a time to the parser using "yypush_parse", which will return to the caller after processing each token. By default, the push interface is disabled. Either of the following directives will enable it: %define api.push_pull "push" // Just push; does not require yylex. %define api.push_pull "both" // Push and pull; requires yylex. See the new section "A Push Parser" in the Bison manual for details. The current push parsing interface is experimental and may evolve. More user feedback will help to stabilize it. ** The -g and --graph options now output graphs in Graphviz DOT format, not VCG format. Like --graph, -g now also takes an optional FILE argument and thus cannot be bundled with other short options. ** Java Bison can now generate an LALR(1) parser in Java. The skeleton is "data/lalr1.java". Consider using the new %language directive instead of %skeleton to select it. See the new section "Java Parsers" in the Bison manual for details. The current Java interface is experimental and may evolve. More user feedback will help to stabilize it. Contributed by Paolo Bonzini. ** %language This new directive specifies the programming language of the generated parser, which can be C (the default), C++, or Java. Besides the skeleton that Bison uses, the directive affects the names of the generated files if the grammar file's name ends in ".y". ** XML Automaton Report Bison can now generate an XML report of the LALR(1) automaton using the new "--xml" option. The current XML schema is experimental and may evolve. More user feedback will help to stabilize it. Contributed by Wojciech Polak. ** The grammar file may now specify the name of the parser header file using %defines. For example: %defines "parser.h" ** When reporting useless rules, useless nonterminals, and unused terminals, Bison now employs the terms "useless in grammar" instead of "useless", "useless in parser" instead of "never reduced", and "unused in grammar" instead of "unused". ** Unreachable State Removal Previously, Bison sometimes generated parser tables containing unreachable states. A state can become unreachable during conflict resolution if Bison disables a shift action leading to it from a predecessor state. Bison now: 1. Removes unreachable states. 2. Does not report any conflicts that appeared in unreachable states. WARNING: As a result, you may need to update %expect and %expect-rr directives in existing grammar files. 3. For any rule used only in such states, Bison now reports the rule as "useless in parser due to conflicts". This feature can be disabled with the following directive: %define lr.keep_unreachable_states See the %define entry in the "Bison Declaration Summary" in the Bison manual for further discussion. ** Lookahead Set Correction in the ".output" Report When instructed to generate a ".output" file including lookahead sets (using "--report=lookahead", for example), Bison now prints each reduction's lookahead set only next to the associated state's one item that (1) is associated with the same rule as the reduction and (2) has its dot at the end of its RHS. Previously, Bison also erroneously printed the lookahead set next to all of the state's other items associated with the same rule. This bug affected only the ".output" file and not the generated parser source code. ** --report-file=FILE is a new option to override the default ".output" file name. ** The "=" that used to be required in the following directives is now deprecated: %file-prefix "parser" %name-prefix "c_" %output "parser.c" ** An Alternative to "%{...%}" -- "%code QUALIFIER {CODE}" Bison 2.3a provided a new set of directives as a more flexible alternative to the traditional Yacc prologue blocks. Those have now been consolidated into a single %code directive with an optional qualifier field, which identifies the purpose of the code and thus the location(s) where Bison should generate it: 1. "%code {CODE}" replaces "%after-header {CODE}" 2. "%code requires {CODE}" replaces "%start-header {CODE}" 3. "%code provides {CODE}" replaces "%end-header {CODE}" 4. "%code top {CODE}" replaces "%before-header {CODE}" See the %code entries in section "Bison Declaration Summary" in the Bison manual for a summary of the new functionality. See the new section "Prologue Alternatives" for a detailed discussion including the advantages of %code over the traditional Yacc prologues. The prologue alternatives are experimental. More user feedback will help to determine whether they should become permanent features. ** Revised warning: unset or unused mid-rule values Since Bison 2.2, Bison has warned about mid-rule values that are set but not used within any of the actions of the parent rule. For example, Bison warns about unused $2 in: exp: '1' { $$ = 1; } '+' exp { $$ = $1 + $4; }; Now, Bison also warns about mid-rule values that are used but not set. For example, Bison warns about unset $$ in the mid-rule action in: exp: '1' { $1 = 1; } '+' exp { $$ = $2 + $4; }; However, Bison now disables both of these warnings by default since they sometimes prove to be false alarms in existing grammars employing the Yacc constructs $0 or $-N (where N is some positive integer). To enable these warnings, specify the option "--warnings=midrule-values" or "-W", which is a synonym for "--warnings=all". ** Default %destructor or %printer with "<*>" or "<>" Bison now recognizes two separate kinds of default %destructor's and %printer's: 1. Place "<*>" in a %destructor/%printer symbol list to define a default %destructor/%printer for all grammar symbols for which you have formally declared semantic type tags. 2. Place "<>" in a %destructor/%printer symbol list to define a default %destructor/%printer for all grammar symbols without declared semantic type tags. Bison no longer supports the "%symbol-default" notation from Bison 2.3a. "<*>" and "<>" combined achieve the same effect with one exception: Bison no longer applies any %destructor to a mid-rule value if that mid-rule value is not actually ever referenced using either $$ or $n in a semantic action. The default %destructor's and %printer's are experimental. More user feedback will help to determine whether they should become permanent features. See the section "Freeing Discarded Symbols" in the Bison manual for further details. ** %left, %right, and %nonassoc can now declare token numbers. This is required by POSIX. However, see the end of section "Operator Precedence" in the Bison manual for a caveat concerning the treatment of literal strings. ** The nonfunctional --no-parser, -n, and %no-parser options have been completely removed from Bison. * Changes in version 2.3a, 2006-09-13: ** Instead of %union, you can define and use your own union type YYSTYPE if your grammar contains at least one tag. Your YYSTYPE need not be a macro; it can be a typedef. This change is for compatibility with other Yacc implementations, and is required by POSIX. ** Locations columns and lines start at 1. In accordance with the GNU Coding Standards and Emacs. ** You may now declare per-type and default %destructor's and %printer's: For example: %union { char *string; } %token STRING1 %token STRING2 %type string1 %type string2 %union { char character; } %token CHR %type chr %destructor { free ($$); } %symbol-default %destructor { free ($$); printf ("%d", @$.first_line); } STRING1 string1 %destructor { } guarantees that, when the parser discards any user-defined symbol that has a semantic type tag other than "", it passes its semantic value to "free". However, when the parser discards a "STRING1" or a "string1", it also prints its line number to "stdout". It performs only the second "%destructor" in this case, so it invokes "free" only once. [Although we failed to mention this here in the 2.3a release, the default %destructor's and %printer's were experimental, and they were rewritten in future versions.] ** Except for LALR(1) parsers in C with POSIX Yacc emulation enabled (with "-y", "--yacc", or "%yacc"), Bison no longer generates #define statements for associating token numbers with token names. Removing the #define statements helps to sanitize the global namespace during preprocessing, but POSIX Yacc requires them. Bison still generates an enum for token names in all cases. ** Handling of traditional Yacc prologue blocks is now more consistent but potentially incompatible with previous releases of Bison. As before, you declare prologue blocks in your grammar file with the "%{ ... %}" syntax. To generate the pre-prologue, Bison concatenates all prologue blocks that you've declared before the first %union. To generate the post-prologue, Bison concatenates all prologue blocks that you've declared after the first %union. Previous releases of Bison inserted the pre-prologue into both the header file and the code file in all cases except for LALR(1) parsers in C. In the latter case, Bison inserted it only into the code file. For parsers in C++, the point of insertion was before any token definitions (which associate token numbers with names). For parsers in C, the point of insertion was after the token definitions. Now, Bison never inserts the pre-prologue into the header file. In the code file, it always inserts it before the token definitions. ** Bison now provides a more flexible alternative to the traditional Yacc prologue blocks: %before-header, %start-header, %end-header, and %after-header. For example, the following declaration order in the grammar file reflects the order in which Bison will output these code blocks. However, you are free to declare these code blocks in your grammar file in whatever order is most convenient for you: %before-header { /* Bison treats this block like a pre-prologue block: it inserts it into * the code file before the contents of the header file. It does *not* * insert it into the header file. This is a good place to put * #include's that you want at the top of your code file. A common * example is '#include "system.h"'. */ } %start-header { /* Bison inserts this block into both the header file and the code file. * In both files, the point of insertion is before any Bison-generated * token, semantic type, location type, and class definitions. This is a * good place to define %union dependencies, for example. */ } %union { /* Unlike the traditional Yacc prologue blocks, the output order for the * new %*-header blocks is not affected by their declaration position * relative to any %union in the grammar file. */ } %end-header { /* Bison inserts this block into both the header file and the code file. * In both files, the point of insertion is after the Bison-generated * definitions. This is a good place to declare or define public * functions or data structures that depend on the Bison-generated * definitions. */ } %after-header { /* Bison treats this block like a post-prologue block: it inserts it into * the code file after the contents of the header file. It does *not* * insert it into the header file. This is a good place to declare or * define internal functions or data structures that depend on the * Bison-generated definitions. */ } If you have multiple occurrences of any one of the above declarations, Bison will concatenate the contents in declaration order. [Although we failed to mention this here in the 2.3a release, the prologue alternatives were experimental, and they were rewritten in future versions.] ** The option "--report=look-ahead" has been changed to "--report=lookahead". The old spelling still works, but is not documented and may be removed in a future release. * Changes in version 2.3, 2006-06-05: ** GLR grammars should now use "YYRECOVERING ()" instead of "YYRECOVERING", for compatibility with LALR(1) grammars. ** It is now documented that any definition of YYSTYPE or YYLTYPE should be to a type name that does not contain parentheses or brackets. * Changes in version 2.2, 2006-05-19: ** The distribution terms for all Bison-generated parsers now permit using the parsers in nonfree programs. Previously, this permission was granted only for Bison-generated LALR(1) parsers in C. ** %name-prefix changes the namespace name in C++ outputs. ** The C++ parsers export their token_type. ** Bison now allows multiple %union declarations, and concatenates their contents together. ** New warning: unused values Right-hand side symbols whose values are not used are reported, if the symbols have destructors. For instance: exp: exp "?" exp ":" exp { $1 ? $1 : $3; } | exp "+" exp ; will trigger a warning about $$ and $5 in the first rule, and $3 in the second ($1 is copied to $$ by the default rule). This example most likely contains three errors, and could be rewritten as: exp: exp "?" exp ":" exp { $$ = $1 ? $3 : $5; free ($1 ? $5 : $3); free ($1); } | exp "+" exp { $$ = $1 ? $1 : $3; if ($1) free ($3); } ; However, if the original actions were really intended, memory leaks and all, the warnings can be suppressed by letting Bison believe the values are used, e.g.: exp: exp "?" exp ":" exp { $1 ? $1 : $3; (void) ($$, $5); } | exp "+" exp { $$ = $1; (void) $3; } ; If there are mid-rule actions, the warning is issued if no action uses it. The following triggers no warning: $1 and $3 are used. exp: exp { push ($1); } '+' exp { push ($3); sum (); }; The warning is intended to help catching lost values and memory leaks. If a value is ignored, its associated memory typically is not reclaimed. ** %destructor vs. YYABORT, YYACCEPT, and YYERROR. Destructors are now called when user code invokes YYABORT, YYACCEPT, and YYERROR, for all objects on the stack, other than objects corresponding to the right-hand side of the current rule. ** %expect, %expect-rr Incorrect numbers of expected conflicts are now actual errors, instead of warnings. ** GLR, YACC parsers. The %parse-params are available in the destructors (and the experimental printers) as per the documentation. ** Bison now warns if it finds a stray "$" or "@" in an action. ** %require "VERSION" This specifies that the grammar file depends on features implemented in Bison version VERSION or higher. ** lalr1.cc: The token and value types are now class members. The tokens were defined as free form enums and cpp macros. YYSTYPE was defined as a free form union. They are now class members: tokens are enumerations of the "yy::parser::token" struct, and the semantic values have the "yy::parser::semantic_type" type. If you do not want or can update to this scheme, the directive '%define "global_tokens_and_yystype" "1"' triggers the global definition of tokens and YYSTYPE. This change is suitable both for previous releases of Bison, and this one. If you wish to update, then make sure older version of Bison will fail using '%require "2.2"'. ** DJGPP support added. * Changes in version 2.1, 2005-09-16: ** The C++ lalr1.cc skeleton supports %lex-param. ** Bison-generated parsers now support the translation of diagnostics like "syntax error" into languages other than English. The default language is still English. For details, please see the new Internationalization section of the Bison manual. Software distributors should also see the new PACKAGING file. Thanks to Bruno Haible for this new feature. ** Wording in the Bison-generated parsers has been changed slightly to simplify translation. In particular, the message "memory exhausted" has replaced "parser stack overflow", as the old message was not always accurate for modern Bison-generated parsers. ** Destructors are now called when the parser aborts, for all symbols left behind on the stack. Also, the start symbol is now destroyed after a successful parse. In both cases, the behavior was formerly inconsistent. ** When generating verbose diagnostics, Bison-generated parsers no longer quote the literal strings associated with tokens. For example, for a syntax error associated with '%token NUM "number"' they might print 'syntax error, unexpected number' instead of 'syntax error, unexpected "number"'. * Changes in version 2.0, 2004-12-25: ** Possibly-incompatible changes - Bison-generated parsers no longer default to using the alloca function (when available) to extend the parser stack, due to widespread problems in unchecked stack-overflow detection. You can "#define YYSTACK_USE_ALLOCA 1" to require the use of alloca, but please read the manual to determine safe values for YYMAXDEPTH in that case. - Error token location. During error recovery, the location of the syntax error is updated to cover the whole sequence covered by the error token: it includes the shifted symbols thrown away during the first part of the error recovery, and the lookahead rejected during the second part. - Semicolon changes: . Stray semicolons are no longer allowed at the start of a grammar. . Semicolons are now required after in-grammar declarations. - Unescaped newlines are no longer allowed in character constants or string literals. They were never portable, and GCC 3.4.0 has dropped support for them. Better diagnostics are now generated if forget a closing quote. - NUL bytes are no longer allowed in Bison string literals, unfortunately. ** New features - GLR grammars now support locations. - New directive: %initial-action. This directive allows the user to run arbitrary code (including initializing @$) from yyparse before parsing starts. - A new directive "%expect-rr N" specifies the expected number of reduce/reduce conflicts in GLR parsers. - %token numbers can now be hexadecimal integers, e.g., "%token FOO 0x12d". This is a GNU extension. - The option "--report=lookahead" was changed to "--report=look-ahead". [However, this was changed back after 2.3.] - Experimental %destructor support has been added to lalr1.cc. - New configure option --disable-yacc, to disable installation of the yacc command and -ly library introduced in 1.875 for POSIX conformance. ** Bug fixes - For now, %expect-count violations are now just warnings, not errors. This is for compatibility with Bison 1.75 and earlier (when there are reduce/reduce conflicts) and with Bison 1.30 and earlier (when there are too many or too few shift/reduce conflicts). However, in future versions of Bison we plan to improve the %expect machinery so that these violations will become errors again. - Within Bison itself, numbers (e.g., goto numbers) are no longer arbitrarily limited to 16-bit counts. - Semicolons are now allowed before "|" in grammar rules, as POSIX requires. * Changes in version 1.875, 2003-01-01: ** The documentation license has been upgraded to version 1.2 of the GNU Free Documentation License. ** syntax error processing - In Yacc-style parsers YYLLOC_DEFAULT is now used to compute error locations too. This fixes bugs in error-location computation. - %destructor It is now possible to reclaim the memory associated to symbols discarded during error recovery. This feature is still experimental. - %error-verbose This new directive is preferred over YYERROR_VERBOSE. - #defining yyerror to steal internal variables is discouraged. It is not guaranteed to work forever. ** POSIX conformance - Semicolons are once again optional at the end of grammar rules. This reverts to the behavior of Bison 1.33 and earlier, and improves compatibility with Yacc. - "parse error" -> "syntax error" Bison now uniformly uses the term "syntax error"; formerly, the code and manual sometimes used the term "parse error" instead. POSIX requires "syntax error" in diagnostics, and it was thought better to be consistent. - The documentation now emphasizes that yylex and yyerror must be declared before use. C99 requires this. - Bison now parses C99 lexical constructs like UCNs and backslash-newline within C escape sequences, as POSIX 1003.1-2001 requires. - File names are properly escaped in C output. E.g., foo\bar.y is output as "foo\\bar.y". - Yacc command and library now available The Bison distribution now installs a "yacc" command, as POSIX requires. Also, Bison now installs a small library liby.a containing implementations of Yacc-compatible yyerror and main functions. This library is normally not useful, but POSIX requires it. - Type clashes now generate warnings, not errors. - If the user does not define YYSTYPE as a macro, Bison now declares it using typedef instead of defining it as a macro. For consistency, YYLTYPE is also declared instead of defined. ** Other compatibility issues - %union directives can now have a tag before the "{", e.g., the directive "%union foo {...}" now generates the C code "typedef union foo { ... } YYSTYPE;"; this is for Yacc compatibility. The default union tag is "YYSTYPE", for compatibility with Solaris 9 Yacc. For consistency, YYLTYPE's struct tag is now "YYLTYPE" not "yyltype". This is for compatibility with both Yacc and Bison 1.35. - ";" is output before the terminating "}" of an action, for compatibility with Bison 1.35. - Bison now uses a Yacc-style format for conflict reports, e.g., "conflicts: 2 shift/reduce, 1 reduce/reduce". - "yystype" and "yyltype" are now obsolescent macros instead of being typedefs or tags; they are no longer documented and are planned to be withdrawn in a future release. ** GLR parser notes - GLR and inline Users of Bison have to decide how they handle the portability of the C keyword "inline". - "parsing stack overflow..." -> "parser stack overflow" GLR parsers now report "parser stack overflow" as per the Bison manual. ** %parse-param and %lex-param The macros YYPARSE_PARAM and YYLEX_PARAM provide a means to pass additional context to yyparse and yylex. They suffer from several shortcomings: - a single argument only can be added, - their types are weak (void *), - this context is not passed to ancillary functions such as yyerror, - only yacc.c parsers support them. The new %parse-param/%lex-param directives provide a more precise control. For instance: %parse-param {int *nastiness} %lex-param {int *nastiness} %parse-param {int *randomness} results in the following signatures: int yylex (int *nastiness); int yyparse (int *nastiness, int *randomness); or, if both %pure-parser and %locations are used: int yylex (YYSTYPE *lvalp, YYLTYPE *llocp, int *nastiness); int yyparse (int *nastiness, int *randomness); ** Bison now warns if it detects conflicting outputs to the same file, e.g., it generates a warning for "bison -d -o foo.h foo.y" since that command outputs both code and header to foo.h. ** #line in output files - --no-line works properly. ** Bison can no longer be built by a K&R C compiler; it requires C89 or later to be built. This change originally took place a few versions ago, but nobody noticed until we recently asked someone to try building Bison with a K&R C compiler. * Changes in version 1.75, 2002-10-14: ** Bison should now work on 64-bit hosts. ** Indonesian translation thanks to Tedi Heriyanto. ** GLR parsers Fix spurious parse errors. ** Pure parsers Some people redefine yyerror to steal yyparse' private variables. Reenable this trick until an official feature replaces it. ** Type Clashes In agreement with POSIX and with other Yaccs, leaving a default action is valid when $$ is untyped, and $1 typed: untyped: ... typed; but the converse remains an error: typed: ... untyped; ** Values of mid-rule actions The following code: foo: { ... } { $$ = $1; } ... was incorrectly rejected: $1 is defined in the second mid-rule action, and is equal to the $$ of the first mid-rule action. * Changes in version 1.50, 2002-10-04: ** GLR parsing The declaration %glr-parser causes Bison to produce a Generalized LR (GLR) parser, capable of handling almost any context-free grammar, ambiguous or not. The new declarations %dprec and %merge on grammar rules allow parse-time resolution of ambiguities. Contributed by Paul Hilfinger. Unfortunately Bison 1.50 does not work properly on 64-bit hosts like the Alpha, so please stick to 32-bit hosts for now. ** Output Directory When not in Yacc compatibility mode, when the output file was not specified, running "bison foo/bar.y" created "foo/bar.c". It now creates "bar.c". ** Undefined token The undefined token was systematically mapped to 2 which prevented the use of 2 by the user. This is no longer the case. ** Unknown token numbers If yylex returned an out of range value, yyparse could die. This is no longer the case. ** Error token According to POSIX, the error token must be 256. Bison extends this requirement by making it a preference: *if* the user specified that one of her tokens is numbered 256, then error will be mapped onto another number. ** Verbose error messages They no longer report "..., expecting error or..." for states where error recovery is possible. ** End token Defaults to "$end" instead of "$". ** Error recovery now conforms to documentation and to POSIX When a Bison-generated parser encounters a syntax error, it now pops the stack until it finds a state that allows shifting the error token. Formerly, it popped the stack until it found a state that allowed some non-error action other than a default reduction on the error token. The new behavior has long been the documented behavior, and has long been required by POSIX. For more details, please see Paul Eggert, "Reductions during Bison error handling" (2002-05-20) . ** Traces Popped tokens and nonterminals are now reported. ** Larger grammars Larger grammars are now supported (larger token numbers, larger grammar size (= sum of the LHS and RHS lengths), larger LALR tables). Formerly, many of these numbers ran afoul of 16-bit limits; now these limits are 32 bits on most hosts. ** Explicit initial rule Bison used to play hacks with the initial rule, which the user does not write. It is now explicit, and visible in the reports and graphs as rule 0. ** Useless rules Before, Bison reported the useless rules, but, although not used, included them in the parsers. They are now actually removed. ** Useless rules, useless nonterminals They are now reported, as a warning, with their locations. ** Rules never reduced Rules that can never be reduced because of conflicts are now reported. ** Incorrect "Token not used" On a grammar such as %token useless useful %% exp: '0' %prec useful; where a token was used to set the precedence of the last rule, bison reported both "useful" and "useless" as useless tokens. ** Revert the C++ namespace changes introduced in 1.31 as they caused too many portability hassles. ** Default locations By an accident of design, the default computation of @$ was performed after another default computation was performed: @$ = @1. The latter is now removed: YYLLOC_DEFAULT is fully responsible of the computation of @$. ** Token end-of-file The token end of file may be specified by the user, in which case, the user symbol is used in the reports, the graphs, and the verbose error messages instead of "$end", which remains being the default. For instance %token MYEOF 0 or %token MYEOF 0 "end of file" ** Semantic parser This old option, which has been broken for ages, is removed. ** New translations Brazilian Portuguese, thanks to Alexandre Folle de Menezes. Croatian, thanks to Denis Lackovic. ** Incorrect token definitions When given %token 'a' "A" bison used to output #define 'a' 65 ** Token definitions as enums Tokens are output both as the traditional #define's, and, provided the compiler supports ANSI C or is a C++ compiler, as enums. This lets debuggers display names instead of integers. ** Reports In addition to --verbose, bison supports --report=THINGS, which produces additional information: - itemset complete the core item sets with their closure - lookahead [changed to "look-ahead" in 1.875e through 2.3, but changed back] explicitly associate lookahead tokens to items - solved describe shift/reduce conflicts solving. Bison used to systematically output this information on top of the report. Solved conflicts are now attached to their states. ** Type clashes Previous versions don't complain when there is a type clash on the default action if the rule has a mid-rule action, such as in: %type bar %% bar: '0' {} '0'; This is fixed. ** GNU M4 is now required when using Bison. * Changes in version 1.35, 2002-03-25: ** C Skeleton Some projects use Bison's C parser with C++ compilers, and define YYSTYPE as a class. The recent adjustment of C parsers for data alignment and 64 bit architectures made this impossible. Because for the time being no real solution for C++ parser generation exists, kludges were implemented in the parser to maintain this use. In the future, when Bison has C++ parsers, this kludge will be disabled. This kludge also addresses some C++ problems when the stack was extended. * Changes in version 1.34, 2002-03-12: ** File name clashes are detected $ bison foo.y -d -o foo.x fatal error: header and parser would both be named "foo.x" ** A missing ";" at the end of a rule triggers a warning In accordance with POSIX, and in agreement with other Yacc implementations, Bison will mandate this semicolon in the near future. This eases the implementation of a Bison parser of Bison grammars by making this grammar LALR(1) instead of LR(2). To facilitate the transition, this release introduces a warning. ** Revert the C++ namespace changes introduced in 1.31, as they caused too many portability hassles. ** DJGPP support added. ** Fix test suite portability problems. * Changes in version 1.33, 2002-02-07: ** Fix C++ issues Groff could not be compiled for the definition of size_t was lacking under some conditions. ** Catch invalid @n As is done with $n. * Changes in version 1.32, 2002-01-23: ** Fix Yacc output file names ** Portability fixes ** Italian, Dutch translations * Changes in version 1.31, 2002-01-14: ** Many Bug Fixes ** GNU Gettext and %expect GNU Gettext asserts 10 s/r conflicts, but there are 7. Now that Bison dies on incorrect %expectations, we fear there will be too many bug reports for Gettext, so _for the time being_, %expect does not trigger an error when the input file is named "plural.y". ** Use of alloca in parsers If YYSTACK_USE_ALLOCA is defined to 0, then the parsers will use malloc exclusively. Since 1.29, but was not NEWS'ed. alloca is used only when compiled with GCC, to avoid portability problems as on AIX. ** yyparse now returns 2 if memory is exhausted; formerly it dumped core. ** When the generated parser lacks debugging code, YYDEBUG is now 0 (as POSIX requires) instead of being undefined. ** User Actions Bison has always permitted actions such as { $$ = $1 }: it adds the ending semicolon. Now if in Yacc compatibility mode, the semicolon is no longer output: one has to write { $$ = $1; }. ** Better C++ compliance The output parsers try to respect C++ namespaces. [This turned out to be a failed experiment, and it was reverted later.] ** Reduced Grammars Fixed bugs when reporting useless nonterminals. ** 64 bit hosts The parsers work properly on 64 bit hosts. ** Error messages Some calls to strerror resulted in scrambled or missing error messages. ** %expect When the number of shift/reduce conflicts is correct, don't issue any warning. ** The verbose report includes the rule line numbers. ** Rule line numbers are fixed in traces. ** Swedish translation ** Parse errors Verbose parse error messages from the parsers are better looking. Before: parse error: unexpected `'/'', expecting `"number"' or `'-'' or `'('' Now: parse error: unexpected '/', expecting "number" or '-' or '(' ** Fixed parser memory leaks. When the generated parser was using malloc to extend its stacks, the previous allocations were not freed. ** Fixed verbose output file. Some newlines were missing. Some conflicts in state descriptions were missing. ** Fixed conflict report. Option -v was needed to get the result. ** %expect Was not used. Mismatches are errors, not warnings. ** Fixed incorrect processing of some invalid input. ** Fixed CPP guards: 9foo.h uses BISON_9FOO_H instead of 9FOO_H. ** Fixed some typos in the documentation. ** %token MY_EOF 0 is supported. Before, MY_EOF was silently renumbered as 257. ** doc/refcard.tex is updated. ** %output, %file-prefix, %name-prefix. New. ** --output New, aliasing "--output-file". * Changes in version 1.30, 2001-10-26: ** "--defines" and "--graph" have now an optional argument which is the output file name. "-d" and "-g" do not change; they do not take any argument. ** "%source_extension" and "%header_extension" are removed, failed experiment. ** Portability fixes. * Changes in version 1.29, 2001-09-07: ** The output file does not define const, as this caused problems when used with common autoconfiguration schemes. If you still use ancient compilers that lack const, compile with the equivalent of the C compiler option "-Dconst=". Autoconf's AC_C_CONST macro provides one way to do this. ** Added "-g" and "--graph". ** The Bison manual is now distributed under the terms of the GNU FDL. ** The input and the output files has automatically a similar extension. ** Russian translation added. ** NLS support updated; should hopefully be less troublesome. ** Added the old Bison reference card. ** Added "--locations" and "%locations". ** Added "-S" and "--skeleton". ** "%raw", "-r", "--raw" is disabled. ** Special characters are escaped when output. This solves the problems of the #line lines with path names including backslashes. ** New directives. "%yacc", "%fixed_output_files", "%defines", "%no_parser", "%verbose", "%debug", "%source_extension" and "%header_extension". ** @$ Automatic location tracking. * Changes in version 1.28, 1999-07-06: ** Should compile better now with K&R compilers. ** Added NLS. ** Fixed a problem with escaping the double quote character. ** There is now a FAQ. * Changes in version 1.27: ** The make rule which prevented bison.simple from being created on some systems has been fixed. * Changes in version 1.26: ** Bison now uses Automake. ** New mailing lists: and . ** Token numbers now start at 257 as previously documented, not 258. ** Bison honors the TMPDIR environment variable. ** A couple of buffer overruns have been fixed. ** Problems when closing files should now be reported. ** Generated parsers should now work even on operating systems which do not provide alloca(). * Changes in version 1.25, 1995-10-16: ** Errors in the input grammar are not fatal; Bison keeps reading the grammar file, and reports all the errors found in it. ** Tokens can now be specified as multiple-character strings: for example, you could use "<=" for a token which looks like <=, instead of choosing a name like LESSEQ. ** The %token_table declaration says to write a table of tokens (names and numbers) into the parser file. The yylex function can use this table to recognize multiple-character string tokens, or for other purposes. ** The %no_lines declaration says not to generate any #line preprocessor directives in the parser file. ** The %raw declaration says to use internal Bison token numbers, not Yacc-compatible token numbers, when token names are defined as macros. ** The --no-parser option produces the parser tables without including the parser engine; a project can now use its own parser engine. The actions go into a separate file called NAME.act, in the form of a switch statement body. * Changes in version 1.23: The user can define YYPARSE_PARAM as the name of an argument to be passed into yyparse. The argument should have type void *. It should actually point to an object. Grammar actions can access the variable by casting it to the proper pointer type. Line numbers in output file corrected. * Changes in version 1.22: --help option added. * Changes in version 1.20: Output file does not redefine const for C++. ----- Copyright (C) 1995-2015 Free Software Foundation, Inc. This file is part of Bison, the GNU Parser Generator. 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 . LocalWords: yacc YYBACKUP glr GCC lalr ArrayIndexOutOfBoundsException nullptr LocalWords: cplusplus liby rpl fprintf mfcalc Wyacc stmt cond expr mk sym lr LocalWords: IELR ielr Lookahead YYERROR nonassoc LALR's api lookaheads yychar LocalWords: destructor lookahead YYRHSLOC YYLLOC Rhs ifndef YYFAIL cpp sr rr LocalWords: preprocessor initializer Wno Wnone Werror FreeBSD prec livelocks LocalWords: Solaris AIX UX RHEL Tru LHS gcc's Wundef YYENABLE NLS YYLTYPE VCG LocalWords: yyerror cpp's Wunused yylval yylloc prepend yyparse yylex yypush LocalWords: Graphviz xml nonterminals midrule destructor's YYSTYPE typedef ly LocalWords: CHR chr printf stdout namespace preprocessing enum pre include's LocalWords: YYRECOVERING nonfree destructors YYABORT YYACCEPT params enums de LocalWords: struct yystype DJGPP lex param Haible NUM alloca YYSTACK NUL goto LocalWords: YYMAXDEPTH Unescaped UCNs YYLTYPE's yyltype typedefs inline Yaccs LocalWords: Heriyanto Reenable dprec Hilfinger Eggert MYEOF Folle Menezes EOF LocalWords: Lackovic define's itemset Groff Gettext malloc NEWS'ed YYDEBUG YY LocalWords: namespaces strerror const autoconfiguration Dconst Autoconf's FDL LocalWords: Automake TMPDIR LESSEQ ylwrap endif yydebug YYTOKEN YYLSP ival hh LocalWords: extern YYTOKENTYPE TOKENTYPE yytokentype tokentype STYPE lval pdf LocalWords: lang yyoutput dvi html ps POSIX lvalp llocp Wother nterm arg init LocalWords: TOK calc yyo fval Wconflicts parsers yystackp yyval yynerrs LocalWords: Théophile Ranquet Santet fno fnone stype associativity Tolmer LocalWords: Wprecedence Rassoul Wempty Paolo Bonzini parser's Michiel loc LocalWords: redeclaration sval fcaret reentrant XSLT xsl Wmaybe yyvsp Tedi LocalWords: pragmas noreturn untyped Rozenman unexpanded Wojciech Polak LocalWords: Alexandre MERCHANTABILITY yytype Local Variables: mode: outline fill-column: 76 End: PKd1]Y&&java.m4nu[ -*- Autoconf -*- # Java language support for Bison # Copyright (C) 2007-2015 Free Software Foundation, Inc. # 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 . m4_include(b4_pkgdatadir/[c-like.m4]) # b4_list2(LIST1, LIST2) # ---------------------- # Join two lists with a comma if necessary. m4_define([b4_list2], [$1[]m4_ifval(m4_quote($1), [m4_ifval(m4_quote($2), [[, ]])])[]$2]) # b4_percent_define_get3(DEF, PRE, POST, NOT) # ------------------------------------------- # Expand to the value of DEF surrounded by PRE and POST if it's %define'ed, # otherwise NOT. m4_define([b4_percent_define_get3], [m4_ifval(m4_quote(b4_percent_define_get([$1])), [$2[]b4_percent_define_get([$1])[]$3], [$4])]) # b4_flag_value(BOOLEAN-FLAG) # --------------------------- m4_define([b4_flag_value], [b4_flag_if([$1], [true], [false])]) # b4_public_if(TRUE, FALSE) # ------------------------- b4_percent_define_default([[public]], [[false]]) m4_define([b4_public_if], [b4_percent_define_flag_if([public], [$1], [$2])]) # b4_abstract_if(TRUE, FALSE) # --------------------------- b4_percent_define_default([[abstract]], [[false]]) m4_define([b4_abstract_if], [b4_percent_define_flag_if([abstract], [$1], [$2])]) # b4_final_if(TRUE, FALSE) # --------------------------- b4_percent_define_default([[final]], [[false]]) m4_define([b4_final_if], [b4_percent_define_flag_if([final], [$1], [$2])]) # b4_strictfp_if(TRUE, FALSE) # --------------------------- b4_percent_define_default([[strictfp]], [[false]]) m4_define([b4_strictfp_if], [b4_percent_define_flag_if([strictfp], [$1], [$2])]) # b4_lexer_if(TRUE, FALSE) # ------------------------ m4_define([b4_lexer_if], [b4_percent_code_ifdef([[lexer]], [$1], [$2])]) # b4_identification # ----------------- m4_define([b4_identification], [ /** Version number for the Bison executable that generated this parser. */ public static final String bisonVersion = "b4_version"; /** Name of the skeleton that generated this parser. */ public static final String bisonSkeleton = b4_skeleton; ]) ## ------------ ## ## Data types. ## ## ------------ ## # b4_int_type(MIN, MAX) # --------------------- # Return the smallest int type able to handle numbers ranging from # MIN to MAX (included). m4_define([b4_int_type], [m4_if(b4_ints_in($@, [-128], [127]), [1], [byte], b4_ints_in($@, [-32768], [32767]), [1], [short], [int])]) # b4_int_type_for(NAME) # --------------------- # Return the smallest int type able to handle numbers ranging from # 'NAME_min' to 'NAME_max' (included). m4_define([b4_int_type_for], [b4_int_type($1_min, $1_max)]) # b4_null # ------- m4_define([b4_null], [null]) # b4_typed_parser_table_define(TYPE, NAME, DATA, COMMENT) # ------------------------------------------------------- m4_define([b4_typed_parser_table_define], [m4_ifval([$4], [b4_comment([$4]) ])dnl [private static final ]$1[ yy$2_[] = yy$2_init(); private static final ]$1[[] yy$2_init() { return new ]$1[[] { ]$3[ }; }]]) # b4_integral_parser_table_define(NAME, DATA, COMMENT) #----------------------------------------------------- m4_define([b4_integral_parser_table_define], [b4_typed_parser_table_define([b4_int_type_for([$2])], [$1], [$2], [$3])]) ## ------------------------- ## ## Assigning token numbers. ## ## ------------------------- ## # b4_token_enum(TOKEN-NUM) # ------------------------ # Output the definition of this token as an enum. m4_define([b4_token_enum], [b4_token_format([ /** Token number, to be returned by the scanner. */ static final int %s = %s; ], [$1])]) # b4_token_enums # -------------- # Output the definition of the tokens (if there are) as enums. m4_define([b4_token_enums], [b4_any_token_visible_if([/* Tokens. */ b4_symbol_foreach([b4_token_enum])])]) # b4-case(ID, CODE) # ----------------- # We need to fool Java's stupid unreachable code detection. m4_define([b4_case], [ case $1: if (yyn == $1) $2; break; ]) # b4_predicate_case(LABEL, CONDITIONS) # ------------------------------------ m4_define([b4_predicate_case], [ case $1: if (! ($2)) YYERROR; break; ]) ## -------- ## ## Checks. ## ## -------- ## b4_percent_define_check_kind([[api.value.type]], [code], [deprecated]) b4_percent_define_check_kind([[annotations]], [code], [deprecated]) b4_percent_define_check_kind([[extends]], [code], [deprecated]) b4_percent_define_check_kind([[implements]], [code], [deprecated]) b4_percent_define_check_kind([[init_throws]], [code], [deprecated]) b4_percent_define_check_kind([[lex_throws]], [code], [deprecated]) b4_percent_define_check_kind([[parser_class_name]], [code], [deprecated]) b4_percent_define_check_kind([[throws]], [code], [deprecated]) ## ---------------- ## ## Default values. ## ## ---------------- ## m4_define([b4_yystype], [b4_percent_define_get([[api.value.type]])]) b4_percent_define_default([[api.value.type]], [[Object]]) # %name-prefix m4_define_default([b4_prefix], [[YY]]) b4_percent_define_default([[parser_class_name]], [b4_prefix[]Parser]) m4_define([b4_parser_class_name], [b4_percent_define_get([[parser_class_name]])]) b4_percent_define_default([[lex_throws]], [[java.io.IOException]]) m4_define([b4_lex_throws], [b4_percent_define_get([[lex_throws]])]) b4_percent_define_default([[throws]], []) m4_define([b4_throws], [b4_percent_define_get([[throws]])]) b4_percent_define_default([[init_throws]], []) m4_define([b4_init_throws], [b4_percent_define_get([[init_throws]])]) b4_percent_define_default([[api.location.type]], [Location]) m4_define([b4_location_type], [b4_percent_define_get([[api.location.type]])]) b4_percent_define_default([[api.position.type]], [Position]) m4_define([b4_position_type], [b4_percent_define_get([[api.position.type]])]) ## ----------------- ## ## Semantic Values. ## ## ----------------- ## # b4_lhs_value([TYPE]) # -------------------- # Expansion of $$. m4_define([b4_lhs_value], [yyval]) # b4_rhs_value(RULE-LENGTH, NUM, [TYPE]) # -------------------------------------- # Expansion of $NUM, where the current rule has RULE-LENGTH # symbols on RHS. # # In this simple implementation, %token and %type have class names # between the angle brackets. m4_define([b4_rhs_value], [(m4_ifval($3, [($3)])[](yystack.valueAt ($1-($2))))]) # b4_lhs_location() # ----------------- # Expansion of @$. m4_define([b4_lhs_location], [(yyloc)]) # b4_rhs_location(RULE-LENGTH, NUM) # --------------------------------- # Expansion of @NUM, where the current rule has RULE-LENGTH symbols # on RHS. m4_define([b4_rhs_location], [yystack.locationAt ($1-($2))]) # b4_lex_param # b4_parse_param # -------------- # If defined, b4_lex_param arrives double quoted, but below we prefer # it to be single quoted. Same for b4_parse_param. # TODO: should be in bison.m4 m4_define_default([b4_lex_param], [[]]) m4_define([b4_lex_param], b4_lex_param) m4_define([b4_parse_param], b4_parse_param) # b4_lex_param_decl # ----------------- # Extra formal arguments of the constructor. m4_define([b4_lex_param_decl], [m4_ifset([b4_lex_param], [b4_remove_comma([$1], b4_param_decls(b4_lex_param))], [$1])]) m4_define([b4_param_decls], [m4_map([b4_param_decl], [$@])]) m4_define([b4_param_decl], [, $1]) m4_define([b4_remove_comma], [m4_ifval(m4_quote($1), [$1, ], [])m4_shift2($@)]) # b4_parse_param_decl # ------------------- # Extra formal arguments of the constructor. m4_define([b4_parse_param_decl], [m4_ifset([b4_parse_param], [b4_remove_comma([$1], b4_param_decls(b4_parse_param))], [$1])]) # b4_lex_param_call # ----------------- # Delegating the lexer parameters to the lexer constructor. m4_define([b4_lex_param_call], [m4_ifset([b4_lex_param], [b4_remove_comma([$1], b4_param_calls(b4_lex_param))], [$1])]) m4_define([b4_param_calls], [m4_map([b4_param_call], [$@])]) m4_define([b4_param_call], [, $2]) # b4_parse_param_cons # ------------------- # Extra initialisations of the constructor. m4_define([b4_parse_param_cons], [m4_ifset([b4_parse_param], [b4_constructor_calls(b4_parse_param)])]) m4_define([b4_constructor_calls], [m4_map([b4_constructor_call], [$@])]) m4_define([b4_constructor_call], [this.$2 = $2; ]) # b4_parse_param_vars # ------------------- # Extra instance variables. m4_define([b4_parse_param_vars], [m4_ifset([b4_parse_param], [ /* User arguments. */ b4_var_decls(b4_parse_param)])]) m4_define([b4_var_decls], [m4_map_sep([b4_var_decl], [ ], [$@])]) m4_define([b4_var_decl], [ protected final $1;]) # b4_maybe_throws(THROWS) # ----------------------- # Expand to either an empty string or "throws THROWS". m4_define([b4_maybe_throws], [m4_ifval($1, [throws $1])]) PKd1]e lalr1.javanu[# Java skeleton for Bison -*- autoconf -*- # Copyright (C) 2007-2015 Free Software Foundation, Inc. # 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 . m4_include(b4_pkgdatadir/[java.m4]) b4_defines_if([b4_fatal([%s: %%defines does not make sense in Java], [b4_skeleton])]) # We do not depend on %debug in Java, but pacify warnings about # non-used flags. b4_parse_trace_if([0], [0]) m4_define([b4_symbol_no_destructor_assert], [b4_symbol_if([$1], [has_destructor], [b4_fatal([%s: %s: %%destructor does not make sense in Java], [b4_skeleton], [b4_symbol_action_location([$1], [destructor])])])]) b4_symbol_foreach([b4_symbol_no_destructor_assert]) # Setup some macros for api.push-pull. b4_percent_define_default([[api.push-pull]], [[pull]]) b4_percent_define_check_values([[[[api.push-pull]], [[pull]], [[push]], [[both]]]]) # Define m4 conditional macros that encode the value # of the api.push-pull flag. b4_define_flag_if([pull]) m4_define([b4_pull_flag], [[1]]) b4_define_flag_if([push]) m4_define([b4_push_flag], [[1]]) m4_case(b4_percent_define_get([[api.push-pull]]), [pull], [m4_define([b4_push_flag], [[0]])], [push], [m4_define([b4_pull_flag], [[0]])]) # Define a macro to be true when api.push-pull has the value "both". m4_define([b4_both_if],[b4_push_if([b4_pull_if([$1],[$2])],[$2])]) # Handle BISON_USE_PUSH_FOR_PULL for the test suite. So that push parsing # tests function as written, do not let BISON_USE_PUSH_FOR_PULL modify the # behavior of Bison at all when push parsing is already requested. b4_define_flag_if([use_push_for_pull]) b4_use_push_for_pull_if([ b4_push_if([m4_define([b4_use_push_for_pull_flag], [[0]])], [m4_define([b4_push_flag], [[1]])])]) # Define a macro to encapsulate the parse state variables. # This allows them to be defined either in parse() when doing # pull parsing, or as class instance variable when doing push parsing. m4_define([b4_define_state],[[ /* Lookahead and lookahead in internal form. */ int yychar = yyempty_; int yytoken = 0; /* State. */ int yyn = 0; int yylen = 0; int yystate = 0; YYStack yystack = new YYStack (); int label = YYNEWSTATE; /* Error handling. */ int yynerrs_ = 0; ]b4_locations_if([/* The location where the error started. */ b4_location_type yyerrloc = null; /* Location. */ b4_location_type yylloc = new b4_location_type (null, null);])[ /* Semantic value of the lookahead. */ ]b4_yystype[ yylval = null; ]]) b4_output_begin([b4_parser_file_name]) b4_copyright([Skeleton implementation for Bison LALR(1) parsers in Java], [2007-2015]) b4_percent_define_ifdef([package], [package b4_percent_define_get([package]); ])[/* First part of user declarations. */ ]b4_user_pre_prologue b4_user_post_prologue b4_percent_code_get([[imports]]) [/** * A Bison parser, automatically generated from ]m4_bpatsubst(b4_file_name, [^"\(.*\)"$], [\1])[. * * @@author LALR (1) parser skeleton written by Paolo Bonzini. */ ]b4_percent_define_get3([annotations], [], [ ])dnl b4_public_if([public ])dnl b4_abstract_if([abstract ])dnl b4_final_if([final ])dnl b4_strictfp_if([strictfp ])dnl [class ]b4_parser_class_name[]dnl b4_percent_define_get3([extends], [ extends ])dnl b4_percent_define_get3([implements], [ implements ])[ { ]b4_identification[ ]b4_error_verbose_if([[ /** * True if verbose error messages are enabled. */ private boolean yyErrorVerbose = true; /** * Return whether verbose error messages are enabled. */ public final boolean getErrorVerbose() { return yyErrorVerbose; } /** * Set the verbosity of error messages. * @@param verbose True to request verbose error messages. */ public final void setErrorVerbose(boolean verbose) { yyErrorVerbose = verbose; } ]]) b4_locations_if([[ /** * A class defining a pair of positions. Positions, defined by the * ]b4_position_type[ class, denote a point in the input. * Locations represent a part of the input through the beginning * and ending positions. */ public class ]b4_location_type[ { /** * The first, inclusive, position in the range. */ public ]b4_position_type[ begin; /** * The first position beyond the range. */ public ]b4_position_type[ end; /** * Create a ]b4_location_type[ denoting an empty range located at * a given point. * @@param loc The position at which the range is anchored. */ public ]b4_location_type[ (]b4_position_type[ loc) { this.begin = this.end = loc; } /** * Create a ]b4_location_type[ from the endpoints of the range. * @@param begin The first position included in the range. * @@param end The first position beyond the range. */ public ]b4_location_type[ (]b4_position_type[ begin, ]b4_position_type[ end) { this.begin = begin; this.end = end; } /** * Print a representation of the location. For this to be correct, * ]b4_position_type[ should override the equals * method. */ public String toString () { if (begin.equals (end)) return begin.toString (); else return begin.toString () + "-" + end.toString (); } } ]]) b4_locations_if([[ private ]b4_location_type[ yylloc (YYStack rhs, int n) { if (n > 0) return new ]b4_location_type[ (rhs.locationAt (n-1).begin, rhs.locationAt (0).end); else return new ]b4_location_type[ (rhs.locationAt (0).end); }]])[ /** * Communication interface between the scanner and the Bison-generated * parser ]b4_parser_class_name[. */ public interface Lexer { /** Token returned by the scanner to signal the end of its input. */ public static final int EOF = 0; ]b4_token_enums[ ]b4_locations_if([[/** * Method to retrieve the beginning position of the last scanned token. * @@return the position at which the last scanned token starts. */ ]b4_position_type[ getStartPos (); /** * Method to retrieve the ending position of the last scanned token. * @@return the first position beyond the last scanned token. */ ]b4_position_type[ getEndPos ();]])[ /** * Method to retrieve the semantic value of the last scanned token. * @@return the semantic value of the last scanned token. */ ]b4_yystype[ getLVal (); /** * Entry point for the scanner. Returns the token identifier corresponding * to the next token and prepares to return the semantic value * ]b4_locations_if([and beginning/ending positions ])[of the token. * @@return the token identifier corresponding to the next token. */ int yylex () ]b4_maybe_throws([b4_lex_throws])[; /** * Entry point for error reporting. Emits an error * ]b4_locations_if([referring to the given location ])[in a user-defined way. * * ]b4_locations_if([[@@param loc The location of the element to which the * error message is related]])[ * @@param msg The string for the error message. */ void yyerror (]b4_locations_if([b4_location_type[ loc, ]])[String msg);] } b4_lexer_if([[private class YYLexer implements Lexer { ]b4_percent_code_get([[lexer]])[ } ]])[/** * The object doing lexical analysis for us. */ private Lexer yylexer; ] b4_parse_param_vars b4_lexer_if([[ /** * Instantiates the Bison-generated parser. */ public ]b4_parser_class_name (b4_parse_param_decl([b4_lex_param_decl])[) ]b4_maybe_throws([b4_init_throws])[ { ]b4_percent_code_get([[init]])[ this.yylexer = new YYLexer(]b4_lex_param_call[); ]b4_parse_param_cons[ } ]]) /** * Instantiates the Bison-generated parser. * @@param yylexer The scanner that will supply tokens to the parser. */ b4_lexer_if([[protected]], [[public]]) b4_parser_class_name[ (]b4_parse_param_decl([[Lexer yylexer]])[) ]b4_maybe_throws([b4_init_throws])[ { ]b4_percent_code_get([[init]])[ this.yylexer = yylexer; ]b4_parse_param_cons[ } private java.io.PrintStream yyDebugStream = System.err; /** * Return the PrintStream on which the debugging output is * printed. */ public final java.io.PrintStream getDebugStream () { return yyDebugStream; } /** * Set the PrintStream on which the debug output is printed. * @@param s The stream that is used for debugging output. */ public final void setDebugStream(java.io.PrintStream s) { yyDebugStream = s; } private int yydebug = 0; /** * Answer the verbosity of the debugging output; 0 means that all kinds of * output from the parser are suppressed. */ public final int getDebugLevel() { return yydebug; } /** * Set the verbosity of the debugging output; 0 means that all kinds of * output from the parser are suppressed. * @@param level The verbosity level for debugging output. */ public final void setDebugLevel(int level) { yydebug = level; } /** * Print an error message via the lexer. *]b4_locations_if([[ Use a null location.]])[ * @@param msg The error message. */ public final void yyerror (String msg) { yylexer.yyerror (]b4_locations_if([[(]b4_location_type[)null, ]])[msg); } ]b4_locations_if([[ /** * Print an error message via the lexer. * @@param loc The location associated with the message. * @@param msg The error message. */ public final void yyerror (]b4_location_type[ loc, String msg) { yylexer.yyerror (loc, msg); } /** * Print an error message via the lexer. * @@param pos The position associated with the message. * @@param msg The error message. */ public final void yyerror (]b4_position_type[ pos, String msg) { yylexer.yyerror (new ]b4_location_type[ (pos), msg); }]]) [protected final void yycdebug (String s) { if (yydebug > 0) yyDebugStream.println (s); } private final class YYStack { private int[] stateStack = new int[16]; ]b4_locations_if([[private ]b4_location_type[[] locStack = new ]b4_location_type[[16];]])[ private ]b4_yystype[[] valueStack = new ]b4_yystype[[16]; public int size = 16; public int height = -1; public final void push (int state, ]b4_yystype[ value]dnl b4_locations_if([, ]b4_location_type[ loc])[) { height++; if (size == height) { int[] newStateStack = new int[size * 2]; System.arraycopy (stateStack, 0, newStateStack, 0, height); stateStack = newStateStack; ]b4_locations_if([[ ]b4_location_type[[] newLocStack = new ]b4_location_type[[size * 2]; System.arraycopy (locStack, 0, newLocStack, 0, height); locStack = newLocStack;]]) b4_yystype[[] newValueStack = new ]b4_yystype[[size * 2]; System.arraycopy (valueStack, 0, newValueStack, 0, height); valueStack = newValueStack; size *= 2; } stateStack[height] = state; ]b4_locations_if([[locStack[height] = loc;]])[ valueStack[height] = value; } public final void pop () { pop (1); } public final void pop (int num) { // Avoid memory leaks... garbage collection is a white lie! if (num > 0) { java.util.Arrays.fill (valueStack, height - num + 1, height + 1, null); ]b4_locations_if([[java.util.Arrays.fill (locStack, height - num + 1, height + 1, null);]])[ } height -= num; } public final int stateAt (int i) { return stateStack[height - i]; } ]b4_locations_if([[public final ]b4_location_type[ locationAt (int i) { return locStack[height - i]; } ]])[public final ]b4_yystype[ valueAt (int i) { return valueStack[height - i]; } // Print the state stack on the debug stream. public void print (java.io.PrintStream out) { out.print ("Stack now"); for (int i = 0; i <= height; i++) { out.print (' '); out.print (stateStack[i]); } out.println (); } } /** * Returned by a Bison action in order to stop the parsing process and * return success (true). */ public static final int YYACCEPT = 0; /** * Returned by a Bison action in order to stop the parsing process and * return failure (false). */ public static final int YYABORT = 1; ]b4_push_if([ /** * Returned by a Bison action in order to request a new token. */ public static final int YYPUSH_MORE = 4;])[ /** * Returned by a Bison action in order to start error recovery without * printing an error message. */ public static final int YYERROR = 2; /** * Internal return codes that are not supported for user semantic * actions. */ private static final int YYERRLAB = 3; private static final int YYNEWSTATE = 4; private static final int YYDEFAULT = 5; private static final int YYREDUCE = 6; private static final int YYERRLAB1 = 7; private static final int YYRETURN = 8; ]b4_push_if([[ private static final int YYGETTOKEN = 9; /* Signify that a new token is expected when doing push-parsing. */]])[ private int yyerrstatus_ = 0; ]b4_push_if([dnl b4_define_state])[ /** * Return whether error recovery is being done. In this state, the parser * reads token until it reaches a known state, and then restarts normal * operation. */ public final boolean recovering () { return yyerrstatus_ == 0; } /** Compute post-reduction state. * @@param yystate the current state * @@param yysym the nonterminal to push on the stack */ private int yy_lr_goto_state_ (int yystate, int yysym) { int yyr = yypgoto_[yysym - yyntokens_] + yystate; if (0 <= yyr && yyr <= yylast_ && yycheck_[yyr] == yystate) return yytable_[yyr]; else return yydefgoto_[yysym - yyntokens_]; } private int yyaction (int yyn, YYStack yystack, int yylen) ]b4_maybe_throws([b4_throws])[ { ]b4_yystype[ yyval; ]b4_locations_if([b4_location_type[ yyloc = yylloc (yystack, yylen);]])[ /* If YYLEN is nonzero, implement the default value of the action: '$$ = $1'. Otherwise, use the top of the stack. Otherwise, the following line sets YYVAL to garbage. This behavior is undocumented and Bison users should not rely upon it. */ if (yylen > 0) yyval = yystack.valueAt (yylen - 1); else yyval = yystack.valueAt (0); yy_reduce_print (yyn, yystack); switch (yyn) { ]b4_user_actions[ default: break; } yy_symbol_print ("-> $$ =", yyr1_[yyn], yyval]b4_locations_if([, yyloc])[); yystack.pop (yylen); yylen = 0; /* Shift the result of the reduction. */ int yystate = yy_lr_goto_state_ (yystack.stateAt (0), yyr1_[yyn]); yystack.push (yystate, yyval]b4_locations_if([, yyloc])[); return YYNEWSTATE; } ]b4_error_verbose_if([[ /* Return YYSTR after stripping away unnecessary quotes and backslashes, so that it's suitable for yyerror. The heuristic is that double-quoting is unnecessary unless the string contains an apostrophe, a comma, or backslash (other than backslash-backslash). YYSTR is taken from yytname. */ private final String yytnamerr_ (String yystr) { if (yystr.charAt (0) == '"') { StringBuffer yyr = new StringBuffer (); strip_quotes: for (int i = 1; i < yystr.length (); i++) switch (yystr.charAt (i)) { case '\'': case ',': break strip_quotes; case '\\': if (yystr.charAt(++i) != '\\') break strip_quotes; /* Fall through. */ default: yyr.append (yystr.charAt (i)); break; case '"': return yyr.toString (); } } else if (yystr.equals ("$end")) return "end of input"; return yystr; } ]])[ /*--------------------------------. | Print this symbol on YYOUTPUT. | `--------------------------------*/ private void yy_symbol_print (String s, int yytype, ]b4_yystype[ yyvaluep]dnl b4_locations_if([, Object yylocationp])[) { if (yydebug > 0) yycdebug (s + (yytype < yyntokens_ ? " token " : " nterm ") + yytname_[yytype] + " ("]b4_locations_if([ + yylocationp + ": "])[ + (yyvaluep == null ? "(null)" : yyvaluep.toString ()) + ")"); } ]b4_push_if([],[[ /** * Parse input from the scanner that was specified at object construction * time. Return whether the end of the input was reached successfully. * * @@return true if the parsing succeeds. Note that this does not * imply that there were no syntax errors. */ public boolean parse () ]b4_maybe_throws([b4_list2([b4_lex_throws], [b4_throws])])[]])[ ]b4_push_if([ /** * Push Parse input from external lexer * * @@param yylextoken current token * @@param yylexval current lval ]b4_locations_if([ * @@param yylexloc current position])[ * * @@return YYACCEPT, YYABORT, YYPUSH_MORE */ public int push_parse (int yylextoken, b4_yystype yylexval[]b4_locations_if([, b4_location_type yylexloc])) b4_maybe_throws([b4_list2([b4_lex_throws], [b4_throws])])])[ { ]b4_locations_if([/* @@$. */ b4_location_type yyloc;])[ ]b4_push_if([],[[ ]b4_define_state[ yycdebug ("Starting parse\n"); yyerrstatus_ = 0; /* Initialize the stack. */ yystack.push (yystate, yylval ]b4_locations_if([, yylloc])[); ]m4_ifdef([b4_initial_action], [ b4_dollar_pushdef([yylval], [], [yylloc])dnl /* User initialization code. */ b4_user_initial_action b4_dollar_popdef[]dnl ])[ ]])[ ]b4_push_if([[ if (!this.push_parse_initialized) { push_parse_initialize (); ]m4_ifdef([b4_initial_action], [ b4_dollar_pushdef([yylval], [], [yylloc])dnl /* User initialization code. */ b4_user_initial_action b4_dollar_popdef[]dnl ])[ yycdebug ("Starting parse\n"); yyerrstatus_ = 0; } else label = YYGETTOKEN; boolean push_token_consumed = true; ]])[ for (;;) switch (label) { /* New state. Unlike in the C/C++ skeletons, the state is already pushed when we come here. */ case YYNEWSTATE: yycdebug ("Entering state " + yystate + "\n"); if (yydebug > 0) yystack.print (yyDebugStream); /* Accept? */ if (yystate == yyfinal_) ]b4_push_if([{label = YYACCEPT; break;}], [return true;])[ /* Take a decision. First try without lookahead. */ yyn = yypact_[yystate]; if (yy_pact_value_is_default_ (yyn)) { label = YYDEFAULT; break; } ]b4_push_if([ /* Fall Through */ case YYGETTOKEN:])[ /* Read a lookahead token. */ if (yychar == yyempty_) { ]b4_push_if([[ if (!push_token_consumed) return YYPUSH_MORE; yycdebug ("Reading a token: "); yychar = yylextoken; yylval = yylexval;]b4_locations_if([ yylloc = yylexloc;])[ push_token_consumed = false;]])[ ]b4_push_if([],[[ yycdebug ("Reading a token: "); yychar = yylexer.yylex (); yylval = yylexer.getLVal ();]b4_locations_if([ yylloc = new b4_location_type (yylexer.getStartPos (), yylexer.getEndPos ());])[ ]])[ } /* Convert token to internal form. */ if (yychar <= Lexer.EOF) { yychar = yytoken = Lexer.EOF; yycdebug ("Now at end of input.\n"); } else { yytoken = yytranslate_ (yychar); yy_symbol_print ("Next token is", yytoken, yylval]b4_locations_if([, yylloc])[); } /* If the proper action on seeing token YYTOKEN is to reduce or to detect an error, take that action. */ yyn += yytoken; if (yyn < 0 || yylast_ < yyn || yycheck_[yyn] != yytoken) label = YYDEFAULT; /* <= 0 means reduce or error. */ else if ((yyn = yytable_[yyn]) <= 0) { if (yy_table_value_is_error_ (yyn)) label = YYERRLAB; else { yyn = -yyn; label = YYREDUCE; } } else { /* Shift the lookahead token. */ yy_symbol_print ("Shifting", yytoken, yylval]b4_locations_if([, yylloc])[); /* Discard the token being shifted. */ yychar = yyempty_; /* Count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus_ > 0) --yyerrstatus_; yystate = yyn; yystack.push (yystate, yylval]b4_locations_if([, yylloc])[); label = YYNEWSTATE; } break; /*-----------------------------------------------------------. | yydefault -- do the default action for the current state. | `-----------------------------------------------------------*/ case YYDEFAULT: yyn = yydefact_[yystate]; if (yyn == 0) label = YYERRLAB; else label = YYREDUCE; break; /*-----------------------------. | yyreduce -- Do a reduction. | `-----------------------------*/ case YYREDUCE: yylen = yyr2_[yyn]; label = yyaction (yyn, yystack, yylen); yystate = yystack.stateAt (0); break; /*------------------------------------. | yyerrlab -- here on detecting error | `------------------------------------*/ case YYERRLAB: /* If not already recovering from an error, report this error. */ if (yyerrstatus_ == 0) { ++yynerrs_; if (yychar == yyempty_) yytoken = yyempty_; yyerror (]b4_locations_if([yylloc, ])[yysyntax_error (yystate, yytoken)); } ]b4_locations_if([yyerrloc = yylloc;])[ if (yyerrstatus_ == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ if (yychar <= Lexer.EOF) { /* Return failure if at end of input. */ if (yychar == Lexer.EOF) ]b4_push_if([{label = YYABORT; break;}],[return false;])[ } else yychar = yyempty_; } /* Else will try to reuse lookahead token after shifting the error token. */ label = YYERRLAB1; break; /*-------------------------------------------------. | errorlab -- error raised explicitly by YYERROR. | `-------------------------------------------------*/ case YYERROR: ]b4_locations_if([yyerrloc = yystack.locationAt (yylen - 1);])[ /* Do not reclaim the symbols of the rule which action triggered this YYERROR. */ yystack.pop (yylen); yylen = 0; yystate = yystack.stateAt (0); label = YYERRLAB1; break; /*-------------------------------------------------------------. | yyerrlab1 -- common code for both syntax error and YYERROR. | `-------------------------------------------------------------*/ case YYERRLAB1: yyerrstatus_ = 3; /* Each real token shifted decrements this. */ for (;;) { yyn = yypact_[yystate]; if (!yy_pact_value_is_default_ (yyn)) { yyn += yyterror_; if (0 <= yyn && yyn <= yylast_ && yycheck_[yyn] == yyterror_) { yyn = yytable_[yyn]; if (0 < yyn) break; } } /* Pop the current state because it cannot handle the * error token. */ if (yystack.height == 0) ]b4_push_if([{label = YYABORT; break;}],[return false;])[ ]b4_locations_if([yyerrloc = yystack.locationAt (0);])[ yystack.pop (); yystate = yystack.stateAt (0); if (yydebug > 0) yystack.print (yyDebugStream); } if (label == YYABORT) /* Leave the switch. */ break; ]b4_locations_if([ /* Muck with the stack to setup for yylloc. */ yystack.push (0, null, yylloc); yystack.push (0, null, yyerrloc); yyloc = yylloc (yystack, 2); yystack.pop (2);])[ /* Shift the error token. */ yy_symbol_print ("Shifting", yystos_[yyn], yylval]b4_locations_if([, yyloc])[); yystate = yyn; yystack.push (yyn, yylval]b4_locations_if([, yyloc])[); label = YYNEWSTATE; break; /* Accept. */ case YYACCEPT: ]b4_push_if([this.push_parse_initialized = false; return YYACCEPT;], [return true;])[ /* Abort. */ case YYABORT: ]b4_push_if([this.push_parse_initialized = false; return YYABORT;], [return false;])[ } } ]b4_push_if([[ boolean push_parse_initialized = false; /** * (Re-)Initialize the state of the push parser. */ public void push_parse_initialize() { /* Lookahead and lookahead in internal form. */ this.yychar = yyempty_; this.yytoken = 0; /* State. */ this.yyn = 0; this.yylen = 0; this.yystate = 0; this.yystack = new YYStack (); this.label = YYNEWSTATE; /* Error handling. */ this.yynerrs_ = 0; ]b4_locations_if([/* The location where the error started. */ this.yyerrloc = null; this.yylloc = new b4_location_type (null, null);])[ /* Semantic value of the lookahead. */ this.yylval = null; yystack.push (this.yystate, this.yylval]b4_locations_if([, this.yylloc])[); this.push_parse_initialized = true; } ]b4_locations_if([ /** * Push parse given input from an external lexer. * * @@param yylextoken current token * @@param yylexval current lval * @@param yyylexpos current position * * @@return YYACCEPT, YYABORT, YYPUSH_MORE */ public int push_parse (int yylextoken, b4_yystype yylexval, b4_position_type yylexpos) b4_maybe_throws([b4_list2([b4_lex_throws], [b4_throws])]) { return push_parse (yylextoken, yylexval, new b4_location_type (yylexpos)); } ])[]]) b4_both_if([[ /** * Parse input from the scanner that was specified at object construction * time. Return whether the end of the input was reached successfully. * This version of parse () is defined only when api.push-push=both. * * @@return true if the parsing succeeds. Note that this does not * imply that there were no syntax errors. */ public boolean parse () ]b4_maybe_throws([b4_list2([b4_lex_throws], [b4_throws])])[ { if (yylexer == null) throw new NullPointerException("Null Lexer"); int status; do { int token = yylexer.yylex(); ]b4_yystype[ lval = yylexer.getLVal(); ]b4_locations_if([dnl b4_location_type yyloc = new b4_location_type (yylexer.getStartPos (), yylexer.getEndPos ());])[ ]b4_locations_if([status = push_parse(token,lval,yyloc);],[ status = push_parse(token,lval);])[ } while (status == YYPUSH_MORE); return (status == YYACCEPT); } ]])[ // Generate an error message. private String yysyntax_error (int yystate, int tok) {]b4_error_verbose_if([[ if (yyErrorVerbose) { /* There are many possibilities here to consider: - If this state is a consistent state with a default action, then the only way this function was invoked is if the default action is an error action. In that case, don't check for expected tokens because there are none. - The only way there can be no lookahead present (in tok) is if this state is a consistent state with a default action. Thus, detecting the absence of a lookahead is sufficient to determine that there is no unexpected or expected token to report. In that case, just report a simple "syntax error". - Don't assume there isn't a lookahead just because this state is a consistent state with a default action. There might have been a previous inconsistent state, consistent state with a non-default action, or user semantic action that manipulated yychar. (However, yychar is currently out of scope during semantic actions.) - Of course, the expected token list depends on states to have correct lookahead information, and it depends on the parser not to perform extra reductions after fetching a lookahead from the scanner and before detecting a syntax error. Thus, state merging (from LALR or IELR) and default reductions corrupt the expected token list. However, the list is correct for canonical LR with one exception: it will still contain any token that will not be accepted due to an error action in a later state. */ if (tok != yyempty_) { /* FIXME: This method of building the message is not compatible with internationalization. */ StringBuffer res = new StringBuffer ("syntax error, unexpected "); res.append (yytnamerr_ (yytname_[tok])); int yyn = yypact_[yystate]; if (!yy_pact_value_is_default_ (yyn)) { /* Start YYX at -YYN if negative to avoid negative indexes in YYCHECK. In other words, skip the first -YYN actions for this state because they are default actions. */ int yyxbegin = yyn < 0 ? -yyn : 0; /* Stay within bounds of both yycheck and yytname. */ int yychecklim = yylast_ - yyn + 1; int yyxend = yychecklim < yyntokens_ ? yychecklim : yyntokens_; int count = 0; for (int x = yyxbegin; x < yyxend; ++x) if (yycheck_[x + yyn] == x && x != yyterror_ && !yy_table_value_is_error_ (yytable_[x + yyn])) ++count; if (count < 5) { count = 0; for (int x = yyxbegin; x < yyxend; ++x) if (yycheck_[x + yyn] == x && x != yyterror_ && !yy_table_value_is_error_ (yytable_[x + yyn])) { res.append (count++ == 0 ? ", expecting " : " or "); res.append (yytnamerr_ (yytname_[x])); } } } return res.toString (); } } ]])[ return "syntax error"; } /** * Whether the given yypact_ value indicates a defaulted state. * @@param yyvalue the value to check */ private static boolean yy_pact_value_is_default_ (int yyvalue) { return yyvalue == yypact_ninf_; } /** * Whether the given yytable_ * value indicates a syntax error. * @@param yyvalue the value to check */ private static boolean yy_table_value_is_error_ (int yyvalue) { return yyvalue == yytable_ninf_; } private static final ]b4_int_type_for([b4_pact])[ yypact_ninf_ = ]b4_pact_ninf[; private static final ]b4_int_type_for([b4_table])[ yytable_ninf_ = ]b4_table_ninf[; ]b4_parser_tables_define[ ]b4_integral_parser_table_define([token_number], [b4_toknum], [[YYTOKEN_NUMBER[YYLEX-NUM] -- Internal symbol number corresponding to YYLEX-NUM.]])[ /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. First, the terminals, then, starting at \a yyntokens_, nonterminals. */ ]b4_typed_parser_table_define([String], [tname], [b4_tname])[ ]b4_integral_parser_table_define([rline], [b4_rline], [[YYRLINE[YYN] -- Source line where rule number YYN was defined.]])[ // Report on the debug stream that the rule yyrule is going to be reduced. private void yy_reduce_print (int yyrule, YYStack yystack) { if (yydebug == 0) return; int yylno = yyrline_[yyrule]; int yynrhs = yyr2_[yyrule]; /* Print the symbols being reduced, and their result. */ yycdebug ("Reducing stack by rule " + (yyrule - 1) + " (line " + yylno + "), "); /* The symbols being reduced. */ for (int yyi = 0; yyi < yynrhs; yyi++) yy_symbol_print (" $" + (yyi + 1) + " =", yystos_[yystack.stateAt(yynrhs - (yyi + 1))], ]b4_rhs_value(yynrhs, yyi + 1)b4_locations_if([, b4_rhs_location(yynrhs, yyi + 1)])[); } /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ ]b4_integral_parser_table_define([translate_table], [b4_translate])[ private static final ]b4_int_type_for([b4_translate])[ yytranslate_ (int t) { if (t >= 0 && t <= yyuser_token_number_max_) return yytranslate_table_[t]; else return yyundef_token_; } private static final int yylast_ = ]b4_last[; private static final int yynnts_ = ]b4_nterms_number[; private static final int yyempty_ = -2; private static final int yyfinal_ = ]b4_final_state_number[; private static final int yyterror_ = 1; private static final int yyerrcode_ = 256; private static final int yyntokens_ = ]b4_tokens_number[; private static final int yyuser_token_number_max_ = ]b4_user_token_number_max[; private static final int yyundef_token_ = ]b4_undef_token_number[; ]/* User implementation code. */ b4_percent_code_get[]dnl } b4_epilogue[]dnl b4_output_end() PKd1]  xslt/bison.xslnu[ s r , 0 PKd1],oHoHxslt/xml2text.xslnu[ Nonterminals useless in grammar Terminals unused in grammar Rules useless in grammar Rules useless in parser due to conflicts Grammar Terminals, with rules where they appear Nonterminals, with rules where they appear 0 on@left: , on@right: State : . . %empty [ ] , shift, and go to state go to state error ( ) [ accept reduce using rule ( ) ] Conflict between rule and token resolved as an ( ). PKd1]%"22xslt/xml2dot.xslnu[ // Generated by GNU Bison . // Report bugs to < >. // Home page: < >. digraph " " { node [fontname = courier, shape = box, colorscheme = paired6] edge [fontname = courier] } 0 label="[ , ]", style=solid] 3 5 : . . %empty [ ] , -> " R d " [ " R d " [label=" Acc", fillcolor=1 R ", fillcolor= , shape=diamond, style=filled] dotted solid dashed [label=" State \n \l"] -> [style= label=" " ] PKd1]~AXAXxslt/xml2xhtml.xslnu[ <xsl:value-of select="bison-xml-report/filename"/> <xsl:text> - GNU Bison XML Automaton Report</xsl:text>

GNU Bison XML Automaton Report

input grammar:

Table of Contents

Reductions

Nonterminals useless in grammar

Terminals unused in grammar

Rules useless in grammar

Rules useless in parser due to conflicts

Grammar

Conflicts

conflicts:

Terminals, with rules where they appear

Nonterminals, with rules where they appear

on left: on right:

Automaton

state

→ . . %empty [ ] , error ( ) [ accept ( ) ] Conflict between and token resolved as an ( ). 0 PKd1]_&& variant.hhnu[# C++ skeleton for Bison # Copyright (C) 2002-2015 Free Software Foundation, Inc. # 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 . ## --------- ## ## variant. ## ## --------- ## # b4_symbol_variant(YYTYPE, YYVAL, ACTION, [ARGS]) # ------------------------------------------------ # Run some ACTION ("build", or "destroy") on YYVAL of symbol type # YYTYPE. m4_define([b4_symbol_variant], [m4_pushdef([b4_dollar_dollar], [$2.$3< $][3 > (m4_shift3($@))])dnl switch ($1) { b4_type_foreach([b4_type_action_])[]dnl default: break; } m4_popdef([b4_dollar_dollar])dnl ]) # _b4_char_sizeof_counter # ----------------------- # A counter used by _b4_char_sizeof_dummy to create fresh symbols. m4_define([_b4_char_sizeof_counter], [0]) # _b4_char_sizeof_dummy # --------------------- # At each call return a new C++ identifier. m4_define([_b4_char_sizeof_dummy], [m4_define([_b4_char_sizeof_counter], m4_incr(_b4_char_sizeof_counter))dnl dummy[]_b4_char_sizeof_counter]) # b4_char_sizeof(SYMBOL-NUMS) # --------------------------- # To be mapped on the list of type names to produce: # # char dummy1[sizeof(type_name_1)]; # char dummy2[sizeof(type_name_2)]; # # for defined type names. m4_define([b4_char_sizeof], [b4_symbol_if([$1], [has_type], [ m4_map([ b4_symbol_tag_comment], [$@])dnl char _b4_char_sizeof_dummy@{sizeof(b4_symbol([$1], [type]))@}; ])]) # b4_variant_includes # ------------------- # The needed includes for variants support. m4_define([b4_variant_includes], [b4_parse_assert_if([[#include ]])[ #ifndef YYASSERT # include # define YYASSERT assert #endif ]]) # b4_variant_define # ----------------- # Define "variant". m4_define([b4_variant_define], [[ /// A char[S] buffer to store and retrieve objects. /// /// Sort of a variant, but does not keep track of the nature /// of the stored data, since that knowledge is available /// via the current state. template struct variant { /// Type of *this. typedef variant self_type; /// Empty construction. variant ()]b4_parse_assert_if([ : yytypeid_ (YY_NULLPTR)])[ {} /// Construct and fill. template variant (const T& t)]b4_parse_assert_if([ : yytypeid_ (&typeid (T))])[ { YYASSERT (sizeof (T) <= S); new (yyas_ ()) T (t); } /// Destruction, allowed only if empty. ~variant () {]b4_parse_assert_if([ YYASSERT (!yytypeid_); ])[} /// Instantiate an empty \a T in here. template T& build () {]b4_parse_assert_if([ YYASSERT (!yytypeid_); YYASSERT (sizeof (T) <= S); yytypeid_ = & typeid (T);])[ return *new (yyas_ ()) T; } /// Instantiate a \a T in here from \a t. template T& build (const T& t) {]b4_parse_assert_if([ YYASSERT (!yytypeid_); YYASSERT (sizeof (T) <= S); yytypeid_ = & typeid (T);])[ return *new (yyas_ ()) T (t); } /// Accessor to a built \a T. template T& as () {]b4_parse_assert_if([ YYASSERT (*yytypeid_ == typeid (T)); YYASSERT (sizeof (T) <= S);])[ return *yyas_ (); } /// Const accessor to a built \a T (for %printer). template const T& as () const {]b4_parse_assert_if([ YYASSERT (*yytypeid_ == typeid (T)); YYASSERT (sizeof (T) <= S);])[ return *yyas_ (); } /// Swap the content with \a other, of same type. /// /// Both variants must be built beforehand, because swapping the actual /// data requires reading it (with as()), and this is not possible on /// unconstructed variants: it would require some dynamic testing, which /// should not be the variant's responsability. /// Swapping between built and (possibly) non-built is done with /// variant::move (). template void swap (self_type& other) {]b4_parse_assert_if([ YYASSERT (yytypeid_); YYASSERT (*yytypeid_ == *other.yytypeid_);])[ std::swap (as (), other.as ()); } /// Move the content of \a other to this. /// /// Destroys \a other. template void move (self_type& other) { build (); swap (other); other.destroy (); } /// Copy the content of \a other to this. template void copy (const self_type& other) { build (other.as ()); } /// Destroy the stored \a T. template void destroy () { as ().~T ();]b4_parse_assert_if([ yytypeid_ = YY_NULLPTR;])[ } private: /// Prohibit blind copies. self_type& operator=(const self_type&); variant (const self_type&); /// Accessor to raw memory as \a T. template T* yyas_ () { void *yyp = yybuffer_.yyraw; return static_cast (yyp); } /// Const accessor to raw memory as \a T. template const T* yyas_ () const { const void *yyp = yybuffer_.yyraw; return static_cast (yyp); } union { /// Strongest alignment constraints. long double yyalign_me; /// A buffer large enough to store any of the semantic values. char yyraw[S]; } yybuffer_;]b4_parse_assert_if([ /// Whether the content is built: if defined, the name of the stored type. const std::type_info *yytypeid_;])[ }; ]]) ## -------------------------- ## ## Adjustments for variants. ## ## -------------------------- ## # b4_value_type_declare # --------------------- # Declare semantic_type. m4_define([b4_value_type_declare], [[ /// An auxiliary type to compute the largest semantic type. union union_type {]b4_type_foreach([b4_char_sizeof])[}; /// Symbol semantic values. typedef variant semantic_type;][]dnl ]) # How the semantic value is extracted when using variants. # b4_symbol_value(VAL, [TYPE]) # ---------------------------- m4_define([b4_symbol_value], [m4_ifval([$2], [$1.as< $2 > ()], [$1])]) # b4_symbol_value_template(VAL, [TYPE]) # ------------------------------------- # Same as b4_symbol_value, but used in a template method. m4_define([b4_symbol_value_template], [m4_ifval([$2], [$1.template as< $2 > ()], [$1])]) ## ------------- ## ## make_SYMBOL. ## ## ------------- ## # b4_symbol_constructor_declare_(SYMBOL-NUMBER) # --------------------------------------------- # Declare the overloaded version of make_symbol for the (common) type of # these SYMBOL-NUMBERS. Use at class-level. m4_define([b4_symbol_constructor_declare_], [b4_symbol_if([$1], [is_token], [b4_symbol_if([$1], [has_id], [ static inline symbol_type make_[]b4_symbol_([$1], [id]) (dnl b4_join(b4_symbol_if([$1], [has_type], [const b4_symbol([$1], [type])& v]), b4_locations_if([const location_type& l]))); ])])]) # b4_symbol_constructor_declare # ----------------------------- # Declare symbol constructors for all the value types. # Use at class-level. m4_define([b4_symbol_constructor_declare], [ // Symbol constructors declarations. b4_symbol_foreach([b4_symbol_constructor_declare_])]) # b4_symbol_constructor_define_(SYMBOL-NUMBER) # -------------------------------------------- # Define symbol constructor for this SYMBOL-NUMBER. m4_define([b4_symbol_constructor_define_], [b4_symbol_if([$1], [is_token], [b4_symbol_if([$1], [has_id], [ b4_parser_class_name::symbol_type b4_parser_class_name::make_[]b4_symbol_([$1], [id]) (dnl b4_join(b4_symbol_if([$1], [has_type], [const b4_symbol([$1], [type])& v]), b4_locations_if([const location_type& l]))) { return symbol_type (b4_join([token::b4_symbol([$1], [id])], b4_symbol_if([$1], [has_type], [v]), b4_locations_if([l]))); } ])])]) # b4_basic_symbol_constructor_declare # ----------------------------------- # Generate a constructor declaration for basic_symbol from given type. m4_define([b4_basic_symbol_constructor_declare], [[ basic_symbol (]b4_join( [typename Base::kind_type t], b4_symbol_if([$1], [has_type], const b4_symbol([$1], [type])[ v]), b4_locations_if([const location_type& l]))[); ]]) # b4_basic_symbol_constructor_define # ---------------------------------- # Generate a constructor implementation for basic_symbol from given type. m4_define([b4_basic_symbol_constructor_define], [[ template ]b4_parser_class_name[::basic_symbol::basic_symbol (]b4_join( [typename Base::kind_type t], b4_symbol_if([$1], [has_type], const b4_symbol([$1], [type])[ v]), b4_locations_if([const location_type& l]))[) : Base (t) , value (]b4_symbol_if([$1], [has_type], [v])[)]b4_locations_if([ , location (l)])[ {} ]]) # b4_symbol_constructor_define # ---------------------------- # Define the overloaded versions of make_symbol for all the value types. m4_define([b4_symbol_constructor_define], [ // Implementation of make_symbol for each symbol type. b4_symbol_foreach([b4_symbol_constructor_define_])]) PKd1]ѧ**glr.ccnu[# C++ GLR skeleton for Bison # Copyright (C) 2002-2015 Free Software Foundation, Inc. # 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 . # This skeleton produces a C++ class that encapsulates a C glr parser. # This is in order to reduce the maintenance burden. The glr.c # skeleton is clean and pure enough so that there are no real # problems. The C++ interface is the same as that of lalr1.cc. In # fact, glr.c can replace yacc.c without the user noticing any # difference, and similarly for glr.cc replacing lalr1.cc. # # The passing of parse-params # # The additional arguments are stored as members of the parser # object, yyparser. The C routines need to carry yyparser # throughout the C parser; that's easy: make yyparser an # additional parse-param. But because the C++ skeleton needs to # know the "real" original parse-param, we save them # (b4_parse_param_orig). Note that b4_parse_param is overquoted # (and c.m4 strips one level of quotes). This is a PITA, and # explains why there are so many levels of quotes. # # The locations # # We use location.cc just like lalr1.cc, but because glr.c stores # the locations in a union, the position and location classes # must not have a constructor. Therefore, contrary to lalr1.cc, we # must not define "b4_location_constructors". As a consequence the # user must initialize the first positions (in particular the # filename member). # We require a pure interface. m4_define([b4_pure_flag], [1]) m4_include(b4_pkgdatadir/[c++.m4]) b4_bison_locations_if([m4_include(b4_pkgdatadir/[location.cc])]) m4_define([b4_parser_class_name], [b4_percent_define_get([[parser_class_name]])]) # Save the parse parameters. m4_define([b4_parse_param_orig], m4_defn([b4_parse_param])) # b4_parse_param_wrap # ------------------- # New ones. m4_ifset([b4_parse_param], [m4_define([b4_parse_param_wrap], [[b4_namespace_ref::b4_parser_class_name[& yyparser], [[yyparser]]],] m4_defn([b4_parse_param]))], [m4_define([b4_parse_param_wrap], [[b4_namespace_ref::b4_parser_class_name[& yyparser], [[yyparser]]]]) ]) # b4_yy_symbol_print_define # ------------------------- # Bypass the default implementation to generate the "yy_symbol_print" # and "yy_symbol_value_print" functions. m4_define([b4_yy_symbol_print_define], [[ /*--------------------. | Print this symbol. | `--------------------*/ ]b4_function_define([yy_symbol_print], [static void], [[FILE *], []], [[int yytype], [yytype]], [[const ]b4_namespace_ref::b4_parser_class_name[::semantic_type *yyvaluep], [yyvaluep]][]dnl b4_locations_if([, [[const ]b4_namespace_ref::b4_parser_class_name[::location_type *yylocationp], [yylocationp]]]), b4_parse_param)[ { ]b4_parse_param_use[]dnl [ yyparser.yy_symbol_print_ (yytype, yyvaluep]b4_locations_if([, yylocationp])[); } ]])[ # Hijack the initial action to initialize the locations. ]b4_bison_locations_if([m4_define([b4_initial_action], [yylloc.initialize ();]m4_ifdef([b4_initial_action], [ m4_defn([b4_initial_action])]))])[ # Hijack the post prologue to insert early definition of YYLLOC_DEFAULT # and declaration of yyerror. ]m4_append([b4_post_prologue], [b4_syncline([@oline@], [@ofile@])[ ]b4_yylloc_default_define[ #define YYRHSLOC(Rhs, K) ((Rhs)[K].yystate.yyloc) ]b4_function_declare([yyerror], [static void],b4_locations_if([ [[const ]b4_namespace_ref::b4_parser_class_name[::location_type *yylocationp], [yylocationp]],]) b4_parse_param, [[const char* msg], [msg]])]) #undef yynerrs #undef yychar #undef yylval]b4_locations_if([ #undef yylloc]) m4_if(b4_prefix, [yy], [], [[/* Substitute the variable and function names. */ #define yyparse ]b4_prefix[parse #define yylex ]b4_prefix[lex #define yyerror ]b4_prefix[error #define yydebug ]b4_prefix[debug ]]b4_pure_if([], [[ #define yylval ]b4_prefix[lval #define yychar ]b4_prefix[char #define yynerrs ]b4_prefix[nerrs]b4_locations_if([[ #define yylloc ]b4_prefix[lloc]])])) # Hijack the epilogue to define implementations (yyerror, parser member # functions etc.). m4_append([b4_epilogue], [b4_syncline([@oline@], [@ofile@])[ /*------------------. | Report an error. | `------------------*/ ]b4_function_define([yyerror], [static void],b4_locations_if([ [[const ]b4_namespace_ref::b4_parser_class_name[::location_type *yylocationp], [yylocationp]],]) b4_parse_param, [[const char* msg], [msg]])[ { ]b4_parse_param_use[]dnl [ yyparser.error (]b4_locations_if([[*yylocationp, ]])[msg); } ]b4_namespace_open[ ]dnl In this section, the parse params are the original parse_params. m4_pushdef([b4_parse_param], m4_defn([b4_parse_param_orig]))dnl [ /// Build a parser object. ]b4_parser_class_name::b4_parser_class_name[ (]b4_parse_param_decl[)]m4_ifset([b4_parse_param], [ :])[ #if ]b4_api_PREFIX[DEBUG ]m4_ifset([b4_parse_param], [ ], [ :])[yycdebug_ (&std::cerr)]m4_ifset([b4_parse_param], [,])[ #endif]b4_parse_param_cons[ { } ]b4_parser_class_name::~b4_parser_class_name[ () { } int ]b4_parser_class_name[::parse () { return ::yyparse (*this]b4_user_args[); } #if ]b4_api_PREFIX[DEBUG /*--------------------. | Print this symbol. | `--------------------*/ inline void ]b4_parser_class_name[::yy_symbol_value_print_ (int yytype, const semantic_type* yyvaluep]b4_locations_if([[, const location_type* yylocationp]])[) {]b4_locations_if([[ YYUSE (yylocationp);]])[ YYUSE (yyvaluep); std::ostream& yyoutput = debug_stream (); std::ostream& yyo = yyoutput; YYUSE (yyo); ]b4_symbol_actions([printer])[ } void ]b4_parser_class_name[::yy_symbol_print_ (int yytype, const semantic_type* yyvaluep]b4_locations_if([[, const location_type* yylocationp]])[) { *yycdebug_ << (yytype < YYNTOKENS ? "token" : "nterm") << ' ' << yytname[yytype] << " ("]b4_locations_if([[ << *yylocationp << ": "]])[; yy_symbol_value_print_ (yytype, yyvaluep]b4_locations_if([[, yylocationp]])[); *yycdebug_ << ')'; } std::ostream& ]b4_parser_class_name[::debug_stream () const { return *yycdebug_; } void ]b4_parser_class_name[::set_debug_stream (std::ostream& o) { yycdebug_ = &o; } ]b4_parser_class_name[::debug_level_type ]b4_parser_class_name[::debug_level () const { return yydebug; } void ]b4_parser_class_name[::set_debug_level (debug_level_type l) { // Actually, it is yydebug which is really used. yydebug = l; } #endif ]m4_popdef([b4_parse_param])dnl b4_namespace_close ]) # b4_shared_declarations # ---------------------- # Declaration that might either go into the header (if --defines) # or open coded in the parser body. m4_define([b4_shared_declarations], [m4_pushdef([b4_parse_param], m4_defn([b4_parse_param_orig]))dnl b4_percent_code_get([[requires]])[ #include #include #include ]b4_defines_if([ b4_bison_locations_if([[#include "location.hh"]])])[ ]b4_YYDEBUG_define[ ]b4_namespace_open[ ]b4_defines_if([], [b4_bison_locations_if([b4_position_define b4_location_define])])[ /// A Bison parser. class ]b4_parser_class_name[ { public: ]b4_public_types_declare[ /// Build a parser object. ]b4_parser_class_name[ (]b4_parse_param_decl[); virtual ~]b4_parser_class_name[ (); /// Parse. /// \returns 0 iff parsing succeeded. virtual int parse (); /// The current debugging stream. std::ostream& debug_stream () const; /// Set the current debugging stream. void set_debug_stream (std::ostream &); /// Type for debugging levels. typedef int debug_level_type; /// The current debugging level. debug_level_type debug_level () const; /// Set the current debugging level. void set_debug_level (debug_level_type l); public: /// Report a syntax error.]b4_locations_if([[ /// \param loc where the syntax error is found.]])[ /// \param msg a description of the syntax error. virtual void error (]b4_locations_if([[const location_type& loc, ]])[const std::string& msg); # if ]b4_api_PREFIX[DEBUG public: /// \brief Report a symbol value on the debug stream. /// \param yytype The token type. /// \param yyvaluep Its semantic value.]b4_locations_if([[ /// \param yylocationp Its location.]])[ virtual void yy_symbol_value_print_ (int yytype, const semantic_type* yyvaluep]b4_locations_if([[, const location_type* yylocationp]])[); /// \brief Report a symbol on the debug stream. /// \param yytype The token type. /// \param yyvaluep Its semantic value.]b4_locations_if([[ /// \param yylocationp Its location.]])[ virtual void yy_symbol_print_ (int yytype, const semantic_type* yyvaluep]b4_locations_if([[, const location_type* yylocationp]])[); private: // Debugging. std::ostream* yycdebug_; #endif ]b4_parse_param_vars[ }; ]dnl Redirections for glr.c. b4_percent_define_flag_if([[global_tokens_and_yystype]], [b4_token_defines]) [ #ifndef ]b4_api_PREFIX[STYPE # define ]b4_api_PREFIX[STYPE ]b4_namespace_ref[::]b4_parser_class_name[::semantic_type #endif #ifndef ]b4_api_PREFIX[LTYPE # define ]b4_api_PREFIX[LTYPE ]b4_namespace_ref[::]b4_parser_class_name[::location_type #endif ]b4_namespace_close[ ]b4_percent_code_get([[provides]])[ ]m4_popdef([b4_parse_param])dnl ]) b4_defines_if( [b4_output_begin([b4_spec_defines_file]) b4_copyright([Skeleton interface for Bison GLR parsers in C++], [2002-2015])[ // C++ GLR parser skeleton written by Akim Demaille. ]b4_cpp_guard_open([b4_spec_defines_file])[ ]b4_shared_declarations[ ]b4_cpp_guard_close([b4_spec_defines_file])[ ]b4_output_end()]) # Let glr.c (and b4_shared_declarations) believe that the user # arguments include the parser itself. m4_pushdef([b4_parse_param], m4_defn([b4_parse_param_wrap])) m4_include(b4_pkgdatadir/[glr.c]) m4_popdef([b4_parse_param]) PKd1]Ǐ stack.hhnu[# C++ skeleton for Bison # Copyright (C) 2002-2015 Free Software Foundation, Inc. # 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 . m4_pushdef([b4_copyright_years], [2002-2015]) # b4_stack_define # --------------- m4_define([b4_stack_define], [[ template > class stack { public: // Hide our reversed order. typedef typename S::reverse_iterator iterator; typedef typename S::const_reverse_iterator const_iterator; stack () : seq_ () { seq_.reserve (200); } stack (unsigned int n) : seq_ (n) {} inline T& operator[] (unsigned int i) { return seq_[seq_.size () - 1 - i]; } inline const T& operator[] (unsigned int i) const { return seq_[seq_.size () - 1 - i]; } /// Steal the contents of \a t. /// /// Close to move-semantics. inline void push (T& t) { seq_.push_back (T()); operator[](0).move (t); } inline void pop (unsigned int n = 1) { for (; n; --n) seq_.pop_back (); } void clear () { seq_.clear (); } inline typename S::size_type size () const { return seq_.size (); } inline const_iterator begin () const { return seq_.rbegin (); } inline const_iterator end () const { return seq_.rend (); } private: stack (const stack&); stack& operator= (const stack&); /// The wrapped container. S seq_; }; /// Present a slice of the top of a stack. template > class slice { public: slice (const S& stack, unsigned int range) : stack_ (stack) , range_ (range) {} inline const T& operator [] (unsigned int i) const { return stack_[range_ - i]; } private: const S& stack_; unsigned int range_; }; ]]) b4_defines_if( [b4_output_begin([b4_dir_prefix[]stack.hh]) b4_copyright([Stack handling for Bison parsers in C++])[ /** ** \file ]b4_dir_prefix[stack.hh ** Define the ]b4_namespace_ref[::stack class. */ ]b4_cpp_guard_open([b4_dir_prefix[]stack.hh])[ # include ]b4_namespace_open[ ]b4_stack_define[ ]b4_namespace_close[ ]b4_cpp_guard_close([b4_dir_prefix[]stack.hh]) b4_output_end() ]) m4_popdef([b4_copyright_years]) PKd1]~~~ c++-skel.m4nu[ -*- Autoconf -*- # C++ skeleton dispatching for Bison. # Copyright (C) 2006-2007, 2009-2015 Free Software Foundation, Inc. # 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 . b4_glr_if( [m4_define([b4_used_skeleton], [b4_pkgdatadir/[glr.cc]])]) b4_nondeterministic_if([m4_define([b4_used_skeleton], [b4_pkgdatadir/[glr.cc]])]) m4_define_default([b4_used_skeleton], [b4_pkgdatadir/[lalr1.cc]]) m4_define_default([b4_skeleton], ["b4_basename(b4_used_skeleton)"]) m4_include(b4_used_skeleton) PKd1]LbLbc.m4nu[ -*- Autoconf -*- # C M4 Macros for Bison. # Copyright (C) 2002, 2004-2015 Free Software Foundation, Inc. # 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 . m4_include(b4_pkgdatadir/[c-like.m4]) # b4_tocpp(STRING) # ---------------- # Convert STRING into a valid C macro name. m4_define([b4_tocpp], [m4_toupper(m4_bpatsubst(m4_quote($1), [[^a-zA-Z0-9]+], [_]))]) # b4_cpp_guard(FILE) # ------------------ # A valid C macro name to use as a CPP header guard for FILE. m4_define([b4_cpp_guard], [[YY_]b4_tocpp(m4_defn([b4_prefix])/[$1])[_INCLUDED]]) # b4_cpp_guard_open(FILE) # b4_cpp_guard_close(FILE) # ------------------------ # If FILE does not expand to nothing, open/close CPP inclusion guards for FILE. m4_define([b4_cpp_guard_open], [m4_ifval(m4_quote($1), [#ifndef b4_cpp_guard([$1]) # define b4_cpp_guard([$1])])]) m4_define([b4_cpp_guard_close], [m4_ifval(m4_quote($1), [#endif b4_comment([!b4_cpp_guard([$1])])])]) ## ---------------- ## ## Identification. ## ## ---------------- ## # b4_identification # ----------------- # Depends on individual skeletons to define b4_pure_flag, b4_push_flag, or # b4_pull_flag if they use the values of the %define variables api.pure or # api.push-pull. m4_define([b4_identification], [[/* Identify Bison output. */ #define YYBISON 1 /* Bison version. */ #define YYBISON_VERSION "]b4_version[" /* Skeleton name. */ #define YYSKELETON_NAME ]b4_skeleton[]m4_ifdef([b4_pure_flag], [[ /* Pure parsers. */ #define YYPURE ]b4_pure_flag])[]m4_ifdef([b4_push_flag], [[ /* Push parsers. */ #define YYPUSH ]b4_push_flag])[]m4_ifdef([b4_pull_flag], [[ /* Pull parsers. */ #define YYPULL ]b4_pull_flag])[ ]]) ## ---------------- ## ## Default values. ## ## ---------------- ## # b4_api_prefix, b4_api_PREFIX # ---------------------------- # Corresponds to %define api.prefix b4_percent_define_default([[api.prefix]], [[yy]]) m4_define([b4_api_prefix], [b4_percent_define_get([[api.prefix]])]) m4_define([b4_api_PREFIX], [m4_toupper(b4_api_prefix)]) # b4_prefix # --------- # If the %name-prefix is not given, it is api.prefix. m4_define_default([b4_prefix], [b4_api_prefix]) # If the %union is not named, its name is YYSTYPE. b4_percent_define_default([[api.value.union.name]], [b4_api_PREFIX[][STYPE]]) ## ------------------------ ## ## Pure/impure interfaces. ## ## ------------------------ ## # b4_lex_formals # -------------- # All the yylex formal arguments. # b4_lex_param arrives quoted twice, but we want to keep only one level. m4_define([b4_lex_formals], [b4_pure_if([[[[YYSTYPE *yylvalp]], [[&yylval]]][]dnl b4_locations_if([, [[YYLTYPE *yyllocp], [&yylloc]]])])dnl m4_ifdef([b4_lex_param], [, ]b4_lex_param)]) # b4_lex # ------ # Call yylex. m4_define([b4_lex], [b4_function_call([yylex], [int], b4_lex_formals)]) # b4_user_args # ------------ m4_define([b4_user_args], [m4_ifset([b4_parse_param], [, b4_args(b4_parse_param)])]) # b4_parse_param # -------------- # If defined, b4_parse_param arrives double quoted, but below we prefer # it to be single quoted. m4_define([b4_parse_param], b4_parse_param) # b4_parse_param_for(DECL, FORMAL, BODY) # --------------------------------------- # Iterate over the user parameters, binding the declaration to DECL, # the formal name to FORMAL, and evaluating the BODY. m4_define([b4_parse_param_for], [m4_foreach([$1_$2], m4_defn([b4_parse_param]), [m4_pushdef([$1], m4_unquote(m4_car($1_$2)))dnl m4_pushdef([$2], m4_shift($1_$2))dnl $3[]dnl m4_popdef([$2])dnl m4_popdef([$1])dnl ])]) # b4_parse_param_use([VAL], [LOC]) # -------------------------------- # 'YYUSE' VAL, LOC if locations are enabled, and all the parse-params. m4_define([b4_parse_param_use], [m4_ifvaln([$1], [ YYUSE ([$1]);])dnl b4_locations_if([m4_ifvaln([$2], [ YYUSE ([$2]);])])dnl b4_parse_param_for([Decl], [Formal], [ YYUSE (Formal); ])dnl ]) ## ------------ ## ## Data Types. ## ## ------------ ## # b4_int_type(MIN, MAX) # --------------------- # Return the smallest int type able to handle numbers ranging from # MIN to MAX (included). m4_define([b4_int_type], [m4_if(b4_ints_in($@, [0], [255]), [1], [unsigned char], b4_ints_in($@, [-128], [127]), [1], [signed char], b4_ints_in($@, [0], [65535]), [1], [unsigned short int], b4_ints_in($@, [-32768], [32767]), [1], [short int], m4_eval([0 <= $1]), [1], [unsigned int], [int])]) # b4_int_type_for(NAME) # --------------------- # Return the smallest int type able to handle numbers ranging from # 'NAME_min' to 'NAME_max' (included). m4_define([b4_int_type_for], [b4_int_type($1_min, $1_max)]) # b4_table_value_equals(TABLE, VALUE, LITERAL) # -------------------------------------------- # Without inducing a comparison warning from the compiler, check if the # literal value LITERAL equals VALUE from table TABLE, which must have # TABLE_min and TABLE_max defined. m4_define([b4_table_value_equals], [m4_if(m4_eval($3 < m4_indir([b4_]$1[_min]) || m4_indir([b4_]$1[_max]) < $3), [1], [[0]], [(!!(($2) == ($3)))])]) ## ----------------- ## ## Compiler issues. ## ## ----------------- ## # b4_attribute_define # ------------------- # Provide portable compiler "attributes". m4_define([b4_attribute_define], [#ifndef YY_ATTRIBUTE # if (defined __GNUC__ \ && (2 < __GNUC__ || (__GNUC__ == 2 && 96 <= __GNUC_MINOR__))) \ || defined __SUNPRO_C && 0x5110 <= __SUNPRO_C # define YY_ATTRIBUTE(Spec) __attribute__(Spec) # else # define YY_ATTRIBUTE(Spec) /* empty */ # endif #endif #ifndef YY_ATTRIBUTE_PURE # define YY_ATTRIBUTE_PURE YY_ATTRIBUTE ((__pure__)) #endif #ifndef YY_ATTRIBUTE_UNUSED # define YY_ATTRIBUTE_UNUSED YY_ATTRIBUTE ((__unused__)) #endif #if !defined _Noreturn \ && (!defined __STDC_VERSION__ || __STDC_VERSION__ < 201112) # if defined _MSC_VER && 1200 <= _MSC_VER # define _Noreturn __declspec (noreturn) # else # define _Noreturn YY_ATTRIBUTE ((__noreturn__)) # endif #endif /* Suppress unused-variable warnings by "using" E. */ #if ! defined lint || defined __GNUC__ # define YYUSE(E) ((void) (E)) #else # define YYUSE(E) /* empty */ #endif #if defined __GNUC__ && 407 <= __GNUC__ * 100 + __GNUC_MINOR__ /* Suppress an incorrect diagnostic about yylval being uninitialized. */ # define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \ _Pragma ("GCC diagnostic push") \ _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")\ _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"") # define YY_IGNORE_MAYBE_UNINITIALIZED_END \ _Pragma ("GCC diagnostic pop") #else # define YY_INITIAL_VALUE(Value) Value #endif #ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN # define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN # define YY_IGNORE_MAYBE_UNINITIALIZED_END #endif #ifndef YY_INITIAL_VALUE # define YY_INITIAL_VALUE(Value) /* Nothing. */ #endif ]) ## ---------## ## Values. ## ## ---------## # b4_null_define # -------------- # Portability issues: define a YY_NULLPTR appropriate for the current # language (C, C++98, or C++11). m4_define([b4_null_define], [# ifndef YY_NULLPTR # if defined __cplusplus && 201103L <= __cplusplus # define YY_NULLPTR nullptr # else # define YY_NULLPTR 0 # endif # endif[]dnl ]) # b4_null # ------- # Return a null pointer constant. m4_define([b4_null], [YY_NULLPTR]) # b4_integral_parser_table_define(TABLE-NAME, CONTENT, COMMENT) # ------------------------------------------------------------- # Define "yy" whose contents is CONTENT. m4_define([b4_integral_parser_table_define], [m4_ifvaln([$3], [b4_comment([$3], [ ])])dnl static const b4_int_type_for([$2]) yy$1[[]] = { $2 };dnl ]) ## ------------------------- ## ## Assigning token numbers. ## ## ------------------------- ## # b4_token_define(TOKEN-NUM) # -------------------------- # Output the definition of this token as #define. m4_define([b4_token_define], [b4_token_format([#define %s %s], [$1])]) # b4_token_defines # ---------------- # Output the definition of the tokens. m4_define([b4_token_defines], [b4_any_token_visible_if([/* Tokens. */ m4_join([ ], b4_symbol_map([b4_token_define])) ])]) # b4_token_enum(TOKEN-NUM) # ------------------------ # Output the definition of this token as an enum. m4_define([b4_token_enum], [b4_token_format([%s = %s], [$1])]) # b4_token_enums # -------------- # Output the definition of the tokens (if there are) as enums. m4_define([b4_token_enums], [b4_any_token_visible_if([[/* Token type. */ #ifndef ]b4_api_PREFIX[TOKENTYPE # define ]b4_api_PREFIX[TOKENTYPE enum ]b4_api_prefix[tokentype { ]m4_join([, ], b4_symbol_map([b4_token_enum]))[ }; #endif ]])]) # b4_token_enums_defines # ---------------------- # Output the definition of the tokens (if there are any) as enums and, # if POSIX Yacc is enabled, as #defines. m4_define([b4_token_enums_defines], [b4_token_enums[]b4_yacc_if([b4_token_defines])]) ## ----------------- ## ## Semantic Values. ## ## ----------------- ## # b4_symbol_value(VAL, [TYPE]) # ---------------------------- # Given a semantic value VAL ($$, $1 etc.), extract its value of type # TYPE if TYPE is given, otherwise just return VAL. The result can be # used safetly, it is put in parens to avoid nasty precedence issues. # TYPE is *not* put in braces, provide some if needed. m4_define([b4_symbol_value], [($1[]m4_ifval([$2], [.$2]))]) ## ---------------------- ## ## Defining C functions. ## ## ---------------------- ## # b4_function_define(NAME, RETURN-VALUE, [DECL1, NAME1], ...) # ----------------------------------------------------------- # Declare the function NAME in C. m4_define([b4_function_define], [$2 $1 (b4_formals(m4_shift2($@)))[]dnl ]) # b4_formals([DECL1, NAME1], ...) # ------------------------------- # The formal arguments of a C function definition. m4_define([b4_formals], [m4_if([$#], [0], [void], [$#$1], [1], [void], [m4_map_sep([b4_formal], [, ], [$@])])]) m4_define([b4_formal], [$1]) ## ----------------------- ## ## Declaring C functions. ## ## ----------------------- ## # b4_function_declare(NAME, RETURN-VALUE, [DECL1, NAME1], ...) # ------------------------------------------------------------ # Declare the function NAME. m4_define([b4_function_declare], [$2 $1 (b4_formals(m4_shift2($@)));[]dnl ]) ## --------------------- ## ## Calling C functions. ## ## --------------------- ## # b4_function_call(NAME, RETURN-VALUE, [DECL1, NAME1], ...) # ----------------------------------------------------------- # Call the function NAME with arguments NAME1, NAME2 etc. m4_define([b4_function_call], [$1 (b4_args(m4_shift2($@)))[]dnl ]) # b4_args([DECL1, NAME1], ...) # ---------------------------- # Output the arguments NAME1, NAME2... m4_define([b4_args], [m4_map_sep([b4_arg], [, ], [$@])]) m4_define([b4_arg], [$2]) ## ----------- ## ## Synclines. ## ## ----------- ## # b4_sync_start(LINE, FILE) # ------------------------- m4_define([b4_sync_start], [[#]line $1 $2]) ## -------------- ## ## User actions. ## ## -------------- ## # b4_case(LABEL, STATEMENTS) # -------------------------- m4_define([b4_case], [ case $1: $2 b4_syncline([@oline@], [@ofile@]) break;]) # b4_predicate_case(LABEL, CONDITIONS) # ------------------------------------ m4_define([b4_predicate_case], [ case $1: if (! ($2)) YYERROR; b4_syncline([@oline@], [@ofile@]) break;]) # b4_yydestruct_define # -------------------- # Define the "yydestruct" function. m4_define_default([b4_yydestruct_define], [[/*-----------------------------------------------. | Release the memory associated to this symbol. | `-----------------------------------------------*/ ]b4_function_define([yydestruct], [static void], [[const char *yymsg], [yymsg]], [[int yytype], [yytype]], [[YYSTYPE *yyvaluep], [yyvaluep]][]dnl b4_locations_if( [, [[YYLTYPE *yylocationp], [yylocationp]]])[]dnl m4_ifset([b4_parse_param], [, b4_parse_param]))[ { ]b4_parse_param_use([yyvaluep], [yylocationp])dnl [ if (!yymsg) yymsg = "Deleting"; YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN ]b4_symbol_actions([destructor])[ YY_IGNORE_MAYBE_UNINITIALIZED_END }]dnl ]) # b4_yy_symbol_print_define # ------------------------- # Define the "yy_symbol_print" function. m4_define_default([b4_yy_symbol_print_define], [[ /*----------------------------------------. | Print this symbol's value on YYOUTPUT. | `----------------------------------------*/ ]b4_function_define([yy_symbol_value_print], [static void], [[FILE *yyoutput], [yyoutput]], [[int yytype], [yytype]], [[YYSTYPE const * const yyvaluep], [yyvaluep]][]dnl b4_locations_if([, [[YYLTYPE const * const yylocationp], [yylocationp]]])[]dnl m4_ifset([b4_parse_param], [, b4_parse_param]))[ { FILE *yyo = yyoutput; ]b4_parse_param_use([yyo], [yylocationp])dnl [ if (!yyvaluep) return;] dnl glr.c does not feature yytoknum. m4_if(b4_skeleton, ["yacc.c"], [[# ifdef YYPRINT if (yytype < YYNTOKENS) YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); # endif ]])dnl b4_symbol_actions([printer])[ } /*--------------------------------. | Print this symbol on YYOUTPUT. | `--------------------------------*/ ]b4_function_define([yy_symbol_print], [static void], [[FILE *yyoutput], [yyoutput]], [[int yytype], [yytype]], [[YYSTYPE const * const yyvaluep], [yyvaluep]][]dnl b4_locations_if([, [[YYLTYPE const * const yylocationp], [yylocationp]]])[]dnl m4_ifset([b4_parse_param], [, b4_parse_param]))[ { YYFPRINTF (yyoutput, "%s %s (", yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]); ]b4_locations_if([ YY_LOCATION_PRINT (yyoutput, *yylocationp); YYFPRINTF (yyoutput, ": "); ])dnl [ yy_symbol_value_print (yyoutput, yytype, yyvaluep]dnl b4_locations_if([, yylocationp])[]b4_user_args[); YYFPRINTF (yyoutput, ")"); }]dnl ]) ## ---------------- ## ## api.value.type. ## ## ---------------- ## # ---------------------- # # api.value.type=union. # # ---------------------- # # b4_symbol_type_register(SYMBOL-NUM) # ----------------------------------- # Symbol SYMBOL-NUM has a type (for variant) instead of a type-tag. # Extend the definition of %union's body (b4_union_members) with a # field of that type, and extend the symbol's "type" field to point to # the field name, instead of the type name. m4_define([b4_symbol_type_register], [m4_define([b4_symbol($1, type_tag)], [b4_symbol_if([$1], [has_id], [b4_symbol([$1], [id])], [yytype_[]b4_symbol([$1], [number])])])dnl m4_append([b4_union_members], m4_expand([ b4_symbol_tag_comment([$1])dnl b4_symbol([$1], [type]) b4_symbol([$1], [type_tag]);])) ]) # b4_type_define_tag(SYMBOL1-NUM, ...) # ------------------------------------ # For the batch of symbols SYMBOL1-NUM... (which all have the same # type), enhance the %union definition for each of them, and set # there "type" field to the field tag name, instead of the type name. m4_define([b4_type_define_tag], [b4_symbol_if([$1], [has_type], [m4_map([b4_symbol_type_register], [$@])]) ]) # b4_symbol_value_union(VAL, [TYPE]) # ---------------------------------- # Same of b4_symbol_value, but when api.value.type=union. m4_define([b4_symbol_value_union], [m4_ifval([$2], [(*($2*)(&$1))], [$1])]) ]) # b4_value_type_setup_union # ------------------------- # Setup support for api.value.type=union. Symbols are defined with a # type instead of a union member name: build the corresponding union, # and give the symbols their tag. m4_define([b4_value_type_setup_union], [m4_define([b4_union_members]) b4_type_foreach([b4_type_define_tag]) m4_copy_force([b4_symbol_value_union], [b4_symbol_value]) ]) # -------------------------- # # api.value.type = variant. # # -------------------------- # # b4_value_type_setup_variant # --------------------------- # Setup support for api.value.type=variant. By default, fail, specialized # by other skeletons. m4_define([b4_value_type_setup_variant], [b4_complain_at(b4_percent_define_get_loc([[api.value.type]]), [['%s' does not support '%s']], [b4_skeleton], [%define api.value.type variant])]) # _b4_value_type_setup_keyword # ---------------------------- # api.value.type is defined with a keyword/string syntax. Check if # that is properly defined, and prepare its use. m4_define([_b4_value_type_setup_keyword], [b4_percent_define_check_values([[[[api.value.type]], [[none]], [[union]], [[union-directive]], [[variant]], [[yystype]]]])dnl m4_case(b4_percent_define_get([[api.value.type]]), [union], [b4_value_type_setup_union], [variant], [b4_value_type_setup_variant])]) # b4_value_type_setup # ------------------- # Check if api.value.type is properly defined, and possibly prepare # its use. b4_define_silent([b4_value_type_setup], [# Define default value. b4_percent_define_ifdef([[api.value.type]], [], [# %union => api.value.type=union-directive m4_ifdef([b4_union_members], [m4_define([b4_percent_define_kind(api.value.type)], [keyword]) m4_define([b4_percent_define(api.value.type)], [union-directive])], [# no tag seen => api.value.type={int} m4_if(b4_tag_seen_flag, 0, [m4_define([b4_percent_define_kind(api.value.type)], [code]) m4_define([b4_percent_define(api.value.type)], [int])], [# otherwise api.value.type=yystype m4_define([b4_percent_define_kind(api.value.type)], [keyword]) m4_define([b4_percent_define(api.value.type)], [yystype])])])]) # Set up. m4_bmatch(b4_percent_define_get_kind([[api.value.type]]), [keyword\|string], [_b4_value_type_setup_keyword]) ]) ## -------------- ## ## Declarations. ## ## -------------- ## # b4_value_type_define # -------------------- m4_define([b4_value_type_define], [b4_value_type_setup[]dnl /* Value type. */ m4_bmatch(b4_percent_define_get_kind([[api.value.type]]), [code], [[#if ! defined ]b4_api_PREFIX[STYPE && ! defined ]b4_api_PREFIX[STYPE_IS_DECLARED typedef ]b4_percent_define_get([[api.value.type]])[ ]b4_api_PREFIX[STYPE; # define ]b4_api_PREFIX[STYPE_IS_TRIVIAL 1 # define ]b4_api_PREFIX[STYPE_IS_DECLARED 1 #endif ]], [m4_bmatch(b4_percent_define_get([[api.value.type]]), [union\|union-directive], [[#if ! defined ]b4_api_PREFIX[STYPE && ! defined ]b4_api_PREFIX[STYPE_IS_DECLARED ]b4_percent_define_get_syncline([[api.value.union.name]])[ union ]b4_percent_define_get([[api.value.union.name]])[ { ]b4_user_union_members[ }; ]b4_percent_define_get_syncline([[api.value.union.name]])[ typedef union ]b4_percent_define_get([[api.value.union.name]])[ ]b4_api_PREFIX[STYPE; # define ]b4_api_PREFIX[STYPE_IS_TRIVIAL 1 # define ]b4_api_PREFIX[STYPE_IS_DECLARED 1 #endif ]])])]) # b4_location_type_define # ----------------------- m4_define([b4_location_type_define], [[/* Location type. */ #if ! defined ]b4_api_PREFIX[LTYPE && ! defined ]b4_api_PREFIX[LTYPE_IS_DECLARED typedef struct ]b4_api_PREFIX[LTYPE ]b4_api_PREFIX[LTYPE; struct ]b4_api_PREFIX[LTYPE { int first_line; int first_column; int last_line; int last_column; }; # define ]b4_api_PREFIX[LTYPE_IS_DECLARED 1 # define ]b4_api_PREFIX[LTYPE_IS_TRIVIAL 1 #endif ]]) # b4_declare_yylstype # ------------------- # Declarations that might either go into the header (if --defines) or # in the parser body. Declare YYSTYPE/YYLTYPE, and yylval/yylloc. m4_define([b4_declare_yylstype], [b4_value_type_define[]b4_locations_if([ b4_location_type_define]) b4_pure_if([], [[extern ]b4_api_PREFIX[STYPE ]b4_prefix[lval; ]b4_locations_if([[extern ]b4_api_PREFIX[LTYPE ]b4_prefix[lloc;]])])[]dnl ]) # b4_YYDEBUG_define # ----------------- m4_define([b4_YYDEBUG_define], [[/* Debug traces. */ ]m4_if(b4_api_prefix, [yy], [[#ifndef YYDEBUG # define YYDEBUG ]b4_parse_trace_if([1], [0])[ #endif]], [[#ifndef ]b4_api_PREFIX[DEBUG # if defined YYDEBUG #if YYDEBUG # define ]b4_api_PREFIX[DEBUG 1 # else # define ]b4_api_PREFIX[DEBUG 0 # endif # else /* ! defined YYDEBUG */ # define ]b4_api_PREFIX[DEBUG ]b4_parse_trace_if([1], [0])[ # endif /* ! defined YYDEBUG */ #endif /* ! defined ]b4_api_PREFIX[DEBUG */]])[]dnl ]) # b4_declare_yydebug # ------------------ m4_define([b4_declare_yydebug], [b4_YYDEBUG_define[ #if ]b4_api_PREFIX[DEBUG extern int ]b4_prefix[debug; #endif][]dnl ]) # b4_yylloc_default_define # ------------------------ # Define YYLLOC_DEFAULT. m4_define([b4_yylloc_default_define], [[/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. If N is 0, then set CURRENT to the empty location which ends the previous symbol: RHS[0] (always defined). */ #ifndef YYLLOC_DEFAULT # define YYLLOC_DEFAULT(Current, Rhs, N) \ do \ if (N) \ { \ (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \ (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \ (Current).last_line = YYRHSLOC (Rhs, N).last_line; \ (Current).last_column = YYRHSLOC (Rhs, N).last_column; \ } \ else \ { \ (Current).first_line = (Current).last_line = \ YYRHSLOC (Rhs, 0).last_line; \ (Current).first_column = (Current).last_column = \ YYRHSLOC (Rhs, 0).last_column; \ } \ while (0) #endif ]]) # b4_yy_location_print_define # --------------------------- # Define YY_LOCATION_PRINT. m4_define([b4_yy_location_print_define], [b4_locations_if([[ /* YY_LOCATION_PRINT -- Print the location on the stream. This macro was not mandated originally: define only if we know we won't break user code: when these are the locations we know. */ #ifndef YY_LOCATION_PRINT # if defined ]b4_api_PREFIX[LTYPE_IS_TRIVIAL && ]b4_api_PREFIX[LTYPE_IS_TRIVIAL /* Print *YYLOCP on YYO. Private, do not rely on its existence. */ YY_ATTRIBUTE_UNUSED ]b4_function_define([yy_location_print_], [static unsigned], [[FILE *yyo], [yyo]], [[YYLTYPE const * const yylocp], [yylocp]])[ { unsigned res = 0; int end_col = 0 != yylocp->last_column ? yylocp->last_column - 1 : 0; if (0 <= yylocp->first_line) { res += YYFPRINTF (yyo, "%d", yylocp->first_line); if (0 <= yylocp->first_column) res += YYFPRINTF (yyo, ".%d", yylocp->first_column); } if (0 <= yylocp->last_line) { if (yylocp->first_line < yylocp->last_line) { res += YYFPRINTF (yyo, "-%d", yylocp->last_line); if (0 <= end_col) res += YYFPRINTF (yyo, ".%d", end_col); } else if (0 <= end_col && yylocp->first_column < end_col) res += YYFPRINTF (yyo, "-%d", end_col); } return res; } # define YY_LOCATION_PRINT(File, Loc) \ yy_location_print_ (File, &(Loc)) # else # define YY_LOCATION_PRINT(File, Loc) ((void) 0) # endif #endif]], [[/* This macro is provided for backward compatibility. */ #ifndef YY_LOCATION_PRINT # define YY_LOCATION_PRINT(File, Loc) ((void) 0) #endif]]) ]) # b4_yyloc_default # ---------------- # Expand to a possible default value for yylloc. m4_define([b4_yyloc_default], [[ # if defined ]b4_api_PREFIX[LTYPE_IS_TRIVIAL && ]b4_api_PREFIX[LTYPE_IS_TRIVIAL = { ]m4_join([, ], m4_defn([b4_location_initial_line]), m4_defn([b4_location_initial_column]), m4_defn([b4_location_initial_line]), m4_defn([b4_location_initial_column]))[ } # endif ]]) PKd1]W java-skel.m4nu[ -*- Autoconf -*- # Java skeleton dispatching for Bison. # Copyright (C) 2007, 2009-2015 Free Software Foundation, Inc. # 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 . b4_glr_if( [b4_complain([%%glr-parser not supported for Java])]) b4_nondeterministic_if([b4_complain([%%nondeterministic-parser not supported for Java])]) m4_define_default([b4_used_skeleton], [b4_pkgdatadir/[lalr1.java]]) m4_define_default([b4_skeleton], ["b4_basename(b4_used_skeleton)"]) m4_include(b4_used_skeleton) PKd1](Od"d" location.ccnu[# C++ skeleton for Bison # Copyright (C) 2002-2015 Free Software Foundation, Inc. # 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 . m4_pushdef([b4_copyright_years], [2002-2015]) # b4_position_define # ------------------ # Define class position. m4_define([b4_position_define], [[ /// Abstract a position. class position { public:]m4_ifdef([b4_location_constructors], [[ /// Construct a position. explicit position (]b4_percent_define_get([[filename_type]])[* f = YY_NULLPTR, unsigned int l = ]b4_location_initial_line[u, unsigned int c = ]b4_location_initial_column[u) : filename (f) , line (l) , column (c) { } ]])[ /// Initialization. void initialize (]b4_percent_define_get([[filename_type]])[* fn = YY_NULLPTR, unsigned int l = ]b4_location_initial_line[u, unsigned int c = ]b4_location_initial_column[u) { filename = fn; line = l; column = c; } /** \name Line and Column related manipulators ** \{ */ /// (line related) Advance to the COUNT next lines. void lines (int count = 1) { if (count) { column = ]b4_location_initial_column[u; line = add_ (line, count, ]b4_location_initial_line[); } } /// (column related) Advance to the COUNT next columns. void columns (int count = 1) { column = add_ (column, count, ]b4_location_initial_column[); } /** \} */ /// File name to which this position refers. ]b4_percent_define_get([[filename_type]])[* filename; /// Current line number. unsigned int line; /// Current column number. unsigned int column; private: /// Compute max(min, lhs+rhs) (provided min <= lhs). static unsigned int add_ (unsigned int lhs, int rhs, unsigned int min) { return (0 < rhs || -static_cast(rhs) < lhs ? rhs + lhs : min); } }; /// Add \a width columns, in place. inline position& operator+= (position& res, int width) { res.columns (width); return res; } /// Add \a width columns. inline position operator+ (position res, int width) { return res += width; } /// Subtract \a width columns, in place. inline position& operator-= (position& res, int width) { return res += -width; } /// Subtract \a width columns. inline position operator- (position res, int width) { return res -= width; } ]b4_percent_define_flag_if([[define_location_comparison]], [[ /// Compare two position objects. inline bool operator== (const position& pos1, const position& pos2) { return (pos1.line == pos2.line && pos1.column == pos2.column && (pos1.filename == pos2.filename || (pos1.filename && pos2.filename && *pos1.filename == *pos2.filename))); } /// Compare two position objects. inline bool operator!= (const position& pos1, const position& pos2) { return !(pos1 == pos2); } ]])[ /** \brief Intercept output stream redirection. ** \param ostr the destination output stream ** \param pos a reference to the position to redirect */ template inline std::basic_ostream& operator<< (std::basic_ostream& ostr, const position& pos) { if (pos.filename) ostr << *pos.filename << ':'; return ostr << pos.line << '.' << pos.column; } ]]) # b4_location_define # ------------------ m4_define([b4_location_define], [[ /// Abstract a location. class location { public: ]m4_ifdef([b4_location_constructors], [ /// Construct a location from \a b to \a e. location (const position& b, const position& e) : begin (b) , end (e) { } /// Construct a 0-width location in \a p. explicit location (const position& p = position ()) : begin (p) , end (p) { } /// Construct a 0-width location in \a f, \a l, \a c. explicit location (]b4_percent_define_get([[filename_type]])[* f, unsigned int l = ]b4_location_initial_line[u, unsigned int c = ]b4_location_initial_column[u) : begin (f, l, c) , end (f, l, c) { } ])[ /// Initialization. void initialize (]b4_percent_define_get([[filename_type]])[* f = YY_NULLPTR, unsigned int l = ]b4_location_initial_line[u, unsigned int c = ]b4_location_initial_column[u) { begin.initialize (f, l, c); end = begin; } /** \name Line and Column related manipulators ** \{ */ public: /// Reset initial location to final location. void step () { begin = end; } /// Extend the current location to the COUNT next columns. void columns (int count = 1) { end += count; } /// Extend the current location to the COUNT next lines. void lines (int count = 1) { end.lines (count); } /** \} */ public: /// Beginning of the located region. position begin; /// End of the located region. position end; }; /// Join two locations, in place. inline location& operator+= (location& res, const location& end) { res.end = end.end; return res; } /// Join two locations. inline location operator+ (location res, const location& end) { return res += end; } /// Add \a width columns to the end position, in place. inline location& operator+= (location& res, int width) { res.columns (width); return res; } /// Add \a width columns to the end position. inline location operator+ (location res, int width) { return res += width; } /// Subtract \a width columns to the end position, in place. inline location& operator-= (location& res, int width) { return res += -width; } /// Subtract \a width columns to the end position. inline location operator- (location res, int width) { return res -= width; } ]b4_percent_define_flag_if([[define_location_comparison]], [[ /// Compare two location objects. inline bool operator== (const location& loc1, const location& loc2) { return loc1.begin == loc2.begin && loc1.end == loc2.end; } /// Compare two location objects. inline bool operator!= (const location& loc1, const location& loc2) { return !(loc1 == loc2); } ]])[ /** \brief Intercept output stream redirection. ** \param ostr the destination output stream ** \param loc a reference to the location to redirect ** ** Avoid duplicate information. */ template inline std::basic_ostream& operator<< (std::basic_ostream& ostr, const location& loc) { unsigned int end_col = 0 < loc.end.column ? loc.end.column - 1 : 0; ostr << loc.begin; if (loc.end.filename && (!loc.begin.filename || *loc.begin.filename != *loc.end.filename)) ostr << '-' << loc.end.filename << ':' << loc.end.line << '.' << end_col; else if (loc.begin.line < loc.end.line) ostr << '-' << loc.end.line << '.' << end_col; else if (loc.begin.column < end_col) ostr << '-' << end_col; return ostr; } ]]) b4_defines_if([ b4_output_begin([b4_dir_prefix[]position.hh]) b4_copyright([Positions for Bison parsers in C++])[ /** ** \file ]b4_dir_prefix[position.hh ** Define the ]b4_namespace_ref[::position class. */ ]b4_cpp_guard_open([b4_dir_prefix[]position.hh])[ # include // std::max # include # include ]b4_null_define[ ]b4_namespace_open[ ]b4_position_define[ ]b4_namespace_close[ ]b4_cpp_guard_close([b4_dir_prefix[]position.hh]) b4_output_end() b4_output_begin([b4_dir_prefix[]location.hh]) b4_copyright([Locations for Bison parsers in C++])[ /** ** \file ]b4_dir_prefix[location.hh ** Define the ]b4_namespace_ref[::location class. */ ]b4_cpp_guard_open([b4_dir_prefix[]location.hh])[ # include "position.hh" ]b4_namespace_open[ ]b4_location_define[ ]b4_namespace_close[ ]b4_cpp_guard_close([b4_dir_prefix[]location.hh]) b4_output_end() ]) m4_popdef([b4_copyright_years]) PKd1]zZDVVbison.m4nu[ -*- Autoconf -*- # Language-independent M4 Macros for Bison. # Copyright (C) 2002, 2004-2015 Free Software Foundation, Inc. # 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 . ## ---------------- ## ## Identification. ## ## ---------------- ## # b4_copyright(TITLE, [YEARS]) # ---------------------------- # If YEARS are not defined, use b4_copyright_years. m4_define([b4_copyright], [b4_comment([A Bison parser, made by GNU Bison b4_version.]) b4_comment([$1 ]m4_dquote(m4_text_wrap([Copyright (C) ]m4_ifval([$2], [[$2]], [m4_defn([b4_copyright_years])])[ Free Software Foundation, Inc.]))[ 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 .]) b4_comment([As a special exception, you may create a larger work that contains part or all of the Bison parser skeleton and distribute that work under terms of your choice, so long as that work isn't itself a parser generator using the skeleton or a modified version thereof as a parser skeleton. Alternatively, if you modify or redistribute the parser skeleton itself, you may (at your option) remove this special exception, which will cause the skeleton and the resulting Bison output files to be licensed under the GNU General Public License without this special exception. This special exception was added by the Free Software Foundation in version 2.2 of Bison.])]) ## -------- ## ## Output. ## ## -------- ## # b4_output_begin(FILE) # --------------------- # Enable output, i.e., send to diversion 0, expand after "#", and # generate the tag to output into FILE. Must be followed by EOL. m4_define([b4_output_begin], [m4_changecom() m4_divert_push(0)dnl @output(m4_unquote([$1])@)@dnl ]) # b4_output_end() # --------------- # Output nothing, restore # as comment character (no expansions after #). m4_define([b4_output_end], [m4_divert_pop(0) m4_changecom([#]) ]) # b4_divert_kill(CODE) # -------------------- # Expand CODE for its side effects, discard its output. m4_define([b4_divert_kill], [m4_divert_text([KILL], [$1])]) # b4_define_silent(MACRO, CODE) # ----------------------------- # Same as m4_define, but throw away the expansion of CODE. m4_define([b4_define_silent], [m4_define([$1], [b4_divert_kill([$2])])]) ## ---------------- ## ## Error handling. ## ## ---------------- ## # The following error handling macros print error directives that should not # become arguments of other macro invocations since they would likely then be # mangled. Thus, they print to stdout directly. # b4_cat(TEXT) # ------------ # Write TEXT to stdout. Precede the final newline with an @ so that it's # escaped. For example: # # b4_cat([[@complain(invalid input@)]]) m4_define([b4_cat], [m4_syscmd([cat <<'_m4eof' ]m4_bpatsubst(m4_dquote($1), [_m4eof], [_m4@`eof])[@ _m4eof ])dnl m4_if(m4_sysval, [0], [], [m4_fatal([$0: cannot write to stdout])])]) # b4_error(KIND, START, END, FORMAT, [ARG1], [ARG2], ...) # ------------------------------------------------------- # Write @KIND(START@,END@,FORMAT@,ARG1@,ARG2@,...@) to stdout. # # For example: # # b4_error([[complain]], [[input.y:2.3]], [[input.y:5.4]], # [[invalid %s]], [[foo]]) m4_define([b4_error], [b4_cat([[@complain][(]$1[@,]$2[@,]$3[@,]$4[]]dnl [m4_if([$#], [4], [], [m4_foreach([b4_arg], m4_dquote(m4_shift(m4_shift(m4_shift(m4_shift($@))))), [[@,]b4_arg])])[@)]])]) # b4_warn(FORMAT, [ARG1], [ARG2], ...) # ------------------------------------ # Write @warn(FORMAT@,ARG1@,ARG2@,...@) to stdout. # # For example: # # b4_warn([[invalid value for '%s': %s]], [[foo]], [[3]]) # # As a simple test suite, this: # # m4_divert(-1) # m4_define([asdf], [ASDF]) # m4_define([fsa], [FSA]) # m4_define([fdsa], [FDSA]) # b4_warn_at([[[asdf), asdf]]], [[[fsa), fsa]]], [[[fdsa), fdsa]]]) # b4_warn_at([[asdf), asdf]], [[fsa), fsa]], [[fdsa), fdsa]]) # b4_warn_at() # b4_warn_at(1) # b4_warn_at(1, 2) # # Should produce this without newlines: # # @warn_at([asdf), asdf]@,@,@,[fsa), fsa]@,[fdsa), fdsa]@) # @warn(asdf), asdf@,@,@,fsa), fsa@,fdsa), fdsa@) # @warn(@) # @warn(1@) # @warn(1@,2@) m4_define([b4_warn], [b4_error([[warn]], [], [], $@)]) # b4_warn_at(START, END, FORMAT, [ARG1], [ARG2], ...) # --------------------------------------------------- # Write @warn(START@,END@,FORMAT@,ARG1@,ARG2@,...@) to stdout. # # For example: # # b4_warn_at([[input.y:2.3]], [[input.y:5.4]], [[invalid %s]], [[foo]]) m4_define([b4_warn_at], [b4_error([[warn]], $@)]) # b4_complain(FORMAT, [ARG1], [ARG2], ...) # ---------------------------------------- # Bounce to b4_complain_at. # # See b4_warn example. m4_define([b4_complain], [b4_error([[complain]], [], [], $@)]) # b4_complain_at(START, END, FORMAT, [ARG1], [ARG2], ...) # ------------------------------------------------------- # Write @complain(START@,END@,FORMAT@,ARG1@,ARG2@,...@) to stdout. # # See b4_warn_at example. m4_define([b4_complain_at], [b4_error([[complain]], $@)]) # b4_fatal(FORMAT, [ARG1], [ARG2], ...) # ------------------------------------- # Bounce to b4_fatal_at. # # See b4_warn example. m4_define([b4_fatal], [b4_error([[fatal]], [], [], $@)dnl m4_exit(1)]) # b4_fatal_at(START, END, FORMAT, [ARG1], [ARG2], ...) # ---------------------------------------------------- # Write @fatal(START@,END@,FORMAT@,ARG1@,ARG2@,...@) to stdout and exit. # # See b4_warn_at example. m4_define([b4_fatal_at], [b4_error([[fatal]], $@)dnl m4_exit(1)]) ## ------------ ## ## Data Types. ## ## ------------ ## # b4_ints_in(INT1, INT2, LOW, HIGH) # --------------------------------- # Return 1 iff both INT1 and INT2 are in [LOW, HIGH], 0 otherwise. m4_define([b4_ints_in], [m4_eval([$3 <= $1 && $1 <= $4 && $3 <= $2 && $2 <= $4])]) # b4_subtract(LHS, RHS) # --------------------- # Evaluate LHS - RHS if they are integer literals, otherwise expand # to (LHS) - (RHS). m4_define([b4_subtract], [m4_bmatch([$1$2], [^[0123456789]*$], [m4_eval([$1 - $2])], [($1) - ($2)])]) # b4_join(ARG1, ...) # _b4_join(ARG1, ...) # ------------------- # Join with comma, skipping empty arguments. # b4_join calls itself recursively until it sees the first non-empty # argument, then calls _b4_join which prepends each non-empty argument # with a comma. m4_define([b4_join], [m4_if([$#$1], [1], [], [m4_ifval([$1], [$1[]_$0(m4_shift($@))], [$0(m4_shift($@))])])]) # _b4_join(ARGS1, ...) # -------------------- m4_define([_b4_join], [m4_if([$#$1], [1], [], [m4_ifval([$1], [, $1])[]$0(m4_shift($@))])]) # b4_integral_parser_tables_map(MACRO) # ------------------------------------- # Map MACRO on all the integral tables. MACRO is expected to have # the signature MACRO(TABLE-NAME, CONTENT, COMMENT). m4_define([b4_integral_parser_tables_map], [$1([pact], [b4_pact], [[YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing STATE-NUM.]]) $1([defact], [b4_defact], [[YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM. Performed when YYTABLE does not specify something else to do. Zero means the default is an error.]]) $1([pgoto], [b4_pgoto], [[YYPGOTO[NTERM-NUM].]]) $1([defgoto], [b4_defgoto], [[YYDEFGOTO[NTERM-NUM].]]) $1([table], [b4_table], [[YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If positive, shift that token. If negative, reduce the rule whose number is the opposite. If YYTABLE_NINF, syntax error.]]) $1([check], [b4_check]) $1([stos], [b4_stos], [[YYSTOS[STATE-NUM] -- The (internal number of the) accessing symbol of state STATE-NUM.]]) $1([r1], [b4_r1], [[YYR1[YYN] -- Symbol number of symbol that rule YYN derives.]]) $1([r2], [b4_r2], [[YYR2[YYN] -- Number of symbols on the right hand side of rule YYN.]]) ]) # b4_parser_tables_declare # b4_parser_tables_define # ------------------------ # Define/declare the (deterministic) parser tables. m4_define([b4_parser_tables_declare], [b4_integral_parser_tables_map([b4_integral_parser_table_declare])]) m4_define([b4_parser_tables_define], [b4_integral_parser_tables_map([b4_integral_parser_table_define])]) ## ------------------ ## ## Decoding options. ## ## ------------------ ## # b4_flag_if(FLAG, IF-TRUE, IF-FALSE) # ----------------------------------- # Run IF-TRUE if b4_FLAG_flag is 1, IF-FALSE if FLAG is 0, otherwise fail. m4_define([b4_flag_if], [m4_case(b4_$1_flag, [0], [$3], [1], [$2], [m4_fatal([invalid $1 value: ]b4_$1_flag)])]) # b4_define_flag_if(FLAG) # ----------------------- # Define "b4_FLAG_if(IF-TRUE, IF-FALSE)" that depends on the # value of the Boolean FLAG. m4_define([b4_define_flag_if], [_b4_define_flag_if($[1], $[2], [$1])]) # _b4_define_flag_if($1, $2, FLAG) # -------------------------------- # Work around the impossibility to define macros inside macros, # because issuing '[$1]' is not possible in M4. GNU M4 should provide # $$1 a la M5/TeX. m4_define([_b4_define_flag_if], [m4_if([$1$2], $[1]$[2], [], [m4_fatal([$0: Invalid arguments: $@])])dnl m4_define([b4_$3_if], [b4_flag_if([$3], [$1], [$2])])]) # b4_FLAG_if(IF-TRUE, IF-FALSE) # ----------------------------- # Expand IF-TRUE, if FLAG is true, IF-FALSE otherwise. b4_define_flag_if([defines]) # Whether headers are requested. b4_define_flag_if([glr]) # Whether a GLR parser is requested. b4_define_flag_if([nondeterministic]) # Whether conflicts should be handled. b4_define_flag_if([token_table]) # Whether yytoken_table is demanded. b4_define_flag_if([yacc]) # Whether POSIX Yacc is emulated. ## --------- ## ## Symbols. ## ## --------- ## # In order to unify the handling of the various aspects of symbols # (tag, type_name, whether terminal, etc.), bison.exe defines one # macro per (token, field), where field can has_id, id, etc.: see # src/output.c:prepare_symbols_definitions(). # # The various FIELDS are: # # - has_id: 0 or 1. # Whether the symbol has an id. # - id: string # If has_id, the id. Guaranteed to be usable as a C identifier. # Prefixed by api.token.prefix if defined. # - tag: string. # A representat of the symbol. Can be 'foo', 'foo.id', '"foo"' etc. # - user_number: integer # The assigned (external) number as used by yylex. # - is_token: 0 or 1 # Whether this is a terminal symbol. # - number: integer # The internalized number (used after yytranslate). # - has_type: 0, 1 # Whether has a semantic value. # - type_tag: string # When api.value.type=union, the generated name for the union member. # yytype_INT etc. for symbols that has_id, otherwise yytype_1 etc. # - type # If it has a semantic value, its type tag, or, if variant are used, # its type. # In the case of api.value.type=union, type is the real type (e.g. int). # - has_printer: 0, 1 # - printer: string # - printer_file: string # - printer_line: integer # If the symbol has a printer, everything about it. # - has_destructor, destructor, destructor_file, destructor_line # Likewise. # # The following macros provide access to these values. # b4_symbol_(NUM, FIELD) # ---------------------- # Recover a FIELD about symbol #NUM. Thanks to m4_indir, fails if # undefined. m4_define([b4_symbol_], [m4_indir([b4_symbol($1, $2)])]) # b4_symbol(NUM, FIELD) # --------------------- # Recover a FIELD about symbol #NUM. Thanks to m4_indir, fails if # undefined. If FIELD = id, prepend the token prefix. m4_define([b4_symbol], [m4_case([$2], [id], [m4_do([b4_percent_define_get([api.token.prefix])], [b4_symbol_([$1], [id])])], [b4_symbol_($@)])]) # b4_symbol_if(NUM, FIELD, IF-TRUE, IF-FALSE) # ------------------------------------------- # If FIELD about symbol #NUM is 1 expand IF-TRUE, if is 0, expand IF-FALSE. # Otherwise an error. m4_define([b4_symbol_if], [m4_case(b4_symbol([$1], [$2]), [1], [$3], [0], [$4], [m4_fatal([$0: field $2 of $1 is not a Boolean:] b4_symbol([$1], [$2]))])]) # b4_symbol_tag_comment(SYMBOL-NUM) # --------------------------------- # Issue a comment giving the tag of symbol NUM. m4_define([b4_symbol_tag_comment], [b4_comment([b4_symbol([$1], [tag])]) ]) # b4_symbol_action_location(SYMBOL-NUM, KIND) # ------------------------------------------- # Report the location of the KIND action as FILE:LINE. m4_define([b4_symbol_action_location], [b4_symbol([$1], [$2_file]):b4_syncline([b4_symbol([$1], [$2_line])])]) # b4_symbol_action(SYMBOL-NUM, KIND) # ---------------------------------- # Run the action KIND (destructor or printer) for SYMBOL-NUM. m4_define([b4_symbol_action], [b4_symbol_if([$1], [has_$2], [b4_dollar_pushdef([(*yyvaluep)], b4_symbol_if([$1], [has_type], [m4_dquote(b4_symbol([$1], [type]))]), [(*yylocationp)])dnl b4_symbol_case_([$1])[]dnl b4_syncline([b4_symbol([$1], [$2_line])], ["b4_symbol([$1], [$2_file])"]) b4_symbol([$1], [$2]) b4_syncline([@oline@], [@ofile@]) break; b4_dollar_popdef[]dnl ])]) # b4_symbol_destructor(SYMBOL-NUM) # b4_symbol_printer(SYMBOL-NUM) # -------------------------------- m4_define([b4_symbol_destructor], [b4_symbol_action([$1], [destructor])]) m4_define([b4_symbol_printer], [b4_symbol_action([$1], [printer])]) # b4_symbol_actions(KIND, [TYPE = yytype]) # ---------------------------------------- # Emit the symbol actions for KIND ("printer" or "destructor"). # Dispatch on TYPE. m4_define([b4_symbol_actions], [m4_pushdef([b4_actions_], m4_expand([b4_symbol_foreach([b4_symbol_$1])]))dnl m4_ifval(m4_defn([b4_actions_]), [switch (m4_default([$2], [yytype])) { m4_defn([b4_actions_]) default: break; }dnl ], [YYUSE (m4_default([$2], [yytype]));])dnl m4_popdef([b4_actions_])dnl ]) # b4_symbol_case_(SYMBOL-NUM) # --------------------------- # Issue a "case NUM" for SYMBOL-NUM. m4_define([b4_symbol_case_], [case b4_symbol([$1], [number]): b4_symbol_tag_comment([$1])]) ]) # b4_symbol_foreach(MACRO) # ------------------------ # Invoke MACRO(SYMBOL-NUM) for each SYMBOL-NUM. m4_define([b4_symbol_foreach], [m4_map([$1], m4_defn([b4_symbol_numbers]))]) # b4_symbol_map(MACRO) # -------------------- # Return a list (possibly empty elements) of MACRO invoked for each # SYMBOL-NUM. m4_define([b4_symbol_map], [m4_map_args_sep([$1(], [)], [,], b4_symbol_numbers)]) # b4_token_visible_if(NUM, IF-TRUE, IF-FALSE) # ------------------------------------------- # Whether NUM denotes a token that has an exported definition (i.e., # shows in enum yytokentype). m4_define([b4_token_visible_if], [b4_symbol_if([$1], [is_token], [b4_symbol_if([$1], [has_id], [$2], [$3])], [$3])]) # b4_token_has_definition(NUM) # ---------------------------- # 1 if NUM is visible, nothing otherwise. m4_define([b4_token_has_definition], [b4_token_visible_if([$1], [1])]) # b4_any_token_visible_if([IF-TRUE], [IF-FALSE]) # ---------------------------------------------- # Whether there is a token that needs to be defined. m4_define([b4_any_token_visible_if], [m4_ifval(b4_symbol_foreach([b4_token_has_definition]), [$1], [$2])]) # b4_token_format(FORMAT, NUM) # ---------------------------- m4_define([b4_token_format], [b4_token_visible_if([$2], [m4_quote(m4_format([$1], [b4_symbol([$2], [id])], [b4_symbol([$2], [user_number])]))])]) ## ------- ## ## Types. ## ## ------- ## # b4_type_action_(NUMS) # --------------------- # Run actions for the symbol NUMS that all have the same type-name. # Skip NUMS that have no type-name. # # To specify the action to run, define b4_dollar_dollar(NUMBER, # TAG, TYPE). m4_define([b4_type_action_], [b4_symbol_if([$1], [has_type], [m4_map([ b4_symbol_case_], [$@])[]dnl b4_dollar_dollar([b4_symbol([$1], [number])], [b4_symbol([$1], [tag])], [b4_symbol([$1], [type])]); break; ])]) # b4_type_foreach(MACRO) # ---------------------- # Invoke MACRO(SYMBOL-NUMS) for each set of SYMBOL-NUMS for each type set. m4_define([b4_type_foreach], [m4_map([$1], m4_defn([b4_type_names]))]) ## ----------- ## ## Synclines. ## ## ----------- ## # b4_basename(NAME) # ----------------- # Similar to POSIX basename; the differences don't matter here. # Beware that NAME is not evaluated. m4_define([b4_basename], [m4_bpatsubst([$1], [^.*/\([^/]+\)/*$], [\1])]) # b4_syncline(LINE, FILE) # ----------------------- m4_define([b4_syncline], [b4_flag_if([synclines], [b4_sync_start([$1], [$2]) b4_sync_end([__line__], [b4_basename(m4_quote(__file__))])[]dnl ])]) # b4_sync_start(LINE, FILE) # ----------------------- # Syncline for the new place. Typically a directive for the compiler. m4_define([b4_sync_start], [b4_comment([$2:$1])]) # b4_sync_end(LINE, FILE) # ----------------------- # Syncline for the current place, which ends. Typically a comment # left for the reader. m4_define([b4_sync_end], [b4_comment([$2:$1])]) # b4_user_code(USER-CODE) # ----------------------- # Emit code from the user, ending it with synclines. m4_define([b4_user_code], [$1 b4_syncline([@oline@], [@ofile@])]) # b4_define_user_code(MACRO) # -------------------------- # From b4_MACRO, build b4_user_MACRO that includes the synclines. m4_define([b4_define_user_code], [m4_define([b4_user_$1], [b4_user_code([b4_$1])])]) # b4_user_actions # b4_user_initial_action # b4_user_post_prologue # b4_user_pre_prologue # b4_user_union_members # ---------------------- # Macros that issue user code, ending with synclines. b4_define_user_code([actions]) b4_define_user_code([initial_action]) b4_define_user_code([post_prologue]) b4_define_user_code([pre_prologue]) b4_define_user_code([union_members]) # b4_check_user_names(WHAT, USER-LIST, BISON-NAMESPACE) # ----------------------------------------------------- # Complain if any name of type WHAT is used by the user (as recorded in # USER-LIST) but is not used by Bison (as recorded by macros in the # namespace BISON-NAMESPACE). # # USER-LIST must expand to a list specifying all user occurrences of all names # of type WHAT. Each item in the list must be a triplet specifying one # occurrence: name, start boundary, and end boundary. Empty string names are # fine. An empty list is fine. # # For example, to define b4_foo_user_names to be used for USER-LIST with three # name occurrences and with correct quoting: # # m4_define([b4_foo_user_names], # [[[[[[bar]], [[parser.y:1.7]], [[parser.y:1.16]]]], # [[[[bar]], [[parser.y:5.7]], [[parser.y:5.16]]]], # [[[[baz]], [[parser.y:8.7]], [[parser.y:8.16]]]]]]) # # The macro BISON-NAMESPACE(bar) must be defined iff the name bar of type WHAT # is used by Bison (in the front-end or in the skeleton). Empty string names # are fine, but it would be ugly for Bison to actually use one. # # For example, to use b4_foo_bison_names for BISON-NAMESPACE and define that # the names bar and baz are used by Bison: # # m4_define([b4_foo_bison_names(bar)]) # m4_define([b4_foo_bison_names(baz)]) # # To invoke b4_check_user_names with TYPE foo, with USER-LIST # b4_foo_user_names, with BISON-NAMESPACE b4_foo_bison_names, and with correct # quoting: # # b4_check_user_names([[foo]], [b4_foo_user_names], # [[b4_foo_bison_names]]) m4_define([b4_check_user_names], [m4_foreach([b4_occurrence], $2, [m4_pushdef([b4_occurrence], b4_occurrence)dnl m4_pushdef([b4_user_name], m4_car(b4_occurrence))dnl m4_pushdef([b4_start], m4_car(m4_shift(b4_occurrence)))dnl m4_pushdef([b4_end], m4_shift(m4_shift(b4_occurrence)))dnl m4_ifndef($3[(]m4_quote(b4_user_name)[)], [b4_complain_at([b4_start], [b4_end], [[%s '%s' is not used]], [$1], [b4_user_name])])[]dnl m4_popdef([b4_occurrence])dnl m4_popdef([b4_user_name])dnl m4_popdef([b4_start])dnl m4_popdef([b4_end])dnl ])]) ## --------------------- ## ## b4_percent_define_*. ## ## --------------------- ## # b4_percent_define_use(VARIABLE) # ------------------------------- # Declare that VARIABLE was used. m4_define([b4_percent_define_use], [m4_define([b4_percent_define_bison_variables(]$1[)])dnl ]) # b4_percent_define_get(VARIABLE, [DEFAULT]) # ------------------------------------------ # Mimic muscle_percent_define_get in ../src/muscle-tab.h. That is, if # the %define variable VARIABLE is defined, emit its value. Contrary # to its C counterpart, return DEFAULT otherwise. Also, record # Bison's usage of VARIABLE by defining # b4_percent_define_bison_variables(VARIABLE). # # For example: # # b4_percent_define_get([[foo]]) m4_define([b4_percent_define_get], [b4_percent_define_use([$1])dnl b4_percent_define_ifdef_([$1], [m4_indir([b4_percent_define(]$1[)])], [$2])]) # b4_percent_define_get_loc(VARIABLE) # ----------------------------------- # Mimic muscle_percent_define_get_loc in ../src/muscle-tab.h exactly. That is, # if the %define variable VARIABLE is undefined, complain fatally since that's # a Bison or skeleton error. Otherwise, return its definition location in a # form approriate for the first two arguments of b4_warn_at, b4_complain_at, or # b4_fatal_at. Don't record this as a Bison usage of VARIABLE as there's no # reason to suspect that the user-supplied value has yet influenced the output. # # For example: # # b4_complain_at(b4_percent_define_get_loc([[foo]]), [[invalid foo]]) m4_define([b4_percent_define_get_loc], [m4_ifdef([b4_percent_define_loc(]$1[)], [m4_pushdef([b4_loc], m4_indir([b4_percent_define_loc(]$1[)]))dnl b4_loc[]dnl m4_popdef([b4_loc])], [b4_fatal([[$0: undefined %%define variable '%s']], [$1])])]) # b4_percent_define_get_kind(VARIABLE) # ------------------------------------ # Get the kind (code, keyword, string) of VARIABLE, i.e., how its # value was defined (braces, not delimiters, quotes). # # If the %define variable VARIABLE is undefined, complain fatally # since that's a Bison or skeleton error. Don't record this as a # Bison usage of VARIABLE as there's no reason to suspect that the # user-supplied value has yet influenced the output. m4_define([b4_percent_define_get_kind], [m4_ifdef([b4_percent_define_kind(]$1[)], [m4_indir([b4_percent_define_kind(]$1[)])], [b4_fatal([[$0: undefined %%define variable '%s']], [$1])])]) # b4_percent_define_get_syncline(VARIABLE) # ---------------------------------------- # Mimic muscle_percent_define_get_syncline in ../src/muscle-tab.h exactly. # That is, if the %define variable VARIABLE is undefined, complain fatally # since that's a Bison or skeleton error. Otherwise, return its definition # location as a b4_syncline invocation. Don't record this as a Bison usage of # VARIABLE as there's no reason to suspect that the user-supplied value has yet # influenced the output. # # For example: # # b4_percent_define_get_syncline([[foo]]) m4_define([b4_percent_define_get_syncline], [m4_ifdef([b4_percent_define_syncline(]$1[)], [m4_indir([b4_percent_define_syncline(]$1[)])], [b4_fatal([[$0: undefined %%define variable '%s']], [$1])])]) # b4_percent_define_ifdef_(VARIABLE, IF-TRUE, [IF-FALSE]) # ------------------------------------------------------ # If the %define variable VARIABLE is defined, expand IF-TRUE, else expand # IF-FALSE. Don't record usage of VARIABLE. # # For example: # # b4_percent_define_ifdef_([[foo]], [[it's defined]], [[it's undefined]]) m4_define([b4_percent_define_ifdef_], [m4_ifdef([b4_percent_define(]$1[)], [$2], [$3])]) # b4_percent_define_ifdef(VARIABLE, IF-TRUE, [IF-FALSE]) # ------------------------------------------------------ # Mimic muscle_percent_define_ifdef in ../src/muscle-tab.h exactly. That is, # if the %define variable VARIABLE is defined, expand IF-TRUE, else expand # IF-FALSE. Also, record Bison's usage of VARIABLE by defining # b4_percent_define_bison_variables(VARIABLE). # # For example: # # b4_percent_define_ifdef([[foo]], [[it's defined]], [[it's undefined]]) m4_define([b4_percent_define_ifdef], [b4_percent_define_ifdef_([$1], [b4_percent_define_use([$1])$2], [$3])]) ## --------- ## ## Options. ## ## --------- ## # b4_percent_define_flag_if(VARIABLE, IF-TRUE, [IF-FALSE]) # -------------------------------------------------------- # Mimic muscle_percent_define_flag_if in ../src/muscle-tab.h exactly. That is, # if the %define variable VARIABLE is defined to "" or "true", expand IF-TRUE. # If it is defined to "false", expand IF-FALSE. Complain if it is undefined # (a Bison or skeleton error since the default value should have been set # already) or defined to any other value (possibly a user error). Also, record # Bison's usage of VARIABLE by defining # b4_percent_define_bison_variables(VARIABLE). # # For example: # # b4_percent_define_flag_if([[foo]], [[it's true]], [[it's false]]) m4_define([b4_percent_define_flag_if], [b4_percent_define_ifdef([$1], [m4_case(b4_percent_define_get([$1]), [], [$2], [true], [$2], [false], [$3], [m4_expand_once([b4_complain_at(b4_percent_define_get_loc([$1]), [[invalid value for %%define Boolean variable '%s']], [$1])], [[b4_percent_define_flag_if($1)]])])], [b4_fatal([[$0: undefined %%define variable '%s']], [$1])])]) # b4_percent_define_default(VARIABLE, DEFAULT, [KIND = keyword]) # -------------------------------------------------------------- # Mimic muscle_percent_define_default in ../src/muscle-tab.h exactly. That is, # if the %define variable VARIABLE is undefined, set its value to DEFAULT. # Don't record this as a Bison usage of VARIABLE as there's no reason to # suspect that the value has yet influenced the output. # # For example: # # b4_percent_define_default([[foo]], [[default value]]) m4_define([b4_percent_define_default], [b4_percent_define_ifdef_([$1], [], [m4_define([b4_percent_define(]$1[)], [$2])dnl m4_define([b4_percent_define_kind(]$1[)], [m4_default([$3], [keyword])])dnl m4_define([b4_percent_define_loc(]$1[)], [[[[:-1.-1]], [[:-1.-1]]]])dnl m4_define([b4_percent_define_syncline(]$1[)], [[]])])]) # b4_percent_define_if_define(NAME, [VARIABLE = NAME]) # ---------------------------------------------------- # Define b4_NAME_if that executes its $1 or $2 depending whether # VARIABLE was %defined. The characters '.' and `-' in VARIABLE are mapped # to '_'. m4_define([b4_percent_define_if_define_], [m4_define(m4_bpatsubst([b4_$1_if], [[-.]], [_]), [b4_percent_define_flag_if(m4_default([$2], [$1]), [$3], [$4])])]) m4_define([b4_percent_define_if_define], [b4_percent_define_default([m4_default([$2], [$1])], [[false]]) b4_percent_define_if_define_([$1], [$2], $[1], $[2])]) # b4_percent_define_check_kind(VARIABLE, KIND, [DIAGNOSTIC = complain]) # --------------------------------------------------------------------- m4_define([b4_percent_define_check_kind], [b4_percent_define_ifdef_([$1], [m4_if(b4_percent_define_get_kind([$1]), [$2], [], [b4_error([m4_default([$3], [complain])], b4_percent_define_get_loc([$1]), [m4_case([$2], [code], [[%%define variable '%s' requires '{...}' values]], [keyword], [[%%define variable '%s' requires keyword values]], [string], [[%%define variable '%s' requires '"..."' values]])], [$1])])])dnl ]) # b4_percent_define_check_values(VALUES) # -------------------------------------- # Mimic muscle_percent_define_check_values in ../src/muscle-tab.h exactly # except that the VALUES structure is more appropriate for M4. That is, VALUES # is a list of sublists of strings. For each sublist, the first string is the # name of a %define variable, and all remaining strings in that sublist are the # valid values for that variable. Complain if such a variable is undefined (a # Bison error since the default value should have been set already) or defined # to any other value (possibly a user error). Don't record this as a Bison # usage of the variable as there's no reason to suspect that the value has yet # influenced the output. # # For example: # # b4_percent_define_check_values([[[[foo]], [[foo-value1]], [[foo-value2]]]], # [[[[bar]], [[bar-value1]]]]) m4_define([b4_percent_define_check_values], [m4_foreach([b4_sublist], m4_quote($@), [_b4_percent_define_check_values(b4_sublist)])]) m4_define([_b4_percent_define_check_values], [b4_percent_define_ifdef_([$1], [b4_percent_define_check_kind(]$1[, [keyword], [deprecated])dnl m4_pushdef([b4_good_value], [0])dnl m4_if($#, 1, [], [m4_foreach([b4_value], m4_dquote(m4_shift($@)), [m4_if(m4_indir([b4_percent_define(]$1[)]), b4_value, [m4_define([b4_good_value], [1])])])])dnl m4_if(b4_good_value, [0], [b4_complain_at(b4_percent_define_get_loc([$1]), [[invalid value for %%define variable '%s': '%s']], [$1], m4_dquote(m4_indir([b4_percent_define(]$1[)]))) m4_foreach([b4_value], m4_dquote(m4_shift($@)), [b4_error([[note]], b4_percent_define_get_loc([$1]), [] [[accepted value: '%s']], m4_dquote(b4_value))])])dnl m4_popdef([b4_good_value])], [b4_fatal([[$0: undefined %%define variable '%s']], [$1])])]) # b4_percent_code_get([QUALIFIER]) # -------------------------------- # If any %code blocks for QUALIFIER are defined, emit them beginning with a # comment and ending with synclines and a newline. If QUALIFIER is not # specified or empty, do this for the unqualified %code blocks. Also, record # Bison's usage of QUALIFIER (if specified) by defining # b4_percent_code_bison_qualifiers(QUALIFIER). # # For example, to emit any unqualified %code blocks followed by any %code # blocks for the qualifier foo: # # b4_percent_code_get # b4_percent_code_get([[foo]]) m4_define([b4_percent_code_get], [m4_pushdef([b4_macro_name], [[b4_percent_code(]$1[)]])dnl m4_ifval([$1], [m4_define([b4_percent_code_bison_qualifiers(]$1[)])])dnl m4_ifdef(b4_macro_name, [b4_comment([m4_if([$#], [0], [[Unqualified %code]], [["%code ]$1["]])[ blocks.]]) b4_user_code([m4_indir(b4_macro_name)]) ])dnl m4_popdef([b4_macro_name])]) # b4_percent_code_ifdef(QUALIFIER, IF-TRUE, [IF-FALSE]) # ----------------------------------------------------- # If any %code blocks for QUALIFIER (or unqualified %code blocks if # QUALIFIER is empty) are defined, expand IF-TRUE, else expand IF-FALSE. # Also, record Bison's usage of QUALIFIER (if specified) by defining # b4_percent_code_bison_qualifiers(QUALIFIER). m4_define([b4_percent_code_ifdef], [m4_ifdef([b4_percent_code(]$1[)], [m4_ifval([$1], [m4_define([b4_percent_code_bison_qualifiers(]$1[)])])$2], [$3])]) ## ------------------ ## ## Common variables. ## ## ------------------ ## # b4_parse_assert_if([IF-ASSERTIONS-ARE-USED], [IF-NOT]) # b4_parse_trace_if([IF-DEBUG-TRACES-ARE-ENABLED], [IF-NOT]) # b4_token_ctor_if([IF-YYLEX-RETURNS-A-TOKEN], [IF-NOT]) # ---------------------------------------------- b4_percent_define_if_define([token_ctor], [api.token.constructor]) b4_percent_define_if_define([locations]) # Whether locations are tracked. b4_percent_define_if_define([parse.assert]) b4_percent_define_if_define([parse.trace]) # b4_bison_locations_if([IF-TRUE]) # -------------------------------- # Expand IF-TRUE if using locations, and using the default location # type. m4_define([b4_bison_locations_if], [b4_locations_if([b4_percent_define_ifdef([[api.location.type]], [], [$1])])]) # b4_error_verbose_if([IF-ERRORS-ARE-VERBOSE], [IF-NOT]) # ------------------------------------------------------ # Map %define parse.error "(simple|verbose)" to b4_error_verbose_if and # b4_error_verbose_flag. b4_percent_define_default([[parse.error]], [[simple]]) b4_percent_define_check_values([[[[parse.error]], [[simple]], [[verbose]]]]) m4_define([b4_error_verbose_flag], [m4_case(b4_percent_define_get([[parse.error]]), [simple], [[0]], [verbose], [[1]])]) b4_define_flag_if([error_verbose]) # yytoken_table is needed to support verbose errors. b4_error_verbose_if([m4_define([b4_token_table_flag], [1])]) # b4_variant_if([IF-VARIANT-ARE-USED], [IF-NOT]) # ---------------------------------------------- b4_percent_define_if_define([variant]) m4_define([b4_variant_flag], [[0]]) b4_percent_define_ifdef([[api.value.type]], [m4_case(b4_percent_define_get_kind([[api.value.type]]), [keyword], [m4_case(b4_percent_define_get([[api.value.type]]), [variant], [m4_define([b4_variant_flag], [[1]])])])]) b4_define_flag_if([variant]) ## ----------------------------------------------------------- ## ## After processing the skeletons, check that all the user's ## ## %define variables and %code qualifiers were used by Bison. ## ## ----------------------------------------------------------- ## m4_define([b4_check_user_names_wrap], [m4_ifdef([b4_percent_]$1[_user_]$2[s], [b4_check_user_names([[%]$1 $2], [b4_percent_]$1[_user_]$2[s], [[b4_percent_]$1[_bison_]$2[s]])])]) m4_wrap_lifo([ b4_check_user_names_wrap([[define]], [[variable]]) b4_check_user_names_wrap([[code]], [[qualifier]]) ]) ## ---------------- ## ## Default values. ## ## ---------------- ## # m4_define_default([b4_lex_param], []) dnl breaks other skeletons m4_define_default([b4_pre_prologue], []) m4_define_default([b4_post_prologue], []) m4_define_default([b4_epilogue], []) m4_define_default([b4_parse_param], []) # The initial column and line. m4_define_default([b4_location_initial_column], [1]) m4_define_default([b4_location_initial_line], [1]) ## --------------- ## ## Sanity checks. ## ## --------------- ## # api.location.prefix={...} (Java and C++). b4_percent_define_check_kind([api.location.type], [code], [deprecated]) # api.position.prefix={...} (Java). b4_percent_define_check_kind([api.position.type], [code], [deprecated]) # api.prefix >< %name-prefix. b4_percent_define_check_kind([api.prefix], [code], [deprecated]) b4_percent_define_ifdef([api.prefix], [m4_ifdef([b4_prefix], [b4_complain_at(b4_percent_define_get_loc([api.prefix]), [['%s' and '%s' cannot be used together]], [%name-prefix], [%define api.prefix])])]) # api.token.prefix={...} # Make it a warning for those who used betas of Bison 3.0. b4_percent_define_check_kind([api.token.prefix], [code], [deprecated]) # api.value.type >< %union. b4_percent_define_ifdef([api.value.type], [m4_ifdef([b4_union_members], [b4_complain_at(b4_percent_define_get_loc([api.value.type]), [['%s' and '%s' cannot be used together]], [%union], [%define api.value.type])])]) # api.value.type=union >< %yacc. b4_percent_define_ifdef([api.value.type], [m4_if(b4_percent_define_get([api.value.type]), [union], [b4_yacc_if(dnl [b4_complain_at(b4_percent_define_get_loc([api.value.type]), [['%s' and '%s' cannot be used together]], [%yacc], [%define api.value.type "union"])])])]) # api.value.union.name. b4_percent_define_check_kind([api.value.union.name], [keyword]) PKd1]^8m4sugar/m4sugar.m4nu[divert(-1)# -*- Autoconf -*- # This file is part of Autoconf. # Base M4 layer. # Requires GNU M4. # # Copyright (C) 1999-2013 Free Software Foundation, Inc. # This file is part of Autoconf. 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. # # Under Section 7 of GPL version 3, you are granted additional # permissions described in the Autoconf Configure Script Exception, # version 3.0, as published by the Free Software Foundation. # # You should have received a copy of the GNU General Public License # and a copy of the Autoconf Configure Script Exception along with # this program; see the files COPYINGv3 and COPYING.EXCEPTION # respectively. If not, see . # Written by Akim Demaille. # Set the quotes, whatever the current quoting system. changequote() changequote([, ]) # Some old m4's don't support m4exit. But they provide # equivalent functionality by core dumping because of the # long macros we define. ifdef([__gnu__], , [errprint(M4sugar requires GNU M4. Install it before installing M4sugar or set the M4 environment variable to its absolute file name.) m4exit(2)]) ## ------------------------------- ## ## 1. Simulate --prefix-builtins. ## ## ------------------------------- ## # m4_define # m4_defn # m4_undefine define([m4_define], defn([define])) define([m4_defn], defn([defn])) define([m4_undefine], defn([undefine])) m4_undefine([define]) m4_undefine([defn]) m4_undefine([undefine]) # m4_copy(SRC, DST) # ----------------- # Define DST as the definition of SRC. # What's the difference between: # 1. m4_copy([from], [to]) # 2. m4_define([to], [from($@)]) # Well, obviously 1 is more expensive in space. Maybe 2 is more expensive # in time, but because of the space cost of 1, it's not that obvious. # Nevertheless, one huge difference is the handling of `$0'. If `from' # uses `$0', then with 1, `to''s `$0' is `to', while it is `from' in 2. # The user would certainly prefer to see `to'. # # This definition is in effect during m4sugar initialization, when # there are no pushdef stacks; later on, we redefine it to something # more powerful for all other clients to use. m4_define([m4_copy], [m4_define([$2], m4_defn([$1]))]) # m4_rename(SRC, DST) # ------------------- # Rename the macro SRC to DST. m4_define([m4_rename], [m4_copy([$1], [$2])m4_undefine([$1])]) # m4_rename_m4(MACRO-NAME) # ------------------------ # Rename MACRO-NAME to m4_MACRO-NAME. m4_define([m4_rename_m4], [m4_rename([$1], [m4_$1])]) # m4_copy_unm4(m4_MACRO-NAME) # --------------------------- # Copy m4_MACRO-NAME to MACRO-NAME. m4_define([m4_copy_unm4], [m4_copy([$1], m4_bpatsubst([$1], [^m4_\(.*\)], [[\1]]))]) # Some m4 internals have names colliding with tokens we might use. # Rename them a` la `m4 --prefix-builtins'. Conditionals first, since # some subsequent renames are conditional. m4_rename_m4([ifdef]) m4_rename([ifelse], [m4_if]) m4_rename_m4([builtin]) m4_rename_m4([changecom]) m4_rename_m4([changequote]) m4_ifdef([changeword],dnl conditionally available in 1.4.x [m4_undefine([changeword])]) m4_rename_m4([debugfile]) m4_rename_m4([debugmode]) m4_rename_m4([decr]) m4_rename_m4([divnum]) m4_rename_m4([dumpdef]) m4_rename_m4([errprint]) m4_rename_m4([esyscmd]) m4_rename_m4([eval]) m4_rename_m4([format]) m4_undefine([include]) m4_rename_m4([incr]) m4_rename_m4([index]) m4_rename_m4([indir]) m4_rename_m4([len]) m4_rename([m4exit], [m4_exit]) m4_undefine([m4wrap]) m4_ifdef([mkstemp],dnl added in M4 1.4.8 [m4_rename_m4([mkstemp]) m4_copy([m4_mkstemp], [m4_maketemp]) m4_undefine([maketemp])], [m4_rename_m4([maketemp]) m4_copy([m4_maketemp], [m4_mkstemp])]) m4_rename([patsubst], [m4_bpatsubst]) m4_rename_m4([popdef]) m4_rename_m4([pushdef]) m4_rename([regexp], [m4_bregexp]) m4_rename_m4([shift]) m4_undefine([sinclude]) m4_rename_m4([substr]) m4_ifdef([symbols],dnl present only in alpha-quality 1.4o [m4_rename_m4([symbols])]) m4_rename_m4([syscmd]) m4_rename_m4([sysval]) m4_rename_m4([traceoff]) m4_rename_m4([traceon]) m4_rename_m4([translit]) # _m4_defn(ARG) # ------------- # _m4_defn is for internal use only - it bypasses the wrapper, so it # must only be used on one argument at a time, and only on macros # known to be defined. Make sure this still works if the user renames # m4_defn but not _m4_defn. m4_copy([m4_defn], [_m4_defn]) # _m4_divert_raw(NUM) # ------------------- # _m4_divert_raw is for internal use only. Use this instead of # m4_builtin([divert], NUM), so that tracing diversion flow is easier. m4_rename([divert], [_m4_divert_raw]) # _m4_popdef(ARG...) # ------------------ # _m4_popdef is for internal use only - it bypasses the wrapper, so it # must only be used on macros known to be defined. Make sure this # still works if the user renames m4_popdef but not _m4_popdef. m4_copy([m4_popdef], [_m4_popdef]) # _m4_undefine(ARG...) # -------------------- # _m4_undefine is for internal use only - it bypasses the wrapper, so # it must only be used on macros known to be defined. Make sure this # still works if the user renames m4_undefine but not _m4_undefine. m4_copy([m4_undefine], [_m4_undefine]) # _m4_undivert(NUM...) # -------------------- # _m4_undivert is for internal use only, and should always be given # arguments. Use this instead of m4_builtin([undivert], NUM...), so # that tracing diversion flow is easier. m4_rename([undivert], [_m4_undivert]) ## ------------------- ## ## 2. Error messages. ## ## ------------------- ## # m4_location # ----------- # Output the current file, colon, and the current line number. m4_define([m4_location], [__file__:__line__]) # m4_errprintn(MSG) # ----------------- # Same as `errprint', but with the missing end of line. m4_define([m4_errprintn], [m4_errprint([$1 ])]) # m4_warning(MSG) # --------------- # Warn the user. m4_define([m4_warning], [m4_errprintn(m4_location[: warning: $1])]) # m4_fatal(MSG, [EXIT-STATUS]) # ---------------------------- # Fatal the user. :) m4_define([m4_fatal], [m4_errprintn(m4_location[: error: $1] m4_expansion_stack)m4_exit(m4_if([$2],, 1, [$2]))]) # m4_assert(EXPRESSION, [EXIT-STATUS = 1]) # ---------------------------------------- # This macro ensures that EXPRESSION evaluates to true, and exits if # EXPRESSION evaluates to false. m4_define([m4_assert], [m4_if(m4_eval([$1]), 0, [m4_fatal([assert failed: $1], [$2])])]) ## ------------- ## ## 3. Warnings. ## ## ------------- ## # _m4_warn(CATEGORY, MESSAGE, [STACK-TRACE]) # ------------------------------------------ # Report a MESSAGE to the user if the CATEGORY of warnings is enabled. # This is for traces only. # If present, STACK-TRACE is a \n-separated list of "LOCATION: MESSAGE", # where the last line (and no other) ends with "the top level". # # Within m4, the macro is a no-op. This macro really matters # when autom4te post-processes the trace output. m4_define([_m4_warn], []) # m4_warn(CATEGORY, MESSAGE) # -------------------------- # Report a MESSAGE to the user if the CATEGORY of warnings is enabled. m4_define([m4_warn], [_m4_warn([$1], [$2], m4_ifdef([_m4_expansion_stack], [m4_expansion_stack]))]) ## ------------------- ## ## 4. File inclusion. ## ## ------------------- ## # We also want to neutralize include (and sinclude for symmetry), # but we want to extend them slightly: warn when a file is included # several times. This is, in general, a dangerous operation, because # too many people forget to quote the first argument of m4_define. # # For instance in the following case: # m4_define(foo, [bar]) # then a second reading will turn into # m4_define(bar, [bar]) # which is certainly not what was meant. # m4_include_unique(FILE) # ----------------------- # Declare that the FILE was loading; and warn if it has already # been included. m4_define([m4_include_unique], [m4_ifdef([m4_include($1)], [m4_warn([syntax], [file `$1' included several times])])dnl m4_define([m4_include($1)])]) # m4_include(FILE) # ---------------- # Like the builtin include, but warns against multiple inclusions. m4_define([m4_include], [m4_include_unique([$1])dnl m4_builtin([include], [$1])]) # m4_sinclude(FILE) # ----------------- # Like the builtin sinclude, but warns against multiple inclusions. m4_define([m4_sinclude], [m4_include_unique([$1])dnl m4_builtin([sinclude], [$1])]) ## ------------------------------------ ## ## 5. Additional branching constructs. ## ## ------------------------------------ ## # Both `m4_ifval' and `m4_ifset' tests against the empty string. The # difference is that `m4_ifset' is specialized on macros. # # In case of arguments of macros, eg. $1, it makes little difference. # In the case of a macro `FOO', you don't want to check `m4_ifval(FOO, # TRUE)', because if `FOO' expands with commas, there is a shifting of # the arguments. So you want to run `m4_ifval([FOO])', but then you just # compare the *string* `FOO' against `', which, of course fails. # # So you want the variation `m4_ifset' that expects a macro name as $1. # If this macro is both defined and defined to a non empty value, then # it runs TRUE, etc. # m4_ifblank(COND, [IF-BLANK], [IF-TEXT]) # m4_ifnblank(COND, [IF-TEXT], [IF-BLANK]) # ---------------------------------------- # If COND is empty, or consists only of blanks (space, tab, newline), # then expand IF-BLANK, otherwise expand IF-TEXT. This differs from # m4_ifval only if COND has just whitespace, but it helps optimize in # spite of users who mistakenly leave trailing space after what they # thought was an empty argument: # macro( # [] # ) # # Writing one macro in terms of the other causes extra overhead, so # we inline both definitions. m4_define([m4_ifblank], [m4_if(m4_translit([[$1]], [ ][ ][ ]), [], [$2], [$3])]) m4_define([m4_ifnblank], [m4_if(m4_translit([[$1]], [ ][ ][ ]), [], [$3], [$2])]) # m4_ifval(COND, [IF-TRUE], [IF-FALSE]) # ------------------------------------- # If COND is not the empty string, expand IF-TRUE, otherwise IF-FALSE. # Comparable to m4_ifdef. m4_define([m4_ifval], [m4_if([$1], [], [$3], [$2])]) # m4_n(TEXT) # ---------- # If TEXT is not empty, return TEXT and a new line, otherwise nothing. m4_define([m4_n], [m4_if([$1], [], [], [$1 ])]) # m4_ifvaln(COND, [IF-TRUE], [IF-FALSE]) # -------------------------------------- # Same as `m4_ifval', but add an extra newline to IF-TRUE or IF-FALSE # unless that argument is empty. m4_define([m4_ifvaln], [m4_if([$1], [], [m4_n([$3])], [m4_n([$2])])]) # m4_ifset(MACRO, [IF-TRUE], [IF-FALSE]) # -------------------------------------- # If MACRO has no definition, or of its definition is the empty string, # expand IF-FALSE, otherwise IF-TRUE. m4_define([m4_ifset], [m4_ifdef([$1], [m4_ifval(_m4_defn([$1]), [$2], [$3])], [$3])]) # m4_ifndef(NAME, [IF-NOT-DEFINED], [IF-DEFINED]) # ----------------------------------------------- m4_define([m4_ifndef], [m4_ifdef([$1], [$3], [$2])]) # m4_case(SWITCH, VAL1, IF-VAL1, VAL2, IF-VAL2, ..., DEFAULT) # ----------------------------------------------------------- # m4 equivalent of # switch (SWITCH) # { # case VAL1: # IF-VAL1; # break; # case VAL2: # IF-VAL2; # break; # ... # default: # DEFAULT; # break; # }. # All the values are optional, and the macro is robust to active # symbols properly quoted. # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_case], [m4_if([$#], 0, [], [$#], 1, [], [$#], 2, [$2], [$1], [$2], [$3], [$0([$1], m4_shift3($@))])]) # m4_bmatch(SWITCH, RE1, VAL1, RE2, VAL2, ..., DEFAULT) # ----------------------------------------------------- # m4 equivalent of # # if (SWITCH =~ RE1) # VAL1; # elif (SWITCH =~ RE2) # VAL2; # elif ... # ... # else # DEFAULT # # All the values are optional, and the macro is robust to active symbols # properly quoted. # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_bmatch], [m4_if([$#], 0, [m4_fatal([$0: too few arguments: $#])], [$#], 1, [m4_fatal([$0: too few arguments: $#: $1])], [$#], 2, [$2], [m4_if(m4_bregexp([$1], [$2]), -1, [$0([$1], m4_shift3($@))], [$3])])]) # m4_argn(N, ARGS...) # ------------------- # Extract argument N (greater than 0) from ARGS. Example: # m4_define([b], [B]) # m4_argn([2], [a], [b], [c]) => b # # Rather than using m4_car(m4_shiftn([$1], $@)), we exploit the fact that # GNU m4 can directly reference any argument, through an indirect macro. m4_define([m4_argn], [m4_assert([0 < $1])]dnl [m4_pushdef([_$0], [_m4_popdef([_$0])]m4_dquote([$]m4_incr([$1])))_$0($@)]) # m4_car(ARGS...) # m4_cdr(ARGS...) # --------------- # Manipulate m4 lists. m4_car returns the first argument. m4_cdr # bundles all but the first argument into a quoted list. These two # macros are generally used with list arguments, with quoting removed # to break the list into multiple m4 ARGS. m4_define([m4_car], [[$1]]) m4_define([m4_cdr], [m4_if([$#], 0, [m4_fatal([$0: cannot be called without arguments])], [$#], 1, [], [m4_dquote(m4_shift($@))])]) # _m4_cdr(ARGS...) # ---------------- # Like m4_cdr, except include a leading comma unless only one argument # remains. Why? Because comparing a large list against [] is more # expensive in expansion time than comparing the number of arguments; so # _m4_cdr can be used to reduce the number of arguments when it is time # to end recursion. m4_define([_m4_cdr], [m4_if([$#], 1, [], [, m4_dquote(m4_shift($@))])]) # m4_cond(TEST1, VAL1, IF-VAL1, TEST2, VAL2, IF-VAL2, ..., [DEFAULT]) # ------------------------------------------------------------------- # Similar to m4_if, except that each TEST is expanded when encountered. # If the expansion of TESTn matches the string VALn, the result is IF-VALn. # The result is DEFAULT if no tests passed. This macro allows # short-circuiting of expensive tests, where it pays to arrange quick # filter tests to run first. # # For an example, consider a previous implementation of _AS_QUOTE_IFELSE: # # m4_if(m4_index([$1], [\]), [-1], [$2], # m4_eval(m4_index([$1], [\\]) >= 0), [1], [$2], # m4_eval(m4_index([$1], [\$]) >= 0), [1], [$2], # m4_eval(m4_index([$1], [\`]) >= 0), [1], [$3], # m4_eval(m4_index([$1], [\"]) >= 0), [1], [$3], # [$2]) # # Here, m4_index is computed 5 times, and m4_eval 4, even if $1 contains # no backslash. It is more efficient to do: # # m4_cond([m4_index([$1], [\])], [-1], [$2], # [m4_eval(m4_index([$1], [\\]) >= 0)], [1], [$2], # [m4_eval(m4_index([$1], [\$]) >= 0)], [1], [$2], # [m4_eval(m4_index([$1], [\`]) >= 0)], [1], [$3], # [m4_eval(m4_index([$1], [\"]) >= 0)], [1], [$3], # [$2]) # # In the common case of $1 with no backslash, only one m4_index expansion # occurs, and m4_eval is avoided altogether. # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_cond], [m4_if([$#], [0], [m4_fatal([$0: cannot be called without arguments])], [$#], [1], [$1], m4_eval([$# % 3]), [2], [m4_fatal([$0: missing an argument])], [_$0($@)])]) m4_define([_m4_cond], [m4_if(($1), [($2)], [$3], [$#], [3], [], [$#], [4], [$4], [$0(m4_shift3($@))])]) ## ---------------------------------------- ## ## 6. Enhanced version of some primitives. ## ## ---------------------------------------- ## # m4_bpatsubsts(STRING, RE1, SUBST1, RE2, SUBST2, ...) # ---------------------------------------------------- # m4 equivalent of # # $_ = STRING; # s/RE1/SUBST1/g; # s/RE2/SUBST2/g; # ... # # All the values are optional, and the macro is robust to active symbols # properly quoted. # # I would have liked to name this macro `m4_bpatsubst', unfortunately, # due to quotation problems, I need to double quote $1 below, therefore # the anchors are broken :( I can't let users be trapped by that. # # Recall that m4_shift3 always results in an argument. Hence, we need # to distinguish between a final deletion vs. ending recursion. # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_bpatsubsts], [m4_if([$#], 0, [m4_fatal([$0: too few arguments: $#])], [$#], 1, [m4_fatal([$0: too few arguments: $#: $1])], [$#], 2, [m4_unquote(m4_builtin([patsubst], [[$1]], [$2]))], [$#], 3, [m4_unquote(m4_builtin([patsubst], [[$1]], [$2], [$3]))], [_$0($@m4_if(m4_eval($# & 1), 0, [,]))])]) m4_define([_m4_bpatsubsts], [m4_if([$#], 2, [$1], [$0(m4_builtin([patsubst], [[$1]], [$2], [$3]), m4_shift3($@))])]) # m4_copy(SRC, DST) # ----------------- # Define the pushdef stack DST as a copy of the pushdef stack SRC; # give an error if DST is already defined. This is particularly nice # for copying self-modifying pushdef stacks, where the top definition # includes one-shot initialization that is later popped to the normal # definition. This version intentionally does nothing if SRC is # undefined. # # Some macros simply can't be renamed with this method: namely, anything # involved in the implementation of m4_stack_foreach_sep. m4_define([m4_copy], [m4_ifdef([$2], [m4_fatal([$0: won't overwrite defined macro: $2])], [m4_stack_foreach_sep([$1], [m4_pushdef([$2],], [)])])]dnl [m4_ifdef([m4_location($1)], [m4_define([m4_location($2)], m4_location)])]) # m4_copy_force(SRC, DST) # m4_rename_force(SRC, DST) # ------------------------- # Like m4_copy/m4_rename, except blindly overwrite any existing DST. # Note that m4_copy_force tolerates undefined SRC, while m4_rename_force # does not. m4_define([m4_copy_force], [m4_ifdef([$2], [_m4_undefine([$2])])m4_copy($@)]) m4_define([m4_rename_force], [m4_ifdef([$2], [_m4_undefine([$2])])m4_rename($@)]) # m4_define_default(MACRO, VALUE) # ------------------------------- # If MACRO is undefined, set it to VALUE. m4_define([m4_define_default], [m4_ifndef([$1], [m4_define($@)])]) # m4_default(EXP1, EXP2) # m4_default_nblank(EXP1, EXP2) # ----------------------------- # Returns EXP1 if not empty/blank, otherwise EXP2. Expand the result. # # m4_default is called on hot paths, so inline the contents of m4_ifval, # for one less round of expansion. m4_define([m4_default], [m4_if([$1], [], [$2], [$1])]) m4_define([m4_default_nblank], [m4_ifblank([$1], [$2], [$1])]) # m4_default_quoted(EXP1, EXP2) # m4_default_nblank_quoted(EXP1, EXP2) # ------------------------------------ # Returns EXP1 if non empty/blank, otherwise EXP2. Leave the result quoted. # # For comparison: # m4_define([active], [ACTIVE]) # m4_default([active], [default]) => ACTIVE # m4_default([], [active]) => ACTIVE # -m4_default([ ], [active])- => - - # -m4_default_nblank([ ], [active])- => -ACTIVE- # m4_default_quoted([active], [default]) => active # m4_default_quoted([], [active]) => active # -m4_default_quoted([ ], [active])- => - - # -m4_default_nblank_quoted([ ], [active])- => -active- # # m4_default macro is called on hot paths, so inline the contents of m4_ifval, # for one less round of expansion. m4_define([m4_default_quoted], [m4_if([$1], [], [[$2]], [[$1]])]) m4_define([m4_default_nblank_quoted], [m4_ifblank([$1], [[$2]], [[$1]])]) # m4_defn(NAME) # ------------- # Like the original, except guarantee a warning when using something which is # undefined (unlike M4 1.4.x). This replacement is not a full-featured # replacement: if any of the defined macros contain unbalanced quoting, but # when pasted together result in a well-quoted string, then only native m4 # support is able to get it correct. But that's where quadrigraphs come in # handy, if you really need unbalanced quotes inside your macros. # # This macro is called frequently, so minimize the amount of additional # expansions by skipping m4_ifndef. Better yet, if __m4_version__ exists, # (added in M4 1.6), then let m4 do the job for us (see m4_init). m4_define([m4_defn], [m4_if([$#], [0], [[$0]], [$#], [1], [m4_ifdef([$1], [_m4_defn([$1])], [m4_fatal([$0: undefined macro: $1])])], [m4_map_args([$0], $@)])]) # m4_dumpdef(NAME...) # ------------------- # In m4 1.4.x, dumpdef writes to the current debugfile, rather than # stderr. This in turn royally confuses autom4te; so we follow the # lead of newer m4 and always dump to stderr. Unlike the original, # this version requires an argument, since there is no convenient way # in m4 1.4.x to grab the names of all defined macros. Newer m4 # always dumps to stderr, regardless of the current debugfile; it also # provides m4symbols as a way to grab all current macro names. But # dumpdefs is not frequently called, so we don't need to worry about # conditionally using these newer features. Also, this version # doesn't sort multiple arguments. # # If we detect m4 1.6 or newer, then provide an alternate definition, # installed during m4_init, that allows builtins through. # Unfortunately, there is no nice way in m4 1.4.x to dump builtins. m4_define([m4_dumpdef], [m4_if([$#], [0], [m4_fatal([$0: missing argument])], [$#], [1], [m4_ifdef([$1], [m4_errprintn( [$1: ]m4_dquote(_m4_defn([$1])))], [m4_fatal([$0: undefined macro: $1])])], [m4_map_args([$0], $@)])]) m4_define([_m4_dumpdef], [m4_if([$#], [0], [m4_fatal([$0: missing argument])], [$#], [1], [m4_builtin([dumpdef], [$1])], [m4_map_args_sep([m4_builtin([dumpdef],], [)], [], $@)])]) # m4_dumpdefs(NAME...) # -------------------- # Similar to `m4_dumpdef(NAME)', but if NAME was m4_pushdef'ed, display its # value stack (most recent displayed first). Also, this version silently # ignores undefined macros, rather than erroring out. # # This macro cheats, because it relies on the current definition of NAME # while the second argument of m4_stack_foreach_lifo is evaluated (which # would be undefined according to the API). m4_define([m4_dumpdefs], [m4_if([$#], [0], [m4_fatal([$0: missing argument])], [$#], [1], [m4_stack_foreach_lifo([$1], [m4_dumpdef([$1])m4_ignore])], [m4_map_args([$0], $@)])]) # m4_esyscmd_s(COMMAND) # --------------------- # Like m4_esyscmd, except strip any trailing newlines, thus behaving # more like shell command substitution. m4_define([m4_esyscmd_s], [m4_chomp_all(m4_esyscmd([$1]))]) # m4_popdef(NAME) # --------------- # Like the original, except guarantee a warning when using something which is # undefined (unlike M4 1.4.x). # # This macro is called frequently, so minimize the amount of additional # expansions by skipping m4_ifndef. Better yet, if __m4_version__ exists, # (added in M4 1.6), then let m4 do the job for us (see m4_init). m4_define([m4_popdef], [m4_if([$#], [0], [[$0]], [$#], [1], [m4_ifdef([$1], [_m4_popdef([$1])], [m4_fatal([$0: undefined macro: $1])])], [m4_map_args([$0], $@)])]) # m4_shiftn(N, ...) # ----------------- # Returns ... shifted N times. Useful for recursive "varargs" constructs. # # Autoconf does not use this macro, because it is inherently slower than # calling the common cases of m4_shift2 or m4_shift3 directly. But it # might as well be fast for other clients, such as Libtool. One way to # do this is to expand $@ only once in _m4_shiftn (otherwise, for long # lists, the expansion of m4_if takes twice as much memory as what the # list itself occupies, only to throw away the unused branch). The end # result is strictly equivalent to # m4_if([$1], 1, [m4_shift(,m4_shift(m4_shift($@)))], # [_m4_shiftn(m4_decr([$1]), m4_shift(m4_shift($@)))]) # but with the final `m4_shift(m4_shift($@)))' shared between the two # paths. The first leg uses a no-op m4_shift(,$@) to balance out the (). # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_shiftn], [m4_assert(0 < $1 && $1 < $#)_$0($@)]) m4_define([_m4_shiftn], [m4_if([$1], 1, [m4_shift(], [$0(m4_decr([$1])]), m4_shift(m4_shift($@)))]) # m4_shift2(...) # m4_shift3(...) # -------------- # Returns ... shifted twice, and three times. Faster than m4_shiftn. m4_define([m4_shift2], [m4_shift(m4_shift($@))]) m4_define([m4_shift3], [m4_shift(m4_shift(m4_shift($@)))]) # _m4_shift2(...) # _m4_shift3(...) # --------------- # Like m4_shift2 or m4_shift3, except include a leading comma unless shifting # consumes all arguments. Why? Because in recursion, it is nice to # distinguish between 1 element left and 0 elements left, based on how many # arguments this shift expands to. m4_define([_m4_shift2], [m4_if([$#], [2], [], [, m4_shift(m4_shift($@))])]) m4_define([_m4_shift3], [m4_if([$#], [3], [], [, m4_shift(m4_shift(m4_shift($@)))])]) # m4_undefine(NAME) # ----------------- # Like the original, except guarantee a warning when using something which is # undefined (unlike M4 1.4.x). # # This macro is called frequently, so minimize the amount of additional # expansions by skipping m4_ifndef. Better yet, if __m4_version__ exists, # (added in M4 1.6), then let m4 do the job for us (see m4_init). m4_define([m4_undefine], [m4_if([$#], [0], [[$0]], [$#], [1], [m4_ifdef([$1], [_m4_undefine([$1])], [m4_fatal([$0: undefined macro: $1])])], [m4_map_args([$0], $@)])]) # _m4_wrap(PRE, POST) # ------------------- # Helper macro for m4_wrap and m4_wrap_lifo. Allows nested calls to # m4_wrap within wrapped text. Use _m4_defn and _m4_popdef for speed. m4_define([_m4_wrap], [m4_ifdef([$0_text], [m4_define([$0_text], [$1]_m4_defn([$0_text])[$2])], [m4_builtin([m4wrap], [m4_unquote( _m4_defn([$0_text])_m4_popdef([$0_text]))])m4_define([$0_text], [$1$2])])]) # m4_wrap(TEXT) # ------------- # Append TEXT to the list of hooks to be executed at the end of input. # Whereas the order of the original may be LIFO in the underlying m4, # this version is always FIFO. m4_define([m4_wrap], [_m4_wrap([], [$1[]])]) # m4_wrap_lifo(TEXT) # ------------------ # Prepend TEXT to the list of hooks to be executed at the end of input. # Whereas the order of m4_wrap may be FIFO in the underlying m4, this # version is always LIFO. m4_define([m4_wrap_lifo], [_m4_wrap([$1[]])]) ## ------------------------- ## ## 7. Quoting manipulation. ## ## ------------------------- ## # m4_apply(MACRO, LIST) # --------------------- # Invoke MACRO, with arguments provided from the quoted list of # comma-separated quoted arguments. If LIST is empty, invoke MACRO # without arguments. The expansion will not be concatenated with # subsequent text. m4_define([m4_apply], [m4_if([$2], [], [$1], [$1($2)])[]]) # _m4_apply(MACRO, LIST) # ---------------------- # Like m4_apply, except do nothing if LIST is empty. m4_define([_m4_apply], [m4_if([$2], [], [], [$1($2)[]])]) # m4_count(ARGS) # -------------- # Return a count of how many ARGS are present. m4_define([m4_count], [$#]) # m4_curry(MACRO, ARG...) # ----------------------- # Perform argument currying. The expansion of this macro is another # macro that takes exactly one argument, appends it to the end of the # original ARG list, then invokes MACRO. For example: # m4_curry([m4_curry], [m4_reverse], [1])([2])([3]) => 3, 2, 1 # Not quite as practical as m4_incr, but you could also do: # m4_define([add], [m4_eval(([$1]) + ([$2]))]) # m4_define([add_one], [m4_curry([add], [1])]) # add_one()([2]) => 3 m4_define([m4_curry], [$1(m4_shift($@,)_$0]) m4_define([_m4_curry], [[$1])]) # m4_do(STRING, ...) # ------------------ # This macro invokes all its arguments (in sequence, of course). It is # useful for making your macros more structured and readable by dropping # unnecessary dnl's and have the macros indented properly. No concatenation # occurs after a STRING; use m4_unquote(m4_join(,STRING)) for that. # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_do], [m4_if([$#], 0, [], [$#], 1, [$1[]], [$1[]$0(m4_shift($@))])]) # m4_dquote(ARGS) # --------------- # Return ARGS as a quoted list of quoted arguments. m4_define([m4_dquote], [[$@]]) # m4_dquote_elt(ARGS) # ------------------- # Return ARGS as an unquoted list of double-quoted arguments. # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_dquote_elt], [m4_if([$#], [0], [], [$#], [1], [[[$1]]], [[[$1]],$0(m4_shift($@))])]) # m4_echo(ARGS) # ------------- # Return the ARGS, with the same level of quoting. Whitespace after # unquoted commas are consumed. m4_define([m4_echo], [$@]) # m4_expand(ARG) # _m4_expand(ARG) # --------------- # Return the expansion of ARG as a single string. Unlike # m4_quote($1), this preserves whitespace following single-quoted # commas that appear within ARG. It also deals with shell case # statements. # # m4_define([active], [ACT, IVE]) # m4_define([active2], [[ACT, IVE]]) # m4_quote(active, active2) # => ACT,IVE,ACT, IVE # m4_expand([active, active2]) # => ACT, IVE, ACT, IVE # # Unfortunately, due to limitations in m4, ARG must expand to # something with balanced quotes (use quadrigraphs to get around # this), and should not contain the unlikely delimiters -=<{( or # )}>=-. It is possible to have unbalanced quoted `(' or `)', as well # as unbalanced unquoted `)'. m4_expand can handle unterminated # comments or dnl on the final line, at the expense of speed; it also # aids in detecting attempts to incorrectly change the current # diversion inside ARG. Meanwhile, _m4_expand is faster but must be # given a terminated expansion, and has no safety checks for # mis-diverted text. # # Exploit that extra unquoted () will group unquoted commas and the # following whitespace. m4_bpatsubst can't handle newlines inside $1, # and m4_substr strips quoting. So we (ab)use m4_changequote, using # temporary quotes to remove the delimiters that conveniently included # the unquoted () that were added prior to the changequote. # # Thanks to shell case statements, too many people are prone to pass # underquoted `)', so we try to detect that by passing a marker as a # fourth argument; if the marker is not present, then we assume that # we encountered an early `)', and re-expand the first argument, but # this time with one more `(' in the second argument and in the # open-quote delimiter. We must also ignore the slop from the # previous try. The final macro is thus half line-noise, half art. m4_define([m4_expand], [m4_pushdef([m4_divert], _m4_defn([_m4_divert_unsafe]))]dnl [m4_pushdef([m4_divert_push], _m4_defn([_m4_divert_unsafe]))]dnl [m4_chomp(_$0([$1 ]))_m4_popdef([m4_divert], [m4_divert_push])]) m4_define([_m4_expand], [$0_([$1], [(], -=<{($1)}>=-, [}>=-])]) m4_define([_m4_expand_], [m4_if([$4], [}>=-], [m4_changequote([-=<{$2], [)}>=-])$3m4_changequote([, ])], [$0([$1], [($2], -=<{($2$1)}>=-, [}>=-])m4_ignore$2])]) # m4_ignore(ARGS) # --------------- # Expands to nothing. Useful for conditionally ignoring an arbitrary # number of arguments (see _m4_list_cmp for an example). m4_define([m4_ignore]) # m4_make_list(ARGS) # ------------------ # Similar to m4_dquote, this creates a quoted list of quoted ARGS. This # version is less efficient than m4_dquote, but separates each argument # with a comma and newline, rather than just comma, for readability. # When developing an m4sugar algorithm, you could temporarily use # m4_pushdef([m4_dquote],m4_defn([m4_make_list])) # around your code to make debugging easier. m4_define([m4_make_list], [m4_join([, ], m4_dquote_elt($@))]) # m4_noquote(STRING) # ------------------ # Return the result of ignoring all quotes in STRING and invoking the # macros it contains. Among other things, this is useful for enabling # macro invocations inside strings with [] blocks (for instance regexps # and help-strings). On the other hand, since all quotes are disabled, # any macro expanded during this time that relies on nested [] quoting # will likely crash and burn. This macro is seldom useful; consider # m4_unquote or m4_expand instead. m4_define([m4_noquote], [m4_changequote([-=<{(],[)}>=-])$1-=<{()}>=-m4_changequote([,])]) # m4_quote(ARGS) # -------------- # Return ARGS as a single argument. Any whitespace after unquoted commas # is stripped. There is always output, even when there were no arguments. # # It is important to realize the difference between `m4_quote(exp)' and # `[exp]': in the first case you obtain the quoted *result* of the # expansion of EXP, while in the latter you just obtain the string # `exp'. m4_define([m4_quote], [[$*]]) # _m4_quote(ARGS) # --------------- # Like m4_quote, except that when there are no arguments, there is no # output. For conditional scenarios (such as passing _m4_quote as the # macro name in m4_mapall), this feature can be used to distinguish between # one argument of the empty string vs. no arguments. However, in the # normal case with arguments present, this is less efficient than m4_quote. m4_define([_m4_quote], [m4_if([$#], [0], [], [[$*]])]) # m4_reverse(ARGS) # ---------------- # Output ARGS in reverse order. # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_reverse], [m4_if([$#], [0], [], [$#], [1], [[$1]], [$0(m4_shift($@)), [$1]])]) # m4_unquote(ARGS) # ---------------- # Remove one layer of quotes from each ARG, performing one level of # expansion. For one argument, m4_unquote([arg]) is more efficient than # m4_do([arg]), but for multiple arguments, the difference is that # m4_unquote separates arguments with commas while m4_do concatenates. # Follow this macro with [] if concatenation with subsequent text is # undesired. m4_define([m4_unquote], [$*]) ## -------------------------- ## ## 8. Implementing m4 loops. ## ## -------------------------- ## # m4_for(VARIABLE, FIRST, LAST, [STEP = +/-1], EXPRESSION) # -------------------------------------------------------- # Expand EXPRESSION defining VARIABLE to FROM, FROM + 1, ..., TO with # increments of STEP. Both limits are included, and bounds are # checked for consistency. The algorithm is robust to indirect # VARIABLE names. Changing VARIABLE inside EXPRESSION will not impact # the number of iterations. # # Uses _m4_defn for speed, and avoid dnl in the macro body. Factor # the _m4_for call so that EXPRESSION is only parsed once. m4_define([m4_for], [m4_pushdef([$1], m4_eval([$2]))]dnl [m4_cond([m4_eval(([$3]) > ([$2]))], 1, [m4_pushdef([_m4_step], m4_eval(m4_default_quoted([$4], 1)))m4_assert(_m4_step > 0)_$0(_m4_defn([$1]), m4_eval((([$3]) - ([$2])) / _m4_step * _m4_step + ([$2])), _m4_step,], [m4_eval(([$3]) < ([$2]))], 1, [m4_pushdef([_m4_step], m4_eval(m4_default_quoted([$4], -1)))m4_assert(_m4_step < 0)_$0(_m4_defn([$1]), m4_eval((([$2]) - ([$3])) / -(_m4_step) * _m4_step + ([$2])), _m4_step,], [m4_pushdef([_m4_step])_$0(_m4_defn([$1]), _m4_defn([$1]), 0,])]dnl [[m4_define([$1],], [)$5])m4_popdef([_m4_step], [$1])]) # _m4_for(COUNT, LAST, STEP, PRE, POST) # ------------------------------------- # Core of the loop, no consistency checks, all arguments are plain # numbers. Expand PRE[COUNT]POST, then alter COUNT by STEP and # iterate if COUNT is not LAST. m4_define([_m4_for], [$4[$1]$5[]m4_if([$1], [$2], [], [$0(m4_eval([$1 + $3]), [$2], [$3], [$4], [$5])])]) # Implementing `foreach' loops in m4 is much more tricky than it may # seem. For example, the old M4 1.4.4 manual had an incorrect example, # which looked like this (when translated to m4sugar): # # | # foreach(VAR, (LIST), STMT) # | m4_define([foreach], # | [m4_pushdef([$1])_foreach([$1], [$2], [$3])m4_popdef([$1])]) # | m4_define([_arg1], [$1]) # | m4_define([_foreach], # | [m4_if([$2], [()], , # | [m4_define([$1], _arg1$2)$3[]_foreach([$1], (m4_shift$2), [$3])])]) # # But then if you run # # | m4_define(a, 1) # | m4_define(b, 2) # | m4_define(c, 3) # | foreach([f], [([a], [(b], [c)])], [echo f # | ]) # # it gives # # => echo 1 # => echo (2,3) # # which is not what is expected. # # Of course the problem is that many quotes are missing. So you add # plenty of quotes at random places, until you reach the expected # result. Alternatively, if you are a quoting wizard, you directly # reach the following implementation (but if you really did, then # apply to the maintenance of m4sugar!). # # | # foreach(VAR, (LIST), STMT) # | m4_define([foreach], [m4_pushdef([$1])_foreach($@)m4_popdef([$1])]) # | m4_define([_arg1], [[$1]]) # | m4_define([_foreach], # | [m4_if($2, [()], , # | [m4_define([$1], [_arg1$2])$3[]_foreach([$1], [(m4_shift$2)], [$3])])]) # # which this time answers # # => echo a # => echo (b # => echo c) # # Bingo! # # Well, not quite. # # With a better look, you realize that the parens are more a pain than # a help: since anyway you need to quote properly the list, you end up # with always using an outermost pair of parens and an outermost pair # of quotes. Rejecting the parens both eases the implementation, and # simplifies the use: # # | # foreach(VAR, (LIST), STMT) # | m4_define([foreach], [m4_pushdef([$1])_foreach($@)m4_popdef([$1])]) # | m4_define([_arg1], [$1]) # | m4_define([_foreach], # | [m4_if($2, [], , # | [m4_define([$1], [_arg1($2)])$3[]_foreach([$1], [m4_shift($2)], [$3])])]) # # # Now, just replace the `$2' with `m4_quote($2)' in the outer `m4_if' # to improve robustness, and you come up with a nice implementation # that doesn't require extra parentheses in the user's LIST. # # But wait - now the algorithm is quadratic, because every recursion of # the algorithm keeps the entire LIST and merely adds another m4_shift to # the quoted text. If the user has a lot of elements in LIST, you can # bring the system to its knees with the memory m4 then requires, or trip # the m4 --nesting-limit recursion factor. The only way to avoid # quadratic growth is ensure m4_shift is expanded prior to the recursion. # Hence the design below. # # The M4 manual now includes a chapter devoted to this issue, with # the lessons learned from m4sugar. And still, this design is only # optimal for M4 1.6; see foreach.m4 for yet more comments on why # M4 1.4.x uses yet another implementation. # m4_foreach(VARIABLE, LIST, EXPRESSION) # -------------------------------------- # # Expand EXPRESSION assigning each value of the LIST to VARIABLE. # LIST should have the form `item_1, item_2, ..., item_n', i.e. the # whole list must *quoted*. Quote members too if you don't want them # to be expanded. # # This macro is robust to active symbols: # | m4_define(active, [ACT, IVE]) # | m4_foreach(Var, [active, active], [-Var-]) # => -ACT--IVE--ACT--IVE- # # | m4_foreach(Var, [[active], [active]], [-Var-]) # => -ACT, IVE--ACT, IVE- # # | m4_foreach(Var, [[[active]], [[active]]], [-Var-]) # => -active--active- # # This macro is called frequently, so avoid extra expansions such as # m4_ifval and dnl. Also, since $2 might be quite large, try to use it # as little as possible in _m4_foreach; each extra use requires that much # more memory for expansion. So, rather than directly compare $2 against # [] and use m4_car/m4_cdr for recursion, we instead unbox the list (which # requires swapping the argument order in the helper), insert an ignored # third argument, and use m4_shift3 to detect when recursion is complete, # at which point this looks very much like m4_map_args. m4_define([m4_foreach], [m4_if([$2], [], [], [m4_pushdef([$1])_$0([m4_define([$1],], [)$3], [], $2)m4_popdef([$1])])]) # _m4_foreach(PRE, POST, IGNORED, ARG...) # --------------------------------------- # Form the common basis of the m4_foreach and m4_map macros. For each # ARG, expand PRE[ARG]POST[]. The IGNORED argument makes recursion # easier, and must be supplied rather than implicit. # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([_m4_foreach], [m4_if([$#], [3], [], [$1[$4]$2[]$0([$1], [$2], m4_shift3($@))])]) # m4_foreach_w(VARIABLE, LIST, EXPRESSION) # ---------------------------------------- # Like m4_foreach, but the list is whitespace separated. Depending on # EXPRESSION, it may be more efficient to use m4_map_args_w. # # This macro is robust to active symbols: # m4_foreach_w([Var], [ active # b act\ # ive ], [-Var-])end # => -active--b--active-end # # This used to use a slower implementation based on m4_foreach: # m4_foreach([$1], m4_split(m4_normalize([$2]), [ ]), [$3]) m4_define([m4_foreach_w], [m4_pushdef([$1])m4_map_args_w([$2], [m4_define([$1],], [)$3])m4_popdef([$1])]) # m4_map(MACRO, LIST) # m4_mapall(MACRO, LIST) # ---------------------- # Invoke MACRO($1), MACRO($2) etc. where $1, $2... are the elements of # LIST. $1, $2... must in turn be lists, appropriate for m4_apply. # If LIST contains an empty sublist, m4_map skips the expansion of # MACRO, while m4_mapall expands MACRO with no arguments. # # Since LIST may be quite large, we want to minimize how often it # appears in the expansion. Rather than use m4_car/m4_cdr iteration, # we unbox the list, and use _m4_foreach for iteration. For m4_map, # an empty list behaves like an empty sublist and gets ignored; for # m4_mapall, we must special-case the empty list. m4_define([m4_map], [_m4_foreach([_m4_apply([$1],], [)], [], $2)]) m4_define([m4_mapall], [m4_if([$2], [], [], [_m4_foreach([m4_apply([$1],], [)], [], $2)])]) # m4_map_sep(MACRO, [SEPARATOR], LIST) # m4_mapall_sep(MACRO, [SEPARATOR], LIST) # --------------------------------------- # Invoke MACRO($1), SEPARATOR, MACRO($2), ..., MACRO($N) where $1, # $2... $N are the elements of LIST, and are in turn lists appropriate # for m4_apply. SEPARATOR is expanded, in order to allow the creation # of a list of arguments by using a single-quoted comma as the # separator. For each empty sublist, m4_map_sep skips the expansion # of MACRO and SEPARATOR, while m4_mapall_sep expands MACRO with no # arguments. # # For m4_mapall_sep, merely expand the first iteration without the # separator, then include separator as part of subsequent recursion; # but avoid extra expansion of LIST's side-effects via a helper macro. # For m4_map_sep, things are trickier - we don't know if the first # list element is an empty sublist, so we must define a self-modifying # helper macro and use that as the separator instead. m4_define([m4_map_sep], [m4_pushdef([m4_Sep], [m4_define([m4_Sep], _m4_defn([m4_unquote]))])]dnl [_m4_foreach([_m4_apply([m4_Sep([$2])[]$1],], [)], [], $3)m4_popdef([m4_Sep])]) m4_define([m4_mapall_sep], [m4_if([$3], [], [], [_$0([$1], [$2], $3)])]) m4_define([_m4_mapall_sep], [m4_apply([$1], [$3])_m4_foreach([m4_apply([$2[]$1],], [)], m4_shift2($@))]) # m4_map_args(EXPRESSION, ARG...) # ------------------------------- # Expand EXPRESSION([ARG]) for each argument. More efficient than # m4_foreach([var], [ARG...], [EXPRESSION(m4_defn([var]))]) # Shorthand for m4_map_args_sep([EXPRESSION(], [)], [], ARG...). m4_define([m4_map_args], [m4_if([$#], [0], [m4_fatal([$0: too few arguments: $#])], [$#], [1], [], [$#], [2], [$1([$2])[]], [_m4_foreach([$1(], [)], $@)])]) # m4_map_args_pair(EXPRESSION, [END-EXPR = EXPRESSION], ARG...) # ------------------------------------------------------------- # Perform a pairwise grouping of consecutive ARGs, by expanding # EXPRESSION([ARG1], [ARG2]). If there are an odd number of ARGs, the # final argument is expanded with END-EXPR([ARGn]). # # For example: # m4_define([show], [($*)m4_newline])dnl # m4_map_args_pair([show], [], [a], [b], [c], [d], [e])dnl # => (a,b) # => (c,d) # => (e) # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_map_args_pair], [m4_if([$#], [0], [m4_fatal([$0: too few arguments: $#])], [$#], [1], [m4_fatal([$0: too few arguments: $#: $1])], [$#], [2], [], [$#], [3], [m4_default([$2], [$1])([$3])[]], [$#], [4], [$1([$3], [$4])[]], [$1([$3], [$4])[]$0([$1], [$2], m4_shift(m4_shift3($@)))])]) # m4_map_args_sep([PRE], [POST], [SEP], ARG...) # --------------------------------------------- # Expand PRE[ARG]POST for each argument, with SEP between arguments. m4_define([m4_map_args_sep], [m4_if([$#], [0], [m4_fatal([$0: too few arguments: $#])], [$#], [1], [], [$#], [2], [], [$#], [3], [], [$#], [4], [$1[$4]$2[]], [$1[$4]$2[]_m4_foreach([$3[]$1], [$2], m4_shift3($@))])]) # m4_map_args_w(STRING, [PRE], [POST], [SEP]) # ------------------------------------------- # Perform the expansion of PRE[word]POST[] for each word in STRING # separated by whitespace. More efficient than: # m4_foreach_w([var], [STRING], [PRE[]m4_defn([var])POST]) # Additionally, expand SEP between words. # # As long as we have to use m4_bpatsubst to split the string, we might # as well make it also apply PRE and POST; this avoids iteration # altogether. But we must be careful of any \ in PRE or POST. # _m4_strip returns a quoted string, but that's okay, since it also # supplies an empty leading and trailing argument due to our # intentional whitespace around STRING. We use m4_substr to strip the # empty elements and remove the extra layer of quoting. m4_define([m4_map_args_w], [_$0(_m4_split([ ]m4_flatten([$1])[ ], [[ ]+], m4_if(m4_index([$2$3$4], [\]), [-1], [[$3[]$4[]$2]], [m4_bpatsubst([[$3[]$4[]$2]], [\\], [\\\\])])), m4_len([[]$3[]$4]), m4_len([$4[]$2[]]))]) m4_define([_m4_map_args_w], [m4_substr([$1], [$2], m4_eval(m4_len([$1]) - [$2] - [$3]))]) # m4_stack_foreach(MACRO, FUNC) # m4_stack_foreach_lifo(MACRO, FUNC) # ---------------------------------- # Pass each stacked definition of MACRO to the one-argument macro FUNC. # m4_stack_foreach proceeds in FIFO order, while m4_stack_foreach_lifo # processes the topmost definitions first. In addition, FUNC should # not push or pop definitions of MACRO, and should not expect anything about # the active definition of MACRO (it will not be the topmost, and may not # be the one passed to FUNC either). # # Some macros simply can't be examined with this method: namely, # anything involved in the implementation of _m4_stack_reverse. m4_define([m4_stack_foreach], [_m4_stack_reverse([$1], [m4_tmp-$1])]dnl [_m4_stack_reverse([m4_tmp-$1], [$1], [$2(_m4_defn([m4_tmp-$1]))])]) m4_define([m4_stack_foreach_lifo], [_m4_stack_reverse([$1], [m4_tmp-$1], [$2(_m4_defn([m4_tmp-$1]))])]dnl [_m4_stack_reverse([m4_tmp-$1], [$1])]) # m4_stack_foreach_sep(MACRO, [PRE], [POST], [SEP]) # m4_stack_foreach_sep_lifo(MACRO, [PRE], [POST], [SEP]) # ------------------------------------------------------ # Similar to m4_stack_foreach and m4_stack_foreach_lifo, in that every # definition of a pushdef stack will be visited. But rather than # passing the definition as a single argument to a macro, this variant # expands the concatenation of PRE[]definition[]POST, and expands SEP # between consecutive expansions. Note that m4_stack_foreach([a], [b]) # is equivalent to m4_stack_foreach_sep([a], [b(], [)]). m4_define([m4_stack_foreach_sep], [_m4_stack_reverse([$1], [m4_tmp-$1])]dnl [_m4_stack_reverse([m4_tmp-$1], [$1], [$2[]_m4_defn([m4_tmp-$1])$3], [$4[]])]) m4_define([m4_stack_foreach_sep_lifo], [_m4_stack_reverse([$1], [m4_tmp-$1], [$2[]_m4_defn([m4_tmp-$1])$3], [$4[]])]dnl [_m4_stack_reverse([m4_tmp-$1], [$1])]) # _m4_stack_reverse(OLD, NEW, [ACTION], [SEP]) # -------------------------------------------- # A recursive worker for pushdef stack manipulation. Destructively # copy the OLD stack into the NEW, and expanding ACTION for each # iteration. After the first iteration, SEP is promoted to the front # of ACTION (note that SEP should include a trailing [] if it is to # avoid interfering with ACTION). The current definition is examined # after the NEW has been pushed but before OLD has been popped; this # order is important, as ACTION is permitted to operate on either # _m4_defn([OLD]) or _m4_defn([NEW]). Since the operation is # destructive, this macro is generally used twice, with a temporary # macro name holding the swapped copy. m4_define([_m4_stack_reverse], [m4_ifdef([$1], [m4_pushdef([$2], _m4_defn([$1]))$3[]_m4_popdef([$1])$0([$1], [$2], [$4$3])])]) ## --------------------------- ## ## 9. More diversion support. ## ## --------------------------- ## # m4_cleardivert(DIVERSION-NAME...) # --------------------------------- # Discard any text in DIVERSION-NAME. # # This works even inside m4_expand. m4_define([m4_cleardivert], [m4_if([$#], [0], [m4_fatal([$0: missing argument])], [_m4_divert_raw([-1])m4_undivert($@)_m4_divert_raw( _m4_divert(_m4_defn([_m4_divert_diversion]), [-]))])]) # _m4_divert(DIVERSION-NAME or NUMBER, [NOWARN]) # ---------------------------------------------- # If DIVERSION-NAME is the name of a diversion, return its number, # otherwise if it is a NUMBER return it. Issue a warning about # the use of a number instead of a name, unless NOWARN is provided. m4_define([_m4_divert], [m4_ifdef([_m4_divert($1)], [m4_indir([_m4_divert($1)])], [m4_if([$2], [], [m4_warn([syntax], [prefer named diversions])])$1])]) # KILL is only used to suppress output. m4_define([_m4_divert(KILL)], -1) # The empty diversion name is a synonym for 0. m4_define([_m4_divert()], 0) # m4_divert_stack # --------------- # Print the diversion stack, if it's nonempty. The caller is # responsible for any leading or trailing newline. m4_define([m4_divert_stack], [m4_stack_foreach_sep_lifo([_m4_divert_stack], [], [], [ ])]) # m4_divert_stack_push(MACRO-NAME, DIVERSION-NAME) # ------------------------------------------------ # Form an entry of the diversion stack from caller MACRO-NAME and # entering DIVERSION-NAME and push it. m4_define([m4_divert_stack_push], [m4_pushdef([_m4_divert_stack], m4_location[: $1: $2])]) # m4_divert(DIVERSION-NAME) # ------------------------- # Change the diversion stream to DIVERSION-NAME. m4_define([m4_divert], [m4_popdef([_m4_divert_stack])]dnl [m4_define([_m4_divert_diversion], [$1])]dnl [m4_divert_stack_push([$0], [$1])]dnl [_m4_divert_raw(_m4_divert([$1]))]) # m4_divert_push(DIVERSION-NAME, [NOWARN]) # ---------------------------------------- # Change the diversion stream to DIVERSION-NAME, while stacking old values. # For internal use only: if NOWARN is not empty, DIVERSION-NAME can be a # number instead of a name. m4_define([m4_divert_push], [m4_divert_stack_push([$0], [$1])]dnl [m4_pushdef([_m4_divert_diversion], [$1])]dnl [_m4_divert_raw(_m4_divert([$1], [$2]))]) # m4_divert_pop([DIVERSION-NAME]) # ------------------------------- # Change the diversion stream to its previous value, unstacking it. # If specified, verify we left DIVERSION-NAME. # When we pop the last value from the stack, we divert to -1. m4_define([m4_divert_pop], [m4_if([$1], [], [], [$1], _m4_defn([_m4_divert_diversion]), [], [m4_fatal([$0($1): diversion mismatch: ]m4_divert_stack)])]dnl [_m4_popdef([_m4_divert_stack], [_m4_divert_diversion])]dnl [m4_ifdef([_m4_divert_diversion], [], [m4_fatal([too many m4_divert_pop])])]dnl [_m4_divert_raw(_m4_divert(_m4_defn([_m4_divert_diversion]), [-]))]) # m4_divert_text(DIVERSION-NAME, CONTENT) # --------------------------------------- # Output CONTENT into DIVERSION-NAME (which may be a number actually). # An end of line is appended for free to CONTENT. m4_define([m4_divert_text], [m4_divert_push([$1])$2 m4_divert_pop([$1])]) # m4_divert_once(DIVERSION-NAME, CONTENT) # --------------------------------------- # Output CONTENT into DIVERSION-NAME once, if not already there. # An end of line is appended for free to CONTENT. m4_define([m4_divert_once], [m4_expand_once([m4_divert_text([$1], [$2])])]) # _m4_divert_unsafe(DIVERSION-NAME) # --------------------------------- # Issue a warning that the attempt to change the current diversion to # DIVERSION-NAME is unsafe, because this macro is being expanded # during argument collection of m4_expand. m4_define([_m4_divert_unsafe], [m4_fatal([$0: cannot change diversion to `$1' inside m4_expand])]) # m4_undivert(DIVERSION-NAME...) # ------------------------------ # Undivert DIVERSION-NAME. Unlike the M4 version, this requires at # least one DIVERSION-NAME; also, due to support for named diversions, # this should not be used to undivert files. m4_define([m4_undivert], [m4_if([$#], [0], [m4_fatal([$0: missing argument])], [$#], [1], [_m4_undivert(_m4_divert([$1]))], [m4_map_args([$0], $@)])]) ## --------------------------------------------- ## ## 10. Defining macros with bells and whistles. ## ## --------------------------------------------- ## # `m4_defun' is basically `m4_define' but it equips the macro with the # needed machinery for `m4_require'. A macro must be m4_defun'd if # either it is m4_require'd, or it m4_require's. # # Two things deserve attention and are detailed below: # 1. Implementation of m4_require # 2. Keeping track of the expansion stack # # 1. Implementation of m4_require # =============================== # # Of course m4_defun calls m4_provide, so that a macro which has # been expanded is not expanded again when m4_require'd, but the # difficult part is the proper expansion of macros when they are # m4_require'd. # # The implementation is based on three ideas, (i) using diversions to # prepare the expansion of the macro and its dependencies (by Franc,ois # Pinard), (ii) expand the most recently m4_require'd macros _after_ # the previous macros (by Axel Thimm), and (iii) track instances of # provide before require (by Eric Blake). # # # The first idea: why use diversions? # ----------------------------------- # # When a macro requires another, the other macro is expanded in new # diversion, GROW. When the outer macro is fully expanded, we first # undivert the most nested diversions (GROW - 1...), and finally # undivert GROW. To understand why we need several diversions, # consider the following example: # # | m4_defun([TEST1], [Test...m4_require([TEST2])1]) # | m4_defun([TEST2], [Test...m4_require([TEST3])2]) # | m4_defun([TEST3], [Test...3]) # # Because m4_require is not required to be first in the outer macros, we # must keep the expansions of the various levels of m4_require separated. # Right before executing the epilogue of TEST1, we have: # # GROW - 2: Test...3 # GROW - 1: Test...2 # GROW: Test...1 # BODY: # # Finally the epilogue of TEST1 undiverts GROW - 2, GROW - 1, and # GROW into the regular flow, BODY. # # GROW - 2: # GROW - 1: # GROW: # BODY: Test...3; Test...2; Test...1 # # (The semicolons are here for clarification, but of course are not # emitted.) This is what Autoconf 2.0 (I think) to 2.13 (I'm sure) # implement. # # # The second idea: first required first out # ----------------------------------------- # # The natural implementation of the idea above is buggy and produces # very surprising results in some situations. Let's consider the # following example to explain the bug: # # | m4_defun([TEST1], [m4_require([TEST2a])m4_require([TEST2b])]) # | m4_defun([TEST2a], []) # | m4_defun([TEST2b], [m4_require([TEST3])]) # | m4_defun([TEST3], [m4_require([TEST2a])]) # | # | AC_INIT # | TEST1 # # The dependencies between the macros are: # # 3 --- 2b # / \ is m4_require'd by # / \ left -------------------- right # 2a ------------ 1 # # If you strictly apply the rules given in the previous section you get: # # GROW - 2: TEST3 # GROW - 1: TEST2a; TEST2b # GROW: TEST1 # BODY: # # (TEST2a, although required by TEST3 is not expanded in GROW - 3 # because is has already been expanded before in GROW - 1, so it has # been AC_PROVIDE'd, so it is not expanded again) so when you undivert # the stack of diversions, you get: # # GROW - 2: # GROW - 1: # GROW: # BODY: TEST3; TEST2a; TEST2b; TEST1 # # i.e., TEST2a is expanded after TEST3 although the latter required the # former. # # Starting from 2.50, we use an implementation provided by Axel Thimm. # The idea is simple: the order in which macros are emitted must be the # same as the one in which macros are expanded. (The bug above can # indeed be described as: a macro has been m4_provide'd before its # dependent, but it is emitted after: the lack of correlation between # emission and expansion order is guilty). # # How to do that? You keep the stack of diversions to elaborate the # macros, but each time a macro is fully expanded, emit it immediately. # # In the example above, when TEST2a is expanded, but it's epilogue is # not run yet, you have: # # GROW - 2: # GROW - 1: TEST2a # GROW: Elaboration of TEST1 # BODY: # # The epilogue of TEST2a emits it immediately: # # GROW - 2: # GROW - 1: # GROW: Elaboration of TEST1 # BODY: TEST2a # # TEST2b then requires TEST3, so right before the epilogue of TEST3, you # have: # # GROW - 2: TEST3 # GROW - 1: Elaboration of TEST2b # GROW: Elaboration of TEST1 # BODY: TEST2a # # The epilogue of TEST3 emits it: # # GROW - 2: # GROW - 1: Elaboration of TEST2b # GROW: Elaboration of TEST1 # BODY: TEST2a; TEST3 # # TEST2b is now completely expanded, and emitted: # # GROW - 2: # GROW - 1: # GROW: Elaboration of TEST1 # BODY: TEST2a; TEST3; TEST2b # # and finally, TEST1 is finished and emitted: # # GROW - 2: # GROW - 1: # GROW: # BODY: TEST2a; TEST3; TEST2b: TEST1 # # The idea is simple, but the implementation is a bit involved. If # you are like me, you will want to see the actual functioning of this # implementation to be convinced. The next section gives the full # details. # # # The Axel Thimm implementation at work # ------------------------------------- # # We consider the macros above, and this configure.ac: # # AC_INIT # TEST1 # # You should keep the definitions of _m4_defun_pro, _m4_defun_epi, and # m4_require at hand to follow the steps. # # This implementation tries not to assume that the current diversion is # BODY, so as soon as a macro (m4_defun'd) is expanded, we first # record the current diversion under the name _m4_divert_dump (denoted # DUMP below for short). This introduces an important difference with # the previous versions of Autoconf: you cannot use m4_require if you # are not inside an m4_defun'd macro, and especially, you cannot # m4_require directly from the top level. # # We have not tried to simulate the old behavior (better yet, we # diagnose it), because it is too dangerous: a macro m4_require'd from # the top level is expanded before the body of `configure', i.e., before # any other test was run. I let you imagine the result of requiring # AC_STDC_HEADERS for instance, before AC_PROG_CC was actually run.... # # After AC_INIT was run, the current diversion is BODY. # * AC_INIT was run # DUMP: undefined # diversion stack: BODY |- # # * TEST1 is expanded # The prologue of TEST1 sets _m4_divert_dump, which is the diversion # where the current elaboration will be dumped, to the current # diversion. It also m4_divert_push to GROW, where the full # expansion of TEST1 and its dependencies will be elaborated. # DUMP: BODY # BODY: empty # diversions: GROW, BODY |- # # * TEST1 requires TEST2a # _m4_require_call m4_divert_pushes another temporary diversion, # GROW - 1, and expands TEST2a in there. # DUMP: BODY # BODY: empty # GROW - 1: TEST2a # diversions: GROW - 1, GROW, BODY |- # Then the content of the temporary diversion is moved to DUMP and the # temporary diversion is popped. # DUMP: BODY # BODY: TEST2a # diversions: GROW, BODY |- # # * TEST1 requires TEST2b # Again, _m4_require_call pushes GROW - 1 and heads to expand TEST2b. # DUMP: BODY # BODY: TEST2a # diversions: GROW - 1, GROW, BODY |- # # * TEST2b requires TEST3 # _m4_require_call pushes GROW - 2 and expands TEST3 here. # (TEST3 requires TEST2a, but TEST2a has already been m4_provide'd, so # nothing happens.) # DUMP: BODY # BODY: TEST2a # GROW - 2: TEST3 # diversions: GROW - 2, GROW - 1, GROW, BODY |- # Then the diversion is appended to DUMP, and popped. # DUMP: BODY # BODY: TEST2a; TEST3 # diversions: GROW - 1, GROW, BODY |- # # * TEST1 requires TEST2b (contd.) # The content of TEST2b is expanded... # DUMP: BODY # BODY: TEST2a; TEST3 # GROW - 1: TEST2b, # diversions: GROW - 1, GROW, BODY |- # ... and moved to DUMP. # DUMP: BODY # BODY: TEST2a; TEST3; TEST2b # diversions: GROW, BODY |- # # * TEST1 is expanded: epilogue # TEST1's own content is in GROW... # DUMP: BODY # BODY: TEST2a; TEST3; TEST2b # GROW: TEST1 # diversions: BODY |- # ... and it's epilogue moves it to DUMP and then undefines DUMP. # DUMP: undefined # BODY: TEST2a; TEST3; TEST2b; TEST1 # diversions: BODY |- # # # The third idea: track macros provided before they were required # --------------------------------------------------------------- # # Using just the first two ideas, Autoconf 2.50 through 2.63 still had # a subtle bug for more than seven years. Let's consider the # following example to explain the bug: # # | m4_defun([TEST1], [1]) # | m4_defun([TEST2], [2[]m4_require([TEST1])]) # | m4_defun([TEST3], [3 TEST1 m4_require([TEST2])]) # | TEST3 # # After the prologue of TEST3, we are collecting text in GROW with the # intent of dumping it in BODY during the epilogue. Next, we # encounter the direct invocation of TEST1, which provides the macro # in place in GROW. From there, we encounter a requirement for TEST2, # which must be collected in a new diversion. While expanding TEST2, # we encounter a requirement for TEST1, but since it has already been # expanded, the Axel Thimm algorithm states that we can treat it as a # no-op. But that would lead to an end result of `2 3 1', meaning # that we have once again output a macro (TEST2) prior to its # requirements (TEST1). # # The problem can only occur if a single defun'd macro first provides, # then later indirectly requires, the same macro. Note that directly # expanding then requiring a macro is okay: because the dependency was # met, the require phase can be a no-op. For that matter, the outer # macro can even require two helpers, where the first helper expands # the macro, and the second helper indirectly requires the macro. # Out-of-order expansion is only present if the inner macro is # required by something that will be hoisted in front of where the # direct expansion occurred. In other words, we must be careful not # to warn on: # # | m4_defun([TEST4], [4]) # | m4_defun([TEST5], [5 TEST4 m4_require([TEST4])]) # | TEST5 => 5 4 # # or even the more complex: # # | m4_defun([TEST6], [6]) # | m4_defun([TEST7], [7 TEST6]) # | m4_defun([TEST8], [8 m4_require([TEST6])]) # | m4_defun([TEST9], [9 m4_require([TEST8])]) # | m4_defun([TEST10], [10 m4_require([TEST7]) m4_require([TEST9])]) # | TEST10 => 7 6 8 9 10 # # So, to detect whether a require was direct or indirect, m4_defun and # m4_require track the name of the macro that caused a diversion to be # created (using the stack _m4_diverting, coupled with an O(1) lookup # _m4_diverting([NAME])), and m4_provide stores the name associated # with the diversion at which a macro was provided. A require call is # direct if it occurs within the same diversion where the macro was # provided, or if the diversion associated with the providing context # has been collected. # # The implementation of the warning involves tracking the set of # macros which have been provided since the start of the outermost # defun'd macro (the set is named _m4_provide). When starting an # outermost macro, the set is emptied; when a macro is provided, it is # added to the set; when require expands the body of a macro, it is # removed from the set; and when a macro is indirectly required, the # set is checked. If a macro is in the set, then it has been provided # before it was required, and we satisfy dependencies by expanding the # macro as if it had never been provided; in the example given above, # this means we now output `1 2 3 1'. Meanwhile, a warning is issued # to inform the user that her macros trigger the bug in older autoconf # versions, and that her output file now contains redundant contents # (and possibly new problems, if the repeated macro was not # idempotent). Meanwhile, macros defined by m4_defun_once instead of # m4_defun are idempotent, avoiding any warning or duplicate output. # # # 2. Keeping track of the expansion stack # ======================================= # # When M4 expansion goes wrong it is often extremely hard to find the # path amongst macros that drove to the failure. What is needed is # the stack of macro `calls'. One could imagine that GNU M4 would # maintain a stack of macro expansions, unfortunately it doesn't, so # we do it by hand. This is of course extremely costly, but the help # this stack provides is worth it. Nevertheless to limit the # performance penalty this is implemented only for m4_defun'd macros, # not for define'd macros. # # Each time we enter an m4_defun'd macros, we add a definition in # _m4_expansion_stack, and when we exit the macro, we remove it (thanks # to pushdef/popdef). m4_stack_foreach is used to print the expansion # stack in the rare cases when it's needed. # # In addition, we want to detect circular m4_require dependencies. # Each time we expand a macro FOO we define _m4_expanding(FOO); and # m4_require(BAR) simply checks whether _m4_expanding(BAR) is defined. # m4_expansion_stack # ------------------ # Expands to the entire contents of the expansion stack. The caller # must supply a trailing newline. This macro always prints a # location; check whether _m4_expansion_stack is defined to filter out # the case when no defun'd macro is in force. m4_define([m4_expansion_stack], [m4_stack_foreach_sep_lifo([_$0], [_$0_entry(], [) ])m4_location[: the top level]]) # _m4_expansion_stack_entry(MACRO) # -------------------------------- # Format an entry for MACRO found on the expansion stack. m4_define([_m4_expansion_stack_entry], [_m4_defn([m4_location($1)])[: $1 is expanded from...]]) # m4_expansion_stack_push(MACRO) # ------------------------------ # Form an entry of the expansion stack on entry to MACRO and push it. m4_define([m4_expansion_stack_push], [m4_pushdef([_m4_expansion_stack], [$1])]) # _m4_divert(GROW) # ---------------- # This diversion is used by the m4_defun/m4_require machinery. It is # important to keep room before GROW because for each nested # AC_REQUIRE we use an additional diversion (i.e., two m4_require's # will use GROW - 2. More than 3 levels has never seemed to be # needed.) # # ... # - GROW - 2 # m4_require'd code, 2 level deep # - GROW - 1 # m4_require'd code, 1 level deep # - GROW # m4_defun'd macros are elaborated here. m4_define([_m4_divert(GROW)], 10000) # _m4_defun_pro(MACRO-NAME) # ------------------------- # The prologue for Autoconf macros. # # This is called frequently, so minimize the number of macro invocations # by avoiding dnl and m4_defn overhead. m4_define([_m4_defun_pro], [m4_ifdef([_m4_expansion_stack], [], [_m4_defun_pro_outer([$1])])]dnl [m4_expansion_stack_push([$1])m4_pushdef([_m4_expanding($1)])]) m4_define([_m4_defun_pro_outer], [m4_set_delete([_m4_provide])]dnl [m4_pushdef([_m4_diverting([$1])])m4_pushdef([_m4_diverting], [$1])]dnl [m4_pushdef([_m4_divert_dump], m4_divnum)m4_divert_push([GROW])]) # _m4_defun_epi(MACRO-NAME) # ------------------------- # The Epilogue for Autoconf macros. MACRO-NAME only helps tracing # the PRO/EPI pairs. # # This is called frequently, so minimize the number of macro invocations # by avoiding dnl and m4_popdef overhead. m4_define([_m4_defun_epi], [_m4_popdef([_m4_expanding($1)], [_m4_expansion_stack])]dnl [m4_ifdef([_m4_expansion_stack], [], [_m4_defun_epi_outer([$1])])]dnl [m4_provide([$1])]) m4_define([_m4_defun_epi_outer], [_m4_popdef([_m4_divert_dump], [_m4_diverting([$1])], [_m4_diverting])]dnl [m4_divert_pop([GROW])m4_undivert([GROW])]) # _m4_divert_dump # --------------- # If blank, we are outside of any defun'd macro. Otherwise, expands # to the diversion number (not name) where require'd macros should be # moved once completed. m4_define([_m4_divert_dump]) # m4_divert_require(DIVERSION, NAME-TO-CHECK, [BODY-TO-EXPAND]) # ------------------------------------------------------------- # Same as m4_require, but BODY-TO-EXPAND goes into the named DIVERSION; # requirements still go in the current diversion though. # m4_define([m4_divert_require], [m4_ifdef([_m4_expanding($2)], [m4_fatal([$0: circular dependency of $2])])]dnl [m4_if(_m4_divert_dump, [], [m4_fatal([$0($2): cannot be used outside of an m4_defun'd macro])])]dnl [m4_provide_if([$2], [], [_m4_require_call([$2], [$3], _m4_divert([$1], [-]))])]) # m4_defun(NAME, EXPANSION, [MACRO = m4_define]) # ---------------------------------------------- # Define a macro NAME which automatically provides itself. Add # machinery so the macro automatically switches expansion to the # diversion stack if it is not already using it, prior to EXPANSION. # In this case, once finished, it will bring back all the code # accumulated in the diversion stack. This, combined with m4_require, # achieves the topological ordering of macros. We don't use this # macro to define some frequently called macros that are not involved # in ordering constraints, to save m4 processing. # # MACRO is an undocumented argument; when set to m4_pushdef, and NAME # is already defined, the new definition is added to the pushdef # stack, rather than overwriting the current definition. It can thus # be used to write self-modifying macros, which pop themselves to a # previously m4_define'd definition so that subsequent use of the # macro is faster. m4_define([m4_defun], [m4_define([m4_location($1)], m4_location)]dnl [m4_default([$3], [m4_define])([$1], [_m4_defun_pro(]m4_dquote($[0])[)$2[]_m4_defun_epi(]m4_dquote($[0])[)])]) # m4_defun_init(NAME, INIT, COMMON) # --------------------------------- # Like m4_defun, but split EXPANSION into two portions: INIT which is # done only the first time NAME is invoked, and COMMON which is # expanded every time. # # For now, the COMMON definition is always m4_define'd, giving an even # lighter-weight definition. m4_defun allows self-providing, but once # a macro is provided, m4_require no longer cares if it is m4_define'd # or m4_defun'd. m4_defun also provides location tracking to identify # dependency bugs, but once the INIT has been expanded, we know there # are no dependency bugs. However, if a future use needs COMMON to be # m4_defun'd, we can add a parameter, similar to the third parameter # to m4_defun. m4_define([m4_defun_init], [m4_define([$1], [$3[]])m4_defun([$1], [$2[]_m4_popdef(]m4_dquote($[0])[)m4_indir(]m4_dquote($[0])dnl [m4_if(]m4_dquote($[#])[, [0], [], ]m4_dquote([,$]@)[))], [m4_pushdef])]) # m4_defun_once(NAME, EXPANSION) # ------------------------------ # Like m4_defun, but guarantee that EXPANSION only happens once # (thereafter, using NAME is a no-op). # # If _m4_divert_dump is empty, we are called at the top level; # otherwise, we must ensure that we are required in front of the # current defun'd macro. Use a helper macro so that EXPANSION need # only occur once in the definition of NAME, since it might be large. m4_define([m4_defun_once], [m4_define([m4_location($1)], m4_location)]dnl [m4_define([$1], [_m4_defun_once([$1], [$2], m4_if(_m4_divert_dump, [], [[_m4_defun_pro([$1])m4_unquote(], [)_m4_defun_epi([$1])]], m4_ifdef([_m4_diverting([$1])], [-]), [-], [[m4_unquote(], [)]], [[_m4_require_call([$1],], [, _m4_divert_dump)]]))])]) m4_define([_m4_defun_once], [m4_pushdef([$1])$3[$2[]m4_provide([$1])]$4]) # m4_pattern_forbid(ERE, [WHY]) # ----------------------------- # Declare that no token matching the forbidden extended regular # expression ERE should be seen in the output unless... m4_define([m4_pattern_forbid], []) # m4_pattern_allow(ERE) # --------------------- # ... that token also matches the allowed extended regular expression ERE. # Both used via traces. m4_define([m4_pattern_allow], []) ## --------------------------------- ## ## 11. Dependencies between macros. ## ## --------------------------------- ## # m4_before(THIS-MACRO-NAME, CALLED-MACRO-NAME) # --------------------------------------------- # Issue a warning if CALLED-MACRO-NAME was called before THIS-MACRO-NAME. m4_define([m4_before], [m4_provide_if([$2], [m4_warn([syntax], [$2 was called before $1])])]) # m4_require(NAME-TO-CHECK, [BODY-TO-EXPAND = NAME-TO-CHECK]) # ----------------------------------------------------------- # If NAME-TO-CHECK has never been expanded (actually, if it is not # m4_provide'd), expand BODY-TO-EXPAND *before* the current macro # expansion; follow the expansion with a newline. Once expanded, emit # it in _m4_divert_dump. Keep track of the m4_require chain in # _m4_expansion_stack. # # The normal cases are: # # - NAME-TO-CHECK == BODY-TO-EXPAND # Which you can use for regular macros with or without arguments, e.g., # m4_require([AC_PROG_CC], [AC_PROG_CC]) # m4_require([AC_CHECK_HEADERS(threads.h)], [AC_CHECK_HEADERS(threads.h)]) # which is just the same as # m4_require([AC_PROG_CC]) # m4_require([AC_CHECK_HEADERS(threads.h)]) # # - BODY-TO-EXPAND == m4_indir([NAME-TO-CHECK]) # In the case of macros with irregular names. For instance: # m4_require([AC_LANG_COMPILER(C)], [indir([AC_LANG_COMPILER(C)])]) # which means `if the macro named `AC_LANG_COMPILER(C)' (the parens are # part of the name, it is not an argument) has not been run, then # call it.' # Had you used # m4_require([AC_LANG_COMPILER(C)], [AC_LANG_COMPILER(C)]) # then m4_require would have tried to expand `AC_LANG_COMPILER(C)', i.e., # call the macro `AC_LANG_COMPILER' with `C' as argument. # # You could argue that `AC_LANG_COMPILER', when it receives an argument # such as `C' should dispatch the call to `AC_LANG_COMPILER(C)'. But this # `extension' prevents `AC_LANG_COMPILER' from having actual arguments that # it passes to `AC_LANG_COMPILER(C)'. # # This is called frequently, so minimize the number of macro invocations # by avoiding dnl and other overhead on the common path. m4_define([m4_require], [m4_ifdef([_m4_expanding($1)], [m4_fatal([$0: circular dependency of $1])])]dnl [m4_if(_m4_divert_dump, [], [m4_fatal([$0($1): cannot be used outside of an ]dnl m4_if([$0], [m4_require], [[m4_defun]], [[AC_DEFUN]])['d macro])])]dnl [m4_provide_if([$1], [m4_set_contains([_m4_provide], [$1], [_m4_require_check([$1], _m4_defn([m4_provide($1)]), [$0])], [m4_ignore])], [_m4_require_call])([$1], [$2], _m4_divert_dump)]) # _m4_require_call(NAME-TO-CHECK, [BODY-TO-EXPAND = NAME-TO-CHECK], # DIVERSION-NUMBER) # ----------------------------------------------------------------- # If m4_require decides to expand the body, it calls this macro. The # expansion is placed in DIVERSION-NUMBER. # # This is called frequently, so minimize the number of macro invocations # by avoiding dnl and other overhead on the common path. # The use of a witness macro protecting the warning allows aclocal # to silence any warnings when probing for what macros are required # and must therefore be located, when using the Autoconf-without-aclocal-m4 # autom4te language. For more background, see: # https://lists.gnu.org/archive/html/automake-patches/2012-11/msg00035.html m4_define([_m4_require_call], [m4_pushdef([_m4_divert_grow], m4_decr(_m4_divert_grow))]dnl [m4_pushdef([_m4_diverting([$1])])m4_pushdef([_m4_diverting], [$1])]dnl [m4_divert_push(_m4_divert_grow, [-])]dnl [m4_if([$2], [], [$1], [$2]) m4_provide_if([$1], [m4_set_remove([_m4_provide], [$1])], [m4_ifndef([m4_require_silent_probe], [m4_warn([syntax], [$1 is m4_require'd but not m4_defun'd])])])]dnl [_m4_divert_raw($3)_m4_undivert(_m4_divert_grow)]dnl [m4_divert_pop(_m4_divert_grow)_m4_popdef([_m4_divert_grow], [_m4_diverting([$1])], [_m4_diverting])]) # _m4_require_check(NAME-TO-CHECK, OWNER, CALLER) # ----------------------------------------------- # NAME-TO-CHECK has been identified as previously expanded in the # diversion owned by OWNER. If this is a problem, warn on behalf of # CALLER and return _m4_require_call; otherwise return m4_ignore. m4_define([_m4_require_check], [m4_if(_m4_defn([_m4_diverting]), [$2], [m4_ignore], m4_ifdef([_m4_diverting([$2])], [-]), [-], [m4_warn([syntax], [$3: `$1' was expanded before it was required http://www.gnu.org/software/autoconf/manual/autoconf.html#Expanded-Before-Required])_m4_require_call], [m4_ignore])]) # _m4_divert_grow # --------------- # The counter for _m4_require_call. m4_define([_m4_divert_grow], _m4_divert([GROW])) # m4_expand_once(TEXT, [WITNESS = TEXT]) # -------------------------------------- # If TEXT has never been expanded, expand it *here*. Use WITNESS as # as a memory that TEXT has already been expanded. m4_define([m4_expand_once], [m4_provide_if(m4_default_quoted([$2], [$1]), [], [m4_provide(m4_default_quoted([$2], [$1]))[]$1])]) # m4_provide(MACRO-NAME) # ---------------------- m4_define([m4_provide], [m4_ifdef([m4_provide($1)], [], [m4_set_add([_m4_provide], [$1], [m4_define([m4_provide($1)], m4_ifdef([_m4_diverting], [_m4_defn([_m4_diverting])]))])])]) # m4_provide_if(MACRO-NAME, IF-PROVIDED, IF-NOT-PROVIDED) # ------------------------------------------------------- # If MACRO-NAME is provided do IF-PROVIDED, else IF-NOT-PROVIDED. # The purpose of this macro is to provide the user with a means to # check macros which are provided without letting her know how the # information is coded. m4_define([m4_provide_if], [m4_ifdef([m4_provide($1)], [$2], [$3])]) ## --------------------- ## ## 12. Text processing. ## ## --------------------- ## # m4_cr_letters # m4_cr_LETTERS # m4_cr_Letters # ------------- m4_define([m4_cr_letters], [abcdefghijklmnopqrstuvwxyz]) m4_define([m4_cr_LETTERS], [ABCDEFGHIJKLMNOPQRSTUVWXYZ]) m4_define([m4_cr_Letters], m4_defn([m4_cr_letters])dnl m4_defn([m4_cr_LETTERS])dnl ) # m4_cr_digits # ------------ m4_define([m4_cr_digits], [0123456789]) # m4_cr_alnum # ----------- m4_define([m4_cr_alnum], m4_defn([m4_cr_Letters])dnl m4_defn([m4_cr_digits])dnl ) # m4_cr_symbols1 # m4_cr_symbols2 # -------------- m4_define([m4_cr_symbols1], m4_defn([m4_cr_Letters])dnl _) m4_define([m4_cr_symbols2], m4_defn([m4_cr_symbols1])dnl m4_defn([m4_cr_digits])dnl ) # m4_cr_all # --------- # The character range representing everything, with `-' as the last # character, since it is special to m4_translit. Use with care, because # it contains characters special to M4 (fortunately, both ASCII and EBCDIC # have [] in order, so m4_defn([m4_cr_all]) remains a valid string). It # also contains characters special to terminals, so it should never be # displayed in an error message. Also, attempts to map [ and ] to other # characters via m4_translit must deal with the fact that m4_translit does # not add quotes to the output. # # In EBCDIC, $ is immediately followed by *, which leads to problems # if m4_cr_all is inlined into a macro definition; so swap them. # # It is mainly useful in generating inverted character range maps, for use # in places where m4_translit is faster than an equivalent m4_bpatsubst; # the regex `[^a-z]' is equivalent to: # m4_translit(m4_dquote(m4_defn([m4_cr_all])), [a-z]) m4_define([m4_cr_all], m4_translit(m4_dquote(m4_format(m4_dquote(m4_for( ,1,255,,[[%c]]))m4_for([i],1,255,,[,i]))), [$*-], [*$])-) # _m4_define_cr_not(CATEGORY) # --------------------------- # Define m4_cr_not_CATEGORY as the inverse of m4_cr_CATEGORY. m4_define([_m4_define_cr_not], [m4_define([m4_cr_not_$1], m4_translit(m4_dquote(m4_defn([m4_cr_all])), m4_defn([m4_cr_$1])))]) # m4_cr_not_letters # m4_cr_not_LETTERS # m4_cr_not_Letters # m4_cr_not_digits # m4_cr_not_alnum # m4_cr_not_symbols1 # m4_cr_not_symbols2 # ------------------ # Inverse character sets _m4_define_cr_not([letters]) _m4_define_cr_not([LETTERS]) _m4_define_cr_not([Letters]) _m4_define_cr_not([digits]) _m4_define_cr_not([alnum]) _m4_define_cr_not([symbols1]) _m4_define_cr_not([symbols2]) # m4_newline([STRING]) # -------------------- # Expands to a newline, possibly followed by STRING. Exists mostly for # formatting reasons. m4_define([m4_newline], [ $1]) # m4_re_escape(STRING) # -------------------- # Escape RE active characters in STRING. m4_define([m4_re_escape], [m4_bpatsubst([$1], [[][*+.?\^$]], [\\\&])]) # m4_re_string # ------------ # Regexp for `[a-zA-Z_0-9]*' # m4_dquote provides literal [] for the character class. m4_define([m4_re_string], m4_dquote(m4_defn([m4_cr_symbols2]))dnl [*]dnl ) # m4_re_word # ---------- # Regexp for `[a-zA-Z_][a-zA-Z_0-9]*' m4_define([m4_re_word], m4_dquote(m4_defn([m4_cr_symbols1]))dnl m4_defn([m4_re_string])dnl ) # m4_tolower(STRING) # m4_toupper(STRING) # ------------------ # These macros convert STRING to lowercase or uppercase. # # Rather than expand the m4_defn each time, we inline them up front. m4_define([m4_tolower], [m4_translit([[$1]], ]m4_dquote(m4_defn([m4_cr_LETTERS]))[, ]m4_dquote(m4_defn([m4_cr_letters]))[)]) m4_define([m4_toupper], [m4_translit([[$1]], ]m4_dquote(m4_defn([m4_cr_letters]))[, ]m4_dquote(m4_defn([m4_cr_LETTERS]))[)]) # m4_split(STRING, [REGEXP]) # -------------------------- # Split STRING into an m4 list of quoted elements. The elements are # quoted with [ and ]. Beginning spaces and end spaces *are kept*. # Use m4_strip to remove them. # # REGEXP specifies where to split. Default is [\t ]+. # # If STRING is empty, the result is an empty list. # # Pay attention to the m4_changequotes. When m4 reads the definition of # m4_split, it still has quotes set to [ and ]. Luckily, these are matched # in the macro body, so the definition is stored correctly. Use the same # alternate quotes as m4_noquote; it must be unlikely to appear in $1. # # Also, notice that $1 is quoted twice, since we want the result to # be quoted. Then you should understand that the argument of # patsubst is -=<{(STRING)}>=- (i.e., with additional -=<{( and )}>=-). # # This macro is safe on active symbols, i.e.: # m4_define(active, ACTIVE) # m4_split([active active ])end # => [active], [active], []end # # Optimize on regex of ` ' (space), since m4_foreach_w already guarantees # that the list contains single space separators, and a common case is # splitting a single-element list. This macro is called frequently, # so avoid unnecessary dnl inside the definition. m4_define([m4_split], [m4_if([$1], [], [], [$2], [ ], [m4_if(m4_index([$1], [ ]), [-1], [[[$1]]], [_$0([$1], [$2], [, ])])], [$2], [], [_$0([$1], [[ ]+], [, ])], [_$0([$1], [$2], [, ])])]) m4_define([_m4_split], [m4_changequote([-=<{(],[)}>=-])]dnl [[m4_bpatsubst(-=<{(-=<{($1)}>=-)}>=-, -=<{($2)}>=-, -=<{(]$3[)}>=-)]m4_changequote([, ])]) # m4_chomp(STRING) # m4_chomp_all(STRING) # -------------------- # Return STRING quoted, but without a trailing newline. m4_chomp # removes at most one newline, while m4_chomp_all removes all # consecutive trailing newlines. Embedded newlines are not touched, # and a trailing backslash-newline leaves just a trailing backslash. # # m4_bregexp is slower than m4_index, and we don't always want to # remove all newlines; hence the two variants. We massage characters # to give a nicer pattern to match, particularly since m4_bregexp is # line-oriented. Both versions must guarantee a match, to avoid bugs # with precision -1 in m4_format in older m4. m4_define([m4_chomp], [m4_format([[%.*s]], m4_index(m4_translit([[$1]], [ /.], [/ ])[./.], [/.]), [$1])]) m4_define([m4_chomp_all], [m4_format([[%.*s]], m4_bregexp(m4_translit([[$1]], [ /], [/ ]), [/*$]), [$1])]) # m4_flatten(STRING) # ------------------ # If STRING contains end of lines, replace them with spaces. If there # are backslashed end of lines, remove them. This macro is safe with # active symbols. # m4_define(active, ACTIVE) # m4_flatten([active # act\ # ive])end # => active activeend # # In m4, m4_bpatsubst is expensive, so first check for a newline. m4_define([m4_flatten], [m4_if(m4_index([$1], [ ]), [-1], [[$1]], [m4_translit(m4_bpatsubst([[[$1]]], [\\ ]), [ ], [ ])])]) # m4_strip(STRING) # ---------------- # Expands into STRING with tabs and spaces singled out into a single # space, and removing leading and trailing spaces. # # This macro is robust to active symbols. # m4_define(active, ACTIVE) # m4_strip([ active active ])end # => active activeend # # First, notice that we guarantee trailing space. Why? Because regular # expressions are greedy, and `.* ?' would always group the space into the # .* portion. The algorithm is simpler by avoiding `?' at the end. The # algorithm correctly strips everything if STRING is just ` '. # # Then notice the second pattern: it is in charge of removing the # leading/trailing spaces. Why not just `[^ ]'? Because they are # applied to over-quoted strings, i.e. more or less [STRING], due # to the limitations of m4_bpatsubsts. So the leading space in STRING # is the *second* character; equally for the trailing space. m4_define([m4_strip], [m4_bpatsubsts([$1 ], [[ ]+], [ ], [^. ?\(.*\) .$], [[[\1]]])]) # m4_normalize(STRING) # -------------------- # Apply m4_flatten and m4_strip to STRING. # # The argument is quoted, so that the macro is robust to active symbols: # # m4_define(active, ACTIVE) # m4_normalize([ act\ # ive # active ])end # => active activeend m4_define([m4_normalize], [m4_strip(m4_flatten([$1]))]) # m4_join(SEP, ARG1, ARG2...) # --------------------------- # Produce ARG1SEPARG2...SEPARGn. Avoid back-to-back SEP when a given ARG # is the empty string. No expansion is performed on SEP or ARGs. # # Since the number of arguments to join can be arbitrarily long, we # want to avoid having more than one $@ in the macro definition; # otherwise, the expansion would require twice the memory of the already # long list. Hence, m4_join merely looks for the first non-empty element, # and outputs just that element; while _m4_join looks for all non-empty # elements, and outputs them following a separator. The final trick to # note is that we decide between recursing with $0 or _$0 based on the # nested m4_if ending with `_'. # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_join], [m4_if([$#], [1], [], [$#], [2], [[$2]], [m4_if([$2], [], [], [[$2]_])$0([$1], m4_shift2($@))])]) m4_define([_m4_join], [m4_if([$#$2], [2], [], [m4_if([$2], [], [], [[$1$2]])$0([$1], m4_shift2($@))])]) # m4_joinall(SEP, ARG1, ARG2...) # ------------------------------ # Produce ARG1SEPARG2...SEPARGn. An empty ARG results in back-to-back SEP. # No expansion is performed on SEP or ARGs. # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_joinall], [[$2]_$0([$1], m4_shift($@))]) m4_define([_m4_joinall], [m4_if([$#], [2], [], [[$1$3]$0([$1], m4_shift2($@))])]) # m4_combine([SEPARATOR], PREFIX-LIST, [INFIX], SUFFIX...) # -------------------------------------------------------- # Produce the pairwise combination of every element in the quoted, # comma-separated PREFIX-LIST with every element from the SUFFIX arguments. # Each pair is joined with INFIX, and pairs are separated by SEPARATOR. # No expansion occurs on SEPARATOR, INFIX, or elements of either list. # # For example: # m4_combine([, ], [[a], [b], [c]], [-], [1], [2], [3]) # => a-1, a-2, a-3, b-1, b-2, b-3, c-1, c-2, c-3 # # This definition is a bit hairy; the thing to realize is that we want # to construct m4_map_args_sep([[prefix$3]], [], [[$1]], m4_shift3($@)) # as the inner loop, using each prefix generated by the outer loop, # and without recalculating m4_shift3 every outer iteration. m4_define([m4_combine], [m4_if([$2], [], [], m4_eval([$# > 3]), [1], [m4_map_args_sep([m4_map_args_sep(m4_dquote(], [)[[$3]], [], [[$1]],]]]dnl [m4_dquote(m4_dquote(m4_shift3($@)))[[)], [[$1]], $2)])]) # m4_append(MACRO-NAME, STRING, [SEPARATOR]) # ------------------------------------------ # Redefine MACRO-NAME to hold its former content plus `SEPARATOR`'STRING' # at the end. It is valid to use this macro with MACRO-NAME undefined, # in which case no SEPARATOR is added. Be aware that the criterion is # `not being defined', and not `not being empty'. # # Note that neither STRING nor SEPARATOR are expanded here; rather, when # you expand MACRO-NAME, they will be expanded at that point in time. # # This macro is robust to active symbols. It can be used to grow # strings. # # | m4_define(active, ACTIVE)dnl # | m4_append([sentence], [This is an])dnl # | m4_append([sentence], [ active ])dnl # | m4_append([sentence], [symbol.])dnl # | sentence # | m4_undefine([active])dnl # | sentence # => This is an ACTIVE symbol. # => This is an active symbol. # # It can be used to define hooks. # # | m4_define(active, ACTIVE)dnl # | m4_append([hooks], [m4_define([act1], [act2])])dnl # | m4_append([hooks], [m4_define([act2], [active])])dnl # | m4_undefine([active])dnl # | act1 # | hooks # | act1 # => act1 # => # => active # # It can also be used to create lists, although this particular usage was # broken prior to autoconf 2.62. # | m4_append([list], [one], [, ])dnl # | m4_append([list], [two], [, ])dnl # | m4_append([list], [three], [, ])dnl # | list # | m4_dquote(list) # => one, two, three # => [one],[two],[three] # # Note that m4_append can benefit from amortized O(n) m4 behavior, if # the underlying m4 implementation is smart enough to avoid copying existing # contents when enlarging a macro's definition into any pre-allocated storage # (m4 1.4.x unfortunately does not implement this optimization). We do # not implement m4_prepend, since it is inherently O(n^2) (pre-allocated # storage only occurs at the end of a macro, so the existing contents must # always be moved). # # Use _m4_defn for speed. m4_define([m4_append], [m4_define([$1], m4_ifdef([$1], [_m4_defn([$1])[$3]])[$2])]) # m4_append_uniq(MACRO-NAME, STRING, [SEPARATOR], [IF-UNIQ], [IF-DUP]) # -------------------------------------------------------------------- # Like `m4_append', but append only if not yet present. Additionally, # expand IF-UNIQ if STRING was appended, or IF-DUP if STRING was already # present. Also, warn if SEPARATOR is not empty and occurs within STRING, # as the algorithm no longer guarantees uniqueness. # # Note that while m4_append can be O(n) (depending on the quality of the # underlying M4 implementation), m4_append_uniq is inherently O(n^2) # because each append operation searches the entire string. m4_define([m4_append_uniq], [m4_ifval([$3], [m4_if(m4_index([$2], [$3]), [-1], [], [m4_warn([syntax], [$0: `$2' contains `$3'])])])_$0($@)]) m4_define([_m4_append_uniq], [m4_ifdef([$1], [m4_if(m4_index([$3]_m4_defn([$1])[$3], [$3$2$3]), [-1], [m4_append([$1], [$2], [$3])$4], [$5])], [m4_define([$1], [$2])$4])]) # m4_append_uniq_w(MACRO-NAME, STRINGS) # ------------------------------------- # For each of the words in the whitespace separated list STRINGS, append # only the unique strings to the definition of MACRO-NAME. # # Use _m4_defn for speed. m4_define([m4_append_uniq_w], [m4_map_args_w([$2], [_m4_append_uniq([$1],], [, [ ])])]) # m4_escape(STRING) # ----------------- # Output quoted STRING, but with embedded #, $, [ and ] turned into # quadrigraphs. # # It is faster to check if STRING is already good using m4_translit # than to blindly perform four m4_bpatsubst. # # Because the translit is stripping quotes, it must also neutralize # anything that might be in a macro name, as well as comments, commas, # and parentheses. All the problem characters are unified so that a # single m4_index can scan the result. # # Rather than expand m4_defn every time m4_escape is expanded, we # inline its expansion up front. m4_define([m4_escape], [m4_if(m4_index(m4_translit([$1], [[]#,()]]m4_dquote(m4_defn([m4_cr_symbols2]))[, [$$$]), [$]), [-1], [m4_echo], [_$0])([$1])]) m4_define([_m4_escape], [m4_changequote([-=<{(],[)}>=-])]dnl [m4_bpatsubst(m4_bpatsubst(m4_bpatsubst(m4_bpatsubst( -=<{(-=<{(-=<{(-=<{(-=<{($1)}>=-)}>=-)}>=-)}>=-)}>=-, -=<{(#)}>=-, -=<{(@%:@)}>=-), -=<{(\[)}>=-, -=<{(@<:@)}>=-), -=<{(\])}>=-, -=<{(@:>@)}>=-), -=<{(\$)}>=-, -=<{(@S|@)}>=-)m4_changequote([,])]) # m4_text_wrap(STRING, [PREFIX], [FIRST-PREFIX], [WIDTH]) # ------------------------------------------------------- # Expands into STRING wrapped to hold in WIDTH columns (default = 79). # If PREFIX is given, each line is prefixed with it. If FIRST-PREFIX is # specified, then the first line is prefixed with it. As a special case, # if the length of FIRST-PREFIX is greater than that of PREFIX, then # FIRST-PREFIX will be left alone on the first line. # # No expansion occurs on the contents STRING, PREFIX, or FIRST-PREFIX, # although quadrigraphs are correctly recognized. More precisely, # you may redefine m4_qlen to recognize whatever escape sequences that # you will post-process. # # Typical outputs are: # # m4_text_wrap([Short string */], [ ], [/* ], 20) # => /* Short string */ # # m4_text_wrap([Much longer string */], [ ], [/* ], 20) # => /* Much longer # => string */ # # m4_text_wrap([Short doc.], [ ], [ --short ], 30) # => --short Short doc. # # m4_text_wrap([Short doc.], [ ], [ --too-wide ], 30) # => --too-wide # => Short doc. # # m4_text_wrap([Super long documentation.], [ ], [ --too-wide ], 30) # => --too-wide # => Super long # => documentation. # # FIXME: there is no checking of a longer PREFIX than WIDTH, but do # we really want to bother with people trying each single corner # of a software? # # This macro does not leave a trailing space behind the last word of a line, # which complicates it a bit. The algorithm is otherwise stupid and simple: # all the words are preceded by m4_Separator which is defined to empty for # the first word, and then ` ' (single space) for all the others. # # The algorithm uses a helper that uses $2 through $4 directly, rather than # using local variables, to avoid m4_defn overhead, or expansion swallowing # any $. It also bypasses m4_popdef overhead with _m4_popdef since no user # macro expansion occurs in the meantime. Also, the definition is written # with m4_do, to avoid time wasted on dnl during expansion (since this is # already a time-consuming macro). m4_define([m4_text_wrap], [_$0(m4_escape([$1]), [$2], m4_default_quoted([$3], [$2]), m4_default_quoted([$4], [79]))]) m4_define([_m4_text_wrap], m4_do(dnl set up local variables, to avoid repeated calculations [[m4_pushdef([m4_Indent], m4_qlen([$2]))]], [[m4_pushdef([m4_Cursor], m4_qlen([$3]))]], [[m4_pushdef([m4_Separator], [m4_define([m4_Separator], [ ])])]], dnl expand the first prefix, then check its length vs. regular prefix dnl same length: nothing special dnl prefix1 longer: output on line by itself, and reset cursor dnl prefix1 shorter: pad to length of prefix, and reset cursor [[[$3]m4_cond([m4_Cursor], m4_Indent, [], [m4_eval(m4_Cursor > m4_Indent)], [1], [ [$2]m4_define([m4_Cursor], m4_Indent)], [m4_format([%*s], m4_max([0], m4_eval(m4_Indent - m4_Cursor)), [])m4_define([m4_Cursor], m4_Indent)])]], dnl now, for each word, compute the cursor after the word is output, then dnl check if the cursor would exceed the wrap column dnl if so, reset cursor, and insert newline and prefix dnl if not, insert the separator (usually a space) dnl either way, insert the word [[m4_map_args_w([$1], [$0_word(], [, [$2], [$4])])]], dnl finally, clean up the local variables [[_m4_popdef([m4_Separator], [m4_Cursor], [m4_Indent])]])) m4_define([_m4_text_wrap_word], [m4_define([m4_Cursor], m4_eval(m4_Cursor + m4_qlen([$1]) + 1))]dnl [m4_if(m4_eval(m4_Cursor > ([$3])), [1], [m4_define([m4_Cursor], m4_eval(m4_Indent + m4_qlen([$1]) + 1)) [$2]], [m4_Separator[]])[$1]]) # m4_text_box(MESSAGE, [FRAME-CHARACTER = `-']) # --------------------------------------------- # Turn MESSAGE into: # ## ------- ## # ## MESSAGE ## # ## ------- ## # using FRAME-CHARACTER in the border. # # Quadrigraphs are correctly recognized. More precisely, you may # redefine m4_qlen to recognize whatever escape sequences that you # will post-process. m4_define([m4_text_box], [m4_pushdef([m4_Border], m4_translit(m4_format([[[%*s]]], m4_decr(m4_qlen(_m4_expand([$1 ]))), []), [ ], m4_default_quoted([$2], [-])))]dnl [[##] _m4_defn([m4_Border]) [##] [##] $1 [##] [##] _m4_defn([m4_Border]) [##]_m4_popdef([m4_Border])]) # m4_qlen(STRING) # --------------- # Expands to the length of STRING after autom4te converts all quadrigraphs. # # If you use some other means of post-processing m4 output rather than # autom4te, then you may redefine this macro to recognize whatever # escape sequences your post-processor will handle. For that matter, # m4_define([m4_qlen], m4_defn([m4_len])) is sufficient if you don't # do any post-processing. # # Avoid bpatsubsts for the common case of no quadrigraphs. Cache # results, as configure scripts tend to ask about lengths of common # strings like `/*' and `*/' rather frequently. Minimize the number # of times that $1 occurs in m4_qlen, so there is less text to parse # on a cache hit. m4_define([m4_qlen], [m4_ifdef([$0-$1], [_m4_defn([$0-]], [_$0(])[$1])]) m4_define([_m4_qlen], [m4_define([m4_qlen-$1], m4_if(m4_index([$1], [@]), [-1], [m4_len([$1])], [m4_len(m4_bpatsubst([[$1]], [@\(\(<:\|:>\|S|\|%:\|\{:\|:\}\)\(@\)\|&t@\)], [\3]))]))_m4_defn([m4_qlen-$1])]) # m4_copyright_condense(TEXT) # --------------------------- # Condense the copyright notice in TEXT to only display the final # year, wrapping the results to fit in 80 columns. m4_define([m4_copyright_condense], [m4_text_wrap(m4_bpatsubst(m4_flatten([[$1]]), [(C)[- ,0-9]*\([1-9][0-9][0-9][0-9]\)], [(C) \1]))]) ## ----------------------- ## ## 13. Number processing. ## ## ----------------------- ## # m4_cmp(A, B) # ------------ # Compare two integer expressions. # A < B -> -1 # A = B -> 0 # A > B -> 1 m4_define([m4_cmp], [m4_eval((([$1]) > ([$2])) - (([$1]) < ([$2])))]) # m4_list_cmp(A, B) # ----------------- # # Compare the two lists of integer expressions A and B. For instance: # m4_list_cmp([1, 0], [1]) -> 0 # m4_list_cmp([1, 0], [1, 0]) -> 0 # m4_list_cmp([1, 2], [1, 0]) -> 1 # m4_list_cmp([1, 2, 3], [1, 2]) -> 1 # m4_list_cmp([1, 2, -3], [1, 2]) -> -1 # m4_list_cmp([1, 0], [1, 2]) -> -1 # m4_list_cmp([1], [1, 2]) -> -1 # m4_define([xa], [oops])dnl # m4_list_cmp([[0xa]], [5+5]) -> 0 # # Rather than face the overhead of m4_case, we use a helper function whose # expansion includes the name of the macro to invoke on the tail, either # m4_ignore or m4_unquote. This is particularly useful when comparing # long lists, since less text is being expanded for deciding when to end # recursion. The recursion is between a pair of macros that alternate # which list is trimmed by one element; this is more efficient than # calling m4_cdr on both lists from a single macro. Guarantee exactly # one expansion of both lists' side effects. # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_list_cmp], [_$0_raw(m4_dquote($1), m4_dquote($2))]) m4_define([_m4_list_cmp_raw], [m4_if([$1], [$2], [0], [_m4_list_cmp_1([$1], $2)])]) m4_define([_m4_list_cmp], [m4_if([$1], [], [0m4_ignore], [$2], [0], [m4_unquote], [$2m4_ignore])]) m4_define([_m4_list_cmp_1], [_m4_list_cmp_2([$2], [m4_shift2($@)], $1)]) m4_define([_m4_list_cmp_2], [_m4_list_cmp([$1$3], m4_cmp([$3+0], [$1+0]))( [_m4_list_cmp_1(m4_dquote(m4_shift3($@)), $2)])]) # m4_max(EXPR, ...) # m4_min(EXPR, ...) # ----------------- # Return the decimal value of the maximum (or minimum) in a series of # integer expressions. # # M4 1.4.x doesn't provide ?:. Hence this huge m4_eval. Avoid m4_eval # if both arguments are identical, but be aware of m4_max(0xa, 10) (hence # the use of <=, not just <, in the second multiply). # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_max], [m4_if([$#], [0], [m4_fatal([too few arguments to $0])], [$#], [1], [m4_eval([$1])], [$#$1], [2$2], [m4_eval([$1])], [$#], [2], [_$0($@)], [_m4_minmax([_$0], $@)])]) m4_define([_m4_max], [m4_eval((([$1]) > ([$2])) * ([$1]) + (([$1]) <= ([$2])) * ([$2]))]) m4_define([m4_min], [m4_if([$#], [0], [m4_fatal([too few arguments to $0])], [$#], [1], [m4_eval([$1])], [$#$1], [2$2], [m4_eval([$1])], [$#], [2], [_$0($@)], [_m4_minmax([_$0], $@)])]) m4_define([_m4_min], [m4_eval((([$1]) < ([$2])) * ([$1]) + (([$1]) >= ([$2])) * ([$2]))]) # _m4_minmax(METHOD, ARG1, ARG2...) # --------------------------------- # Common recursion code for m4_max and m4_min. METHOD must be _m4_max # or _m4_min, and there must be at least two arguments to combine. # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([_m4_minmax], [m4_if([$#], [3], [$1([$2], [$3])], [$0([$1], $1([$2], [$3]), m4_shift3($@))])]) # m4_sign(A) # ---------- # The sign of the integer expression A. m4_define([m4_sign], [m4_eval((([$1]) > 0) - (([$1]) < 0))]) ## ------------------------ ## ## 14. Version processing. ## ## ------------------------ ## # m4_version_unletter(VERSION) # ---------------------------- # Normalize beta version numbers with letters to numeric expressions, which # can then be handed to m4_eval for the purpose of comparison. # # Nl -> (N+1).-1.(l#) # # for example: # [2.14a] -> [0,2,14+1,-1,[0r36:a]] -> 2.15.-1.10 # [2.14b] -> [0,2,15+1,-1,[0r36:b]] -> 2.15.-1.11 # [2.61aa.b] -> [0,2.61,1,-1,[0r36:aa],+1,-1,[0r36:b]] -> 2.62.-1.370.1.-1.11 # [08] -> [0,[0r10:0]8] -> 8 # # This macro expects reasonable version numbers, but can handle double # letters and does not expand any macros. Original version strings can # use both `.' and `-' separators. # # Inline constant expansions, to avoid m4_defn overhead. # _m4_version_unletter is the real workhorse used by m4_version_compare, # but since [0r36:a] and commas are less readable than 10 and dots, we # provide a wrapper for human use. m4_define([m4_version_unletter], [m4_substr(m4_map_args([.m4_eval], m4_unquote(_$0([$1]))), [3])]) m4_define([_m4_version_unletter], [m4_bpatsubst(m4_bpatsubst(m4_translit([[[[0,$1]]]], [.-], [,,]),]dnl m4_dquote(m4_dquote(m4_defn([m4_cr_Letters])))[[+], [+1,-1,[0r36:\&]]), [,0], [,[0r10:0]])]) # m4_version_compare(VERSION-1, VERSION-2) # ---------------------------------------- # Compare the two version numbers and expand into # -1 if VERSION-1 < VERSION-2 # 0 if = # 1 if > # # Since _m4_version_unletter does not output side effects, we can # safely bypass the overhead of m4_version_cmp. m4_define([m4_version_compare], [_m4_list_cmp_raw(_m4_version_unletter([$1]), _m4_version_unletter([$2]))]) # m4_PACKAGE_NAME # m4_PACKAGE_TARNAME # m4_PACKAGE_VERSION # m4_PACKAGE_STRING # m4_PACKAGE_BUGREPORT # -------------------- # If m4sugar/version.m4 is present, then define version strings. This # file is optional, provided by Autoconf but absent in Bison. m4_sinclude([m4sugar/version.m4]) # m4_version_prereq(VERSION, [IF-OK], [IF-NOT = FAIL]) # ---------------------------------------------------- # Check this Autoconf version against VERSION. m4_define([m4_version_prereq], m4_ifdef([m4_PACKAGE_VERSION], [[m4_if(m4_version_compare(]m4_dquote(m4_defn([m4_PACKAGE_VERSION]))[, [$1]), [-1], [m4_default([$3], [m4_fatal([Autoconf version $1 or higher is required], [63])])], [$2])]], [[m4_fatal([m4sugar/version.m4 not found])]])) ## ------------------ ## ## 15. Set handling. ## ## ------------------ ## # Autoconf likes to create arbitrarily large sets; for example, as of # this writing, the configure.ac for coreutils tracks a set of more # than 400 AC_SUBST. How do we track all of these set members, # without introducing duplicates? We could use m4_append_uniq, with # the set NAME residing in the contents of the macro NAME. # Unfortunately, m4_append_uniq is quadratic for set creation, because # it costs O(n) to search the string for each of O(n) insertions; not # to mention that with m4 1.4.x, even using m4_append is slow, costing # O(n) rather than O(1) per insertion. Other set operations, not used # by Autoconf but still possible by manipulation of the definition # tracked in macro NAME, include O(n) deletion of one element and O(n) # computation of set size. Because the set is exposed to the user via # the definition of a single macro, we cannot cache any data about the # set without risking the cache being invalidated by the user # redefining NAME. # # Can we do better? Yes, because m4 gives us an O(1) search function # for free: ifdef. Additionally, even m4 1.4.x gives us an O(1) # insert operation for free: pushdef. But to use these, we must # represent the set via a group of macros; to keep the set consistent, # we must hide the set so that the user can only manipulate it through # accessor macros. The contents of the set are maintained through two # access points; _m4_set([name]) is a pushdef stack of values in the # set, useful for O(n) traversal of the set contents; while the # existence of _m4_set([name],value) with no particular value is # useful for O(1) querying of set membership. And since the user # cannot externally manipulate the set, we are free to add additional # caching macros for other performance improvements. Deletion can be # O(1) per element rather than O(n), by reworking the definition of # _m4_set([name],value) to be 0 or 1 based on current membership, and # adding _m4_set_cleanup(name) to defer the O(n) cleanup of # _m4_set([name]) until we have another reason to do an O(n) # traversal. The existence of _m4_set_cleanup(name) can then be used # elsewhere to determine if we must dereference _m4_set([name],value), # or assume that definition implies set membership. Finally, size can # be tracked in an O(1) fashion with _m4_set_size(name). # # The quoting in _m4_set([name],value) is chosen so that there is no # ambiguity with a set whose name contains a comma, and so that we can # supply the value via _m4_defn([_m4_set([name])]) without needing any # quote manipulation. # m4_set_add(SET, VALUE, [IF-UNIQ], [IF-DUP]) # ------------------------------------------- # Add VALUE as an element of SET. Expand IF-UNIQ on the first # addition, and IF-DUP if it is already in the set. Addition of one # element is O(1), such that overall set creation is O(n). # # We do not want to add a duplicate for a previously deleted but # unpruned element, but it is just as easy to check existence directly # as it is to query _m4_set_cleanup($1). m4_define([m4_set_add], [m4_ifdef([_m4_set([$1],$2)], [m4_if(m4_indir([_m4_set([$1],$2)]), [0], [m4_define([_m4_set([$1],$2)], [1])_m4_set_size([$1], [m4_incr])$3], [$4])], [m4_define([_m4_set([$1],$2)], [1])m4_pushdef([_m4_set([$1])], [$2])_m4_set_size([$1], [m4_incr])$3])]) # m4_set_add_all(SET, VALUE...) # ----------------------------- # Add each VALUE into SET. This is O(n) in the number of VALUEs, and # can be faster than calling m4_set_add for each VALUE. # # Implement two recursion helpers; the check variant is slower but # handles the case where an element has previously been removed but # not pruned. The recursion helpers ignore their second argument, so # that we can use the faster m4_shift2 and 2 arguments, rather than # _m4_shift2 and one argument, as the signal to end recursion. # # Please keep foreach.m4 in sync with any adjustments made here. m4_define([m4_set_add_all], [m4_define([_m4_set_size($1)], m4_eval(m4_set_size([$1]) + m4_len(m4_ifdef([_m4_set_cleanup($1)], [_$0_check], [_$0])([$1], $@))))]) m4_define([_m4_set_add_all], [m4_if([$#], [2], [], [m4_ifdef([_m4_set([$1],$3)], [], [m4_define([_m4_set([$1],$3)], [1])m4_pushdef([_m4_set([$1])], [$3])-])$0([$1], m4_shift2($@))])]) m4_define([_m4_set_add_all_check], [m4_if([$#], [2], [], [m4_set_add([$1], [$3])$0([$1], m4_shift2($@))])]) # m4_set_contains(SET, VALUE, [IF-PRESENT], [IF-ABSENT]) # ------------------------------------------------------ # Expand IF-PRESENT if SET contains VALUE, otherwise expand IF-ABSENT. # This is always O(1). m4_define([m4_set_contains], [m4_ifdef([_m4_set_cleanup($1)], [m4_if(m4_ifdef([_m4_set([$1],$2)], [m4_indir([_m4_set([$1],$2)])], [0]), [1], [$3], [$4])], [m4_ifdef([_m4_set([$1],$2)], [$3], [$4])])]) # m4_set_contents(SET, [SEP]) # --------------------------- # Expand to a single string containing all the elements in SET, # separated by SEP, without modifying SET. No provision is made for # disambiguating set elements that contain non-empty SEP as a # sub-string, or for recognizing a set that contains only the empty # string. Order of the output is not guaranteed. If any elements # have been previously removed from the set, this action will prune # the unused memory. This is O(n) in the size of the set before # pruning. # # Use _m4_popdef for speed. The existence of _m4_set_cleanup($1) # determines which version of _1 helper we use. m4_define([m4_set_contents], [m4_set_map_sep([$1], [], [], [[$2]])]) # _m4_set_contents_1(SET) # _m4_set_contents_1c(SET) # _m4_set_contents_2(SET, [PRE], [POST], [SEP]) # --------------------------------------------- # Expand to a list of quoted elements currently in the set, each # surrounded by PRE and POST, and moving SEP in front of PRE on # recursion. To avoid nesting limit restrictions, the algorithm must # be broken into two parts; _1 destructively copies the stack in # reverse into _m4_set_($1), producing no output; then _2 # destructively copies _m4_set_($1) back into the stack in reverse. # If no elements were deleted, then this visits the set in the order # that elements were inserted. Behavior is undefined if PRE/POST/SEP # tries to recursively list or modify SET in any way other than # calling m4_set_remove on the current element. Use _1 if all entries # in the stack are guaranteed to be in the set, and _1c to prune # removed entries. Uses _m4_defn and _m4_popdef for speed. m4_define([_m4_set_contents_1], [_m4_stack_reverse([_m4_set([$1])], [_m4_set_($1)])]) m4_define([_m4_set_contents_1c], [m4_ifdef([_m4_set([$1])], [m4_set_contains([$1], _m4_defn([_m4_set([$1])]), [m4_pushdef([_m4_set_($1)], _m4_defn([_m4_set([$1])]))], [_m4_popdef([_m4_set([$1],]_m4_defn( [_m4_set([$1])])[)])])_m4_popdef([_m4_set([$1])])$0([$1])], [_m4_popdef([_m4_set_cleanup($1)])])]) m4_define([_m4_set_contents_2], [_m4_stack_reverse([_m4_set_($1)], [_m4_set([$1])], [$2[]_m4_defn([_m4_set_($1)])$3], [$4[]])]) # m4_set_delete(SET) # ------------------ # Delete all elements in SET, and reclaim any memory occupied by the # set. This is O(n) in the set size. # # Use _m4_defn and _m4_popdef for speed. m4_define([m4_set_delete], [m4_ifdef([_m4_set([$1])], [_m4_popdef([_m4_set([$1],]_m4_defn([_m4_set([$1])])[)], [_m4_set([$1])])$0([$1])], [m4_ifdef([_m4_set_cleanup($1)], [_m4_popdef([_m4_set_cleanup($1)])])m4_ifdef( [_m4_set_size($1)], [_m4_popdef([_m4_set_size($1)])])])]) # m4_set_difference(SET1, SET2) # ----------------------------- # Produce a LIST of quoted elements that occur in SET1 but not SET2. # Output a comma prior to any elements, to distinguish the empty # string from no elements. This can be directly used as a series of # arguments, such as for m4_join, or wrapped inside quotes for use in # m4_foreach. Order of the output is not guaranteed. # # Short-circuit the idempotence relation. m4_define([m4_set_difference], [m4_if([$1], [$2], [], [m4_set_map_sep([$1], [_$0([$2],], [)])])]) m4_define([_m4_set_difference], [m4_set_contains([$1], [$2], [], [,[$2]])]) # m4_set_dump(SET, [SEP]) # ----------------------- # Expand to a single string containing all the elements in SET, # separated by SEP, then delete SET. In general, if you only need to # list the contents once, this is faster than m4_set_contents. No # provision is made for disambiguating set elements that contain # non-empty SEP as a sub-string. Order of the output is not # guaranteed. This is O(n) in the size of the set before pruning. # # Use _m4_popdef for speed. Use existence of _m4_set_cleanup($1) to # decide if more expensive recursion is needed. m4_define([m4_set_dump], [m4_ifdef([_m4_set_size($1)], [_m4_popdef([_m4_set_size($1)])])m4_ifdef([_m4_set_cleanup($1)], [_$0_check], [_$0])([$1], [], [$2])]) # _m4_set_dump(SET, [SEP], [PREP]) # _m4_set_dump_check(SET, [SEP], [PREP]) # -------------------------------------- # Print SEP and the current element, then delete the element and # recurse with empty SEP changed to PREP. The check variant checks # whether the element has been previously removed. Use _m4_defn and # _m4_popdef for speed. m4_define([_m4_set_dump], [m4_ifdef([_m4_set([$1])], [[$2]_m4_defn([_m4_set([$1])])_m4_popdef([_m4_set([$1],]_m4_defn( [_m4_set([$1])])[)], [_m4_set([$1])])$0([$1], [$2$3])])]) m4_define([_m4_set_dump_check], [m4_ifdef([_m4_set([$1])], [m4_set_contains([$1], _m4_defn([_m4_set([$1])]), [[$2]_m4_defn([_m4_set([$1])])])_m4_popdef( [_m4_set([$1],]_m4_defn([_m4_set([$1])])[)], [_m4_set([$1])])$0([$1], [$2$3])], [_m4_popdef([_m4_set_cleanup($1)])])]) # m4_set_empty(SET, [IF-EMPTY], [IF-ELEMENTS]) # -------------------------------------------- # Expand IF-EMPTY if SET has no elements, otherwise IF-ELEMENTS. m4_define([m4_set_empty], [m4_ifdef([_m4_set_size($1)], [m4_if(m4_indir([_m4_set_size($1)]), [0], [$2], [$3])], [$2])]) # m4_set_foreach(SET, VAR, ACTION) # -------------------------------- # For each element of SET, define VAR to the element and expand # ACTION. ACTION should not recursively list SET's contents, add # elements to SET, nor delete any element from SET except the one # currently in VAR. The order that the elements are visited in is not # guaranteed. This is faster than the corresponding m4_foreach([VAR], # m4_indir([m4_dquote]m4_set_listc([SET])), [ACTION]) m4_define([m4_set_foreach], [m4_pushdef([$2])m4_set_map_sep([$1], [m4_define([$2],], [)$3])]) # m4_set_intersection(SET1, SET2) # ------------------------------- # Produce a LIST of quoted elements that occur in both SET1 or SET2. # Output a comma prior to any elements, to distinguish the empty # string from no elements. This can be directly used as a series of # arguments, such as for m4_join, or wrapped inside quotes for use in # m4_foreach. Order of the output is not guaranteed. # # Iterate over the smaller set, and short-circuit the idempotence # relation. m4_define([m4_set_intersection], [m4_if([$1], [$2], [m4_set_listc([$1])], m4_eval(m4_set_size([$2]) < m4_set_size([$1])), [1], [$0([$2], [$1])], [m4_set_map_sep([$1], [_$0([$2],], [)])])]) m4_define([_m4_set_intersection], [m4_set_contains([$1], [$2], [,[$2]])]) # m4_set_list(SET) # m4_set_listc(SET) # ----------------- # Produce a LIST of quoted elements of SET. This can be directly used # as a series of arguments, such as for m4_join or m4_set_add_all, or # wrapped inside quotes for use in m4_foreach or m4_map. With # m4_set_list, there is no way to distinguish an empty set from a set # containing only the empty string; with m4_set_listc, a leading comma # is output if there are any elements. m4_define([m4_set_list], [m4_set_map_sep([$1], [], [], [,])]) m4_define([m4_set_listc], [m4_set_map_sep([$1], [,])]) # m4_set_map(SET, ACTION) # ----------------------- # For each element of SET, expand ACTION with a single argument of the # current element. ACTION should not recursively list SET's contents, # add elements to SET, nor delete any element from SET except the one # passed as an argument. The order that the elements are visited in # is not guaranteed. This is faster than either of the corresponding # m4_map_args([ACTION]m4_set_listc([SET])) # m4_set_foreach([SET], [VAR], [ACTION(m4_defn([VAR]))]) m4_define([m4_set_map], [m4_set_map_sep([$1], [$2(], [)])]) # m4_set_map_sep(SET, [PRE], [POST], [SEP]) # ----------------------------------------- # For each element of SET, expand PRE[value]POST[], and expand SEP # between elements. m4_define([m4_set_map_sep], [m4_ifdef([_m4_set_cleanup($1)], [_m4_set_contents_1c], [_m4_set_contents_1])([$1])_m4_set_contents_2($@)]) # m4_set_remove(SET, VALUE, [IF-PRESENT], [IF-ABSENT]) # ---------------------------------------------------- # If VALUE is an element of SET, delete it and expand IF-PRESENT. # Otherwise expand IF-ABSENT. Deleting a single value is O(1), # although it leaves memory occupied until the next O(n) traversal of # the set which will compact the set. # # Optimize if the element being removed is the most recently added, # since defining _m4_set_cleanup($1) slows down so many other macros. # In particular, this plays well with m4_set_foreach and m4_set_map. m4_define([m4_set_remove], [m4_set_contains([$1], [$2], [_m4_set_size([$1], [m4_decr])m4_if(_m4_defn([_m4_set([$1])]), [$2], [_m4_popdef([_m4_set([$1],$2)], [_m4_set([$1])])], [m4_define([_m4_set_cleanup($1)])m4_define( [_m4_set([$1],$2)], [0])])$3], [$4])]) # m4_set_size(SET) # ---------------- # Expand to the number of elements currently in SET. This operation # is O(1), and thus more efficient than m4_count(m4_set_list([SET])). m4_define([m4_set_size], [m4_ifdef([_m4_set_size($1)], [m4_indir([_m4_set_size($1)])], [0])]) # _m4_set_size(SET, ACTION) # ------------------------- # ACTION must be either m4_incr or m4_decr, and the size of SET is # changed accordingly. If the set is empty, ACTION must not be # m4_decr. m4_define([_m4_set_size], [m4_define([_m4_set_size($1)], m4_ifdef([_m4_set_size($1)], [$2(m4_indir([_m4_set_size($1)]))], [1]))]) # m4_set_union(SET1, SET2) # ------------------------ # Produce a LIST of double quoted elements that occur in either SET1 # or SET2, without duplicates. Output a comma prior to any elements, # to distinguish the empty string from no elements. This can be # directly used as a series of arguments, such as for m4_join, or # wrapped inside quotes for use in m4_foreach. Order of the output is # not guaranteed. # # We can rely on the fact that m4_set_listc prunes SET1, so we don't # need to check _m4_set([$1],element) for 0. Short-circuit the # idempotence relation. m4_define([m4_set_union], [m4_set_listc([$1])m4_if([$1], [$2], [], [m4_set_map_sep([$2], [_$0([$1],], [)])])]) m4_define([_m4_set_union], [m4_ifdef([_m4_set([$1],$2)], [], [,[$2]])]) ## ------------------- ## ## 16. File handling. ## ## ------------------- ## # It is a real pity that M4 comes with no macros to bind a diversion # to a file. So we have to deal without, which makes us a lot more # fragile than we should. # m4_file_append(FILE-NAME, CONTENT) # ---------------------------------- m4_define([m4_file_append], [m4_syscmd([cat >>$1 <<_m4eof $2 _m4eof ]) m4_if(m4_sysval, [0], [], [m4_fatal([$0: cannot write: $1])])]) ## ------------------------ ## ## 17. Setting M4sugar up. ## ## ------------------------ ## # _m4_divert_diversion should be defined. m4_divert_push([KILL]) # m4_init # ------- # Initialize the m4sugar language. m4_define([m4_init], [# All the M4sugar macros start with `m4_', except `dnl' kept as is # for sake of simplicity. m4_pattern_forbid([^_?m4_]) m4_pattern_forbid([^dnl$]) # If __m4_version__ is defined, we assume that we are being run by M4 # 1.6 or newer, thus $@ recursion is linear, and debugmode(+do) # is available for faster checks of dereferencing undefined macros # and forcing dumpdef to print to stderr regardless of debugfile. # But if it is missing, we assume we are being run by M4 1.4.x, that # $@ recursion is quadratic, and that we need foreach-based # replacement macros. Also, m4 prior to 1.4.8 loses track of location # during m4wrap text; __line__ should never be 0. # # Use the raw builtin to avoid tripping up include tracing. # Meanwhile, avoid m4_copy, since it temporarily undefines m4_defn. m4_ifdef([__m4_version__], [m4_debugmode([+do]) m4_define([m4_defn], _m4_defn([_m4_defn])) m4_define([m4_dumpdef], _m4_defn([_m4_dumpdef])) m4_define([m4_popdef], _m4_defn([_m4_popdef])) m4_define([m4_undefine], _m4_defn([_m4_undefine]))], [m4_builtin([include], [m4sugar/foreach.m4]) m4_wrap_lifo([m4_if(__line__, [0], [m4_pushdef([m4_location], ]]m4_dquote(m4_dquote(m4_dquote(__file__:__line__)))[[)])])]) # Rewrite the first entry of the diversion stack. m4_divert([KILL]) # Check the divert push/pop perfect balance. # Some users are prone to also use m4_wrap to register last-minute # m4_divert_text; so after our diversion cleanups, we restore # KILL as the bottom of the diversion stack. m4_wrap([m4_popdef([_m4_divert_diversion])m4_ifdef( [_m4_divert_diversion], [m4_fatal([$0: unbalanced m4_divert_push: ]m4_divert_stack)])_m4_popdef([_m4_divert_stack])m4_divert_push([KILL])]) ]) PKd1]l99m4sugar/foreach.m4nu[# -*- Autoconf -*- # This file is part of Autoconf. # foreach-based replacements for recursive functions. # Speeds up GNU M4 1.4.x by avoiding quadratic $@ recursion, but penalizes # GNU M4 1.6 by requiring more memory and macro expansions. # # Copyright (C) 2008-2013 Free Software Foundation, Inc. # This file is part of Autoconf. 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. # # Under Section 7 of GPL version 3, you are granted additional # permissions described in the Autoconf Configure Script Exception, # version 3.0, as published by the Free Software Foundation. # # You should have received a copy of the GNU General Public License # and a copy of the Autoconf Configure Script Exception along with # this program; see the files COPYINGv3 and COPYING.EXCEPTION # respectively. If not, see . # Written by Eric Blake. # In M4 1.4.x, every byte of $@ is rescanned. This means that an # algorithm on n arguments that recurses with one less argument each # iteration will scan n * (n + 1) / 2 arguments, for O(n^2) time. In # M4 1.6, this was fixed so that $@ is only scanned once, then # back-references are made to information stored about the scan. # Thus, n iterations need only scan n arguments, for O(n) time. # Additionally, in M4 1.4.x, recursive algorithms did not clean up # memory very well, requiring O(n^2) memory rather than O(n) for n # iterations. # # This file is designed to overcome the quadratic nature of $@ # recursion by writing a variant of m4_foreach that uses m4_for rather # than $@ recursion to operate on the list. This involves more macro # expansions, but avoids the need to rescan a quadratic number of # arguments, making these replacements very attractive for M4 1.4.x. # On the other hand, in any version of M4, expanding additional macros # costs additional time; therefore, in M4 1.6, where $@ recursion uses # fewer macros, these replacements actually pessimize performance. # Additionally, the use of $10 to mean the tenth argument violates # POSIX; although all versions of m4 1.4.x support this meaning, a # future m4 version may switch to take it as the first argument # concatenated with a literal 0, so the implementations in this file # are not future-proof. Thus, this file is conditionally included as # part of m4_init(), only when it is detected that M4 probably has # quadratic behavior (ie. it lacks the macro __m4_version__). # # Please keep this file in sync with m4sugar.m4. # _m4_foreach(PRE, POST, IGNORED, ARG...) # --------------------------------------- # Form the common basis of the m4_foreach and m4_map macros. For each # ARG, expand PRE[ARG]POST[]. The IGNORED argument makes recursion # easier, and must be supplied rather than implicit. # # This version minimizes the number of times that $@ is evaluated by # using m4_for to generate a boilerplate into _m4_f then passing $@ to # that temporary macro. Thus, the recursion is done in m4_for without # reparsing any user input, and is not quadratic. For an idea of how # this works, note that m4_foreach(i,[1,2],[i]) calls # _m4_foreach([m4_define([i],],[)i],[],[1],[2]) # which defines _m4_f: # $1[$4]$2[]$1[$5]$2[]_m4_popdef([_m4_f]) # then calls _m4_f([m4_define([i],],[)i],[],[1],[2]) for a net result: # m4_define([i],[1])i[]m4_define([i],[2])i[]_m4_popdef([_m4_f]). m4_define([_m4_foreach], [m4_if([$#], [3], [], [m4_pushdef([_m4_f], _m4_for([4], [$#], [1], [$0_([1], [2],], [)])[_m4_popdef([_m4_f])])_m4_f($@)])]) m4_define([_m4_foreach_], [[$$1[$$3]$$2[]]]) # m4_case(SWITCH, VAL1, IF-VAL1, VAL2, IF-VAL2, ..., DEFAULT) # ----------------------------------------------------------- # Find the first VAL that SWITCH matches, and expand the corresponding # IF-VAL. If there are no matches, expand DEFAULT. # # Use m4_for to create a temporary macro in terms of a boilerplate # m4_if with final cleanup. If $# is even, we have DEFAULT; if it is # odd, then rounding the last $# up in the temporary macro is # harmless. For example, both m4_case(1,2,3,4,5) and # m4_case(1,2,3,4,5,6) result in the intermediate _m4_case being # m4_if([$1],[$2],[$3],[$1],[$4],[$5],_m4_popdef([_m4_case])[$6]) m4_define([m4_case], [m4_if(m4_eval([$# <= 2]), [1], [$2], [m4_pushdef([_$0], [m4_if(]_m4_for([2], m4_eval([($# - 1) / 2 * 2]), [2], [_$0_(], [)])[_m4_popdef( [_$0])]m4_dquote($m4_eval([($# + 1) & ~1]))[)])_$0($@)])]) m4_define([_m4_case_], [$0_([1], [$1], m4_incr([$1]))]) m4_define([_m4_case__], [[[$$1],[$$2],[$$3],]]) # m4_bmatch(SWITCH, RE1, VAL1, RE2, VAL2, ..., DEFAULT) # ----------------------------------------------------- # m4 equivalent of # # if (SWITCH =~ RE1) # VAL1; # elif (SWITCH =~ RE2) # VAL2; # elif ... # ... # else # DEFAULT # # We build the temporary macro _m4_b: # m4_define([_m4_b], _m4_defn([_m4_bmatch]))_m4_b([$1], [$2], [$3])... # _m4_b([$1], [$m-1], [$m])_m4_b([], [], [$m+1]_m4_popdef([_m4_b])) # then invoke m4_unquote(_m4_b($@)), for concatenation with later text. m4_define([m4_bmatch], [m4_if([$#], 0, [m4_fatal([$0: too few arguments: $#])], [$#], 1, [m4_fatal([$0: too few arguments: $#: $1])], [$#], 2, [$2], [m4_pushdef([_m4_b], [m4_define([_m4_b], _m4_defn([_$0]))]_m4_for([3], m4_eval([($# + 1) / 2 * 2 - 1]), [2], [_$0_(], [)])[_m4_b([], [],]m4_dquote([$]m4_eval( [($# + 1) / 2 * 2]))[_m4_popdef([_m4_b]))])m4_unquote(_m4_b($@))])]) m4_define([_m4_bmatch], [m4_if(m4_bregexp([$1], [$2]), [-1], [], [[$3]m4_define([$0])])]) m4_define([_m4_bmatch_], [$0_([1], m4_decr([$1]), [$1])]) m4_define([_m4_bmatch__], [[_m4_b([$$1], [$$2], [$$3])]]) # m4_cond(TEST1, VAL1, IF-VAL1, TEST2, VAL2, IF-VAL2, ..., [DEFAULT]) # ------------------------------------------------------------------- # Similar to m4_if, except that each TEST is expanded when encountered. # If the expansion of TESTn matches the string VALn, the result is IF-VALn. # The result is DEFAULT if no tests passed. This macro allows # short-circuiting of expensive tests, where it pays to arrange quick # filter tests to run first. # # m4_cond already guarantees either 3*n or 3*n + 1 arguments, 1 <= n. # We only have to speed up _m4_cond, by building the temporary _m4_c: # m4_define([_m4_c], _m4_defn([m4_unquote]))_m4_c([m4_if(($1), [($2)], # [[$3]m4_define([_m4_c])])])_m4_c([m4_if(($4), [($5)], # [[$6]m4_define([_m4_c])])])..._m4_c([m4_if(($m-2), [($m-1)], # [[$m]m4_define([_m4_c])])])_m4_c([[$m+1]]_m4_popdef([_m4_c])) # We invoke m4_unquote(_m4_c($@)), for concatenation with later text. m4_define([_m4_cond], [m4_pushdef([_m4_c], [m4_define([_m4_c], _m4_defn([m4_unquote]))]_m4_for([2], m4_eval([$# / 3 * 3 - 1]), [3], [$0_(], [)])[_m4_c(]m4_dquote(m4_dquote( [$]m4_eval([$# / 3 * 3 + 1])))[_m4_popdef([_m4_c]))])m4_unquote(_m4_c($@))]) m4_define([_m4_cond_], [$0_(m4_decr([$1]), [$1], m4_incr([$1]))]) m4_define([_m4_cond__], [[_m4_c([m4_if(($$1), [($$2)], [[$$3]m4_define([_m4_c])])])]]) # m4_bpatsubsts(STRING, RE1, SUBST1, RE2, SUBST2, ...) # ---------------------------------------------------- # m4 equivalent of # # $_ = STRING; # s/RE1/SUBST1/g; # s/RE2/SUBST2/g; # ... # # m4_bpatsubsts already validated an odd number of arguments; we only # need to speed up _m4_bpatsubsts. To avoid nesting, we build the # temporary _m4_p: # m4_define([_m4_p], [$1])m4_define([_m4_p], # m4_bpatsubst(m4_dquote(_m4_defn([_m4_p])), [$2], [$3]))m4_define([_m4_p], # m4_bpatsubst(m4_dquote(_m4_defn([_m4_p])), [$4], [$5]))m4_define([_m4_p],... # m4_bpatsubst(m4_dquote(_m4_defn([_m4_p])), [$m-1], [$m]))m4_unquote( # _m4_defn([_m4_p])_m4_popdef([_m4_p])) m4_define([_m4_bpatsubsts], [m4_pushdef([_m4_p], [m4_define([_m4_p], ]m4_dquote([$]1)[)]_m4_for([3], [$#], [2], [$0_(], [)])[m4_unquote(_m4_defn([_m4_p])_m4_popdef([_m4_p]))])_m4_p($@)]) m4_define([_m4_bpatsubsts_], [$0_(m4_decr([$1]), [$1])]) m4_define([_m4_bpatsubsts__], [[m4_define([_m4_p], m4_bpatsubst(m4_dquote(_m4_defn([_m4_p])), [$$1], [$$2]))]]) # m4_shiftn(N, ...) # ----------------- # Returns ... shifted N times. Useful for recursive "varargs" constructs. # # m4_shiftn already validated arguments; we only need to speed up # _m4_shiftn. If N is 3, then we build the temporary _m4_s, defined as # ,[$5],[$6],...,[$m]_m4_popdef([_m4_s]) # before calling m4_shift(_m4_s($@)). m4_define([_m4_shiftn], [m4_if(m4_incr([$1]), [$#], [], [m4_pushdef([_m4_s], _m4_for(m4_eval([$1 + 2]), [$#], [1], [[,]m4_dquote($], [)])[_m4_popdef([_m4_s])])m4_shift(_m4_s($@))])]) # m4_do(STRING, ...) # ------------------ # This macro invokes all its arguments (in sequence, of course). It is # useful for making your macros more structured and readable by dropping # unnecessary dnl's and have the macros indented properly. # # Here, we use the temporary macro _m4_do, defined as # $1[]$2[]...[]$n[]_m4_popdef([_m4_do]) m4_define([m4_do], [m4_if([$#], [0], [], [m4_pushdef([_$0], _m4_for([1], [$#], [1], [$], [[[]]])[_m4_popdef([_$0])])_$0($@)])]) # m4_dquote_elt(ARGS) # ------------------- # Return ARGS as an unquoted list of double-quoted arguments. # # _m4_foreach to the rescue. m4_define([m4_dquote_elt], [m4_if([$#], [0], [], [[[$1]]_m4_foreach([,m4_dquote(], [)], $@)])]) # m4_reverse(ARGS) # ---------------- # Output ARGS in reverse order. # # Invoke _m4_r($@) with the temporary _m4_r built as # [$m], [$m-1], ..., [$2], [$1]_m4_popdef([_m4_r]) m4_define([m4_reverse], [m4_if([$#], [0], [], [$#], [1], [[$1]], [m4_pushdef([_m4_r], [[$$#]]_m4_for(m4_decr([$#]), [1], [-1], [[, ]m4_dquote($], [)])[_m4_popdef([_m4_r])])_m4_r($@)])]) # m4_map_args_pair(EXPRESSION, [END-EXPR = EXPRESSION], ARG...) # ------------------------------------------------------------- # Perform a pairwise grouping of consecutive ARGs, by expanding # EXPRESSION([ARG1], [ARG2]). If there are an odd number of ARGs, the # final argument is expanded with END-EXPR([ARGn]). # # Build the temporary macro _m4_map_args_pair, with the $2([$m+1]) # only output if $# is odd: # $1([$3], [$4])[]$1([$5], [$6])[]...$1([$m-1], # [$m])[]m4_default([$2], [$1])([$m+1])[]_m4_popdef([_m4_map_args_pair]) m4_define([m4_map_args_pair], [m4_if([$#], [0], [m4_fatal([$0: too few arguments: $#])], [$#], [1], [m4_fatal([$0: too few arguments: $#: $1])], [$#], [2], [], [$#], [3], [m4_default([$2], [$1])([$3])[]], [m4_pushdef([_$0], _m4_for([3], m4_eval([$# / 2 * 2 - 1]), [2], [_$0_(], [)])_$0_end( [1], [2], [$#])[_m4_popdef([_$0])])_$0($@)])]) m4_define([_m4_map_args_pair_], [$0_([1], [$1], m4_incr([$1]))]) m4_define([_m4_map_args_pair__], [[$$1([$$2], [$$3])[]]]) m4_define([_m4_map_args_pair_end], [m4_if(m4_eval([$3 & 1]), [1], [[m4_default([$$2], [$$1])([$$3])[]]])]) # m4_join(SEP, ARG1, ARG2...) # --------------------------- # Produce ARG1SEPARG2...SEPARGn. Avoid back-to-back SEP when a given ARG # is the empty string. No expansion is performed on SEP or ARGs. # # Use a self-modifying separator, since we don't know how many # arguments might be skipped before a separator is first printed, but # be careful if the separator contains $. _m4_foreach to the rescue. m4_define([m4_join], [m4_pushdef([_m4_sep], [m4_define([_m4_sep], _m4_defn([m4_echo]))])]dnl [_m4_foreach([_$0([$1],], [)], $@)_m4_popdef([_m4_sep])]) m4_define([_m4_join], [m4_if([$2], [], [], [_m4_sep([$1])[$2]])]) # m4_joinall(SEP, ARG1, ARG2...) # ------------------------------ # Produce ARG1SEPARG2...SEPARGn. An empty ARG results in back-to-back SEP. # No expansion is performed on SEP or ARGs. # # A bit easier than m4_join. _m4_foreach to the rescue. m4_define([m4_joinall], [[$2]m4_if(m4_eval([$# <= 2]), [1], [], [_m4_foreach([$1], [], m4_shift($@))])]) # m4_list_cmp(A, B) # ----------------- # Compare the two lists of integer expressions A and B. # # m4_list_cmp takes care of any side effects; we only override # _m4_list_cmp_raw, where we can safely expand lists multiple times. # First, insert padding so that both lists are the same length; the # trailing +0 is necessary to handle a missing list. Next, create a # temporary macro to perform pairwise comparisons until an inequality # is found. For example, m4_list_cmp([1], [1,2]) creates _m4_cmp as # m4_if(m4_eval([($1) != ($3)]), [1], [m4_cmp([$1], [$3])], # m4_eval([($2) != ($4)]), [1], [m4_cmp([$2], [$4])], # [0]_m4_popdef([_m4_cmp])) # then calls _m4_cmp([1+0], [0*2], [1], [2+0]) m4_define([_m4_list_cmp_raw], [m4_if([$1], [$2], 0, [_m4_list_cmp($1+0_m4_list_pad(m4_count($1), m4_count($2)), $2+0_m4_list_pad(m4_count($2), m4_count($1)))])]) m4_define([_m4_list_pad], [m4_if(m4_eval($1 < $2), [1], [_m4_for(m4_incr([$1]), [$2], [1], [,0*])])]) m4_define([_m4_list_cmp], [m4_pushdef([_m4_cmp], [m4_if(]_m4_for( [1], m4_eval([$# >> 1]), [1], [$0_(], [,]m4_eval([$# >> 1])[)])[ [0]_m4_popdef([_m4_cmp]))])_m4_cmp($@)]) m4_define([_m4_list_cmp_], [$0_([$1], m4_eval([$1 + $2]))]) m4_define([_m4_list_cmp__], [[m4_eval([($$1) != ($$2)]), [1], [m4_cmp([$$1], [$$2])], ]]) # m4_max(EXPR, ...) # m4_min(EXPR, ...) # ----------------- # Return the decimal value of the maximum (or minimum) in a series of # integer expressions. # # _m4_foreach to the rescue; we only need to replace _m4_minmax. Here, # we need a temporary macro to track the best answer so far, so that # the foreach expression is tractable. m4_define([_m4_minmax], [m4_pushdef([_m4_best], m4_eval([$2]))_m4_foreach( [m4_define([_m4_best], $1(_m4_best,], [))], m4_shift($@))]dnl [_m4_best[]_m4_popdef([_m4_best])]) # m4_set_add_all(SET, VALUE...) # ----------------------------- # Add each VALUE into SET. This is O(n) in the number of VALUEs, and # can be faster than calling m4_set_add for each VALUE. # # _m4_foreach to the rescue. If no deletions have occurred, then # avoid the speed penalty of m4_set_add. m4_define([m4_set_add_all], [m4_if([$#], [0], [], [$#], [1], [], [m4_define([_m4_set_size($1)], m4_eval(m4_set_size([$1]) + m4_len(_m4_foreach(m4_ifdef([_m4_set_cleanup($1)], [[m4_set_add]], [[_$0]])[([$1],], [)], $@))))])]) m4_define([_m4_set_add_all], [m4_ifdef([_m4_set([$1],$2)], [], [m4_define([_m4_set([$1],$2)], [1])m4_pushdef([_m4_set([$1])], [$2])-])]) PKd1]Y쩉lalr1.ccnu[# C++ skeleton for Bison # Copyright (C) 2002-2015 Free Software Foundation, Inc. # 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 . m4_include(b4_pkgdatadir/[c++.m4]) # api.value.type=variant is valid. m4_define([b4_value_type_setup_variant]) # b4_integral_parser_table_declare(TABLE-NAME, CONTENT, COMMENT) # -------------------------------------------------------------- # Declare "parser::yy_" whose contents is CONTENT. m4_define([b4_integral_parser_table_declare], [m4_ifval([$3], [b4_comment([$3], [ ]) ])dnl static const b4_int_type_for([$2]) yy$1_[[]];dnl ]) # b4_integral_parser_table_define(TABLE-NAME, CONTENT, COMMENT) # ------------------------------------------------------------- # Define "parser::yy_" whose contents is CONTENT. m4_define([b4_integral_parser_table_define], [ const b4_int_type_for([$2]) b4_parser_class_name::yy$1_[[]] = { $2 };dnl ]) # b4_symbol_value_template(VAL, [TYPE]) # ------------------------------------- # Same as b4_symbol_value, but used in a template method. It makes # a difference when using variants. Note that b4_value_type_setup_union # overrides b4_symbol_value, so we must override it again. m4_copy([b4_symbol_value], [b4_symbol_value_template]) m4_append([b4_value_type_setup_union], [m4_copy_force([b4_symbol_value_union], [b4_symbol_value_template])]) # b4_lhs_value([TYPE]) # -------------------- # Expansion of $$. m4_define([b4_lhs_value], [b4_symbol_value([yylhs.value], [$1])]) # b4_lhs_location() # ----------------- # Expansion of @$. m4_define([b4_lhs_location], [yylhs.location]) # b4_rhs_data(RULE-LENGTH, NUM) # ----------------------------- # Return the data corresponding to the symbol #NUM, where the current # rule has RULE-LENGTH symbols on RHS. m4_define([b4_rhs_data], [yystack_@{b4_subtract($@)@}]) # b4_rhs_state(RULE-LENGTH, NUM) # ------------------------------ # The state corresponding to the symbol #NUM, where the current # rule has RULE-LENGTH symbols on RHS. m4_define([b4_rhs_state], [b4_rhs_data([$1], [$2]).state]) # b4_rhs_value(RULE-LENGTH, NUM, [TYPE]) # -------------------------------------- # Expansion of $NUM, where the current rule has RULE-LENGTH # symbols on RHS. m4_define([b4_rhs_value], [b4_symbol_value([b4_rhs_data([$1], [$2]).value], [$3])]) # b4_rhs_location(RULE-LENGTH, NUM) # --------------------------------- # Expansion of @NUM, where the current rule has RULE-LENGTH symbols # on RHS. m4_define([b4_rhs_location], [b4_rhs_data([$1], [$2]).location]) # b4_symbol_action(SYMBOL-NUM, KIND) # ---------------------------------- # Run the action KIND (destructor or printer) for SYMBOL-NUM. # Same as in C, but using references instead of pointers. m4_define([b4_symbol_action], [b4_symbol_if([$1], [has_$2], [m4_pushdef([b4_symbol_value], m4_defn([b4_symbol_value_template]))[]dnl b4_dollar_pushdef([yysym.value], b4_symbol_if([$1], [has_type], [m4_dquote(b4_symbol([$1], [type]))]), [yysym.location])dnl b4_symbol_case_([$1]) b4_syncline([b4_symbol([$1], [$2_line])], ["b4_symbol([$1], [$2_file])"]) b4_symbol([$1], [$2]) b4_syncline([@oline@], [@ofile@]) break; m4_popdef([b4_symbol_value])[]dnl b4_dollar_popdef[]dnl ])]) # b4_lex # ------ # Call yylex. m4_define([b4_lex], [b4_token_ctor_if( [b4_function_call([yylex], [symbol_type], m4_ifdef([b4_lex_param], b4_lex_param))], [b4_function_call([yylex], [int], [b4_api_PREFIX[STYPE*], [&yyla.value]][]dnl b4_locations_if([, [[location*], [&yyla.location]]])dnl m4_ifdef([b4_lex_param], [, ]b4_lex_param))])]) m4_pushdef([b4_copyright_years], [2002-2015]) m4_define([b4_parser_class_name], [b4_percent_define_get([[parser_class_name]])]) b4_bison_locations_if([# Backward compatibility. m4_define([b4_location_constructors]) m4_include(b4_pkgdatadir/[location.cc])]) m4_include(b4_pkgdatadir/[stack.hh]) b4_variant_if([m4_include(b4_pkgdatadir/[variant.hh])]) # b4_shared_declarations # ---------------------- # Declaration that might either go into the header (if --defines) # or open coded in the parser body. m4_define([b4_shared_declarations], [b4_percent_code_get([[requires]])[ ]b4_parse_assert_if([# include ])[ # include // std::abort # include # include # include # include ]b4_defines_if([[ # include "stack.hh" ]b4_bison_locations_if([[# include "location.hh"]])])[ ]b4_variant_if([b4_variant_includes])[ ]b4_attribute_define[ ]b4_YYDEBUG_define[ ]b4_namespace_open[ ]b4_defines_if([], [b4_stack_define b4_bison_locations_if([b4_position_define b4_location_define])])[ ]b4_variant_if([b4_variant_define])[ /// A Bison parser. class ]b4_parser_class_name[ { public: ]b4_public_types_declare[ /// Build a parser object. ]b4_parser_class_name[ (]b4_parse_param_decl[); virtual ~]b4_parser_class_name[ (); /// Parse. /// \returns 0 iff parsing succeeded. virtual int parse (); #if ]b4_api_PREFIX[DEBUG /// The current debugging stream. std::ostream& debug_stream () const YY_ATTRIBUTE_PURE; /// Set the current debugging stream. void set_debug_stream (std::ostream &); /// Type for debugging levels. typedef int debug_level_type; /// The current debugging level. debug_level_type debug_level () const YY_ATTRIBUTE_PURE; /// Set the current debugging level. void set_debug_level (debug_level_type l); #endif /// Report a syntax error.]b4_locations_if([[ /// \param loc where the syntax error is found.]])[ /// \param msg a description of the syntax error. virtual void error (]b4_locations_if([[const location_type& loc, ]])[const std::string& msg); /// Report a syntax error. void error (const syntax_error& err); private: /// This class is not copyable. ]b4_parser_class_name[ (const ]b4_parser_class_name[&); ]b4_parser_class_name[& operator= (const ]b4_parser_class_name[&); /// State numbers. typedef int state_type; /// Generate an error message. /// \param yystate the state where the error occurred. /// \param yyla the lookahead token. virtual std::string yysyntax_error_ (state_type yystate, const symbol_type& yyla) const; /// Compute post-reduction state. /// \param yystate the current state /// \param yysym the nonterminal to push on the stack state_type yy_lr_goto_state_ (state_type yystate, int yysym); /// Whether the given \c yypact_ value indicates a defaulted state. /// \param yyvalue the value to check static bool yy_pact_value_is_default_ (int yyvalue); /// Whether the given \c yytable_ value indicates a syntax error. /// \param yyvalue the value to check static bool yy_table_value_is_error_ (int yyvalue); static const ]b4_int_type(b4_pact_ninf, b4_pact_ninf)[ yypact_ninf_; static const ]b4_int_type(b4_table_ninf, b4_table_ninf)[ yytable_ninf_; /// Convert a scanner token number \a t to a symbol number. static token_number_type yytranslate_ (]b4_token_ctor_if([token_type], [int])[ t); // Tables. ]b4_parser_tables_declare[]b4_error_verbose_if([ /// Convert the symbol name \a n to a form suitable for a diagnostic. static std::string yytnamerr_ (const char *n);])[ ]b4_token_table_if([], [[#if ]b4_api_PREFIX[DEBUG]])[ /// For a symbol, its name in clear. static const char* const yytname_[]; ]b4_token_table_if([[#if ]b4_api_PREFIX[DEBUG]])[ ]b4_integral_parser_table_declare([rline], [b4_rline], [[YYRLINE[YYN] -- Source line where rule number YYN was defined.]])[ /// Report on the debug stream that the rule \a r is going to be reduced. virtual void yy_reduce_print_ (int r); /// Print the state stack on the debug stream. virtual void yystack_print_ (); // Debugging. int yydebug_; std::ostream* yycdebug_; /// \brief Display a symbol type, value and location. /// \param yyo The output stream. /// \param yysym The symbol. template void yy_print_ (std::ostream& yyo, const basic_symbol& yysym) const; #endif /// \brief Reclaim the memory associated to a symbol. /// \param yymsg Why this token is reclaimed. /// If null, print nothing. /// \param yysym The symbol. template void yy_destroy_ (const char* yymsg, basic_symbol& yysym) const; private: /// Type access provider for state based symbols. struct by_state { /// Default constructor. by_state (); /// The symbol type as needed by the constructor. typedef state_type kind_type; /// Constructor. by_state (kind_type s); /// Copy constructor. by_state (const by_state& other); /// Record that this symbol is empty. void clear (); /// Steal the symbol type from \a that. void move (by_state& that); /// The (internal) type number (corresponding to \a state). /// \a empty_symbol when empty. symbol_number_type type_get () const; /// The state number used to denote an empty symbol. enum { empty_state = -1 }; /// The state. /// \a empty when empty. state_type state; }; /// "Internal" symbol: element of the stack. struct stack_symbol_type : basic_symbol { /// Superclass. typedef basic_symbol super_type; /// Construct an empty symbol. stack_symbol_type (); /// Steal the contents from \a sym to build this. stack_symbol_type (state_type s, symbol_type& sym); /// Assignment, needed by push_back. stack_symbol_type& operator= (const stack_symbol_type& that); }; /// Stack type. typedef stack stack_type; /// The stack. stack_type yystack_; /// Push a new state on the stack. /// \param m a debug message to display /// if null, no trace is output. /// \param s the symbol /// \warning the contents of \a s.value is stolen. void yypush_ (const char* m, stack_symbol_type& s); /// Push a new look ahead token on the state on the stack. /// \param m a debug message to display /// if null, no trace is output. /// \param s the state /// \param sym the symbol (for its value and location). /// \warning the contents of \a s.value is stolen. void yypush_ (const char* m, state_type s, symbol_type& sym); /// Pop \a n symbols the three stacks. void yypop_ (unsigned int n = 1); /// Constants. enum { yyeof_ = 0, yylast_ = ]b4_last[, ///< Last index in yytable_. yynnts_ = ]b4_nterms_number[, ///< Number of nonterminal symbols. yyfinal_ = ]b4_final_state_number[, ///< Termination state number. yyterror_ = 1, yyerrcode_ = 256, yyntokens_ = ]b4_tokens_number[ ///< Number of tokens. }; ]b4_parse_param_vars[ }; ]b4_token_ctor_if([b4_yytranslate_define b4_public_types_define])[ ]b4_namespace_close[ ]b4_percent_define_flag_if([[global_tokens_and_yystype]], [b4_token_defines #ifndef ]b4_api_PREFIX[STYPE // Redirection for backward compatibility. # define ]b4_api_PREFIX[STYPE b4_namespace_ref::b4_parser_class_name::semantic_type #endif ])[ ]b4_percent_code_get([[provides]])[ ]]) b4_defines_if( [b4_output_begin([b4_spec_defines_file]) b4_copyright([Skeleton interface for Bison LALR(1) parsers in C++]) [ /** ** \file ]b4_spec_defines_file[ ** Define the ]b4_namespace_ref[::parser class. */ // C++ LALR(1) parser skeleton written by Akim Demaille. ]b4_cpp_guard_open([b4_spec_defines_file])[ ]b4_shared_declarations[ ]b4_cpp_guard_close([b4_spec_defines_file]) b4_output_end() ]) b4_output_begin([b4_parser_file_name]) b4_copyright([Skeleton implementation for Bison LALR(1) parsers in C++]) b4_percent_code_get([[top]])[]dnl m4_if(b4_prefix, [yy], [], [ // Take the name prefix into account. #define yylex b4_prefix[]lex])[ // First part of user declarations. ]b4_user_pre_prologue[ ]b4_null_define[ ]b4_defines_if([[#include "@basename(]b4_spec_defines_file[@)"]], [b4_shared_declarations])[ // User implementation prologue. ]b4_user_post_prologue[ ]b4_percent_code_get[ #ifndef YY_ # if defined YYENABLE_NLS && YYENABLE_NLS # if ENABLE_NLS # include // FIXME: INFRINGES ON USER NAME SPACE. # define YY_(msgid) dgettext ("bison-runtime", msgid) # endif # endif # ifndef YY_ # define YY_(msgid) msgid # endif #endif ]b4_locations_if([dnl [#define YYRHSLOC(Rhs, K) ((Rhs)[K].location) ]b4_yylloc_default_define])[ // Suppress unused-variable warnings by "using" E. #define YYUSE(E) ((void) (E)) // Enable debugging if requested. #if ]b4_api_PREFIX[DEBUG // A pseudo ostream that takes yydebug_ into account. # define YYCDEBUG if (yydebug_) (*yycdebug_) # define YY_SYMBOL_PRINT(Title, Symbol) \ do { \ if (yydebug_) \ { \ *yycdebug_ << Title << ' '; \ yy_print_ (*yycdebug_, Symbol); \ *yycdebug_ << std::endl; \ } \ } while (false) # define YY_REDUCE_PRINT(Rule) \ do { \ if (yydebug_) \ yy_reduce_print_ (Rule); \ } while (false) # define YY_STACK_PRINT() \ do { \ if (yydebug_) \ yystack_print_ (); \ } while (false) #else // !]b4_api_PREFIX[DEBUG # define YYCDEBUG if (false) std::cerr # define YY_SYMBOL_PRINT(Title, Symbol) YYUSE(Symbol) # define YY_REDUCE_PRINT(Rule) static_cast(0) # define YY_STACK_PRINT() static_cast(0) #endif // !]b4_api_PREFIX[DEBUG #define yyerrok (yyerrstatus_ = 0) #define yyclearin (yyla.clear ()) #define YYACCEPT goto yyacceptlab #define YYABORT goto yyabortlab #define YYERROR goto yyerrorlab #define YYRECOVERING() (!!yyerrstatus_) ]b4_namespace_open[]b4_error_verbose_if([[ /* Return YYSTR after stripping away unnecessary quotes and backslashes, so that it's suitable for yyerror. The heuristic is that double-quoting is unnecessary unless the string contains an apostrophe, a comma, or backslash (other than backslash-backslash). YYSTR is taken from yytname. */ std::string ]b4_parser_class_name[::yytnamerr_ (const char *yystr) { if (*yystr == '"') { std::string yyr = ""; char const *yyp = yystr; for (;;) switch (*++yyp) { case '\'': case ',': goto do_not_strip_quotes; case '\\': if (*++yyp != '\\') goto do_not_strip_quotes; // Fall through. default: yyr += *yyp; break; case '"': return yyr; } do_not_strip_quotes: ; } return yystr; } ]])[ /// Build a parser object. ]b4_parser_class_name::b4_parser_class_name[ (]b4_parse_param_decl[)]m4_ifset([b4_parse_param], [ :])[ #if ]b4_api_PREFIX[DEBUG ]m4_ifset([b4_parse_param], [ ], [ :])[yydebug_ (false), yycdebug_ (&std::cerr)]m4_ifset([b4_parse_param], [,])[ #endif]b4_parse_param_cons[ {} ]b4_parser_class_name::~b4_parser_class_name[ () {} /*---------------. | Symbol types. | `---------------*/ ]b4_token_ctor_if([], [b4_public_types_define])[ // by_state. inline ]b4_parser_class_name[::by_state::by_state () : state (empty_state) {} inline ]b4_parser_class_name[::by_state::by_state (const by_state& other) : state (other.state) {} inline void ]b4_parser_class_name[::by_state::clear () { state = empty_state; } inline void ]b4_parser_class_name[::by_state::move (by_state& that) { state = that.state; that.clear (); } inline ]b4_parser_class_name[::by_state::by_state (state_type s) : state (s) {} inline ]b4_parser_class_name[::symbol_number_type ]b4_parser_class_name[::by_state::type_get () const { if (state == empty_state) return empty_symbol; else return yystos_[state]; } inline ]b4_parser_class_name[::stack_symbol_type::stack_symbol_type () {} inline ]b4_parser_class_name[::stack_symbol_type::stack_symbol_type (state_type s, symbol_type& that) : super_type (s]b4_locations_if([, that.location])[) { ]b4_variant_if([b4_symbol_variant([that.type_get ()], [value], [move], [that.value])], [[value = that.value;]])[ // that is emptied. that.type = empty_symbol; } inline ]b4_parser_class_name[::stack_symbol_type& ]b4_parser_class_name[::stack_symbol_type::operator= (const stack_symbol_type& that) { state = that.state; ]b4_variant_if([b4_symbol_variant([that.type_get ()], [value], [copy], [that.value])], [[value = that.value;]])[]b4_locations_if([ location = that.location;])[ return *this; } template inline void ]b4_parser_class_name[::yy_destroy_ (const char* yymsg, basic_symbol& yysym) const { if (yymsg) YY_SYMBOL_PRINT (yymsg, yysym);]b4_variant_if([], [ // User destructor. b4_symbol_actions([destructor], [yysym.type_get ()])])[ } #if ]b4_api_PREFIX[DEBUG template void ]b4_parser_class_name[::yy_print_ (std::ostream& yyo, const basic_symbol& yysym) const { std::ostream& yyoutput = yyo; YYUSE (yyoutput); symbol_number_type yytype = yysym.type_get (); // Avoid a (spurious) G++ 4.8 warning about "array subscript is // below array bounds". if (yysym.empty ()) std::abort (); yyo << (yytype < yyntokens_ ? "token" : "nterm") << ' ' << yytname_[yytype] << " ("]b4_locations_if([ << yysym.location << ": "])[; ]b4_symbol_actions([printer])[ yyo << ')'; } #endif inline void ]b4_parser_class_name[::yypush_ (const char* m, state_type s, symbol_type& sym) { stack_symbol_type t (s, sym); yypush_ (m, t); } inline void ]b4_parser_class_name[::yypush_ (const char* m, stack_symbol_type& s) { if (m) YY_SYMBOL_PRINT (m, s); yystack_.push (s); } inline void ]b4_parser_class_name[::yypop_ (unsigned int n) { yystack_.pop (n); } #if ]b4_api_PREFIX[DEBUG std::ostream& ]b4_parser_class_name[::debug_stream () const { return *yycdebug_; } void ]b4_parser_class_name[::set_debug_stream (std::ostream& o) { yycdebug_ = &o; } ]b4_parser_class_name[::debug_level_type ]b4_parser_class_name[::debug_level () const { return yydebug_; } void ]b4_parser_class_name[::set_debug_level (debug_level_type l) { yydebug_ = l; } #endif // ]b4_api_PREFIX[DEBUG inline ]b4_parser_class_name[::state_type ]b4_parser_class_name[::yy_lr_goto_state_ (state_type yystate, int yysym) { int yyr = yypgoto_[yysym - yyntokens_] + yystate; if (0 <= yyr && yyr <= yylast_ && yycheck_[yyr] == yystate) return yytable_[yyr]; else return yydefgoto_[yysym - yyntokens_]; } inline bool ]b4_parser_class_name[::yy_pact_value_is_default_ (int yyvalue) { return yyvalue == yypact_ninf_; } inline bool ]b4_parser_class_name[::yy_table_value_is_error_ (int yyvalue) { return yyvalue == yytable_ninf_; } int ]b4_parser_class_name[::parse () { // State. int yyn; /// Length of the RHS of the rule being reduced. int yylen = 0; // Error handling. int yynerrs_ = 0; int yyerrstatus_ = 0; /// The lookahead symbol. symbol_type yyla;]b4_locations_if([[ /// The locations where the error started and ended. stack_symbol_type yyerror_range[3];]])[ /// The return value of parse (). int yyresult; // FIXME: This shoud be completely indented. It is not yet to // avoid gratuitous conflicts when merging into the master branch. try { YYCDEBUG << "Starting parse" << std::endl; ]m4_ifdef([b4_initial_action], [ b4_dollar_pushdef([yyla.value], [], [yyla.location])dnl // User initialization code. b4_user_initial_action b4_dollar_popdef])[]dnl [ /* Initialize the stack. The initial state will be set in yynewstate, since the latter expects the semantical and the location values to have been already stored, initialize these stacks with a primary value. */ yystack_.clear (); yypush_ (YY_NULLPTR, 0, yyla); // A new symbol was pushed on the stack. yynewstate: YYCDEBUG << "Entering state " << yystack_[0].state << std::endl; // Accept? if (yystack_[0].state == yyfinal_) goto yyacceptlab; goto yybackup; // Backup. yybackup: // Try to take a decision without lookahead. yyn = yypact_[yystack_[0].state]; if (yy_pact_value_is_default_ (yyn)) goto yydefault; // Read a lookahead token. if (yyla.empty ()) { YYCDEBUG << "Reading a token: "; try {]b4_token_ctor_if([[ symbol_type yylookahead (]b4_lex[); yyla.move (yylookahead);]], [[ yyla.type = yytranslate_ (]b4_lex[);]])[ } catch (const syntax_error& yyexc) { error (yyexc); goto yyerrlab1; } } YY_SYMBOL_PRINT ("Next token is", yyla); /* If the proper action on seeing token YYLA.TYPE is to reduce or to detect an error, take that action. */ yyn += yyla.type_get (); if (yyn < 0 || yylast_ < yyn || yycheck_[yyn] != yyla.type_get ()) goto yydefault; // Reduce or error. yyn = yytable_[yyn]; if (yyn <= 0) { if (yy_table_value_is_error_ (yyn)) goto yyerrlab; yyn = -yyn; goto yyreduce; } // Count tokens shifted since error; after three, turn off error status. if (yyerrstatus_) --yyerrstatus_; // Shift the lookahead token. yypush_ ("Shifting", yyn, yyla); goto yynewstate; /*-----------------------------------------------------------. | yydefault -- do the default action for the current state. | `-----------------------------------------------------------*/ yydefault: yyn = yydefact_[yystack_[0].state]; if (yyn == 0) goto yyerrlab; goto yyreduce; /*-----------------------------. | yyreduce -- Do a reduction. | `-----------------------------*/ yyreduce: yylen = yyr2_[yyn]; { stack_symbol_type yylhs; yylhs.state = yy_lr_goto_state_(yystack_[yylen].state, yyr1_[yyn]);]b4_variant_if([ /* Variants are always initialized to an empty instance of the correct type. The default '$$ = $1' action is NOT applied when using variants. */ b4_symbol_variant([[yyr1_@{yyn@}]], [yylhs.value], [build])], [ /* If YYLEN is nonzero, implement the default value of the action: '$$ = $1'. Otherwise, use the top of the stack. Otherwise, the following line sets YYLHS.VALUE to garbage. This behavior is undocumented and Bison users should not rely upon it. */ if (yylen) yylhs.value = yystack_@{yylen - 1@}.value; else yylhs.value = yystack_@{0@}.value;])[ ]b4_locations_if([dnl [ // Compute the default @@$. { slice slice (yystack_, yylen); YYLLOC_DEFAULT (yylhs.location, slice, yylen); }]])[ // Perform the reduction. YY_REDUCE_PRINT (yyn); try { switch (yyn) { ]b4_user_actions[ default: break; } } catch (const syntax_error& yyexc) { error (yyexc); YYERROR; } YY_SYMBOL_PRINT ("-> $$ =", yylhs); yypop_ (yylen); yylen = 0; YY_STACK_PRINT (); // Shift the result of the reduction. yypush_ (YY_NULLPTR, yylhs); } goto yynewstate; /*--------------------------------------. | yyerrlab -- here on detecting error. | `--------------------------------------*/ yyerrlab: // If not already recovering from an error, report this error. if (!yyerrstatus_) { ++yynerrs_; error (]b4_join(b4_locations_if([yyla.location]), [[yysyntax_error_ (yystack_[0].state, yyla)]])[); } ]b4_locations_if([[ yyerror_range[1].location = yyla.location;]])[ if (yyerrstatus_ == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ // Return failure if at end of input. if (yyla.type_get () == yyeof_) YYABORT; else if (!yyla.empty ()) { yy_destroy_ ("Error: discarding", yyla); yyla.clear (); } } // Else will try to reuse lookahead token after shifting the error token. goto yyerrlab1; /*---------------------------------------------------. | yyerrorlab -- error raised explicitly by YYERROR. | `---------------------------------------------------*/ yyerrorlab: /* Pacify compilers like GCC when the user code never invokes YYERROR and the label yyerrorlab therefore never appears in user code. */ if (false) goto yyerrorlab;]b4_locations_if([[ yyerror_range[1].location = yystack_[yylen - 1].location;]])[ /* Do not reclaim the symbols of the rule whose action triggered this YYERROR. */ yypop_ (yylen); yylen = 0; goto yyerrlab1; /*-------------------------------------------------------------. | yyerrlab1 -- common code for both syntax error and YYERROR. | `-------------------------------------------------------------*/ yyerrlab1: yyerrstatus_ = 3; // Each real token shifted decrements this. { stack_symbol_type error_token; for (;;) { yyn = yypact_[yystack_[0].state]; if (!yy_pact_value_is_default_ (yyn)) { yyn += yyterror_; if (0 <= yyn && yyn <= yylast_ && yycheck_[yyn] == yyterror_) { yyn = yytable_[yyn]; if (0 < yyn) break; } } // Pop the current state because it cannot handle the error token. if (yystack_.size () == 1) YYABORT; ]b4_locations_if([[ yyerror_range[1].location = yystack_[0].location;]])[ yy_destroy_ ("Error: popping", yystack_[0]); yypop_ (); YY_STACK_PRINT (); } ]b4_locations_if([[ yyerror_range[2].location = yyla.location; YYLLOC_DEFAULT (error_token.location, yyerror_range, 2);]])[ // Shift the error token. error_token.state = yyn; yypush_ ("Shifting", error_token); } goto yynewstate; // Accept. yyacceptlab: yyresult = 0; goto yyreturn; // Abort. yyabortlab: yyresult = 1; goto yyreturn; yyreturn: if (!yyla.empty ()) yy_destroy_ ("Cleanup: discarding lookahead", yyla); /* Do not reclaim the symbols of the rule whose action triggered this YYABORT or YYACCEPT. */ yypop_ (yylen); while (1 < yystack_.size ()) { yy_destroy_ ("Cleanup: popping", yystack_[0]); yypop_ (); } return yyresult; } catch (...) { YYCDEBUG << "Exception caught: cleaning lookahead and stack" << std::endl; // Do not try to display the values of the reclaimed symbols, // as their printer might throw an exception. if (!yyla.empty ()) yy_destroy_ (YY_NULLPTR, yyla); while (1 < yystack_.size ()) { yy_destroy_ (YY_NULLPTR, yystack_[0]); yypop_ (); } throw; } } void ]b4_parser_class_name[::error (const syntax_error& yyexc) { error (]b4_join(b4_locations_if([yyexc.location]), [[yyexc.what()]])[); } // Generate an error message. std::string ]b4_parser_class_name[::yysyntax_error_ (]dnl b4_error_verbose_if([state_type yystate, const symbol_type& yyla], [state_type, const symbol_type&])[) const {]b4_error_verbose_if([[ // Number of reported tokens (one for the "unexpected", one per // "expected"). size_t yycount = 0; // Its maximum. enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; // Arguments of yyformat. char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; /* There are many possibilities here to consider: - If this state is a consistent state with a default action, then the only way this function was invoked is if the default action is an error action. In that case, don't check for expected tokens because there are none. - The only way there can be no lookahead present (in yyla) is if this state is a consistent state with a default action. Thus, detecting the absence of a lookahead is sufficient to determine that there is no unexpected or expected token to report. In that case, just report a simple "syntax error". - Don't assume there isn't a lookahead just because this state is a consistent state with a default action. There might have been a previous inconsistent state, consistent state with a non-default action, or user semantic action that manipulated yyla. (However, yyla is currently not documented for users.) - Of course, the expected token list depends on states to have correct lookahead information, and it depends on the parser not to perform extra reductions after fetching a lookahead from the scanner and before detecting a syntax error. Thus, state merging (from LALR or IELR) and default reductions corrupt the expected token list. However, the list is correct for canonical LR with one exception: it will still contain any token that will not be accepted due to an error action in a later state. */ if (!yyla.empty ()) { int yytoken = yyla.type_get (); yyarg[yycount++] = yytname_[yytoken]; int yyn = yypact_[yystate]; if (!yy_pact_value_is_default_ (yyn)) { /* Start YYX at -YYN if negative to avoid negative indexes in YYCHECK. In other words, skip the first -YYN actions for this state because they are default actions. */ int yyxbegin = yyn < 0 ? -yyn : 0; // Stay within bounds of both yycheck and yytname. int yychecklim = yylast_ - yyn + 1; int yyxend = yychecklim < yyntokens_ ? yychecklim : yyntokens_; for (int yyx = yyxbegin; yyx < yyxend; ++yyx) if (yycheck_[yyx + yyn] == yyx && yyx != yyterror_ && !yy_table_value_is_error_ (yytable_[yyx + yyn])) { if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) { yycount = 1; break; } else yyarg[yycount++] = yytname_[yyx]; } } } char const* yyformat = YY_NULLPTR; switch (yycount) { #define YYCASE_(N, S) \ case N: \ yyformat = S; \ break YYCASE_(0, YY_("syntax error")); YYCASE_(1, YY_("syntax error, unexpected %s")); YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s")); YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s")); YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s")); YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s")); #undef YYCASE_ } std::string yyres; // Argument number. size_t yyi = 0; for (char const* yyp = yyformat; *yyp; ++yyp) if (yyp[0] == '%' && yyp[1] == 's' && yyi < yycount) { yyres += yytnamerr_ (yyarg[yyi++]); ++yyp; } else yyres += *yyp; return yyres;]], [[ return YY_("syntax error");]])[ } const ]b4_int_type(b4_pact_ninf, b4_pact_ninf) b4_parser_class_name::yypact_ninf_ = b4_pact_ninf[; const ]b4_int_type(b4_table_ninf, b4_table_ninf) b4_parser_class_name::yytable_ninf_ = b4_table_ninf[; ]b4_parser_tables_define[ ]b4_token_table_if([], [[#if ]b4_api_PREFIX[DEBUG]])[ // YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. // First, the terminals, then, starting at \a yyntokens_, nonterminals. const char* const ]b4_parser_class_name[::yytname_[] = { ]b4_tname[ }; ]b4_token_table_if([[#if ]b4_api_PREFIX[DEBUG]])[ ]b4_integral_parser_table_define([rline], [b4_rline])[ // Print the state stack on the debug stream. void ]b4_parser_class_name[::yystack_print_ () { *yycdebug_ << "Stack now"; for (stack_type::const_iterator i = yystack_.begin (), i_end = yystack_.end (); i != i_end; ++i) *yycdebug_ << ' ' << i->state; *yycdebug_ << std::endl; } // Report on the debug stream that the rule \a yyrule is going to be reduced. void ]b4_parser_class_name[::yy_reduce_print_ (int yyrule) { unsigned int yylno = yyrline_[yyrule]; int yynrhs = yyr2_[yyrule]; // Print the symbols being reduced, and their result. *yycdebug_ << "Reducing stack by rule " << yyrule - 1 << " (line " << yylno << "):" << std::endl; // The symbols being reduced. for (int yyi = 0; yyi < yynrhs; yyi++) YY_SYMBOL_PRINT (" $" << yyi + 1 << " =", ]b4_rhs_data(yynrhs, yyi + 1)[); } #endif // ]b4_api_PREFIX[DEBUG ]b4_token_ctor_if([], [b4_yytranslate_define])[ ]b4_namespace_close[ ]b4_epilogue[]dnl b4_output_end() m4_popdef([b4_copyright_years])dnl PKd1]ڝggyacc.cnu[ -*- C -*- # Yacc compatible skeleton for Bison # Copyright (C) 1984, 1989-1990, 2000-2015 Free Software Foundation, # Inc. m4_pushdef([b4_copyright_years], [1984, 1989-1990, 2000-2015]) # 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 . # Check the value of %define api.push-pull. b4_percent_define_default([[api.push-pull]], [[pull]]) b4_percent_define_check_values([[[[api.push-pull]], [[pull]], [[push]], [[both]]]]) b4_define_flag_if([pull]) m4_define([b4_pull_flag], [[1]]) b4_define_flag_if([push]) m4_define([b4_push_flag], [[1]]) m4_case(b4_percent_define_get([[api.push-pull]]), [pull], [m4_define([b4_push_flag], [[0]])], [push], [m4_define([b4_pull_flag], [[0]])]) # Handle BISON_USE_PUSH_FOR_PULL for the test suite. So that push parsing # tests function as written, do not let BISON_USE_PUSH_FOR_PULL modify the # behavior of Bison at all when push parsing is already requested. b4_define_flag_if([use_push_for_pull]) b4_use_push_for_pull_if([ b4_push_if([m4_define([b4_use_push_for_pull_flag], [[0]])], [m4_define([b4_push_flag], [[1]])])]) # Check the value of %define parse.lac and friends, where LAC stands for # lookahead correction. b4_percent_define_default([[parse.lac]], [[none]]) b4_percent_define_default([[parse.lac.es-capacity-initial]], [[20]]) b4_percent_define_default([[parse.lac.memory-trace]], [[failures]]) b4_percent_define_check_values([[[[parse.lac]], [[full]], [[none]]]], [[[[parse.lac.memory-trace]], [[failures]], [[full]]]]) b4_define_flag_if([lac]) m4_define([b4_lac_flag], [m4_if(b4_percent_define_get([[parse.lac]]), [none], [[0]], [[1]])]) m4_include(b4_pkgdatadir/[c.m4]) ## ---------------- ## ## Default values. ## ## ---------------- ## # Stack parameters. m4_define_default([b4_stack_depth_max], [10000]) m4_define_default([b4_stack_depth_init], [200]) ## ------------------------ ## ## Pure/impure interfaces. ## ## ------------------------ ## b4_percent_define_default([[api.pure]], [[false]]) b4_percent_define_check_values([[[[api.pure]], [[false]], [[true]], [[]], [[full]]]]) m4_define([b4_pure_flag], [[0]]) m4_case(b4_percent_define_get([[api.pure]]), [false], [m4_define([b4_pure_flag], [[0]])], [true], [m4_define([b4_pure_flag], [[1]])], [], [m4_define([b4_pure_flag], [[1]])], [full], [m4_define([b4_pure_flag], [[2]])]) m4_define([b4_pure_if], [m4_case(b4_pure_flag, [0], [$2], [1], [$1], [2], [$1])]) [m4_fatal([invalid api.pure value: ]$1)])]) # b4_yyerror_arg_loc_if(ARG) # -------------------------- # Expand ARG iff yyerror is to be given a location as argument. m4_define([b4_yyerror_arg_loc_if], [b4_locations_if([m4_case(b4_pure_flag, [1], [m4_ifset([b4_parse_param], [$1])], [2], [$1])])]) # b4_yyerror_args # --------------- # Arguments passed to yyerror: user args plus yylloc. m4_define([b4_yyerror_args], [b4_yyerror_arg_loc_if([&yylloc, ])dnl m4_ifset([b4_parse_param], [b4_args(b4_parse_param), ])]) ## ------------ ## ## Data Types. ## ## ------------ ## # b4_int_type(MIN, MAX) # --------------------- # Return the smallest int type able to handle numbers ranging from # MIN to MAX (included). Overwrite the version from c.m4, which # uses only C89 types, so that the user can override the shorter # types, and so that pre-C89 compilers are handled correctly. m4_define([b4_int_type], [m4_if(b4_ints_in($@, [0], [255]), [1], [yytype_uint8], b4_ints_in($@, [-128], [127]), [1], [yytype_int8], b4_ints_in($@, [0], [65535]), [1], [yytype_uint16], b4_ints_in($@, [-32768], [32767]), [1], [yytype_int16], m4_eval([0 <= $1]), [1], [unsigned int], [int])]) ## ----------------- ## ## Semantic Values. ## ## ----------------- ## # b4_lhs_value([TYPE]) # -------------------- # Expansion of $$. m4_define([b4_lhs_value], [b4_symbol_value(yyval, [$1])]) # b4_rhs_value(RULE-LENGTH, NUM, [TYPE]) # -------------------------------------- # Expansion of $NUM, where the current rule has RULE-LENGTH # symbols on RHS. m4_define([b4_rhs_value], [b4_symbol_value([yyvsp@{b4_subtract([$2], [$1])@}], [$3])]) ## ----------- ## ## Locations. ## ## ----------- ## # b4_lhs_location() # ----------------- # Expansion of @$. m4_define([b4_lhs_location], [(yyloc)]) # b4_rhs_location(RULE-LENGTH, NUM) # --------------------------------- # Expansion of @NUM, where the current rule has RULE-LENGTH symbols # on RHS. m4_define([b4_rhs_location], [(yylsp@{b4_subtract([$2], [$1])@})]) ## -------------- ## ## Declarations. ## ## -------------- ## # b4_declare_scanner_communication_variables # ------------------------------------------ # Declare the variables that are global, or local to YYPARSE if # pure-parser. m4_define([b4_declare_scanner_communication_variables], [[ /* The lookahead symbol. */ int yychar; ]b4_pure_if([[ /* The semantic value of the lookahead symbol. */ /* Default value used for initialization, for pacifying older GCCs or non-GCC compilers. */ YY_INITIAL_VALUE (static YYSTYPE yyval_default;) YYSTYPE yylval YY_INITIAL_VALUE (= yyval_default);]b4_locations_if([[ /* Location data for the lookahead symbol. */ static YYLTYPE yyloc_default]b4_yyloc_default[; YYLTYPE yylloc = yyloc_default;]])], [[/* The semantic value of the lookahead symbol. */ YYSTYPE yylval;]b4_locations_if([[ /* Location data for the lookahead symbol. */ YYLTYPE yylloc]b4_yyloc_default[;]])[ /* Number of syntax errors so far. */ int yynerrs;]])]) # b4_declare_parser_state_variables # --------------------------------- # Declare all the variables that are needed to maintain the parser state # between calls to yypush_parse. m4_define([b4_declare_parser_state_variables], [b4_pure_if([[ /* Number of syntax errors so far. */ int yynerrs; ]])[ int yystate; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* The stacks and their tools: 'yyss': related to states. 'yyvs': related to semantic values.]b4_locations_if([[ 'yyls': related to locations.]])[ Refer to the stacks through separate pointers, to allow yyoverflow to reallocate them elsewhere. */ /* The state stack. */ yytype_int16 yyssa[YYINITDEPTH]; yytype_int16 *yyss; yytype_int16 *yyssp; /* The semantic value stack. */ YYSTYPE yyvsa[YYINITDEPTH]; YYSTYPE *yyvs; YYSTYPE *yyvsp;]b4_locations_if([[ /* The location stack. */ YYLTYPE yylsa[YYINITDEPTH]; YYLTYPE *yyls; YYLTYPE *yylsp; /* The locations where the error started and ended. */ YYLTYPE yyerror_range[3];]])[ YYSIZE_T yystacksize;]b4_lac_if([[ yytype_int16 yyesa@{]b4_percent_define_get([[parse.lac.es-capacity-initial]])[@}; yytype_int16 *yyes; YYSIZE_T yyes_capacity;]])]) # b4_declare_yyparse_push_ # ------------------------ # Declaration of yyparse (and dependencies) when using the push parser # (including in pull mode). m4_define([b4_declare_yyparse_push_], [[#ifndef YYPUSH_MORE_DEFINED # define YYPUSH_MORE_DEFINED enum { YYPUSH_MORE = 4 }; #endif typedef struct ]b4_prefix[pstate ]b4_prefix[pstate; ]b4_pull_if([b4_function_declare([b4_prefix[parse]], [[int]], b4_parse_param) ])b4_function_declare([b4_prefix[push_parse]], [[int]], [[b4_prefix[pstate *ps]], [[ps]]]b4_pure_if([, [[[int pushed_char]], [[pushed_char]]], [[b4_api_PREFIX[STYPE const *pushed_val]], [[pushed_val]]]b4_locations_if([, [[b4_api_PREFIX[LTYPE *pushed_loc]], [[pushed_loc]]]])])m4_ifset([b4_parse_param], [, b4_parse_param])) b4_pull_if([b4_function_declare([b4_prefix[pull_parse]], [[int]], [[b4_prefix[pstate *ps]], [[ps]]]m4_ifset([b4_parse_param], [, b4_parse_param]))]) b4_function_declare([b4_prefix[pstate_new]], [b4_prefix[pstate *]], [[[void]], []]) b4_function_declare([b4_prefix[pstate_delete]], [[void]], [[b4_prefix[pstate *ps]], [[ps]]])dnl ]) # b4_declare_yyparse_ # ------------------- # When not the push parser. m4_define([b4_declare_yyparse_], [b4_function_declare(b4_prefix[parse], [int], b4_parse_param)]) # b4_declare_yyparse # ------------------ m4_define([b4_declare_yyparse], [b4_push_if([b4_declare_yyparse_push_], [b4_declare_yyparse_])[]dnl ]) # b4_shared_declarations # ---------------------- # Declaration that might either go into the header (if --defines) # or open coded in the parser body. m4_define([b4_shared_declarations], [b4_cpp_guard_open([b4_spec_defines_file])[ ]b4_declare_yydebug[ ]b4_percent_code_get([[requires]])[ ]b4_token_enums_defines[ ]b4_declare_yylstype[ ]b4_declare_yyparse[ ]b4_percent_code_get([[provides]])[ ]b4_cpp_guard_close([b4_spec_defines_file])[]dnl ]) ## -------------- ## ## Output files. ## ## -------------- ## b4_output_begin([b4_parser_file_name]) b4_copyright([Bison implementation for Yacc-like parsers in C])[ /* C LALR(1) parser skeleton written by Richard Stallman, by simplifying the original so-called "semantic" parser. */ /* All symbols defined below should begin with yy or YY, to avoid infringing on user name space. This should be done even for local variables, as they might otherwise be expanded by user macros. There are some unavoidable exceptions within include files to define necessary library symbols; they are noted "INFRINGES ON USER NAME SPACE" below. */ ]b4_identification b4_percent_code_get([[top]])[]dnl m4_if(b4_api_prefix, [yy], [], [[/* Substitute the type names. */ #define YYSTYPE ]b4_api_PREFIX[STYPE]b4_locations_if([[ #define YYLTYPE ]b4_api_PREFIX[LTYPE]])])[ ]m4_if(b4_prefix, [yy], [], [[/* Substitute the variable and function names. */]b4_pull_if([[ #define yyparse ]b4_prefix[parse]])b4_push_if([[ #define yypush_parse ]b4_prefix[push_parse]b4_pull_if([[ #define yypull_parse ]b4_prefix[pull_parse]])[ #define yypstate_new ]b4_prefix[pstate_new #define yypstate_delete ]b4_prefix[pstate_delete #define yypstate ]b4_prefix[pstate]])[ #define yylex ]b4_prefix[lex #define yyerror ]b4_prefix[error #define yydebug ]b4_prefix[debug #define yynerrs ]b4_prefix[nerrs ]]b4_pure_if([], [[ #define yylval ]b4_prefix[lval #define yychar ]b4_prefix[char]b4_locations_if([[ #define yylloc ]b4_prefix[lloc]])]))[ /* Copy the first part of user declarations. */ ]b4_user_pre_prologue[ ]b4_null_define[ /* Enabling verbose error messages. */ #ifdef YYERROR_VERBOSE # undef YYERROR_VERBOSE # define YYERROR_VERBOSE 1 #else # define YYERROR_VERBOSE ]b4_error_verbose_if([1], [0])[ #endif ]m4_ifval(m4_quote(b4_spec_defines_file), [[/* In a future release of Bison, this section will be replaced by #include "@basename(]b4_spec_defines_file[@)". */ ]])dnl b4_shared_declarations[ /* Copy the second part of user declarations. */ ]b4_user_post_prologue b4_percent_code_get[]dnl [#ifdef short # undef short #endif #ifdef YYTYPE_UINT8 typedef YYTYPE_UINT8 yytype_uint8; #else typedef unsigned char yytype_uint8; #endif #ifdef YYTYPE_INT8 typedef YYTYPE_INT8 yytype_int8; #else typedef signed char yytype_int8; #endif #ifdef YYTYPE_UINT16 typedef YYTYPE_UINT16 yytype_uint16; #else typedef unsigned short int yytype_uint16; #endif #ifdef YYTYPE_INT16 typedef YYTYPE_INT16 yytype_int16; #else typedef short int yytype_int16; #endif #ifndef YYSIZE_T # ifdef __SIZE_TYPE__ # define YYSIZE_T __SIZE_TYPE__ # elif defined size_t # define YYSIZE_T size_t # elif ! defined YYSIZE_T # include /* INFRINGES ON USER NAME SPACE */ # define YYSIZE_T size_t # else # define YYSIZE_T unsigned int # endif #endif #define YYSIZE_MAXIMUM ((YYSIZE_T) -1) #ifndef YY_ # if defined YYENABLE_NLS && YYENABLE_NLS # if ENABLE_NLS # include /* INFRINGES ON USER NAME SPACE */ # define YY_(Msgid) dgettext ("bison-runtime", Msgid) # endif # endif # ifndef YY_ # define YY_(Msgid) Msgid # endif #endif ]b4_attribute_define[ #if ]b4_lac_if([[1]], [[! defined yyoverflow || YYERROR_VERBOSE]])[ /* The parser invokes alloca or malloc; define the necessary symbols. */]dnl b4_push_if([], [b4_lac_if([], [[ # ifdef YYSTACK_USE_ALLOCA # if YYSTACK_USE_ALLOCA # ifdef __GNUC__ # define YYSTACK_ALLOC __builtin_alloca # elif defined __BUILTIN_VA_ARG_INCR # include /* INFRINGES ON USER NAME SPACE */ # elif defined _AIX # define YYSTACK_ALLOC __alloca # elif defined _MSC_VER # include /* INFRINGES ON USER NAME SPACE */ # define alloca _alloca # else # define YYSTACK_ALLOC alloca # if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS # include /* INFRINGES ON USER NAME SPACE */ /* Use EXIT_SUCCESS as a witness for stdlib.h. */ # ifndef EXIT_SUCCESS # define EXIT_SUCCESS 0 # endif # endif # endif # endif # endif]])])[ # ifdef YYSTACK_ALLOC /* Pacify GCC's 'empty if-body' warning. */ # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) # ifndef YYSTACK_ALLOC_MAXIMUM /* The OS might guarantee only one guard page at the bottom of the stack, and a page size can be as small as 4096 bytes. So we cannot safely invoke alloca (N) if N exceeds 4096. Use a slightly smaller number to allow for a few compiler-allocated temporary stack slots. */ # define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */ # endif # else # define YYSTACK_ALLOC YYMALLOC # define YYSTACK_FREE YYFREE # ifndef YYSTACK_ALLOC_MAXIMUM # define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM # endif # if (defined __cplusplus && ! defined EXIT_SUCCESS \ && ! ((defined YYMALLOC || defined malloc) \ && (defined YYFREE || defined free))) # include /* INFRINGES ON USER NAME SPACE */ # ifndef EXIT_SUCCESS # define EXIT_SUCCESS 0 # endif # endif # ifndef YYMALLOC # define YYMALLOC malloc # if ! defined malloc && ! defined EXIT_SUCCESS void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ # endif # endif # ifndef YYFREE # define YYFREE free # if ! defined free && ! defined EXIT_SUCCESS void free (void *); /* INFRINGES ON USER NAME SPACE */ # endif # endif # endif]b4_lac_if([[ # define YYCOPY_NEEDED 1]])[ #endif]b4_lac_if([], [[ /* ! defined yyoverflow || YYERROR_VERBOSE */]])[ #if (! defined yyoverflow \ && (! defined __cplusplus \ || (]b4_locations_if([[defined ]b4_api_PREFIX[LTYPE_IS_TRIVIAL && ]b4_api_PREFIX[LTYPE_IS_TRIVIAL \ && ]])[defined ]b4_api_PREFIX[STYPE_IS_TRIVIAL && ]b4_api_PREFIX[STYPE_IS_TRIVIAL))) /* A type that is properly aligned for any stack member. */ union yyalloc { yytype_int16 yyss_alloc; YYSTYPE yyvs_alloc;]b4_locations_if([ YYLTYPE yyls_alloc;])[ }; /* The size of the maximum gap between one aligned stack and the next. */ # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) /* The size of an array large to enough to hold all stacks, each with N elements. */ ]b4_locations_if( [# define YYSTACK_BYTES(N) \ ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \ + 2 * YYSTACK_GAP_MAXIMUM)], [# define YYSTACK_BYTES(N) \ ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \ + YYSTACK_GAP_MAXIMUM)])[ # define YYCOPY_NEEDED 1 /* Relocate STACK from its old location to the new one. The local variables YYSIZE and YYSTACKSIZE give the old and new number of elements in the stack, and YYPTR gives the new location of the stack. Advance YYPTR to a properly aligned location for the next stack. */ # define YYSTACK_RELOCATE(Stack_alloc, Stack) \ do \ { \ YYSIZE_T yynewbytes; \ YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ Stack = &yyptr->Stack_alloc; \ yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ yyptr += yynewbytes / sizeof (*yyptr); \ } \ while (0) #endif #if defined YYCOPY_NEEDED && YYCOPY_NEEDED /* Copy COUNT objects from SRC to DST. The source and destination do not overlap. */ # ifndef YYCOPY # if defined __GNUC__ && 1 < __GNUC__ # define YYCOPY(Dst, Src, Count) \ __builtin_memcpy (Dst, Src, (Count) * sizeof (*(Src))) # else # define YYCOPY(Dst, Src, Count) \ do \ { \ YYSIZE_T yyi; \ for (yyi = 0; yyi < (Count); yyi++) \ (Dst)[yyi] = (Src)[yyi]; \ } \ while (0) # endif # endif #endif /* !YYCOPY_NEEDED */ /* YYFINAL -- State number of the termination state. */ #define YYFINAL ]b4_final_state_number[ /* YYLAST -- Last index in YYTABLE. */ #define YYLAST ]b4_last[ /* YYNTOKENS -- Number of terminals. */ #define YYNTOKENS ]b4_tokens_number[ /* YYNNTS -- Number of nonterminals. */ #define YYNNTS ]b4_nterms_number[ /* YYNRULES -- Number of rules. */ #define YYNRULES ]b4_rules_number[ /* YYNSTATES -- Number of states. */ #define YYNSTATES ]b4_states_number[ /* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned by yylex, with out-of-bounds checking. */ #define YYUNDEFTOK ]b4_undef_token_number[ #define YYMAXUTOK ]b4_user_token_number_max[ #define YYTRANSLATE(YYX) \ ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) /* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM as returned by yylex, without out-of-bounds checking. */ static const ]b4_int_type_for([b4_translate])[ yytranslate[] = { ]b4_translate[ }; #if ]b4_api_PREFIX[DEBUG ]b4_integral_parser_table_define([rline], [b4_rline], [[YYRLINE[YYN] -- Source line where rule number YYN was defined.]])[ #endif #if ]b4_api_PREFIX[DEBUG || YYERROR_VERBOSE || ]b4_token_table_flag[ /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. First, the terminals, then, starting at YYNTOKENS, nonterminals. */ static const char *const yytname[] = { ]b4_tname[ }; #endif # ifdef YYPRINT /* YYTOKNUM[NUM] -- (External) token number corresponding to the (internal) symbol number NUM (which must be that of a token). */ static const ]b4_int_type_for([b4_toknum])[ yytoknum[] = { ]b4_toknum[ }; # endif #define YYPACT_NINF ]b4_pact_ninf[ #define yypact_value_is_default(Yystate) \ ]b4_table_value_equals([[pact]], [[Yystate]], [b4_pact_ninf])[ #define YYTABLE_NINF ]b4_table_ninf[ #define yytable_value_is_error(Yytable_value) \ ]b4_table_value_equals([[table]], [[Yytable_value]], [b4_table_ninf])[ ]b4_parser_tables_define[ #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) #define YYEMPTY (-2) #define YYEOF 0 #define YYACCEPT goto yyacceptlab #define YYABORT goto yyabortlab #define YYERROR goto yyerrorlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY) \ { \ yychar = (Token); \ yylval = (Value); \ YYPOPSTACK (yylen); \ yystate = *yyssp; \]b4_lac_if([[ YY_LAC_DISCARD ("YYBACKUP"); \]])[ goto yybackup; \ } \ else \ { \ yyerror (]b4_yyerror_args[YY_("syntax error: cannot back up")); \ YYERROR; \ } \ while (0) /* Error token number */ #define YYTERROR 1 #define YYERRCODE 256 ]b4_locations_if([[ ]b4_yylloc_default_define[ #define YYRHSLOC(Rhs, K) ((Rhs)[K]) ]])[ /* Enable debugging if requested. */ #if ]b4_api_PREFIX[DEBUG # ifndef YYFPRINTF # include /* INFRINGES ON USER NAME SPACE */ # define YYFPRINTF fprintf # endif # define YYDPRINTF(Args) \ do { \ if (yydebug) \ YYFPRINTF Args; \ } while (0) ]b4_yy_location_print_define[ # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ do { \ if (yydebug) \ { \ YYFPRINTF (stderr, "%s ", Title); \ yy_symbol_print (stderr, \ Type, Value]b4_locations_if([, Location])[]b4_user_args[); \ YYFPRINTF (stderr, "\n"); \ } \ } while (0) ]b4_yy_symbol_print_define[ /*------------------------------------------------------------------. | yy_stack_print -- Print the state stack from its BOTTOM up to its | | TOP (included). | `------------------------------------------------------------------*/ ]b4_function_define([yy_stack_print], [static void], [[yytype_int16 *yybottom], [yybottom]], [[yytype_int16 *yytop], [yytop]])[ { YYFPRINTF (stderr, "Stack now"); for (; yybottom <= yytop; yybottom++) { int yybot = *yybottom; YYFPRINTF (stderr, " %d", yybot); } YYFPRINTF (stderr, "\n"); } # define YY_STACK_PRINT(Bottom, Top) \ do { \ if (yydebug) \ yy_stack_print ((Bottom), (Top)); \ } while (0) /*------------------------------------------------. | Report that the YYRULE is going to be reduced. | `------------------------------------------------*/ ]b4_function_define([yy_reduce_print], [static void], [[yytype_int16 *yyssp], [yyssp]], [[YYSTYPE *yyvsp], [yyvsp]], b4_locations_if([[[YYLTYPE *yylsp], [yylsp]], ])[[int yyrule], [yyrule]]m4_ifset([b4_parse_param], [, b4_parse_param]))[ { unsigned long int yylno = yyrline[yyrule]; int yynrhs = yyr2[yyrule]; int yyi; YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", yyrule - 1, yylno); /* The symbols being reduced. */ for (yyi = 0; yyi < yynrhs; yyi++) { YYFPRINTF (stderr, " $%d = ", yyi + 1); yy_symbol_print (stderr, yystos[yyssp[yyi + 1 - yynrhs]], &]b4_rhs_value(yynrhs, yyi + 1)[ ]b4_locations_if([, &]b4_rhs_location(yynrhs, yyi + 1))[]dnl b4_user_args[); YYFPRINTF (stderr, "\n"); } } # define YY_REDUCE_PRINT(Rule) \ do { \ if (yydebug) \ yy_reduce_print (yyssp, yyvsp, ]b4_locations_if([yylsp, ])[Rule]b4_user_args[); \ } while (0) /* Nonzero means print parse trace. It is left uninitialized so that multiple parsers can coexist. */ int yydebug; #else /* !]b4_api_PREFIX[DEBUG */ # define YYDPRINTF(Args) # define YY_SYMBOL_PRINT(Title, Type, Value, Location) # define YY_STACK_PRINT(Bottom, Top) # define YY_REDUCE_PRINT(Rule) #endif /* !]b4_api_PREFIX[DEBUG */ /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH ]b4_stack_depth_init[ #endif /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only if the built-in stack extension method is used). Do not make this value too large; the results are undefined if YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) evaluated with infinite-precision integer arithmetic. */ #ifndef YYMAXDEPTH # define YYMAXDEPTH ]b4_stack_depth_max[ #endif]b4_lac_if([[ /* Given a state stack such that *YYBOTTOM is its bottom, such that *YYTOP is either its top or is YYTOP_EMPTY to indicate an empty stack, and such that *YYCAPACITY is the maximum number of elements it can hold without a reallocation, make sure there is enough room to store YYADD more elements. If not, allocate a new stack using YYSTACK_ALLOC, copy the existing elements, and adjust *YYBOTTOM, *YYTOP, and *YYCAPACITY to reflect the new capacity and memory location. If *YYBOTTOM != YYBOTTOM_NO_FREE, then free the old stack using YYSTACK_FREE. Return 0 if successful or if no reallocation is required. Return 1 if memory is exhausted. */ static int yy_lac_stack_realloc (YYSIZE_T *yycapacity, YYSIZE_T yyadd, #if ]b4_api_PREFIX[DEBUG char const *yydebug_prefix, char const *yydebug_suffix, #endif yytype_int16 **yybottom, yytype_int16 *yybottom_no_free, yytype_int16 **yytop, yytype_int16 *yytop_empty) { YYSIZE_T yysize_old = *yytop == yytop_empty ? 0 : *yytop - *yybottom + 1; YYSIZE_T yysize_new = yysize_old + yyadd; if (*yycapacity < yysize_new) { YYSIZE_T yyalloc = 2 * yysize_new; yytype_int16 *yybottom_new; /* Use YYMAXDEPTH for maximum stack size given that the stack should never need to grow larger than the main state stack needs to grow without LAC. */ if (YYMAXDEPTH < yysize_new) { YYDPRINTF ((stderr, "%smax size exceeded%s", yydebug_prefix, yydebug_suffix)); return 1; } if (YYMAXDEPTH < yyalloc) yyalloc = YYMAXDEPTH; yybottom_new = (yytype_int16*) YYSTACK_ALLOC (yyalloc * sizeof *yybottom_new); if (!yybottom_new) { YYDPRINTF ((stderr, "%srealloc failed%s", yydebug_prefix, yydebug_suffix)); return 1; } if (*yytop != yytop_empty) { YYCOPY (yybottom_new, *yybottom, yysize_old); *yytop = yybottom_new + (yysize_old - 1); } if (*yybottom != yybottom_no_free) YYSTACK_FREE (*yybottom); *yybottom = yybottom_new; *yycapacity = yyalloc;]m4_if(b4_percent_define_get([[parse.lac.memory-trace]]), [full], [[ YYDPRINTF ((stderr, "%srealloc to %lu%s", yydebug_prefix, (unsigned long int) yyalloc, yydebug_suffix));]])[ } return 0; } /* Establish the initial context for the current lookahead if no initial context is currently established. We define a context as a snapshot of the parser stacks. We define the initial context for a lookahead as the context in which the parser initially examines that lookahead in order to select a syntactic action. Thus, if the lookahead eventually proves syntactically unacceptable (possibly in a later context reached via a series of reductions), the initial context can be used to determine the exact set of tokens that would be syntactically acceptable in the lookahead's place. Moreover, it is the context after which any further semantic actions would be erroneous because they would be determined by a syntactically unacceptable token. YY_LAC_ESTABLISH should be invoked when a reduction is about to be performed in an inconsistent state (which, for the purposes of LAC, includes consistent states that don't know they're consistent because their default reductions have been disabled). Iff there is a lookahead token, it should also be invoked before reporting a syntax error. This latter case is for the sake of the debugging output. For parse.lac=full, the implementation of YY_LAC_ESTABLISH is as follows. If no initial context is currently established for the current lookahead, then check if that lookahead can eventually be shifted if syntactic actions continue from the current context. Report a syntax error if it cannot. */ #define YY_LAC_ESTABLISH \ do { \ if (!yy_lac_established) \ { \ YYDPRINTF ((stderr, \ "LAC: initial context established for %s\n", \ yytname[yytoken])); \ yy_lac_established = 1; \ { \ int yy_lac_status = \ yy_lac (yyesa, &yyes, &yyes_capacity, yyssp, yytoken); \ if (yy_lac_status == 2) \ goto yyexhaustedlab; \ if (yy_lac_status == 1) \ goto yyerrlab; \ } \ } \ } while (0) /* Discard any previous initial lookahead context because of Event, which may be a lookahead change or an invalidation of the currently established initial context for the current lookahead. The most common example of a lookahead change is a shift. An example of both cases is syntax error recovery. That is, a syntax error occurs when the lookahead is syntactically erroneous for the currently established initial context, so error recovery manipulates the parser stacks to try to find a new initial context in which the current lookahead is syntactically acceptable. If it fails to find such a context, it discards the lookahead. */ #if ]b4_api_PREFIX[DEBUG # define YY_LAC_DISCARD(Event) \ do { \ if (yy_lac_established) \ { \ if (yydebug) \ YYFPRINTF (stderr, "LAC: initial context discarded due to " \ Event "\n"); \ yy_lac_established = 0; \ } \ } while (0) #else # define YY_LAC_DISCARD(Event) yy_lac_established = 0 #endif /* Given the stack whose top is *YYSSP, return 0 iff YYTOKEN can eventually (after perhaps some reductions) be shifted, return 1 if not, or return 2 if memory is exhausted. As preconditions and postconditions: *YYES_CAPACITY is the allocated size of the array to which *YYES points, and either *YYES = YYESA or *YYES points to an array allocated with YYSTACK_ALLOC. yy_lac may overwrite the contents of either array, alter *YYES and *YYES_CAPACITY, and free any old *YYES other than YYESA. */ static int yy_lac (yytype_int16 *yyesa, yytype_int16 **yyes, YYSIZE_T *yyes_capacity, yytype_int16 *yyssp, int yytoken) { yytype_int16 *yyes_prev = yyssp; yytype_int16 *yyesp = yyes_prev; YYDPRINTF ((stderr, "LAC: checking lookahead %s:", yytname[yytoken])); if (yytoken == YYUNDEFTOK) { YYDPRINTF ((stderr, " Always Err\n")); return 1; } while (1) { int yyrule = yypact[*yyesp]; if (yypact_value_is_default (yyrule) || (yyrule += yytoken) < 0 || YYLAST < yyrule || yycheck[yyrule] != yytoken) { yyrule = yydefact[*yyesp]; if (yyrule == 0) { YYDPRINTF ((stderr, " Err\n")); return 1; } } else { yyrule = yytable[yyrule]; if (yytable_value_is_error (yyrule)) { YYDPRINTF ((stderr, " Err\n")); return 1; } if (0 < yyrule) { YYDPRINTF ((stderr, " S%d\n", yyrule)); return 0; } yyrule = -yyrule; } { YYSIZE_T yylen = yyr2[yyrule]; YYDPRINTF ((stderr, " R%d", yyrule - 1)); if (yyesp != yyes_prev) { YYSIZE_T yysize = yyesp - *yyes + 1; if (yylen < yysize) { yyesp -= yylen; yylen = 0; } else { yylen -= yysize; yyesp = yyes_prev; } } if (yylen) yyesp = yyes_prev -= yylen; } { int yystate; { int yylhs = yyr1[yyrule] - YYNTOKENS; yystate = yypgoto[yylhs] + *yyesp; if (yystate < 0 || YYLAST < yystate || yycheck[yystate] != *yyesp) yystate = yydefgoto[yylhs]; else yystate = yytable[yystate]; } if (yyesp == yyes_prev) { yyesp = *yyes; *yyesp = yystate; } else { if (yy_lac_stack_realloc (yyes_capacity, 1, #if ]b4_api_PREFIX[DEBUG " (", ")", #endif yyes, yyesa, &yyesp, yyes_prev)) { YYDPRINTF ((stderr, "\n")); return 2; } *++yyesp = yystate; } YYDPRINTF ((stderr, " G%d", yystate)); } } }]])[ #if YYERROR_VERBOSE # ifndef yystrlen # if defined __GLIBC__ && defined _STRING_H # define yystrlen strlen # else /* Return the length of YYSTR. */ ]b4_function_define([yystrlen], [static YYSIZE_T], [[const char *yystr], [yystr]])[ { YYSIZE_T yylen; for (yylen = 0; yystr[yylen]; yylen++) continue; return yylen; } # endif # endif # ifndef yystpcpy # if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE # define yystpcpy stpcpy # else /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in YYDEST. */ ]b4_function_define([yystpcpy], [static char *], [[char *yydest], [yydest]], [[const char *yysrc], [yysrc]])[ { char *yyd = yydest; const char *yys = yysrc; while ((*yyd++ = *yys++) != '\0') continue; return yyd - 1; } # endif # endif # ifndef yytnamerr /* Copy to YYRES the contents of YYSTR after stripping away unnecessary quotes and backslashes, so that it's suitable for yyerror. The heuristic is that double-quoting is unnecessary unless the string contains an apostrophe, a comma, or backslash (other than backslash-backslash). YYSTR is taken from yytname. If YYRES is null, do not copy; instead, return the length of what the result would have been. */ static YYSIZE_T yytnamerr (char *yyres, const char *yystr) { if (*yystr == '"') { YYSIZE_T yyn = 0; char const *yyp = yystr; for (;;) switch (*++yyp) { case '\'': case ',': goto do_not_strip_quotes; case '\\': if (*++yyp != '\\') goto do_not_strip_quotes; /* Fall through. */ default: if (yyres) yyres[yyn] = *yyp; yyn++; break; case '"': if (yyres) yyres[yyn] = '\0'; return yyn; } do_not_strip_quotes: ; } if (! yyres) return yystrlen (yystr); return yystpcpy (yyres, yystr) - yyres; } # endif /* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message about the unexpected token YYTOKEN for the state stack whose top is YYSSP.]b4_lac_if([[ In order to see if a particular token T is a valid looakhead, invoke yy_lac (YYESA, YYES, YYES_CAPACITY, YYSSP, T).]])[ Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is not large enough to hold the message. In that case, also set *YYMSG_ALLOC to the required number of bytes. Return 2 if the required number of bytes is too large to store]b4_lac_if([[ or if yy_lac returned 2]])[. */ static int yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg, ]b4_lac_if([[yytype_int16 *yyesa, yytype_int16 **yyes, YYSIZE_T *yyes_capacity, ]])[yytype_int16 *yyssp, int yytoken) { YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]); YYSIZE_T yysize = yysize0; enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; /* Internationalized format string. */ const char *yyformat = YY_NULLPTR; /* Arguments of yyformat. */ char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; /* Number of reported tokens (one for the "unexpected", one per "expected"). */ int yycount = 0; /* There are many possibilities here to consider: - If this state is a consistent state with a default action, then the only way this function was invoked is if the default action is an error action. In that case, don't check for expected tokens because there are none. - The only way there can be no lookahead present (in yychar) is if this state is a consistent state with a default action. Thus, detecting the absence of a lookahead is sufficient to determine that there is no unexpected or expected token to report. In that case, just report a simple "syntax error". - Don't assume there isn't a lookahead just because this state is a consistent state with a default action. There might have been a previous inconsistent state, consistent state with a non-default action, or user semantic action that manipulated yychar.]b4_lac_if([[ In the first two cases, it might appear that the current syntax error should have been detected in the previous state when yy_lac was invoked. However, at that time, there might have been a different syntax error that discarded a different initial context during error recovery, leaving behind the current lookahead.]], [[ - Of course, the expected token list depends on states to have correct lookahead information, and it depends on the parser not to perform extra reductions after fetching a lookahead from the scanner and before detecting a syntax error. Thus, state merging (from LALR or IELR) and default reductions corrupt the expected token list. However, the list is correct for canonical LR with one exception: it will still contain any token that will not be accepted due to an error action in a later state.]])[ */ if (yytoken != YYEMPTY) { int yyn = yypact[*yyssp];]b4_lac_if([[ YYDPRINTF ((stderr, "Constructing syntax error message\n"));]])[ yyarg[yycount++] = yytname[yytoken]; if (!yypact_value_is_default (yyn)) {]b4_lac_if([], [[ /* Start YYX at -YYN if negative to avoid negative indexes in YYCHECK. In other words, skip the first -YYN actions for this state because they are default actions. */ int yyxbegin = yyn < 0 ? -yyn : 0; /* Stay within bounds of both yycheck and yytname. */ int yychecklim = YYLAST - yyn + 1; int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;]])[ int yyx;]b4_lac_if([[ for (yyx = 0; yyx < YYNTOKENS; ++yyx) if (yyx != YYTERROR && yyx != YYUNDEFTOK) { { int yy_lac_status = yy_lac (yyesa, yyes, yyes_capacity, yyssp, yyx); if (yy_lac_status == 2) return 2; if (yy_lac_status == 1) continue; }]], [[ for (yyx = yyxbegin; yyx < yyxend; ++yyx) if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR && !yytable_value_is_error (yytable[yyx + yyn])) {]])[ if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) { yycount = 1; yysize = yysize0; break; } yyarg[yycount++] = yytname[yyx]; { YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]); if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) return 2; yysize = yysize1; } } }]b4_lac_if([[ # if ]b4_api_PREFIX[DEBUG else if (yydebug) YYFPRINTF (stderr, "No expected tokens.\n"); # endif]])[ } switch (yycount) { # define YYCASE_(N, S) \ case N: \ yyformat = S; \ break YYCASE_(0, YY_("syntax error")); YYCASE_(1, YY_("syntax error, unexpected %s")); YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s")); YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s")); YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s")); YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s")); # undef YYCASE_ } { YYSIZE_T yysize1 = yysize + yystrlen (yyformat); if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) return 2; yysize = yysize1; } if (*yymsg_alloc < yysize) { *yymsg_alloc = 2 * yysize; if (! (yysize <= *yymsg_alloc && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM)) *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM; return 1; } /* Avoid sprintf, as that infringes on the user's name space. Don't have undefined behavior even if the translation produced a string with the wrong number of "%s"s. */ { char *yyp = *yymsg; int yyi = 0; while ((*yyp = *yyformat) != '\0') if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount) { yyp += yytnamerr (yyp, yyarg[yyi++]); yyformat += 2; } else { yyp++; yyformat++; } } return 0; } #endif /* YYERROR_VERBOSE */ ]b4_yydestruct_define[ ]b4_pure_if([], [ b4_declare_scanner_communication_variables])[]b4_push_if([[ struct yypstate {]b4_declare_parser_state_variables[ /* Used to determine if this is the first time this instance has been used. */ int yynew; };]b4_pure_if([], [[ static char yypstate_allocated = 0;]])b4_pull_if([ b4_function_define([[yyparse]], [[int]], b4_parse_param)[ { return yypull_parse (YY_NULLPTR]m4_ifset([b4_parse_param], [[, ]b4_args(b4_parse_param)])[); } ]b4_function_define([[yypull_parse]], [[int]], [[[yypstate *yyps]], [[yyps]]]m4_ifset([b4_parse_param], [, b4_parse_param]))[ { int yystatus; yypstate *yyps_local;]b4_pure_if([[ int yychar; YYSTYPE yylval;]b4_locations_if([[ static YYLTYPE yyloc_default][]b4_yyloc_default[; YYLTYPE yylloc = yyloc_default;]])])[ if (yyps) yyps_local = yyps; else { yyps_local = yypstate_new (); if (!yyps_local) {]b4_pure_if([[ yyerror (]b4_yyerror_args[YY_("memory exhausted"));]], [[ if (!yypstate_allocated) yyerror (]b4_yyerror_args[YY_("memory exhausted"));]])[ return 2; } } do { yychar = ]b4_lex[; yystatus = yypush_parse (yyps_local]b4_pure_if([[, yychar, &yylval]b4_locations_if([[, &yylloc]])])m4_ifset([b4_parse_param], [, b4_args(b4_parse_param)])[); } while (yystatus == YYPUSH_MORE); if (!yyps) yypstate_delete (yyps_local); return yystatus; }]])[ /* Initialize the parser data structure. */ ]b4_function_define([[yypstate_new]], [[yypstate *]])[ { yypstate *yyps;]b4_pure_if([], [[ if (yypstate_allocated) return YY_NULLPTR;]])[ yyps = (yypstate *) malloc (sizeof *yyps); if (!yyps) return YY_NULLPTR; yyps->yynew = 1;]b4_pure_if([], [[ yypstate_allocated = 1;]])[ return yyps; } ]b4_function_define([[yypstate_delete]], [[void]], [[[yypstate *yyps]], [[yyps]]])[ { #ifndef yyoverflow /* If the stack was reallocated but the parse did not complete, then the stack still needs to be freed. */ if (!yyps->yynew && yyps->yyss != yyps->yyssa) YYSTACK_FREE (yyps->yyss); #endif]b4_lac_if([[ if (!yyps->yynew && yyps->yyes != yyps->yyesa) YYSTACK_FREE (yyps->yyes);]])[ free (yyps);]b4_pure_if([], [[ yypstate_allocated = 0;]])[ } ]b4_pure_if([[ #define ]b4_prefix[nerrs yyps->]b4_prefix[nerrs]])[ #define yystate yyps->yystate #define yyerrstatus yyps->yyerrstatus #define yyssa yyps->yyssa #define yyss yyps->yyss #define yyssp yyps->yyssp #define yyvsa yyps->yyvsa #define yyvs yyps->yyvs #define yyvsp yyps->yyvsp]b4_locations_if([[ #define yylsa yyps->yylsa #define yyls yyps->yyls #define yylsp yyps->yylsp #define yyerror_range yyps->yyerror_range]])[ #define yystacksize yyps->yystacksize]b4_lac_if([[ #define yyesa yyps->yyesa #define yyes yyps->yyes #define yyes_capacity yyps->yyes_capacity]])[ /*---------------. | yypush_parse. | `---------------*/ ]b4_function_define([[yypush_parse]], [[int]], [[[yypstate *yyps]], [[yyps]]]b4_pure_if([, [[[int yypushed_char]], [[yypushed_char]]], [[[YYSTYPE const *yypushed_val]], [[yypushed_val]]]b4_locations_if([, [[[YYLTYPE *yypushed_loc]], [[yypushed_loc]]]])])m4_ifset([b4_parse_param], [, b4_parse_param]))], [[ /*----------. | yyparse. | `----------*/ ]b4_function_define([yyparse], [int], b4_parse_param)])[ {]b4_pure_if([b4_declare_scanner_communication_variables ])b4_push_if([b4_pure_if([], [[ int yypushed_char = yychar; YYSTYPE yypushed_val = yylval;]b4_locations_if([[ YYLTYPE yypushed_loc = yylloc;]]) ])], [b4_declare_parser_state_variables ])b4_lac_if([[ int yy_lac_established = 0;]])[ int yyn; int yyresult; /* Lookahead token as an internal (translated) token number. */ int yytoken = 0; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval;]b4_locations_if([[ YYLTYPE yyloc;]])[ #if YYERROR_VERBOSE /* Buffer for error messages, and its allocated size. */ char yymsgbuf[128]; char *yymsg = yymsgbuf; YYSIZE_T yymsg_alloc = sizeof yymsgbuf; #endif #define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N)]b4_locations_if([, yylsp -= (N)])[) /* The number of symbols on the RHS of the reduced rule. Keep to zero when no symbol should be popped. */ int yylen = 0;]b4_push_if([[ if (!yyps->yynew) { yyn = yypact[yystate]; goto yyread_pushed_token; }]])[ yyssp = yyss = yyssa; yyvsp = yyvs = yyvsa;]b4_locations_if([[ yylsp = yyls = yylsa;]])[ yystacksize = YYINITDEPTH;]b4_lac_if([[ yyes = yyesa; yyes_capacity = sizeof yyesa / sizeof *yyes; if (YYMAXDEPTH < yyes_capacity) yyes_capacity = YYMAXDEPTH;]])[ YYDPRINTF ((stderr, "Starting parse\n")); yystate = 0; yyerrstatus = 0; yynerrs = 0; yychar = YYEMPTY; /* Cause a token to be read. */ ]m4_ifdef([b4_initial_action], [ b4_dollar_pushdef([m4_define([b4_dollar_dollar_used])yylval], [], [b4_push_if([b4_pure_if([*])yypushed_loc], [yylloc])])dnl /* User initialization code. */ b4_user_initial_action b4_dollar_popdef[]dnl m4_ifdef([b4_dollar_dollar_used],[[ yyvsp[0] = yylval; ]])])dnl b4_locations_if([[ yylsp[0] = ]b4_push_if([b4_pure_if([*])yypushed_loc], [yylloc])[; ]])dnl [ goto yysetstate; /*------------------------------------------------------------. | yynewstate -- Push a new state, which is found in yystate. | `------------------------------------------------------------*/ yynewstate: /* In all cases, when you get here, the value and location stacks have just been pushed. So pushing a state here evens the stacks. */ yyssp++; yysetstate: *yyssp = yystate; if (yyss + yystacksize - 1 <= yyssp) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; #ifdef yyoverflow { /* Give user a chance to reallocate the stack. Use copies of these so that the &'s don't force the real ones into memory. */ YYSTYPE *yyvs1 = yyvs; yytype_int16 *yyss1 = yyss;]b4_locations_if([ YYLTYPE *yyls1 = yyls;])[ /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. This used to be a conditional around just the two extra args, but that might be undefined if yyoverflow is a macro. */ yyoverflow (YY_("memory exhausted"), &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp),]b4_locations_if([ &yyls1, yysize * sizeof (*yylsp),])[ &yystacksize); ]b4_locations_if([ yyls = yyls1;])[ yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ # ifndef YYSTACK_RELOCATE goto yyexhaustedlab; # else /* Extend the stack our own way. */ if (YYMAXDEPTH <= yystacksize) goto yyexhaustedlab; yystacksize *= 2; if (YYMAXDEPTH < yystacksize) yystacksize = YYMAXDEPTH; { yytype_int16 *yyss1 = yyss; union yyalloc *yyptr = (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyexhaustedlab; YYSTACK_RELOCATE (yyss_alloc, yyss); YYSTACK_RELOCATE (yyvs_alloc, yyvs);]b4_locations_if([ YYSTACK_RELOCATE (yyls_alloc, yyls);])[ # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } # endif #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1;]b4_locations_if([ yylsp = yyls + yysize - 1;])[ YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); if (yyss + yystacksize - 1 <= yyssp) YYABORT; } YYDPRINTF ((stderr, "Entering state %d\n", yystate)); if (yystate == YYFINAL) YYACCEPT; goto yybackup; /*-----------. | yybackup. | `-----------*/ yybackup: /* Do appropriate processing given the current state. Read a lookahead token if we need one and don't already have one. */ /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; if (yypact_value_is_default (yyn)) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ if (yychar == YYEMPTY) {]b4_push_if([[ if (!yyps->yynew) {]b4_use_push_for_pull_if([], [[ YYDPRINTF ((stderr, "Return for a new token:\n"));]])[ yyresult = YYPUSH_MORE; goto yypushreturn; } yyps->yynew = 0;]b4_pure_if([], [[ /* Restoring the pushed token is only necessary for the first yypush_parse invocation since subsequent invocations don't overwrite it before jumping to yyread_pushed_token. */ yychar = yypushed_char; yylval = yypushed_val;]b4_locations_if([[ yylloc = yypushed_loc;]])])[ yyread_pushed_token:]])[ YYDPRINTF ((stderr, "Reading a token: "));]b4_push_if([b4_pure_if([[ yychar = yypushed_char; if (yypushed_val) yylval = *yypushed_val;]b4_locations_if([[ if (yypushed_loc) yylloc = *yypushed_loc;]])])], [[ yychar = ]b4_lex[;]])[ } if (yychar <= YYEOF) { yychar = yytoken = YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else { yytoken = YYTRANSLATE (yychar); YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); } /* If the proper action on seeing token YYTOKEN is to reduce or to detect an error, take that action. */ yyn += yytoken; if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)]b4_lac_if([[ { YY_LAC_ESTABLISH; goto yydefault; }]], [[ goto yydefault;]])[ yyn = yytable[yyn]; if (yyn <= 0) { if (yytable_value_is_error (yyn)) goto yyerrlab;]b4_lac_if([[ YY_LAC_ESTABLISH;]])[ yyn = -yyn; goto yyreduce; } /* Count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus) yyerrstatus--; /* Shift the lookahead token. */ YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); /* Discard the shifted token. */ yychar = YYEMPTY;]b4_lac_if([[ YY_LAC_DISCARD ("shift");]])[ yystate = yyn; YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN *++yyvsp = yylval; YY_IGNORE_MAYBE_UNINITIALIZED_END ]b4_locations_if([ *++yylsp = yylloc;])[ goto yynewstate; /*-----------------------------------------------------------. | yydefault -- do the default action for the current state. | `-----------------------------------------------------------*/ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; goto yyreduce; /*-----------------------------. | yyreduce -- Do a reduction. | `-----------------------------*/ yyreduce: /* yyn is the number of a rule to reduce with. */ yylen = yyr2[yyn]; /* If YYLEN is nonzero, implement the default value of the action: '$$ = $1'. Otherwise, the following line sets YYVAL to garbage. This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; ]b4_locations_if( [[ /* Default location. */ YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);]])[ YY_REDUCE_PRINT (yyn);]b4_lac_if([[ { int yychar_backup = yychar; switch (yyn) { ]b4_user_actions[ default: break; } if (yychar_backup != yychar) YY_LAC_DISCARD ("yychar change"); }]], [[ switch (yyn) { ]b4_user_actions[ default: break; }]])[ /* User semantic actions sometimes alter yychar, and that requires that yytoken be updated with the new translation. We take the approach of translating immediately before every use of yytoken. One alternative is translating here after every semantic action, but that translation would be missed if the semantic action invokes YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an incorrect destructor might then be invoked immediately. In the case of YYERROR or YYBACKUP, subsequent parser actions might lead to an incorrect destructor call or verbose syntax error message before the lookahead is translated. */ YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); YYPOPSTACK (yylen); yylen = 0; YY_STACK_PRINT (yyss, yyssp); *++yyvsp = yyval;]b4_locations_if([ *++yylsp = yyloc;])[ /* Now 'shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule number reduced by. */ yyn = yyr1[yyn]; yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else yystate = yydefgoto[yyn - YYNTOKENS]; goto yynewstate; /*--------------------------------------. | yyerrlab -- here on detecting error. | `--------------------------------------*/ yyerrlab: /* Make sure we have latest lookahead translation. See comments at user semantic actions for why this is necessary. */ yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar); /* If not already recovering from an error, report this error. */ if (!yyerrstatus) { ++yynerrs; #if ! YYERROR_VERBOSE yyerror (]b4_yyerror_args[YY_("syntax error")); #else # define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \]b4_lac_if([[ yyesa, &yyes, &yyes_capacity, \]])[ yyssp, yytoken) { char const *yymsgp = YY_("syntax error"); int yysyntax_error_status;]b4_lac_if([[ if (yychar != YYEMPTY) YY_LAC_ESTABLISH;]])[ yysyntax_error_status = YYSYNTAX_ERROR; if (yysyntax_error_status == 0) yymsgp = yymsg; else if (yysyntax_error_status == 1) { if (yymsg != yymsgbuf) YYSTACK_FREE (yymsg); yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc); if (!yymsg) { yymsg = yymsgbuf; yymsg_alloc = sizeof yymsgbuf; yysyntax_error_status = 2; } else { yysyntax_error_status = YYSYNTAX_ERROR; yymsgp = yymsg; } } yyerror (]b4_yyerror_args[yymsgp); if (yysyntax_error_status == 2) goto yyexhaustedlab; } # undef YYSYNTAX_ERROR #endif } ]b4_locations_if([[ yyerror_range[1] = yylloc;]])[ if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ if (yychar <= YYEOF) { /* Return failure if at end of input. */ if (yychar == YYEOF) YYABORT; } else { yydestruct ("Error: discarding", yytoken, &yylval]b4_locations_if([, &yylloc])[]b4_user_args[); yychar = YYEMPTY; } } /* Else will try to reuse lookahead token after shifting the error token. */ goto yyerrlab1; /*---------------------------------------------------. | yyerrorlab -- error raised explicitly by YYERROR. | `---------------------------------------------------*/ yyerrorlab: /* Pacify compilers like GCC when the user code never invokes YYERROR and the label yyerrorlab therefore never appears in user code. */ if (/*CONSTCOND*/ 0) goto yyerrorlab; ]b4_locations_if([[ yyerror_range[1] = yylsp[1-yylen]; ]])[ /* Do not reclaim the symbols of the rule whose action triggered this YYERROR. */ YYPOPSTACK (yylen); yylen = 0; YY_STACK_PRINT (yyss, yyssp); yystate = *yyssp; goto yyerrlab1; /*-------------------------------------------------------------. | yyerrlab1 -- common code for both syntax error and YYERROR. | `-------------------------------------------------------------*/ yyerrlab1: yyerrstatus = 3; /* Each real token shifted decrements this. */ for (;;) { yyn = yypact[yystate]; if (!yypact_value_is_default (yyn)) { yyn += YYTERROR; if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) { yyn = yytable[yyn]; if (0 < yyn) break; } } /* Pop the current state because it cannot handle the error token. */ if (yyssp == yyss) YYABORT; ]b4_locations_if([[ yyerror_range[1] = *yylsp;]])[ yydestruct ("Error: popping", yystos[yystate], yyvsp]b4_locations_if([, yylsp])[]b4_user_args[); YYPOPSTACK (1); yystate = *yyssp; YY_STACK_PRINT (yyss, yyssp); }]b4_lac_if([[ /* If the stack popping above didn't lose the initial context for the current lookahead token, the shift below will for sure. */ YY_LAC_DISCARD ("error recovery");]])[ YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN *++yyvsp = yylval; YY_IGNORE_MAYBE_UNINITIALIZED_END ]b4_locations_if([[ yyerror_range[2] = yylloc; /* Using YYLLOC is tempting, but would change the location of the lookahead. YYLOC is available though. */ YYLLOC_DEFAULT (yyloc, yyerror_range, 2); *++yylsp = yyloc;]])[ /* Shift the error token. */ YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); yystate = yyn; goto yynewstate; /*-------------------------------------. | yyacceptlab -- YYACCEPT comes here. | `-------------------------------------*/ yyacceptlab: yyresult = 0; goto yyreturn; /*-----------------------------------. | yyabortlab -- YYABORT comes here. | `-----------------------------------*/ yyabortlab: yyresult = 1; goto yyreturn; #if ]b4_lac_if([[1]], [[!defined yyoverflow || YYERROR_VERBOSE]])[ /*-------------------------------------------------. | yyexhaustedlab -- memory exhaustion comes here. | `-------------------------------------------------*/ yyexhaustedlab: yyerror (]b4_yyerror_args[YY_("memory exhausted")); yyresult = 2; /* Fall through. */ #endif yyreturn: if (yychar != YYEMPTY) { /* Make sure we have latest lookahead translation. See comments at user semantic actions for why this is necessary. */ yytoken = YYTRANSLATE (yychar); yydestruct ("Cleanup: discarding lookahead", yytoken, &yylval]b4_locations_if([, &yylloc])[]b4_user_args[); } /* Do not reclaim the symbols of the rule whose action triggered this YYABORT or YYACCEPT. */ YYPOPSTACK (yylen); YY_STACK_PRINT (yyss, yyssp); while (yyssp != yyss) { yydestruct ("Cleanup: popping", yystos[*yyssp], yyvsp]b4_locations_if([, yylsp])[]b4_user_args[); YYPOPSTACK (1); } #ifndef yyoverflow if (yyss != yyssa) YYSTACK_FREE (yyss); #endif]b4_lac_if([[ if (yyes != yyesa) YYSTACK_FREE (yyes);]])b4_push_if([[ yyps->yynew = 1; yypushreturn:]])[ #if YYERROR_VERBOSE if (yymsg != yymsgbuf) YYSTACK_FREE (yymsg); #endif return yyresult; } ]b4_epilogue[]dnl b4_output_end() b4_defines_if( [b4_output_begin([b4_spec_defines_file])[ ]b4_copyright([Bison interface for Yacc-like parsers in C])[ ]b4_shared_declarations[ ]b4_output_end() ])# b4_defines_if PKd1]_xx c-skel.m4nu[ -*- Autoconf -*- # C skeleton dispatching for Bison. # Copyright (C) 2006-2007, 2009-2015 Free Software Foundation, Inc. # 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 . b4_glr_if( [m4_define([b4_used_skeleton], [b4_pkgdatadir/[glr.c]])]) b4_nondeterministic_if([m4_define([b4_used_skeleton], [b4_pkgdatadir/[glr.c]])]) m4_define_default([b4_used_skeleton], [b4_pkgdatadir/[yacc.c]]) m4_define_default([b4_skeleton], ["b4_basename(b4_used_skeleton)"]) m4_include(b4_used_skeleton) PKd1]T67 c-like.m4nu[ -*- Autoconf -*- # Common code for C-like languages (C, C++, Java, etc.) # Copyright (C) 2012-2015 Free Software Foundation, Inc. # 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 . # b4_comment_(TEXT, OPEN, CONTINUE, END) # -------------------------------------- # Put TEXT in comment. Avoid trailing spaces: don't indent empty lines. # Avoid adding indentation to the first line, as the indentation comes # from OPEN. That's why we don't patsubst([$1], [^\(.\)], [ \1]). # # Prefix all the output lines with PREFIX. m4_define([b4_comment_], [$2[]m4_bpatsubst(m4_expand([[$1]]), [ \(.\)], [ $3\1])$4]) # b4_comment(TEXT, [PREFIX]) # -------------------------- # Put TEXT in comment. Prefix all the output lines with PREFIX. m4_define([b4_comment], [b4_comment_([$1], [$2/* ], [$2 ], [ */])]) # b4_dollar_dollar_(VALUE, FIELD, DEFAULT-FIELD) # ---------------------------------------------- # If FIELD (or DEFAULT-FIELD) is non-null, return "VALUE.FIELD", # otherwise just VALUE. Be sure to pass "(VALUE)" is VALUE is a # pointer. m4_define([b4_dollar_dollar_], [b4_symbol_value([$1], m4_if([$2], [[]], [[$3]], [[$2]]))]) # b4_dollar_pushdef(VALUE-POINTER, DEFAULT-FIELD, LOCATION) # b4_dollar_popdef # --------------------------------------------------------- # Define b4_dollar_dollar for VALUE and DEFAULT-FIELD, # and b4_at_dollar for LOCATION. m4_define([b4_dollar_pushdef], [m4_pushdef([b4_dollar_dollar], [b4_dollar_dollar_([$1], m4_dquote($][1), [$2])])dnl m4_pushdef([b4_at_dollar], [$3])dnl ]) m4_define([b4_dollar_popdef], [m4_popdef([b4_at_dollar])dnl m4_popdef([b4_dollar_dollar])dnl ]) PKd1]3s. # Sanity checks, before defaults installed by c.m4. b4_percent_define_ifdef([[api.value.union.name]], [b4_complain_at(b4_percent_define_get_loc([[api.value.union.name]]), [named %union is invalid in C++])]) m4_include(b4_pkgdatadir/[c.m4]) # b4_comment(TEXT, [PREFIX]) # -------------------------- # Put TEXT in comment. Prefix all the output lines with PREFIX. m4_define([b4_comment], [b4_comment_([$1], [$2// ], [$2// ])]) ## -------- ## ## Checks. ## ## -------- ## b4_percent_define_check_kind([api.namespace], [code], [deprecated]) b4_percent_define_check_kind([parser_class_name], [code], [deprecated]) ## ---------------- ## ## Default values. ## ## ---------------- ## b4_percent_define_default([[parser_class_name]], [[parser]]) # Don't do that so that we remember whether we're using a user # request, or the default value. # # b4_percent_define_default([[api.location.type]], [[location]]) b4_percent_define_default([[filename_type]], [[std::string]]) # Make it a warning for those who used betas of Bison 3.0. b4_percent_define_default([[api.namespace]], m4_defn([b4_prefix])) b4_percent_define_default([[global_tokens_and_yystype]], [[false]]) b4_percent_define_default([[define_location_comparison]], [m4_if(b4_percent_define_get([[filename_type]]), [std::string], [[true]], [[false]])]) ## ----------- ## ## Namespace. ## ## ----------- ## m4_define([b4_namespace_ref], [b4_percent_define_get([[api.namespace]])]) # Don't permit an empty b4_namespace_ref. Any '::parser::foo' appended to it # would compile as an absolute reference with 'parser' in the global namespace. # b4_namespace_open would open an anonymous namespace and thus establish # internal linkage. This would compile. However, it's cryptic, and internal # linkage for the parser would be specified in all translation units that # include the header, which is always generated. If we ever need to permit # internal linkage somehow, surely we can find a cleaner approach. m4_if(m4_bregexp(b4_namespace_ref, [^[ ]*$]), [-1], [], [b4_complain_at(b4_percent_define_get_loc([[api.namespace]]), [[namespace reference is empty]])]) # Instead of assuming the C++ compiler will do it, Bison should reject any # invalid b4_namepsace_ref that would be converted to a valid # b4_namespace_open. The problem is that Bison doesn't always output # b4_namespace_ref to uncommented code but should reserve the ability to do so # in future releases without risking breaking any existing user grammars. # Specifically, don't allow empty names as b4_namespace_open would just convert # those into anonymous namespaces, and that might tempt some users. m4_if(m4_bregexp(b4_namespace_ref, [::[ ]*::]), [-1], [], [b4_complain_at(b4_percent_define_get_loc([[api.namespace]]), [[namespace reference has consecutive "::"]])]) m4_if(m4_bregexp(b4_namespace_ref, [::[ ]*$]), [-1], [], [b4_complain_at(b4_percent_define_get_loc([[api.namespace]]), [[namespace reference has a trailing "::"]])]) m4_define([b4_namespace_open], [b4_user_code([b4_percent_define_get_syncline([[api.namespace]]) [namespace ]m4_bpatsubst(m4_dquote(m4_bpatsubst(m4_dquote(b4_namespace_ref), [^\(.\)[ ]*::], [\1])), [::], [ { namespace ])[ {]])]) m4_define([b4_namespace_close], [b4_user_code([b4_percent_define_get_syncline([[api.namespace]]) m4_bpatsubst(m4_dquote(m4_bpatsubst(m4_dquote(b4_namespace_ref[ ]), [^\(.\)[ ]*\(::\)?\([^][:]\|:[^:]\)*], [\1])), [::\([^][:]\|:[^:]\)*], [} ])[} // ]b4_namespace_ref])]) # b4_token_enums # -------------- # Output the definition of the tokens as enums. m4_define([b4_token_enums], [[enum yytokentype { ]m4_join([, ], b4_symbol_map([b4_token_enum]))[ };]dnl ]) ## ----------------- ## ## Semantic Values. ## ## ----------------- ## # b4_value_type_declare # --------------------- # Declare semantic_type. m4_define([b4_value_type_declare], [b4_value_type_setup[]dnl [ /// Symbol semantic values. ]m4_bmatch(b4_percent_define_get_kind([[api.value.type]]), [code], [[ typedef ]b4_percent_define_get([[api.value.type]])[ semantic_type;]], [m4_bmatch(b4_percent_define_get([[api.value.type]]), [union\|union-directive], [[ union semantic_type { ]b4_user_union_members[ };]])])dnl ]) # b4_public_types_declare # ----------------------- # Define the public types: token, semantic value, location, and so forth. # Depending on %define token_lex, may be output in the header or source file. m4_define([b4_public_types_declare], [[#ifndef ]b4_api_PREFIX[STYPE ]b4_value_type_declare[ #else typedef ]b4_api_PREFIX[STYPE semantic_type; #endif]b4_locations_if([ /// Symbol locations. typedef b4_percent_define_get([[api.location.type]], [[location]]) location_type;])[ /// Syntax errors thrown from user actions. struct syntax_error : std::runtime_error { syntax_error (]b4_locations_if([const location_type& l, ])[const std::string& m);]b4_locations_if([ location_type location;])[ }; /// Tokens. struct token { ]b4_token_enums[ }; /// (External) token type, as returned by yylex. typedef token::yytokentype token_type; /// Symbol type: an internal symbol number. typedef int symbol_number_type; /// The symbol type number to denote an empty symbol. enum { empty_symbol = -2 }; /// Internal symbol number for tokens (subsumed by symbol_number_type). typedef ]b4_int_type_for([b4_translate])[ token_number_type; /// A complete symbol. /// /// Expects its Base type to provide access to the symbol type /// via type_get(). /// /// Provide access to semantic value]b4_locations_if([ and location])[. template struct basic_symbol : Base { /// Alias to Base. typedef Base super_type; /// Default constructor. basic_symbol (); /// Copy constructor. basic_symbol (const basic_symbol& other); ]b4_variant_if([[ /// Constructor for valueless symbols, and symbols from each type. ]b4_type_foreach([b4_basic_symbol_constructor_declare])], [[ /// Constructor for valueless symbols. basic_symbol (typename Base::kind_type t]b4_locations_if([, const location_type& l])[);]])[ /// Constructor for symbols with semantic value. basic_symbol (typename Base::kind_type t, const semantic_type& v]b4_locations_if([, const location_type& l])[); /// Destroy the symbol. ~basic_symbol (); /// Destroy contents, and record that is empty. void clear (); /// Whether empty. bool empty () const; /// Destructive move, \a s is emptied into this. void move (basic_symbol& s); /// The semantic value. semantic_type value;]b4_locations_if([ /// The location. location_type location;])[ private: /// Assignment operator. basic_symbol& operator= (const basic_symbol& other); }; /// Type access provider for token (enum) based symbols. struct by_type { /// Default constructor. by_type (); /// Copy constructor. by_type (const by_type& other); /// The symbol type as needed by the constructor. typedef token_type kind_type; /// Constructor from (external) token numbers. by_type (kind_type t); /// Record that this symbol is empty. void clear (); /// Steal the symbol type from \a that. void move (by_type& that); /// The (internal) type number (corresponding to \a type). /// \a empty when empty. symbol_number_type type_get () const; /// The token. token_type token () const; /// The symbol type. /// \a empty_symbol when empty. /// An int, not token_number_type, to be able to store empty_symbol. int type; }; /// "External" symbols: returned by the scanner. typedef basic_symbol symbol_type; ]b4_symbol_constructor_declare]) # b4_public_types_define # ---------------------- # Provide the implementation needed by the public types. m4_define([b4_public_types_define], [[ inline ]b4_parser_class_name[::syntax_error::syntax_error (]b4_locations_if([const location_type& l, ])[const std::string& m) : std::runtime_error (m)]b4_locations_if([ , location (l)])[ {} // basic_symbol. template inline ]b4_parser_class_name[::basic_symbol::basic_symbol () : value () {} template inline ]b4_parser_class_name[::basic_symbol::basic_symbol (const basic_symbol& other) : Base (other) , value ()]b4_locations_if([ , location (other.location)])[ { ]b4_variant_if([b4_symbol_variant([other.type_get ()], [value], [copy], [other.value])], [value = other.value;])[ } template inline ]b4_parser_class_name[::basic_symbol::basic_symbol (]b4_join( [typename Base::kind_type t], [const semantic_type& v], b4_locations_if([const location_type& l]))[) : Base (t) , value (]b4_variant_if([], [v])[)]b4_locations_if([ , location (l)])[ {]b4_variant_if([[ (void) v; ]b4_symbol_variant([this->type_get ()], [value], [copy], [v])])[} ]b4_variant_if([[ // Implementation of basic_symbol constructor for each type. ]b4_type_foreach([b4_basic_symbol_constructor_define])], [[ /// Constructor for valueless symbols. template inline ]b4_parser_class_name[::basic_symbol::basic_symbol (]b4_join( [typename Base::kind_type t], b4_locations_if([const location_type& l]))[) : Base (t) , value ()]b4_locations_if([ , location (l)])[ {}]])[ template inline ]b4_parser_class_name[::basic_symbol::~basic_symbol () { clear (); } template inline void ]b4_parser_class_name[::basic_symbol::clear () {]b4_variant_if([[ // User destructor. symbol_number_type yytype = this->type_get (); basic_symbol& yysym = *this; (void) yysym; switch (yytype) { ]b4_symbol_foreach([b4_symbol_destructor])dnl [ default: break; } // Type destructor. ]b4_symbol_variant([[yytype]], [[value]], [[template destroy]])])[ Base::clear (); } template inline bool ]b4_parser_class_name[::basic_symbol::empty () const { return Base::type_get () == empty_symbol; } template inline void ]b4_parser_class_name[::basic_symbol::move (basic_symbol& s) { super_type::move(s); ]b4_variant_if([b4_symbol_variant([this->type_get ()], [value], [move], [s.value])], [value = s.value;])[]b4_locations_if([ location = s.location;])[ } // by_type. inline ]b4_parser_class_name[::by_type::by_type () : type (empty_symbol) {} inline ]b4_parser_class_name[::by_type::by_type (const by_type& other) : type (other.type) {} inline ]b4_parser_class_name[::by_type::by_type (token_type t) : type (yytranslate_ (t)) {} inline void ]b4_parser_class_name[::by_type::clear () { type = empty_symbol; } inline void ]b4_parser_class_name[::by_type::move (by_type& that) { type = that.type; that.clear (); } inline int ]b4_parser_class_name[::by_type::type_get () const { return type; } ]b4_token_ctor_if([[ inline ]b4_parser_class_name[::token_type ]b4_parser_class_name[::by_type::token () const { // YYTOKNUM[NUM] -- (External) token number corresponding to the // (internal) symbol number NUM (which must be that of a token). */ static const ]b4_int_type_for([b4_toknum])[ yytoken_number_[] = { ]b4_toknum[ }; return static_cast (yytoken_number_[type]); } ]])[]dnl b4_symbol_constructor_define]) # b4_symbol_constructor_declare # b4_symbol_constructor_define # ----------------------------- # Declare/define symbol constructors for all the value types. # Use at class-level. Redefined in variant.hh. m4_define([b4_symbol_constructor_declare], []) m4_define([b4_symbol_constructor_define], []) # b4_yytranslate_define # --------------------- # Define yytranslate_. Sometimes used in the header file, # sometimes in the cc file. m4_define([b4_yytranslate_define], [[ // Symbol number corresponding to token number t. inline ]b4_parser_class_name[::token_number_type ]b4_parser_class_name[::yytranslate_ (]b4_token_ctor_if([token_type], [int])[ t) { static const token_number_type translate_table[] = { ]b4_translate[ }; const unsigned int user_token_number_max_ = ]b4_user_token_number_max[; const token_number_type undef_token_ = ]b4_undef_token_number[; if (static_cast(t) <= yyeof_) return yyeof_; else if (static_cast (t) <= user_token_number_max_) return translate_table[t]; else return undef_token_; } ]]) # b4_lhs_value([TYPE]) # -------------------- # Expansion of $$. m4_define([b4_lhs_value], [b4_symbol_value([yyval], [$1])]) # b4_rhs_value(RULE-LENGTH, NUM, [TYPE]) # -------------------------------------- # Expansion of $NUM, where the current rule has RULE-LENGTH # symbols on RHS. m4_define([b4_rhs_value], [b4_symbol_value([yysemantic_stack_@{($1) - ($2)@}], [$3])]) # b4_lhs_location() # ----------------- # Expansion of @$. m4_define([b4_lhs_location], [(yyloc)]) # b4_rhs_location(RULE-LENGTH, NUM) # --------------------------------- # Expansion of @NUM, where the current rule has RULE-LENGTH symbols # on RHS. m4_define([b4_rhs_location], [(yylocation_stack_@{($1) - ($2)@})]) # b4_parse_param_decl # ------------------- # Extra formal arguments of the constructor. # Change the parameter names from "foo" into "foo_yyarg", so that # there is no collision bw the user chosen attribute name, and the # argument name in the constructor. m4_define([b4_parse_param_decl], [m4_ifset([b4_parse_param], [m4_map_sep([b4_parse_param_decl_1], [, ], [b4_parse_param])])]) m4_define([b4_parse_param_decl_1], [$1_yyarg]) # b4_parse_param_cons # ------------------- # Extra initialisations of the constructor. m4_define([b4_parse_param_cons], [m4_ifset([b4_parse_param], [ b4_cc_constructor_calls(b4_parse_param)])]) m4_define([b4_cc_constructor_calls], [m4_map_sep([b4_cc_constructor_call], [, ], [$@])]) m4_define([b4_cc_constructor_call], [$2 ($2_yyarg)]) # b4_parse_param_vars # ------------------- # Extra instance variables. m4_define([b4_parse_param_vars], [m4_ifset([b4_parse_param], [ // User arguments. b4_cc_var_decls(b4_parse_param)])]) m4_define([b4_cc_var_decls], [m4_map_sep([b4_cc_var_decl], [ ], [$@])]) m4_define([b4_cc_var_decl], [ $1;]) ## ---------## ## Values. ## ## ---------## # b4_yylloc_default_define # ------------------------ # Define YYLLOC_DEFAULT. m4_define([b4_yylloc_default_define], [[/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. If N is 0, then set CURRENT to the empty location which ends the previous symbol: RHS[0] (always defined). */ # ifndef YYLLOC_DEFAULT # define YYLLOC_DEFAULT(Current, Rhs, N) \ do \ if (N) \ { \ (Current).begin = YYRHSLOC (Rhs, 1).begin; \ (Current).end = YYRHSLOC (Rhs, N).end; \ } \ else \ { \ (Current).begin = (Current).end = YYRHSLOC (Rhs, 0).end; \ } \ while (/*CONSTCOND*/ false) # endif ]]) ## -------- ## ## Checks. ## ## -------- ## b4_token_ctor_if([b4_variant_if([], [b4_fatal_at(b4_percent_define_get_loc(api.token.constructor), [cannot use '%s' without '%s'], [%define api.token.constructor], [%define api.value.type variant]))])]) PKd1]GJGJglr.cnu[ -*- C -*- # GLR skeleton for Bison # Copyright (C) 2002-2015 Free Software Foundation, Inc. # 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 . # If we are loaded by glr.cc, do not override c++.m4 definitions by # those of c.m4. m4_if(b4_skeleton, ["glr.c"], [m4_include(b4_pkgdatadir/[c.m4])]) ## ---------------- ## ## Default values. ## ## ---------------- ## # Stack parameters. m4_define_default([b4_stack_depth_max], [10000]) m4_define_default([b4_stack_depth_init], [200]) ## ------------------------ ## ## Pure/impure interfaces. ## ## ------------------------ ## b4_define_flag_if([pure]) # If glr.cc is including this file and thus has already set b4_pure_flag, # do not change the value of b4_pure_flag, and do not record a use of api.pure. m4_ifndef([b4_pure_flag], [b4_percent_define_default([[api.pure]], [[false]]) m4_define([b4_pure_flag], [b4_percent_define_flag_if([[api.pure]], [[1]], [[0]])])]) # b4_user_formals # --------------- # The possible parse-params formal arguments preceded by a comma. # # This is not shared with yacc.c in c.m4 because GLR relies on ISO C # formal argument declarations. m4_define([b4_user_formals], [m4_ifset([b4_parse_param], [, b4_formals(b4_parse_param)])]) # b4_yyerror_args # --------------- # Optional effective arguments passed to yyerror: user args plus yylloc, and # a trailing comma. m4_define([b4_yyerror_args], [b4_pure_if([b4_locations_if([yylocp, ])])dnl m4_ifset([b4_parse_param], [b4_args(b4_parse_param), ])]) # b4_lyyerror_args # ---------------- # Same as above, but on the lookahead, hence &yylloc instead of yylocp. m4_define([b4_lyyerror_args], [b4_pure_if([b4_locations_if([&yylloc, ])])dnl m4_ifset([b4_parse_param], [b4_args(b4_parse_param), ])]) # b4_pure_args # ------------ # Same as b4_yyerror_args, but with a leading comma. m4_define([b4_pure_args], [b4_pure_if([b4_locations_if([, yylocp])])[]b4_user_args]) # b4_lpure_args # ------------- # Same as above, but on the lookahead, hence &yylloc instead of yylocp. m4_define([b4_lpure_args], [b4_pure_if([b4_locations_if([, &yylloc])])[]b4_user_args]) # b4_pure_formals # --------------- # Arguments passed to yyerror: user formals plus yylocp with leading comma. m4_define([b4_pure_formals], [b4_pure_if([b4_locations_if([, YYLTYPE *yylocp])])[]b4_user_formals]) # b4_locuser_formals(LOC = yylocp) # -------------------------------- m4_define([b4_locuser_formals], [b4_locations_if([, YYLTYPE *m4_default([$1], [yylocp])])[]b4_user_formals]) # b4_locuser_args(LOC = yylocp) # ----------------------------- m4_define([b4_locuser_args], [b4_locations_if([, m4_default([$1], [yylocp])])[]b4_user_args]) ## ----------------- ## ## Semantic Values. ## ## ----------------- ## # b4_lhs_value([TYPE]) # -------------------- # Expansion of $$. m4_define([b4_lhs_value], [b4_symbol_value([(*yyvalp)], [$1])]) # b4_rhs_data(RULE-LENGTH, NUM) # ----------------------------- # Expand to the semantic stack place that contains value and location # of symbol number NUM in a rule of length RULE-LENGTH. m4_define([b4_rhs_data], [((yyGLRStackItem const *)yyvsp)@{YYFILL (b4_subtract([$2], [$1]))@}.yystate]) # b4_rhs_value(RULE-LENGTH, NUM, [TYPE]) # -------------------------------------- # Expansion of $NUM, where the current rule has RULE-LENGTH # symbols on RHS. m4_define([b4_rhs_value], [b4_symbol_value([b4_rhs_data([$1], [$2]).yysemantics.yysval], [$3])]) ## ----------- ## ## Locations. ## ## ----------- ## # b4_lhs_location() # ----------------- # Expansion of @$. m4_define([b4_lhs_location], [(*yylocp)]) # b4_rhs_location(RULE-LENGTH, NUM) # --------------------------------- # Expansion of @NUM, where the current rule has RULE-LENGTH symbols # on RHS. m4_define([b4_rhs_location], [(b4_rhs_data([$1], [$2]).yyloc)]) ## -------------- ## ## Declarations. ## ## -------------- ## # b4_shared_declarations # ---------------------- # Declaration that might either go into the header (if --defines) # or open coded in the parser body. glr.cc has its own definition. m4_if(b4_skeleton, ["glr.c"], [m4_define([b4_shared_declarations], [b4_declare_yydebug[ ]b4_percent_code_get([[requires]])[ ]b4_token_enums[ ]b4_declare_yylstype[ ]b4_function_declare(b4_prefix[parse], [int], b4_parse_param)[ ]b4_percent_code_get([[provides]])[]dnl ]) ]) ## -------------- ## ## Output files. ## ## -------------- ## # Unfortunately the order of generation between the header and the # implementation file matters (for glr.c) because of the current # implementation of api.value.type=union. In that case we still use a # union for YYSTYPE, but we generate the contents of this union when # setting up YYSTYPE. This is needed for other aspects, such as # defining yy_symbol_value_print, since we need to now the name of the # members of this union. # # To avoid this issue, just generate the header before the # implementation file. But we should also make them more independant. # ----------------- # # The header file. # # ----------------- # # glr.cc produces its own header. m4_if(b4_skeleton, ["glr.c"], [b4_defines_if( [b4_output_begin([b4_spec_defines_file]) b4_copyright([Skeleton interface for Bison GLR parsers in C], [2002-2015])[ ]b4_cpp_guard_open([b4_spec_defines_file])[ ]b4_shared_declarations[ ]b4_cpp_guard_close([b4_spec_defines_file])[ ]b4_output_end() ])]) # ------------------------- # # The implementation file. # # ------------------------- # b4_output_begin([b4_parser_file_name]) b4_copyright([Skeleton implementation for Bison GLR parsers in C], [2002-2015])[ /* C GLR parser skeleton written by Paul Hilfinger. */ ]b4_identification b4_percent_code_get([[top]])[ ]m4_if(b4_api_prefix, [yy], [], [[/* Substitute the type names. */ #define YYSTYPE ]b4_api_PREFIX[STYPE]b4_locations_if([[ #define YYLTYPE ]b4_api_PREFIX[LTYPE]])])[ ]m4_if(b4_prefix, [yy], [], [[/* Substitute the variable and function names. */ #define yyparse ]b4_prefix[parse #define yylex ]b4_prefix[lex #define yyerror ]b4_prefix[error #define yydebug ]b4_prefix[debug ]]b4_pure_if([], [[ #define yylval ]b4_prefix[lval #define yychar ]b4_prefix[char #define yynerrs ]b4_prefix[nerrs]b4_locations_if([[ #define yylloc ]b4_prefix[lloc]])]))[ /* First part of user declarations. */ ]b4_user_pre_prologue[ ]b4_null_define[ ]b4_defines_if([[#include "@basename(]b4_spec_defines_file[@)"]], [b4_shared_declarations])[ /* Enabling verbose error messages. */ #ifdef YYERROR_VERBOSE # undef YYERROR_VERBOSE # define YYERROR_VERBOSE 1 #else # define YYERROR_VERBOSE ]b4_error_verbose_if([1], [0])[ #endif /* Default (constant) value used for initialization for null right-hand sides. Unlike the standard yacc.c template, here we set the default value of $$ to a zeroed-out value. Since the default value is undefined, this behavior is technically correct. */ static YYSTYPE yyval_default;]b4_locations_if([[ static YYLTYPE yyloc_default][]b4_yyloc_default;])[ /* Copy the second part of user declarations. */ ]b4_user_post_prologue b4_percent_code_get[]dnl [#include #include #include #ifndef YY_ # if defined YYENABLE_NLS && YYENABLE_NLS # if ENABLE_NLS # include /* INFRINGES ON USER NAME SPACE */ # define YY_(Msgid) dgettext ("bison-runtime", Msgid) # endif # endif # ifndef YY_ # define YY_(Msgid) Msgid # endif #endif #ifndef YYFREE # define YYFREE free #endif #ifndef YYMALLOC # define YYMALLOC malloc #endif #ifndef YYREALLOC # define YYREALLOC realloc #endif #define YYSIZEMAX ((size_t) -1) #ifdef __cplusplus typedef bool yybool; #else typedef unsigned char yybool; #endif #define yytrue 1 #define yyfalse 0 #ifndef YYSETJMP # include # define YYJMP_BUF jmp_buf # define YYSETJMP(Env) setjmp (Env) /* Pacify clang. */ # define YYLONGJMP(Env, Val) (longjmp (Env, Val), YYASSERT (0)) #endif ]b4_attribute_define[ #ifndef YYASSERT # define YYASSERT(Condition) ((void) ((Condition) || (abort (), 0))) #endif /* YYFINAL -- State number of the termination state. */ #define YYFINAL ]b4_final_state_number[ /* YYLAST -- Last index in YYTABLE. */ #define YYLAST ]b4_last[ /* YYNTOKENS -- Number of terminals. */ #define YYNTOKENS ]b4_tokens_number[ /* YYNNTS -- Number of nonterminals. */ #define YYNNTS ]b4_nterms_number[ /* YYNRULES -- Number of rules. */ #define YYNRULES ]b4_rules_number[ /* YYNRULES -- Number of states. */ #define YYNSTATES ]b4_states_number[ /* YYMAXRHS -- Maximum number of symbols on right-hand side of rule. */ #define YYMAXRHS ]b4_r2_max[ /* YYMAXLEFT -- Maximum number of symbols to the left of a handle accessed by $0, $-1, etc., in any rule. */ #define YYMAXLEFT ]b4_max_left_semantic_context[ /* YYTRANSLATE(X) -- Bison symbol number corresponding to X. */ #define YYUNDEFTOK ]b4_undef_token_number[ #define YYMAXUTOK ]b4_user_token_number_max[ #define YYTRANSLATE(YYX) \ ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ static const ]b4_int_type_for([b4_translate])[ yytranslate[] = { ]b4_translate[ }; #if ]b4_api_PREFIX[DEBUG /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ static const ]b4_int_type_for([b4_rline])[ yyrline[] = { ]b4_rline[ }; #endif #if ]b4_api_PREFIX[DEBUG || YYERROR_VERBOSE || ]b4_token_table_flag[ /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. First, the terminals, then, starting at YYNTOKENS, nonterminals. */ static const char *const yytname[] = { ]b4_tname[ }; #endif #define YYPACT_NINF ]b4_pact_ninf[ #define YYTABLE_NINF ]b4_table_ninf[ ]b4_parser_tables_define[ /* YYDPREC[RULE-NUM] -- Dynamic precedence of rule #RULE-NUM (0 if none). */ static const ]b4_int_type_for([b4_dprec])[ yydprec[] = { ]b4_dprec[ }; /* YYMERGER[RULE-NUM] -- Index of merging function for rule #RULE-NUM. */ static const ]b4_int_type_for([b4_merger])[ yymerger[] = { ]b4_merger[ }; /* YYIMMEDIATE[RULE-NUM] -- True iff rule #RULE-NUM is not to be deferred, as in the case of predicates. */ static const yybool yyimmediate[] = { ]b4_immediate[ }; /* YYCONFLP[YYPACT[STATE-NUM]] -- Pointer into YYCONFL of start of list of conflicting reductions corresponding to action entry for state STATE-NUM in yytable. 0 means no conflicts. The list in yyconfl is terminated by a rule number of 0. */ static const ]b4_int_type_for([b4_conflict_list_heads])[ yyconflp[] = { ]b4_conflict_list_heads[ }; /* YYCONFL[I] -- lists of conflicting rule numbers, each terminated by 0, pointed into by YYCONFLP. */ ]dnl Do not use b4_int_type_for here, since there are places where dnl pointers onto yyconfl are taken, whose type is "short int *". dnl We probably ought to introduce a type for confl. [static const short int yyconfl[] = { ]b4_conflicting_rules[ }; /* Error token number */ #define YYTERROR 1 ]b4_locations_if([[ ]b4_yylloc_default_define[ # define YYRHSLOC(Rhs, K) ((Rhs)[K].yystate.yyloc) ]])[ ]b4_pure_if( [ #undef yynerrs #define yynerrs (yystackp->yyerrcnt) #undef yychar #define yychar (yystackp->yyrawchar) #undef yylval #define yylval (yystackp->yyval) #undef yylloc #define yylloc (yystackp->yyloc) m4_if(b4_prefix[], [yy], [], [#define b4_prefix[]nerrs yynerrs #define b4_prefix[]char yychar #define b4_prefix[]lval yylval #define b4_prefix[]lloc yylloc])], [YYSTYPE yylval;]b4_locations_if([[ YYLTYPE yylloc;]])[ int yynerrs; int yychar;])[ static const int YYEOF = 0; static const int YYEMPTY = -2; typedef enum { yyok, yyaccept, yyabort, yyerr } YYRESULTTAG; #define YYCHK(YYE) \ do { \ YYRESULTTAG yychk_flag = YYE; \ if (yychk_flag != yyok) \ return yychk_flag; \ } while (0) #if ]b4_api_PREFIX[DEBUG # ifndef YYFPRINTF # define YYFPRINTF fprintf # endif ]b4_yy_location_print_define[ # define YYDPRINTF(Args) \ do { \ if (yydebug) \ YYFPRINTF Args; \ } while (0) ]b4_yy_symbol_print_define[ # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ do { \ if (yydebug) \ { \ YYFPRINTF (stderr, "%s ", Title); \ yy_symbol_print (stderr, Type, Value]b4_locuser_args([Location])[); \ YYFPRINTF (stderr, "\n"); \ } \ } while (0) /* Nonzero means print parse trace. It is left uninitialized so that multiple parsers can coexist. */ int yydebug; struct yyGLRStack; static void yypstack (struct yyGLRStack* yystackp, size_t yyk) YY_ATTRIBUTE_UNUSED; static void yypdumpstack (struct yyGLRStack* yystackp) YY_ATTRIBUTE_UNUSED; #else /* !]b4_api_PREFIX[DEBUG */ # define YYDPRINTF(Args) # define YY_SYMBOL_PRINT(Title, Type, Value, Location) #endif /* !]b4_api_PREFIX[DEBUG */ /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH ]b4_stack_depth_init[ #endif /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only if the built-in stack extension method is used). Do not make this value too large; the results are undefined if SIZE_MAX < YYMAXDEPTH * sizeof (GLRStackItem) evaluated with infinite-precision integer arithmetic. */ #ifndef YYMAXDEPTH # define YYMAXDEPTH ]b4_stack_depth_max[ #endif /* Minimum number of free items on the stack allowed after an allocation. This is to allow allocation and initialization to be completed by functions that call yyexpandGLRStack before the stack is expanded, thus insuring that all necessary pointers get properly redirected to new data. */ #define YYHEADROOM 2 #ifndef YYSTACKEXPANDABLE # define YYSTACKEXPANDABLE 1 #endif #if YYSTACKEXPANDABLE # define YY_RESERVE_GLRSTACK(Yystack) \ do { \ if (Yystack->yyspaceLeft < YYHEADROOM) \ yyexpandGLRStack (Yystack); \ } while (0) #else # define YY_RESERVE_GLRSTACK(Yystack) \ do { \ if (Yystack->yyspaceLeft < YYHEADROOM) \ yyMemoryExhausted (Yystack); \ } while (0) #endif #if YYERROR_VERBOSE # ifndef yystpcpy # if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE # define yystpcpy stpcpy # else /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in YYDEST. */ static char * yystpcpy (char *yydest, const char *yysrc) { char *yyd = yydest; const char *yys = yysrc; while ((*yyd++ = *yys++) != '\0') continue; return yyd - 1; } # endif # endif # ifndef yytnamerr /* Copy to YYRES the contents of YYSTR after stripping away unnecessary quotes and backslashes, so that it's suitable for yyerror. The heuristic is that double-quoting is unnecessary unless the string contains an apostrophe, a comma, or backslash (other than backslash-backslash). YYSTR is taken from yytname. If YYRES is null, do not copy; instead, return the length of what the result would have been. */ static size_t yytnamerr (char *yyres, const char *yystr) { if (*yystr == '"') { size_t yyn = 0; char const *yyp = yystr; for (;;) switch (*++yyp) { case '\'': case ',': goto do_not_strip_quotes; case '\\': if (*++yyp != '\\') goto do_not_strip_quotes; /* Fall through. */ default: if (yyres) yyres[yyn] = *yyp; yyn++; break; case '"': if (yyres) yyres[yyn] = '\0'; return yyn; } do_not_strip_quotes: ; } if (! yyres) return strlen (yystr); return yystpcpy (yyres, yystr) - yyres; } # endif #endif /* !YYERROR_VERBOSE */ /** State numbers, as in LALR(1) machine */ typedef int yyStateNum; /** Rule numbers, as in LALR(1) machine */ typedef int yyRuleNum; /** Grammar symbol */ typedef int yySymbol; /** Item references, as in LALR(1) machine */ typedef short int yyItemNum; typedef struct yyGLRState yyGLRState; typedef struct yyGLRStateSet yyGLRStateSet; typedef struct yySemanticOption yySemanticOption; typedef union yyGLRStackItem yyGLRStackItem; typedef struct yyGLRStack yyGLRStack; struct yyGLRState { /** Type tag: always true. */ yybool yyisState; /** Type tag for yysemantics. If true, yysval applies, otherwise * yyfirstVal applies. */ yybool yyresolved; /** Number of corresponding LALR(1) machine state. */ yyStateNum yylrState; /** Preceding state in this stack */ yyGLRState* yypred; /** Source position of the last token produced by my symbol */ size_t yyposn; union { /** First in a chain of alternative reductions producing the * non-terminal corresponding to this state, threaded through * yynext. */ yySemanticOption* yyfirstVal; /** Semantic value for this state. */ YYSTYPE yysval; } yysemantics;]b4_locations_if([[ /** Source location for this state. */ YYLTYPE yyloc;]])[ }; struct yyGLRStateSet { yyGLRState** yystates; /** During nondeterministic operation, yylookaheadNeeds tracks which * stacks have actually needed the current lookahead. During deterministic * operation, yylookaheadNeeds[0] is not maintained since it would merely * duplicate yychar != YYEMPTY. */ yybool* yylookaheadNeeds; size_t yysize, yycapacity; }; struct yySemanticOption { /** Type tag: always false. */ yybool yyisState; /** Rule number for this reduction */ yyRuleNum yyrule; /** The last RHS state in the list of states to be reduced. */ yyGLRState* yystate; /** The lookahead for this reduction. */ int yyrawchar; YYSTYPE yyval;]b4_locations_if([[ YYLTYPE yyloc;]])[ /** Next sibling in chain of options. To facilitate merging, * options are chained in decreasing order by address. */ yySemanticOption* yynext; }; /** Type of the items in the GLR stack. The yyisState field * indicates which item of the union is valid. */ union yyGLRStackItem { yyGLRState yystate; yySemanticOption yyoption; }; struct yyGLRStack { int yyerrState; ]b4_locations_if([[ /* To compute the location of the error token. */ yyGLRStackItem yyerror_range[3];]])[ ]b4_pure_if( [ int yyerrcnt; int yyrawchar; YYSTYPE yyval;]b4_locations_if([[ YYLTYPE yyloc;]])[ ])[ YYJMP_BUF yyexception_buffer; yyGLRStackItem* yyitems; yyGLRStackItem* yynextFree; size_t yyspaceLeft; yyGLRState* yysplitPoint; yyGLRState* yylastDeleted; yyGLRStateSet yytops; }; #if YYSTACKEXPANDABLE static void yyexpandGLRStack (yyGLRStack* yystackp); #endif static _Noreturn void yyFail (yyGLRStack* yystackp]b4_pure_formals[, const char* yymsg) { if (yymsg != YY_NULLPTR) yyerror (]b4_yyerror_args[yymsg); YYLONGJMP (yystackp->yyexception_buffer, 1); } static _Noreturn void yyMemoryExhausted (yyGLRStack* yystackp) { YYLONGJMP (yystackp->yyexception_buffer, 2); } #if ]b4_api_PREFIX[DEBUG || YYERROR_VERBOSE /** A printable representation of TOKEN. */ static inline const char* yytokenName (yySymbol yytoken) { if (yytoken == YYEMPTY) return ""; return yytname[yytoken]; } #endif /** Fill in YYVSP[YYLOW1 .. YYLOW0-1] from the chain of states starting * at YYVSP[YYLOW0].yystate.yypred. Leaves YYVSP[YYLOW1].yystate.yypred * containing the pointer to the next state in the chain. */ static void yyfillin (yyGLRStackItem *, int, int) YY_ATTRIBUTE_UNUSED; static void yyfillin (yyGLRStackItem *yyvsp, int yylow0, int yylow1) { int i; yyGLRState *s = yyvsp[yylow0].yystate.yypred; for (i = yylow0-1; i >= yylow1; i -= 1) { #if ]b4_api_PREFIX[DEBUG yyvsp[i].yystate.yylrState = s->yylrState; #endif yyvsp[i].yystate.yyresolved = s->yyresolved; if (s->yyresolved) yyvsp[i].yystate.yysemantics.yysval = s->yysemantics.yysval; else /* The effect of using yysval or yyloc (in an immediate rule) is * undefined. */ yyvsp[i].yystate.yysemantics.yyfirstVal = YY_NULLPTR;]b4_locations_if([[ yyvsp[i].yystate.yyloc = s->yyloc;]])[ s = yyvsp[i].yystate.yypred = s->yypred; } } /* Do nothing if YYNORMAL or if *YYLOW <= YYLOW1. Otherwise, fill in * YYVSP[YYLOW1 .. *YYLOW-1] as in yyfillin and set *YYLOW = YYLOW1. * For convenience, always return YYLOW1. */ static inline int yyfill (yyGLRStackItem *, int *, int, yybool) YY_ATTRIBUTE_UNUSED; static inline int yyfill (yyGLRStackItem *yyvsp, int *yylow, int yylow1, yybool yynormal) { if (!yynormal && yylow1 < *yylow) { yyfillin (yyvsp, *yylow, yylow1); *yylow = yylow1; } return yylow1; } /** Perform user action for rule number YYN, with RHS length YYRHSLEN, * and top stack item YYVSP. YYLVALP points to place to put semantic * value ($$), and yylocp points to place for location information * (@@$). Returns yyok for normal return, yyaccept for YYACCEPT, * yyerr for YYERROR, yyabort for YYABORT. */ static YYRESULTTAG yyuserAction (yyRuleNum yyn, size_t yyrhslen, yyGLRStackItem* yyvsp, yyGLRStack* yystackp, YYSTYPE* yyvalp]b4_locuser_formals[) { yybool yynormal YY_ATTRIBUTE_UNUSED = (yystackp->yysplitPoint == YY_NULLPTR); int yylow; ]b4_parse_param_use([yyvalp], [yylocp])dnl [ YYUSE (yyrhslen); # undef yyerrok # define yyerrok (yystackp->yyerrState = 0) # undef YYACCEPT # define YYACCEPT return yyaccept # undef YYABORT # define YYABORT return yyabort # undef YYERROR # define YYERROR return yyerrok, yyerr # undef YYRECOVERING # define YYRECOVERING() (yystackp->yyerrState != 0) # undef yyclearin # define yyclearin (yychar = YYEMPTY) # undef YYFILL # define YYFILL(N) yyfill (yyvsp, &yylow, N, yynormal) # undef YYBACKUP # define YYBACKUP(Token, Value) \ return yyerror (]b4_yyerror_args[YY_("syntax error: cannot back up")), \ yyerrok, yyerr yylow = 1; if (yyrhslen == 0) *yyvalp = yyval_default; else *yyvalp = yyvsp[YYFILL (1-yyrhslen)].yystate.yysemantics.yysval;]b4_locations_if([[ YYLLOC_DEFAULT ((*yylocp), (yyvsp - yyrhslen), yyrhslen); yystackp->yyerror_range[1].yystate.yyloc = *yylocp; ]])[ switch (yyn) { ]b4_user_actions[ default: break; } return yyok; # undef yyerrok # undef YYABORT # undef YYACCEPT # undef YYERROR # undef YYBACKUP # undef yyclearin # undef YYRECOVERING } static void yyuserMerge (int yyn, YYSTYPE* yy0, YYSTYPE* yy1) { YYUSE (yy0); YYUSE (yy1); switch (yyn) { ]b4_mergers[ default: break; } } /* Bison grammar-table manipulation. */ ]b4_yydestruct_define[ /** Number of symbols composing the right hand side of rule #RULE. */ static inline int yyrhsLength (yyRuleNum yyrule) { return yyr2[yyrule]; } static void yydestroyGLRState (char const *yymsg, yyGLRState *yys]b4_user_formals[) { if (yys->yyresolved) yydestruct (yymsg, yystos[yys->yylrState], &yys->yysemantics.yysval]b4_locuser_args([&yys->yyloc])[); else { #if ]b4_api_PREFIX[DEBUG if (yydebug) { if (yys->yysemantics.yyfirstVal) YYFPRINTF (stderr, "%s unresolved", yymsg); else YYFPRINTF (stderr, "%s incomplete", yymsg); YY_SYMBOL_PRINT ("", yystos[yys->yylrState], YY_NULLPTR, &yys->yyloc); } #endif if (yys->yysemantics.yyfirstVal) { yySemanticOption *yyoption = yys->yysemantics.yyfirstVal; yyGLRState *yyrh; int yyn; for (yyrh = yyoption->yystate, yyn = yyrhsLength (yyoption->yyrule); yyn > 0; yyrh = yyrh->yypred, yyn -= 1) yydestroyGLRState (yymsg, yyrh]b4_user_args[); } } } /** Left-hand-side symbol for rule #YYRULE. */ static inline yySymbol yylhsNonterm (yyRuleNum yyrule) { return yyr1[yyrule]; } #define yypact_value_is_default(Yystate) \ ]b4_table_value_equals([[pact]], [[Yystate]], [b4_pact_ninf])[ /** True iff LR state YYSTATE has only a default reduction (regardless * of token). */ static inline yybool yyisDefaultedState (yyStateNum yystate) { return yypact_value_is_default (yypact[yystate]); } /** The default reduction for YYSTATE, assuming it has one. */ static inline yyRuleNum yydefaultAction (yyStateNum yystate) { return yydefact[yystate]; } #define yytable_value_is_error(Yytable_value) \ ]b4_table_value_equals([[table]], [[Yytable_value]], [b4_table_ninf])[ /** Set *YYACTION to the action to take in YYSTATE on seeing YYTOKEN. * Result R means * R < 0: Reduce on rule -R. * R = 0: Error. * R > 0: Shift to state R. * Set *YYCONFLICTS to a pointer into yyconfl to a 0-terminated list * of conflicting reductions. */ static inline void yygetLRActions (yyStateNum yystate, int yytoken, int* yyaction, const short int** yyconflicts) { int yyindex = yypact[yystate] + yytoken; if (yypact_value_is_default (yypact[yystate]) || yyindex < 0 || YYLAST < yyindex || yycheck[yyindex] != yytoken) { *yyaction = -yydefact[yystate]; *yyconflicts = yyconfl; } else if (! yytable_value_is_error (yytable[yyindex])) { *yyaction = yytable[yyindex]; *yyconflicts = yyconfl + yyconflp[yyindex]; } else { *yyaction = 0; *yyconflicts = yyconfl + yyconflp[yyindex]; } } /** Compute post-reduction state. * \param yystate the current state * \param yysym the nonterminal to push on the stack */ static inline yyStateNum yyLRgotoState (yyStateNum yystate, yySymbol yysym) { int yyr = yypgoto[yysym - YYNTOKENS] + yystate; if (0 <= yyr && yyr <= YYLAST && yycheck[yyr] == yystate) return yytable[yyr]; else return yydefgoto[yysym - YYNTOKENS]; } static inline yybool yyisShiftAction (int yyaction) { return 0 < yyaction; } static inline yybool yyisErrorAction (int yyaction) { return yyaction == 0; } /* GLRStates */ /** Return a fresh GLRStackItem in YYSTACKP. The item is an LR state * if YYISSTATE, and otherwise a semantic option. Callers should call * YY_RESERVE_GLRSTACK afterwards to make sure there is sufficient * headroom. */ static inline yyGLRStackItem* yynewGLRStackItem (yyGLRStack* yystackp, yybool yyisState) { yyGLRStackItem* yynewItem = yystackp->yynextFree; yystackp->yyspaceLeft -= 1; yystackp->yynextFree += 1; yynewItem->yystate.yyisState = yyisState; return yynewItem; } /** Add a new semantic action that will execute the action for rule * YYRULE on the semantic values in YYRHS to the list of * alternative actions for YYSTATE. Assumes that YYRHS comes from * stack #YYK of *YYSTACKP. */ static void yyaddDeferredAction (yyGLRStack* yystackp, size_t yyk, yyGLRState* yystate, yyGLRState* yyrhs, yyRuleNum yyrule) { yySemanticOption* yynewOption = &yynewGLRStackItem (yystackp, yyfalse)->yyoption; YYASSERT (!yynewOption->yyisState); yynewOption->yystate = yyrhs; yynewOption->yyrule = yyrule; if (yystackp->yytops.yylookaheadNeeds[yyk]) { yynewOption->yyrawchar = yychar; yynewOption->yyval = yylval;]b4_locations_if([ yynewOption->yyloc = yylloc;])[ } else yynewOption->yyrawchar = YYEMPTY; yynewOption->yynext = yystate->yysemantics.yyfirstVal; yystate->yysemantics.yyfirstVal = yynewOption; YY_RESERVE_GLRSTACK (yystackp); } /* GLRStacks */ /** Initialize YYSET to a singleton set containing an empty stack. */ static yybool yyinitStateSet (yyGLRStateSet* yyset) { yyset->yysize = 1; yyset->yycapacity = 16; yyset->yystates = (yyGLRState**) YYMALLOC (16 * sizeof yyset->yystates[0]); if (! yyset->yystates) return yyfalse; yyset->yystates[0] = YY_NULLPTR; yyset->yylookaheadNeeds = (yybool*) YYMALLOC (16 * sizeof yyset->yylookaheadNeeds[0]); if (! yyset->yylookaheadNeeds) { YYFREE (yyset->yystates); return yyfalse; } return yytrue; } static void yyfreeStateSet (yyGLRStateSet* yyset) { YYFREE (yyset->yystates); YYFREE (yyset->yylookaheadNeeds); } /** Initialize *YYSTACKP to a single empty stack, with total maximum * capacity for all stacks of YYSIZE. */ static yybool yyinitGLRStack (yyGLRStack* yystackp, size_t yysize) { yystackp->yyerrState = 0; yynerrs = 0; yystackp->yyspaceLeft = yysize; yystackp->yyitems = (yyGLRStackItem*) YYMALLOC (yysize * sizeof yystackp->yynextFree[0]); if (!yystackp->yyitems) return yyfalse; yystackp->yynextFree = yystackp->yyitems; yystackp->yysplitPoint = YY_NULLPTR; yystackp->yylastDeleted = YY_NULLPTR; return yyinitStateSet (&yystackp->yytops); } #if YYSTACKEXPANDABLE # define YYRELOC(YYFROMITEMS,YYTOITEMS,YYX,YYTYPE) \ &((YYTOITEMS) - ((YYFROMITEMS) - (yyGLRStackItem*) (YYX)))->YYTYPE /** If *YYSTACKP is expandable, extend it. WARNING: Pointers into the stack from outside should be considered invalid after this call. We always expand when there are 1 or fewer items left AFTER an allocation, so that we can avoid having external pointers exist across an allocation. */ static void yyexpandGLRStack (yyGLRStack* yystackp) { yyGLRStackItem* yynewItems; yyGLRStackItem* yyp0, *yyp1; size_t yynewSize; size_t yyn; size_t yysize = yystackp->yynextFree - yystackp->yyitems; if (YYMAXDEPTH - YYHEADROOM < yysize) yyMemoryExhausted (yystackp); yynewSize = 2*yysize; if (YYMAXDEPTH < yynewSize) yynewSize = YYMAXDEPTH; yynewItems = (yyGLRStackItem*) YYMALLOC (yynewSize * sizeof yynewItems[0]); if (! yynewItems) yyMemoryExhausted (yystackp); for (yyp0 = yystackp->yyitems, yyp1 = yynewItems, yyn = yysize; 0 < yyn; yyn -= 1, yyp0 += 1, yyp1 += 1) { *yyp1 = *yyp0; if (*(yybool *) yyp0) { yyGLRState* yys0 = &yyp0->yystate; yyGLRState* yys1 = &yyp1->yystate; if (yys0->yypred != YY_NULLPTR) yys1->yypred = YYRELOC (yyp0, yyp1, yys0->yypred, yystate); if (! yys0->yyresolved && yys0->yysemantics.yyfirstVal != YY_NULLPTR) yys1->yysemantics.yyfirstVal = YYRELOC (yyp0, yyp1, yys0->yysemantics.yyfirstVal, yyoption); } else { yySemanticOption* yyv0 = &yyp0->yyoption; yySemanticOption* yyv1 = &yyp1->yyoption; if (yyv0->yystate != YY_NULLPTR) yyv1->yystate = YYRELOC (yyp0, yyp1, yyv0->yystate, yystate); if (yyv0->yynext != YY_NULLPTR) yyv1->yynext = YYRELOC (yyp0, yyp1, yyv0->yynext, yyoption); } } if (yystackp->yysplitPoint != YY_NULLPTR) yystackp->yysplitPoint = YYRELOC (yystackp->yyitems, yynewItems, yystackp->yysplitPoint, yystate); for (yyn = 0; yyn < yystackp->yytops.yysize; yyn += 1) if (yystackp->yytops.yystates[yyn] != YY_NULLPTR) yystackp->yytops.yystates[yyn] = YYRELOC (yystackp->yyitems, yynewItems, yystackp->yytops.yystates[yyn], yystate); YYFREE (yystackp->yyitems); yystackp->yyitems = yynewItems; yystackp->yynextFree = yynewItems + yysize; yystackp->yyspaceLeft = yynewSize - yysize; } #endif static void yyfreeGLRStack (yyGLRStack* yystackp) { YYFREE (yystackp->yyitems); yyfreeStateSet (&yystackp->yytops); } /** Assuming that YYS is a GLRState somewhere on *YYSTACKP, update the * splitpoint of *YYSTACKP, if needed, so that it is at least as deep as * YYS. */ static inline void yyupdateSplit (yyGLRStack* yystackp, yyGLRState* yys) { if (yystackp->yysplitPoint != YY_NULLPTR && yystackp->yysplitPoint > yys) yystackp->yysplitPoint = yys; } /** Invalidate stack #YYK in *YYSTACKP. */ static inline void yymarkStackDeleted (yyGLRStack* yystackp, size_t yyk) { if (yystackp->yytops.yystates[yyk] != YY_NULLPTR) yystackp->yylastDeleted = yystackp->yytops.yystates[yyk]; yystackp->yytops.yystates[yyk] = YY_NULLPTR; } /** Undelete the last stack in *YYSTACKP that was marked as deleted. Can only be done once after a deletion, and only when all other stacks have been deleted. */ static void yyundeleteLastStack (yyGLRStack* yystackp) { if (yystackp->yylastDeleted == YY_NULLPTR || yystackp->yytops.yysize != 0) return; yystackp->yytops.yystates[0] = yystackp->yylastDeleted; yystackp->yytops.yysize = 1; YYDPRINTF ((stderr, "Restoring last deleted stack as stack #0.\n")); yystackp->yylastDeleted = YY_NULLPTR; } static inline void yyremoveDeletes (yyGLRStack* yystackp) { size_t yyi, yyj; yyi = yyj = 0; while (yyj < yystackp->yytops.yysize) { if (yystackp->yytops.yystates[yyi] == YY_NULLPTR) { if (yyi == yyj) { YYDPRINTF ((stderr, "Removing dead stacks.\n")); } yystackp->yytops.yysize -= 1; } else { yystackp->yytops.yystates[yyj] = yystackp->yytops.yystates[yyi]; /* In the current implementation, it's unnecessary to copy yystackp->yytops.yylookaheadNeeds[yyi] since, after yyremoveDeletes returns, the parser immediately either enters deterministic operation or shifts a token. However, it doesn't hurt, and the code might evolve to need it. */ yystackp->yytops.yylookaheadNeeds[yyj] = yystackp->yytops.yylookaheadNeeds[yyi]; if (yyj != yyi) { YYDPRINTF ((stderr, "Rename stack %lu -> %lu.\n", (unsigned long int) yyi, (unsigned long int) yyj)); } yyj += 1; } yyi += 1; } } /** Shift to a new state on stack #YYK of *YYSTACKP, corresponding to LR * state YYLRSTATE, at input position YYPOSN, with (resolved) semantic * value *YYVALP and source location *YYLOCP. */ static inline void yyglrShift (yyGLRStack* yystackp, size_t yyk, yyStateNum yylrState, size_t yyposn, YYSTYPE* yyvalp]b4_locations_if([, YYLTYPE* yylocp])[) { yyGLRState* yynewState = &yynewGLRStackItem (yystackp, yytrue)->yystate; yynewState->yylrState = yylrState; yynewState->yyposn = yyposn; yynewState->yyresolved = yytrue; yynewState->yypred = yystackp->yytops.yystates[yyk]; yynewState->yysemantics.yysval = *yyvalp;]b4_locations_if([ yynewState->yyloc = *yylocp;])[ yystackp->yytops.yystates[yyk] = yynewState; YY_RESERVE_GLRSTACK (yystackp); } /** Shift stack #YYK of *YYSTACKP, to a new state corresponding to LR * state YYLRSTATE, at input position YYPOSN, with the (unresolved) * semantic value of YYRHS under the action for YYRULE. */ static inline void yyglrShiftDefer (yyGLRStack* yystackp, size_t yyk, yyStateNum yylrState, size_t yyposn, yyGLRState* yyrhs, yyRuleNum yyrule) { yyGLRState* yynewState = &yynewGLRStackItem (yystackp, yytrue)->yystate; YYASSERT (yynewState->yyisState); yynewState->yylrState = yylrState; yynewState->yyposn = yyposn; yynewState->yyresolved = yyfalse; yynewState->yypred = yystackp->yytops.yystates[yyk]; yynewState->yysemantics.yyfirstVal = YY_NULLPTR; yystackp->yytops.yystates[yyk] = yynewState; /* Invokes YY_RESERVE_GLRSTACK. */ yyaddDeferredAction (yystackp, yyk, yynewState, yyrhs, yyrule); } #if !]b4_api_PREFIX[DEBUG # define YY_REDUCE_PRINT(Args) #else # define YY_REDUCE_PRINT(Args) \ do { \ if (yydebug) \ yy_reduce_print Args; \ } while (0) /*----------------------------------------------------------------------. | Report that stack #YYK of *YYSTACKP is going to be reduced by YYRULE. | `----------------------------------------------------------------------*/ static inline void yy_reduce_print (int yynormal, yyGLRStackItem* yyvsp, size_t yyk, yyRuleNum yyrule]b4_user_formals[) { int yynrhs = yyrhsLength (yyrule);]b4_locations_if([ int yylow = 1;])[ int yyi; YYFPRINTF (stderr, "Reducing stack %lu by rule %d (line %lu):\n", (unsigned long int) yyk, yyrule - 1, (unsigned long int) yyrline[yyrule]); if (! yynormal) yyfillin (yyvsp, 1, -yynrhs); /* The symbols being reduced. */ for (yyi = 0; yyi < yynrhs; yyi++) { YYFPRINTF (stderr, " $%d = ", yyi + 1); yy_symbol_print (stderr, yystos[yyvsp[yyi - yynrhs + 1].yystate.yylrState], &yyvsp[yyi - yynrhs + 1].yystate.yysemantics.yysval ]b4_locations_if([, &]b4_rhs_location(yynrhs, yyi + 1))[]dnl b4_user_args[); if (!yyvsp[yyi - yynrhs + 1].yystate.yyresolved) YYFPRINTF (stderr, " (unresolved)"); YYFPRINTF (stderr, "\n"); } } #endif /** Pop the symbols consumed by reduction #YYRULE from the top of stack * #YYK of *YYSTACKP, and perform the appropriate semantic action on their * semantic values. Assumes that all ambiguities in semantic values * have been previously resolved. Set *YYVALP to the resulting value, * and *YYLOCP to the computed location (if any). Return value is as * for userAction. */ static inline YYRESULTTAG yydoAction (yyGLRStack* yystackp, size_t yyk, yyRuleNum yyrule, YYSTYPE* yyvalp]b4_locuser_formals[) { int yynrhs = yyrhsLength (yyrule); if (yystackp->yysplitPoint == YY_NULLPTR) { /* Standard special case: single stack. */ yyGLRStackItem* yyrhs = (yyGLRStackItem*) yystackp->yytops.yystates[yyk]; YYASSERT (yyk == 0); yystackp->yynextFree -= yynrhs; yystackp->yyspaceLeft += yynrhs; yystackp->yytops.yystates[0] = & yystackp->yynextFree[-1].yystate; YY_REDUCE_PRINT ((1, yyrhs, yyk, yyrule]b4_user_args[)); return yyuserAction (yyrule, yynrhs, yyrhs, yystackp, yyvalp]b4_locuser_args[); } else { int yyi; yyGLRState* yys; yyGLRStackItem yyrhsVals[YYMAXRHS + YYMAXLEFT + 1]; yys = yyrhsVals[YYMAXRHS + YYMAXLEFT].yystate.yypred = yystackp->yytops.yystates[yyk];]b4_locations_if([[ if (yynrhs == 0) /* Set default location. */ yyrhsVals[YYMAXRHS + YYMAXLEFT - 1].yystate.yyloc = yys->yyloc;]])[ for (yyi = 0; yyi < yynrhs; yyi += 1) { yys = yys->yypred; YYASSERT (yys); } yyupdateSplit (yystackp, yys); yystackp->yytops.yystates[yyk] = yys; YY_REDUCE_PRINT ((0, yyrhsVals + YYMAXRHS + YYMAXLEFT - 1, yyk, yyrule]b4_user_args[)); return yyuserAction (yyrule, yynrhs, yyrhsVals + YYMAXRHS + YYMAXLEFT - 1, yystackp, yyvalp]b4_locuser_args[); } } /** Pop items off stack #YYK of *YYSTACKP according to grammar rule YYRULE, * and push back on the resulting nonterminal symbol. Perform the * semantic action associated with YYRULE and store its value with the * newly pushed state, if YYFORCEEVAL or if *YYSTACKP is currently * unambiguous. Otherwise, store the deferred semantic action with * the new state. If the new state would have an identical input * position, LR state, and predecessor to an existing state on the stack, * it is identified with that existing state, eliminating stack #YYK from * *YYSTACKP. In this case, the semantic value is * added to the options for the existing state's semantic value. */ static inline YYRESULTTAG yyglrReduce (yyGLRStack* yystackp, size_t yyk, yyRuleNum yyrule, yybool yyforceEval]b4_user_formals[) { size_t yyposn = yystackp->yytops.yystates[yyk]->yyposn; if (yyforceEval || yystackp->yysplitPoint == YY_NULLPTR) { YYSTYPE yysval;]b4_locations_if([[ YYLTYPE yyloc;]])[ YYRESULTTAG yyflag = yydoAction (yystackp, yyk, yyrule, &yysval]b4_locuser_args([&yyloc])[); if (yyflag == yyerr && yystackp->yysplitPoint != YY_NULLPTR) { YYDPRINTF ((stderr, "Parse on stack %lu rejected by rule #%d.\n", (unsigned long int) yyk, yyrule - 1)); } if (yyflag != yyok) return yyflag; YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyrule], &yysval, &yyloc); yyglrShift (yystackp, yyk, yyLRgotoState (yystackp->yytops.yystates[yyk]->yylrState, yylhsNonterm (yyrule)), yyposn, &yysval]b4_locations_if([, &yyloc])[); } else { size_t yyi; int yyn; yyGLRState* yys, *yys0 = yystackp->yytops.yystates[yyk]; yyStateNum yynewLRState; for (yys = yystackp->yytops.yystates[yyk], yyn = yyrhsLength (yyrule); 0 < yyn; yyn -= 1) { yys = yys->yypred; YYASSERT (yys); } yyupdateSplit (yystackp, yys); yynewLRState = yyLRgotoState (yys->yylrState, yylhsNonterm (yyrule)); YYDPRINTF ((stderr, "Reduced stack %lu by rule #%d; action deferred. " "Now in state %d.\n", (unsigned long int) yyk, yyrule - 1, yynewLRState)); for (yyi = 0; yyi < yystackp->yytops.yysize; yyi += 1) if (yyi != yyk && yystackp->yytops.yystates[yyi] != YY_NULLPTR) { yyGLRState *yysplit = yystackp->yysplitPoint; yyGLRState *yyp = yystackp->yytops.yystates[yyi]; while (yyp != yys && yyp != yysplit && yyp->yyposn >= yyposn) { if (yyp->yylrState == yynewLRState && yyp->yypred == yys) { yyaddDeferredAction (yystackp, yyk, yyp, yys0, yyrule); yymarkStackDeleted (yystackp, yyk); YYDPRINTF ((stderr, "Merging stack %lu into stack %lu.\n", (unsigned long int) yyk, (unsigned long int) yyi)); return yyok; } yyp = yyp->yypred; } } yystackp->yytops.yystates[yyk] = yys; yyglrShiftDefer (yystackp, yyk, yynewLRState, yyposn, yys0, yyrule); } return yyok; } static size_t yysplitStack (yyGLRStack* yystackp, size_t yyk) { if (yystackp->yysplitPoint == YY_NULLPTR) { YYASSERT (yyk == 0); yystackp->yysplitPoint = yystackp->yytops.yystates[yyk]; } if (yystackp->yytops.yysize >= yystackp->yytops.yycapacity) { yyGLRState** yynewStates; yybool* yynewLookaheadNeeds; yynewStates = YY_NULLPTR; if (yystackp->yytops.yycapacity > (YYSIZEMAX / (2 * sizeof yynewStates[0]))) yyMemoryExhausted (yystackp); yystackp->yytops.yycapacity *= 2; yynewStates = (yyGLRState**) YYREALLOC (yystackp->yytops.yystates, (yystackp->yytops.yycapacity * sizeof yynewStates[0])); if (yynewStates == YY_NULLPTR) yyMemoryExhausted (yystackp); yystackp->yytops.yystates = yynewStates; yynewLookaheadNeeds = (yybool*) YYREALLOC (yystackp->yytops.yylookaheadNeeds, (yystackp->yytops.yycapacity * sizeof yynewLookaheadNeeds[0])); if (yynewLookaheadNeeds == YY_NULLPTR) yyMemoryExhausted (yystackp); yystackp->yytops.yylookaheadNeeds = yynewLookaheadNeeds; } yystackp->yytops.yystates[yystackp->yytops.yysize] = yystackp->yytops.yystates[yyk]; yystackp->yytops.yylookaheadNeeds[yystackp->yytops.yysize] = yystackp->yytops.yylookaheadNeeds[yyk]; yystackp->yytops.yysize += 1; return yystackp->yytops.yysize-1; } /** True iff YYY0 and YYY1 represent identical options at the top level. * That is, they represent the same rule applied to RHS symbols * that produce the same terminal symbols. */ static yybool yyidenticalOptions (yySemanticOption* yyy0, yySemanticOption* yyy1) { if (yyy0->yyrule == yyy1->yyrule) { yyGLRState *yys0, *yys1; int yyn; for (yys0 = yyy0->yystate, yys1 = yyy1->yystate, yyn = yyrhsLength (yyy0->yyrule); yyn > 0; yys0 = yys0->yypred, yys1 = yys1->yypred, yyn -= 1) if (yys0->yyposn != yys1->yyposn) return yyfalse; return yytrue; } else return yyfalse; } /** Assuming identicalOptions (YYY0,YYY1), destructively merge the * alternative semantic values for the RHS-symbols of YYY1 and YYY0. */ static void yymergeOptionSets (yySemanticOption* yyy0, yySemanticOption* yyy1) { yyGLRState *yys0, *yys1; int yyn; for (yys0 = yyy0->yystate, yys1 = yyy1->yystate, yyn = yyrhsLength (yyy0->yyrule); yyn > 0; yys0 = yys0->yypred, yys1 = yys1->yypred, yyn -= 1) { if (yys0 == yys1) break; else if (yys0->yyresolved) { yys1->yyresolved = yytrue; yys1->yysemantics.yysval = yys0->yysemantics.yysval; } else if (yys1->yyresolved) { yys0->yyresolved = yytrue; yys0->yysemantics.yysval = yys1->yysemantics.yysval; } else { yySemanticOption** yyz0p = &yys0->yysemantics.yyfirstVal; yySemanticOption* yyz1 = yys1->yysemantics.yyfirstVal; while (yytrue) { if (yyz1 == *yyz0p || yyz1 == YY_NULLPTR) break; else if (*yyz0p == YY_NULLPTR) { *yyz0p = yyz1; break; } else if (*yyz0p < yyz1) { yySemanticOption* yyz = *yyz0p; *yyz0p = yyz1; yyz1 = yyz1->yynext; (*yyz0p)->yynext = yyz; } yyz0p = &(*yyz0p)->yynext; } yys1->yysemantics.yyfirstVal = yys0->yysemantics.yyfirstVal; } } } /** Y0 and Y1 represent two possible actions to take in a given * parsing state; return 0 if no combination is possible, * 1 if user-mergeable, 2 if Y0 is preferred, 3 if Y1 is preferred. */ static int yypreference (yySemanticOption* y0, yySemanticOption* y1) { yyRuleNum r0 = y0->yyrule, r1 = y1->yyrule; int p0 = yydprec[r0], p1 = yydprec[r1]; if (p0 == p1) { if (yymerger[r0] == 0 || yymerger[r0] != yymerger[r1]) return 0; else return 1; } if (p0 == 0 || p1 == 0) return 0; if (p0 < p1) return 3; if (p1 < p0) return 2; return 0; } static YYRESULTTAG yyresolveValue (yyGLRState* yys, yyGLRStack* yystackp]b4_user_formals[); /** Resolve the previous YYN states starting at and including state YYS * on *YYSTACKP. If result != yyok, some states may have been left * unresolved possibly with empty semantic option chains. Regardless * of whether result = yyok, each state has been left with consistent * data so that yydestroyGLRState can be invoked if necessary. */ static YYRESULTTAG yyresolveStates (yyGLRState* yys, int yyn, yyGLRStack* yystackp]b4_user_formals[) { if (0 < yyn) { YYASSERT (yys->yypred); YYCHK (yyresolveStates (yys->yypred, yyn-1, yystackp]b4_user_args[)); if (! yys->yyresolved) YYCHK (yyresolveValue (yys, yystackp]b4_user_args[)); } return yyok; } /** Resolve the states for the RHS of YYOPT on *YYSTACKP, perform its * user action, and return the semantic value and location in *YYVALP * and *YYLOCP. Regardless of whether result = yyok, all RHS states * have been destroyed (assuming the user action destroys all RHS * semantic values if invoked). */ static YYRESULTTAG yyresolveAction (yySemanticOption* yyopt, yyGLRStack* yystackp, YYSTYPE* yyvalp]b4_locuser_formals[) { yyGLRStackItem yyrhsVals[YYMAXRHS + YYMAXLEFT + 1]; int yynrhs = yyrhsLength (yyopt->yyrule); YYRESULTTAG yyflag = yyresolveStates (yyopt->yystate, yynrhs, yystackp]b4_user_args[); if (yyflag != yyok) { yyGLRState *yys; for (yys = yyopt->yystate; yynrhs > 0; yys = yys->yypred, yynrhs -= 1) yydestroyGLRState ("Cleanup: popping", yys]b4_user_args[); return yyflag; } yyrhsVals[YYMAXRHS + YYMAXLEFT].yystate.yypred = yyopt->yystate;]b4_locations_if([[ if (yynrhs == 0) /* Set default location. */ yyrhsVals[YYMAXRHS + YYMAXLEFT - 1].yystate.yyloc = yyopt->yystate->yyloc;]])[ { int yychar_current = yychar; YYSTYPE yylval_current = yylval;]b4_locations_if([ YYLTYPE yylloc_current = yylloc;])[ yychar = yyopt->yyrawchar; yylval = yyopt->yyval;]b4_locations_if([ yylloc = yyopt->yyloc;])[ yyflag = yyuserAction (yyopt->yyrule, yynrhs, yyrhsVals + YYMAXRHS + YYMAXLEFT - 1, yystackp, yyvalp]b4_locuser_args[); yychar = yychar_current; yylval = yylval_current;]b4_locations_if([ yylloc = yylloc_current;])[ } return yyflag; } #if ]b4_api_PREFIX[DEBUG static void yyreportTree (yySemanticOption* yyx, int yyindent) { int yynrhs = yyrhsLength (yyx->yyrule); int yyi; yyGLRState* yys; yyGLRState* yystates[1 + YYMAXRHS]; yyGLRState yyleftmost_state; for (yyi = yynrhs, yys = yyx->yystate; 0 < yyi; yyi -= 1, yys = yys->yypred) yystates[yyi] = yys; if (yys == YY_NULLPTR) { yyleftmost_state.yyposn = 0; yystates[0] = &yyleftmost_state; } else yystates[0] = yys; if (yyx->yystate->yyposn < yys->yyposn + 1) YYFPRINTF (stderr, "%*s%s -> \n", yyindent, "", yytokenName (yylhsNonterm (yyx->yyrule)), yyx->yyrule - 1); else YYFPRINTF (stderr, "%*s%s -> \n", yyindent, "", yytokenName (yylhsNonterm (yyx->yyrule)), yyx->yyrule - 1, (unsigned long int) (yys->yyposn + 1), (unsigned long int) yyx->yystate->yyposn); for (yyi = 1; yyi <= yynrhs; yyi += 1) { if (yystates[yyi]->yyresolved) { if (yystates[yyi-1]->yyposn+1 > yystates[yyi]->yyposn) YYFPRINTF (stderr, "%*s%s \n", yyindent+2, "", yytokenName (yystos[yystates[yyi]->yylrState])); else YYFPRINTF (stderr, "%*s%s \n", yyindent+2, "", yytokenName (yystos[yystates[yyi]->yylrState]), (unsigned long int) (yystates[yyi-1]->yyposn + 1), (unsigned long int) yystates[yyi]->yyposn); } else yyreportTree (yystates[yyi]->yysemantics.yyfirstVal, yyindent+2); } } #endif static YYRESULTTAG yyreportAmbiguity (yySemanticOption* yyx0, yySemanticOption* yyx1]b4_pure_formals[) { YYUSE (yyx0); YYUSE (yyx1); #if ]b4_api_PREFIX[DEBUG YYFPRINTF (stderr, "Ambiguity detected.\n"); YYFPRINTF (stderr, "Option 1,\n"); yyreportTree (yyx0, 2); YYFPRINTF (stderr, "\nOption 2,\n"); yyreportTree (yyx1, 2); YYFPRINTF (stderr, "\n"); #endif yyerror (]b4_yyerror_args[YY_("syntax is ambiguous")); return yyabort; }]b4_locations_if([[ /** Resolve the locations for each of the YYN1 states in *YYSTACKP, * ending at YYS1. Has no effect on previously resolved states. * The first semantic option of a state is always chosen. */ static void yyresolveLocations (yyGLRState* yys1, int yyn1, yyGLRStack *yystackp]b4_user_formals[) { if (0 < yyn1) { yyresolveLocations (yys1->yypred, yyn1 - 1, yystackp]b4_user_args[); if (!yys1->yyresolved) { yyGLRStackItem yyrhsloc[1 + YYMAXRHS]; int yynrhs; yySemanticOption *yyoption = yys1->yysemantics.yyfirstVal; YYASSERT (yyoption != YY_NULLPTR); yynrhs = yyrhsLength (yyoption->yyrule); if (yynrhs > 0) { yyGLRState *yys; int yyn; yyresolveLocations (yyoption->yystate, yynrhs, yystackp]b4_user_args[); for (yys = yyoption->yystate, yyn = yynrhs; yyn > 0; yys = yys->yypred, yyn -= 1) yyrhsloc[yyn].yystate.yyloc = yys->yyloc; } else { /* Both yyresolveAction and yyresolveLocations traverse the GSS in reverse rightmost order. It is only necessary to invoke yyresolveLocations on a subforest for which yyresolveAction would have been invoked next had an ambiguity not been detected. Thus the location of the previous state (but not necessarily the previous state itself) is guaranteed to be resolved already. */ yyGLRState *yyprevious = yyoption->yystate; yyrhsloc[0].yystate.yyloc = yyprevious->yyloc; } { int yychar_current = yychar; YYSTYPE yylval_current = yylval; YYLTYPE yylloc_current = yylloc; yychar = yyoption->yyrawchar; yylval = yyoption->yyval; yylloc = yyoption->yyloc; YYLLOC_DEFAULT ((yys1->yyloc), yyrhsloc, yynrhs); yychar = yychar_current; yylval = yylval_current; yylloc = yylloc_current; } } } }]])[ /** Resolve the ambiguity represented in state YYS in *YYSTACKP, * perform the indicated actions, and set the semantic value of YYS. * If result != yyok, the chain of semantic options in YYS has been * cleared instead or it has been left unmodified except that * redundant options may have been removed. Regardless of whether * result = yyok, YYS has been left with consistent data so that * yydestroyGLRState can be invoked if necessary. */ static YYRESULTTAG yyresolveValue (yyGLRState* yys, yyGLRStack* yystackp]b4_user_formals[) { yySemanticOption* yyoptionList = yys->yysemantics.yyfirstVal; yySemanticOption* yybest = yyoptionList; yySemanticOption** yypp; yybool yymerge = yyfalse; YYSTYPE yysval; YYRESULTTAG yyflag;]b4_locations_if([ YYLTYPE *yylocp = &yys->yyloc;])[ for (yypp = &yyoptionList->yynext; *yypp != YY_NULLPTR; ) { yySemanticOption* yyp = *yypp; if (yyidenticalOptions (yybest, yyp)) { yymergeOptionSets (yybest, yyp); *yypp = yyp->yynext; } else { switch (yypreference (yybest, yyp)) { case 0:]b4_locations_if([[ yyresolveLocations (yys, 1, yystackp]b4_user_args[);]])[ return yyreportAmbiguity (yybest, yyp]b4_pure_args[); break; case 1: yymerge = yytrue; break; case 2: break; case 3: yybest = yyp; yymerge = yyfalse; break; default: /* This cannot happen so it is not worth a YYASSERT (yyfalse), but some compilers complain if the default case is omitted. */ break; } yypp = &yyp->yynext; } } if (yymerge) { yySemanticOption* yyp; int yyprec = yydprec[yybest->yyrule]; yyflag = yyresolveAction (yybest, yystackp, &yysval]b4_locuser_args[); if (yyflag == yyok) for (yyp = yybest->yynext; yyp != YY_NULLPTR; yyp = yyp->yynext) { if (yyprec == yydprec[yyp->yyrule]) { YYSTYPE yysval_other;]b4_locations_if([ YYLTYPE yydummy;])[ yyflag = yyresolveAction (yyp, yystackp, &yysval_other]b4_locuser_args([&yydummy])[); if (yyflag != yyok) { yydestruct ("Cleanup: discarding incompletely merged value for", yystos[yys->yylrState], &yysval]b4_locuser_args[); break; } yyuserMerge (yymerger[yyp->yyrule], &yysval, &yysval_other); } } } else yyflag = yyresolveAction (yybest, yystackp, &yysval]b4_locuser_args([yylocp])[); if (yyflag == yyok) { yys->yyresolved = yytrue; yys->yysemantics.yysval = yysval; } else yys->yysemantics.yyfirstVal = YY_NULLPTR; return yyflag; } static YYRESULTTAG yyresolveStack (yyGLRStack* yystackp]b4_user_formals[) { if (yystackp->yysplitPoint != YY_NULLPTR) { yyGLRState* yys; int yyn; for (yyn = 0, yys = yystackp->yytops.yystates[0]; yys != yystackp->yysplitPoint; yys = yys->yypred, yyn += 1) continue; YYCHK (yyresolveStates (yystackp->yytops.yystates[0], yyn, yystackp ]b4_user_args[)); } return yyok; } static void yycompressStack (yyGLRStack* yystackp) { yyGLRState* yyp, *yyq, *yyr; if (yystackp->yytops.yysize != 1 || yystackp->yysplitPoint == YY_NULLPTR) return; for (yyp = yystackp->yytops.yystates[0], yyq = yyp->yypred, yyr = YY_NULLPTR; yyp != yystackp->yysplitPoint; yyr = yyp, yyp = yyq, yyq = yyp->yypred) yyp->yypred = yyr; yystackp->yyspaceLeft += yystackp->yynextFree - yystackp->yyitems; yystackp->yynextFree = ((yyGLRStackItem*) yystackp->yysplitPoint) + 1; yystackp->yyspaceLeft -= yystackp->yynextFree - yystackp->yyitems; yystackp->yysplitPoint = YY_NULLPTR; yystackp->yylastDeleted = YY_NULLPTR; while (yyr != YY_NULLPTR) { yystackp->yynextFree->yystate = *yyr; yyr = yyr->yypred; yystackp->yynextFree->yystate.yypred = &yystackp->yynextFree[-1].yystate; yystackp->yytops.yystates[0] = &yystackp->yynextFree->yystate; yystackp->yynextFree += 1; yystackp->yyspaceLeft -= 1; } } static YYRESULTTAG yyprocessOneStack (yyGLRStack* yystackp, size_t yyk, size_t yyposn]b4_pure_formals[) { while (yystackp->yytops.yystates[yyk] != YY_NULLPTR) { yyStateNum yystate = yystackp->yytops.yystates[yyk]->yylrState; YYDPRINTF ((stderr, "Stack %lu Entering state %d\n", (unsigned long int) yyk, yystate)); YYASSERT (yystate != YYFINAL); if (yyisDefaultedState (yystate)) { YYRESULTTAG yyflag; yyRuleNum yyrule = yydefaultAction (yystate); if (yyrule == 0) { YYDPRINTF ((stderr, "Stack %lu dies.\n", (unsigned long int) yyk)); yymarkStackDeleted (yystackp, yyk); return yyok; } yyflag = yyglrReduce (yystackp, yyk, yyrule, yyimmediate[yyrule]]b4_user_args[); if (yyflag == yyerr) { YYDPRINTF ((stderr, "Stack %lu dies " "(predicate failure or explicit user error).\n", (unsigned long int) yyk)); yymarkStackDeleted (yystackp, yyk); return yyok; } if (yyflag != yyok) return yyflag; } else { yySymbol yytoken; int yyaction; const short int* yyconflicts; yystackp->yytops.yylookaheadNeeds[yyk] = yytrue; if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = ]b4_lex[; } if (yychar <= YYEOF) { yychar = yytoken = YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else { yytoken = YYTRANSLATE (yychar); YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); } yygetLRActions (yystate, yytoken, &yyaction, &yyconflicts); while (*yyconflicts != 0) { YYRESULTTAG yyflag; size_t yynewStack = yysplitStack (yystackp, yyk); YYDPRINTF ((stderr, "Splitting off stack %lu from %lu.\n", (unsigned long int) yynewStack, (unsigned long int) yyk)); yyflag = yyglrReduce (yystackp, yynewStack, *yyconflicts, yyimmediate[*yyconflicts]]b4_user_args[); if (yyflag == yyok) YYCHK (yyprocessOneStack (yystackp, yynewStack, yyposn]b4_pure_args[)); else if (yyflag == yyerr) { YYDPRINTF ((stderr, "Stack %lu dies.\n", (unsigned long int) yynewStack)); yymarkStackDeleted (yystackp, yynewStack); } else return yyflag; yyconflicts += 1; } if (yyisShiftAction (yyaction)) break; else if (yyisErrorAction (yyaction)) { YYDPRINTF ((stderr, "Stack %lu dies.\n", (unsigned long int) yyk)); yymarkStackDeleted (yystackp, yyk); break; } else { YYRESULTTAG yyflag = yyglrReduce (yystackp, yyk, -yyaction, yyimmediate[-yyaction]]b4_user_args[); if (yyflag == yyerr) { YYDPRINTF ((stderr, "Stack %lu dies " "(predicate failure or explicit user error).\n", (unsigned long int) yyk)); yymarkStackDeleted (yystackp, yyk); break; } else if (yyflag != yyok) return yyflag; } } } return yyok; } static void yyreportSyntaxError (yyGLRStack* yystackp]b4_user_formals[) { if (yystackp->yyerrState != 0) return; #if ! YYERROR_VERBOSE yyerror (]b4_lyyerror_args[YY_("syntax error")); #else { yySymbol yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar); size_t yysize0 = yytnamerr (YY_NULLPTR, yytokenName (yytoken)); size_t yysize = yysize0; yybool yysize_overflow = yyfalse; char* yymsg = YY_NULLPTR; enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; /* Internationalized format string. */ const char *yyformat = YY_NULLPTR; /* Arguments of yyformat. */ char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; /* Number of reported tokens (one for the "unexpected", one per "expected"). */ int yycount = 0; /* There are many possibilities here to consider: - If this state is a consistent state with a default action, then the only way this function was invoked is if the default action is an error action. In that case, don't check for expected tokens because there are none. - The only way there can be no lookahead present (in yychar) is if this state is a consistent state with a default action. Thus, detecting the absence of a lookahead is sufficient to determine that there is no unexpected or expected token to report. In that case, just report a simple "syntax error". - Don't assume there isn't a lookahead just because this state is a consistent state with a default action. There might have been a previous inconsistent state, consistent state with a non-default action, or user semantic action that manipulated yychar. - Of course, the expected token list depends on states to have correct lookahead information, and it depends on the parser not to perform extra reductions after fetching a lookahead from the scanner and before detecting a syntax error. Thus, state merging (from LALR or IELR) and default reductions corrupt the expected token list. However, the list is correct for canonical LR with one exception: it will still contain any token that will not be accepted due to an error action in a later state. */ if (yytoken != YYEMPTY) { int yyn = yypact[yystackp->yytops.yystates[0]->yylrState]; yyarg[yycount++] = yytokenName (yytoken); if (!yypact_value_is_default (yyn)) { /* Start YYX at -YYN if negative to avoid negative indexes in YYCHECK. In other words, skip the first -YYN actions for this state because they are default actions. */ int yyxbegin = yyn < 0 ? -yyn : 0; /* Stay within bounds of both yycheck and yytname. */ int yychecklim = YYLAST - yyn + 1; int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; int yyx; for (yyx = yyxbegin; yyx < yyxend; ++yyx) if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR && !yytable_value_is_error (yytable[yyx + yyn])) { if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) { yycount = 1; yysize = yysize0; break; } yyarg[yycount++] = yytokenName (yyx); { size_t yysz = yysize + yytnamerr (YY_NULLPTR, yytokenName (yyx)); yysize_overflow |= yysz < yysize; yysize = yysz; } } } } switch (yycount) { #define YYCASE_(N, S) \ case N: \ yyformat = S; \ break YYCASE_(0, YY_("syntax error")); YYCASE_(1, YY_("syntax error, unexpected %s")); YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s")); YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s")); YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s")); YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s")); #undef YYCASE_ } { size_t yysz = yysize + strlen (yyformat); yysize_overflow |= yysz < yysize; yysize = yysz; } if (!yysize_overflow) yymsg = (char *) YYMALLOC (yysize); if (yymsg) { char *yyp = yymsg; int yyi = 0; while ((*yyp = *yyformat)) { if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount) { yyp += yytnamerr (yyp, yyarg[yyi++]); yyformat += 2; } else { yyp++; yyformat++; } } yyerror (]b4_lyyerror_args[yymsg); YYFREE (yymsg); } else { yyerror (]b4_lyyerror_args[YY_("syntax error")); yyMemoryExhausted (yystackp); } } #endif /* YYERROR_VERBOSE */ yynerrs += 1; } /* Recover from a syntax error on *YYSTACKP, assuming that *YYSTACKP->YYTOKENP, yylval, and yylloc are the syntactic category, semantic value, and location of the lookahead. */ static void yyrecoverSyntaxError (yyGLRStack* yystackp]b4_user_formals[) { size_t yyk; int yyj; if (yystackp->yyerrState == 3) /* We just shifted the error token and (perhaps) took some reductions. Skip tokens until we can proceed. */ while (yytrue) { yySymbol yytoken; if (yychar == YYEOF) yyFail (yystackp][]b4_lpure_args[, YY_NULLPTR); if (yychar != YYEMPTY) {]b4_locations_if([[ /* We throw away the lookahead, but the error range of the shifted error token must take it into account. */ yyGLRState *yys = yystackp->yytops.yystates[0]; yyGLRStackItem yyerror_range[3]; yyerror_range[1].yystate.yyloc = yys->yyloc; yyerror_range[2].yystate.yyloc = yylloc; YYLLOC_DEFAULT ((yys->yyloc), yyerror_range, 2);]])[ yytoken = YYTRANSLATE (yychar); yydestruct ("Error: discarding", yytoken, &yylval]b4_locuser_args([&yylloc])[); } YYDPRINTF ((stderr, "Reading a token: ")); yychar = ]b4_lex[; if (yychar <= YYEOF) { yychar = yytoken = YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else { yytoken = YYTRANSLATE (yychar); YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); } yyj = yypact[yystackp->yytops.yystates[0]->yylrState]; if (yypact_value_is_default (yyj)) return; yyj += yytoken; if (yyj < 0 || YYLAST < yyj || yycheck[yyj] != yytoken) { if (yydefact[yystackp->yytops.yystates[0]->yylrState] != 0) return; } else if (! yytable_value_is_error (yytable[yyj])) return; } /* Reduce to one stack. */ for (yyk = 0; yyk < yystackp->yytops.yysize; yyk += 1) if (yystackp->yytops.yystates[yyk] != YY_NULLPTR) break; if (yyk >= yystackp->yytops.yysize) yyFail (yystackp][]b4_lpure_args[, YY_NULLPTR); for (yyk += 1; yyk < yystackp->yytops.yysize; yyk += 1) yymarkStackDeleted (yystackp, yyk); yyremoveDeletes (yystackp); yycompressStack (yystackp); /* Now pop stack until we find a state that shifts the error token. */ yystackp->yyerrState = 3; while (yystackp->yytops.yystates[0] != YY_NULLPTR) { yyGLRState *yys = yystackp->yytops.yystates[0]; yyj = yypact[yys->yylrState]; if (! yypact_value_is_default (yyj)) { yyj += YYTERROR; if (0 <= yyj && yyj <= YYLAST && yycheck[yyj] == YYTERROR && yyisShiftAction (yytable[yyj])) { /* Shift the error token. */]b4_locations_if([[ /* First adjust its location.*/ YYLTYPE yyerrloc; yystackp->yyerror_range[2].yystate.yyloc = yylloc; YYLLOC_DEFAULT (yyerrloc, (yystackp->yyerror_range), 2);]])[ YY_SYMBOL_PRINT ("Shifting", yystos[yytable[yyj]], &yylval, &yyerrloc); yyglrShift (yystackp, 0, yytable[yyj], yys->yyposn, &yylval]b4_locations_if([, &yyerrloc])[); yys = yystackp->yytops.yystates[0]; break; } }]b4_locations_if([[ yystackp->yyerror_range[1].yystate.yyloc = yys->yyloc;]])[ if (yys->yypred != YY_NULLPTR) yydestroyGLRState ("Error: popping", yys]b4_user_args[); yystackp->yytops.yystates[0] = yys->yypred; yystackp->yynextFree -= 1; yystackp->yyspaceLeft += 1; } if (yystackp->yytops.yystates[0] == YY_NULLPTR) yyFail (yystackp][]b4_lpure_args[, YY_NULLPTR); } #define YYCHK1(YYE) \ do { \ switch (YYE) { \ case yyok: \ break; \ case yyabort: \ goto yyabortlab; \ case yyaccept: \ goto yyacceptlab; \ case yyerr: \ goto yyuser_error; \ default: \ goto yybuglab; \ } \ } while (0) /*----------. | yyparse. | `----------*/ ]b4_function_define([yyparse], [int], b4_parse_param)[ { int yyresult; yyGLRStack yystack; yyGLRStack* const yystackp = &yystack; size_t yyposn; YYDPRINTF ((stderr, "Starting parse\n")); yychar = YYEMPTY; yylval = yyval_default;]b4_locations_if([ yylloc = yyloc_default;])[ ]m4_ifdef([b4_initial_action], [ b4_dollar_pushdef([yylval], [], [yylloc])dnl /* User initialization code. */ b4_user_initial_action b4_dollar_popdef])[]dnl [ if (! yyinitGLRStack (yystackp, YYINITDEPTH)) goto yyexhaustedlab; switch (YYSETJMP (yystack.yyexception_buffer)) { case 0: break; case 1: goto yyabortlab; case 2: goto yyexhaustedlab; default: goto yybuglab; } yyglrShift (&yystack, 0, 0, 0, &yylval]b4_locations_if([, &yylloc])[); yyposn = 0; while (yytrue) { /* For efficiency, we have two loops, the first of which is specialized to deterministic operation (single stack, no potential ambiguity). */ /* Standard mode */ while (yytrue) { yyRuleNum yyrule; int yyaction; const short int* yyconflicts; yyStateNum yystate = yystack.yytops.yystates[0]->yylrState; YYDPRINTF ((stderr, "Entering state %d\n", yystate)); if (yystate == YYFINAL) goto yyacceptlab; if (yyisDefaultedState (yystate)) { yyrule = yydefaultAction (yystate); if (yyrule == 0) { ]b4_locations_if([[ yystack.yyerror_range[1].yystate.yyloc = yylloc;]])[ yyreportSyntaxError (&yystack]b4_user_args[); goto yyuser_error; } YYCHK1 (yyglrReduce (&yystack, 0, yyrule, yytrue]b4_user_args[)); } else { yySymbol yytoken; if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = ]b4_lex[; } if (yychar <= YYEOF) { yychar = yytoken = YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else { yytoken = YYTRANSLATE (yychar); YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); } yygetLRActions (yystate, yytoken, &yyaction, &yyconflicts); if (*yyconflicts != 0) break; if (yyisShiftAction (yyaction)) { YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); yychar = YYEMPTY; yyposn += 1; yyglrShift (&yystack, 0, yyaction, yyposn, &yylval]b4_locations_if([, &yylloc])[); if (0 < yystack.yyerrState) yystack.yyerrState -= 1; } else if (yyisErrorAction (yyaction)) { ]b4_locations_if([[ yystack.yyerror_range[1].yystate.yyloc = yylloc;]])[ yyreportSyntaxError (&yystack]b4_user_args[); goto yyuser_error; } else YYCHK1 (yyglrReduce (&yystack, 0, -yyaction, yytrue]b4_user_args[)); } } while (yytrue) { yySymbol yytoken_to_shift; size_t yys; for (yys = 0; yys < yystack.yytops.yysize; yys += 1) yystackp->yytops.yylookaheadNeeds[yys] = yychar != YYEMPTY; /* yyprocessOneStack returns one of three things: - An error flag. If the caller is yyprocessOneStack, it immediately returns as well. When the caller is finally yyparse, it jumps to an error label via YYCHK1. - yyok, but yyprocessOneStack has invoked yymarkStackDeleted (&yystack, yys), which sets the top state of yys to NULL. Thus, yyparse's following invocation of yyremoveDeletes will remove the stack. - yyok, when ready to shift a token. Except in the first case, yyparse will invoke yyremoveDeletes and then shift the next token onto all remaining stacks. This synchronization of the shift (that is, after all preceding reductions on all stacks) helps prevent double destructor calls on yylval in the event of memory exhaustion. */ for (yys = 0; yys < yystack.yytops.yysize; yys += 1) YYCHK1 (yyprocessOneStack (&yystack, yys, yyposn]b4_lpure_args[)); yyremoveDeletes (&yystack); if (yystack.yytops.yysize == 0) { yyundeleteLastStack (&yystack); if (yystack.yytops.yysize == 0) yyFail (&yystack][]b4_lpure_args[, YY_("syntax error")); YYCHK1 (yyresolveStack (&yystack]b4_user_args[)); YYDPRINTF ((stderr, "Returning to deterministic operation.\n")); ]b4_locations_if([[ yystack.yyerror_range[1].yystate.yyloc = yylloc;]])[ yyreportSyntaxError (&yystack]b4_user_args[); goto yyuser_error; } /* If any yyglrShift call fails, it will fail after shifting. Thus, a copy of yylval will already be on stack 0 in the event of a failure in the following loop. Thus, yychar is set to YYEMPTY before the loop to make sure the user destructor for yylval isn't called twice. */ yytoken_to_shift = YYTRANSLATE (yychar); yychar = YYEMPTY; yyposn += 1; for (yys = 0; yys < yystack.yytops.yysize; yys += 1) { int yyaction; const short int* yyconflicts; yyStateNum yystate = yystack.yytops.yystates[yys]->yylrState; yygetLRActions (yystate, yytoken_to_shift, &yyaction, &yyconflicts); /* Note that yyconflicts were handled by yyprocessOneStack. */ YYDPRINTF ((stderr, "On stack %lu, ", (unsigned long int) yys)); YY_SYMBOL_PRINT ("shifting", yytoken_to_shift, &yylval, &yylloc); yyglrShift (&yystack, yys, yyaction, yyposn, &yylval]b4_locations_if([, &yylloc])[); YYDPRINTF ((stderr, "Stack %lu now in state #%d\n", (unsigned long int) yys, yystack.yytops.yystates[yys]->yylrState)); } if (yystack.yytops.yysize == 1) { YYCHK1 (yyresolveStack (&yystack]b4_user_args[)); YYDPRINTF ((stderr, "Returning to deterministic operation.\n")); yycompressStack (&yystack); break; } } continue; yyuser_error: yyrecoverSyntaxError (&yystack]b4_user_args[); yyposn = yystack.yytops.yystates[0]->yyposn; } yyacceptlab: yyresult = 0; goto yyreturn; yybuglab: YYASSERT (yyfalse); goto yyabortlab; yyabortlab: yyresult = 1; goto yyreturn; yyexhaustedlab: yyerror (]b4_lyyerror_args[YY_("memory exhausted")); yyresult = 2; goto yyreturn; yyreturn: if (yychar != YYEMPTY) yydestruct ("Cleanup: discarding lookahead", YYTRANSLATE (yychar), &yylval]b4_locuser_args([&yylloc])[); /* If the stack is well-formed, pop the stack until it is empty, destroying its entries as we go. But free the stack regardless of whether it is well-formed. */ if (yystack.yyitems) { yyGLRState** yystates = yystack.yytops.yystates; if (yystates) { size_t yysize = yystack.yytops.yysize; size_t yyk; for (yyk = 0; yyk < yysize; yyk += 1) if (yystates[yyk]) { while (yystates[yyk]) { yyGLRState *yys = yystates[yyk]; ]b4_locations_if([[ yystack.yyerror_range[1].yystate.yyloc = yys->yyloc;]] )[ if (yys->yypred != YY_NULLPTR) yydestroyGLRState ("Cleanup: popping", yys]b4_user_args[); yystates[yyk] = yys->yypred; yystack.yynextFree -= 1; yystack.yyspaceLeft += 1; } break; } } yyfreeGLRStack (&yystack); } return yyresult; } /* DEBUGGING ONLY */ #if ]b4_api_PREFIX[DEBUG static void yy_yypstack (yyGLRState* yys) { if (yys->yypred) { yy_yypstack (yys->yypred); YYFPRINTF (stderr, " -> "); } YYFPRINTF (stderr, "%d@@%lu", yys->yylrState, (unsigned long int) yys->yyposn); } static void yypstates (yyGLRState* yyst) { if (yyst == YY_NULLPTR) YYFPRINTF (stderr, ""); else yy_yypstack (yyst); YYFPRINTF (stderr, "\n"); } static void yypstack (yyGLRStack* yystackp, size_t yyk) { yypstates (yystackp->yytops.yystates[yyk]); } #define YYINDEX(YYX) \ ((YYX) == YY_NULLPTR ? -1 : (yyGLRStackItem*) (YYX) - yystackp->yyitems) static void yypdumpstack (yyGLRStack* yystackp) { yyGLRStackItem* yyp; size_t yyi; for (yyp = yystackp->yyitems; yyp < yystackp->yynextFree; yyp += 1) { YYFPRINTF (stderr, "%3lu. ", (unsigned long int) (yyp - yystackp->yyitems)); if (*(yybool *) yyp) { YYASSERT (yyp->yystate.yyisState); YYASSERT (yyp->yyoption.yyisState); YYFPRINTF (stderr, "Res: %d, LR State: %d, posn: %lu, pred: %ld", yyp->yystate.yyresolved, yyp->yystate.yylrState, (unsigned long int) yyp->yystate.yyposn, (long int) YYINDEX (yyp->yystate.yypred)); if (! yyp->yystate.yyresolved) YYFPRINTF (stderr, ", firstVal: %ld", (long int) YYINDEX (yyp->yystate .yysemantics.yyfirstVal)); } else { YYASSERT (!yyp->yystate.yyisState); YYASSERT (!yyp->yyoption.yyisState); YYFPRINTF (stderr, "Option. rule: %d, state: %ld, next: %ld", yyp->yyoption.yyrule - 1, (long int) YYINDEX (yyp->yyoption.yystate), (long int) YYINDEX (yyp->yyoption.yynext)); } YYFPRINTF (stderr, "\n"); } YYFPRINTF (stderr, "Tops:"); for (yyi = 0; yyi < yystackp->yytops.yysize; yyi += 1) YYFPRINTF (stderr, "%lu: %ld; ", (unsigned long int) yyi, (long int) YYINDEX (yystackp->yytops.yystates[yyi])); YYFPRINTF (stderr, "\n"); } #endif #undef yylval #undef yychar #undef yynerrs]b4_locations_if([ #undef yylloc]) m4_if(b4_prefix, [yy], [], [[/* Substitute the variable and function names. */ #define yyparse ]b4_prefix[parse #define yylex ]b4_prefix[lex #define yyerror ]b4_prefix[error #define yylval ]b4_prefix[lval #define yychar ]b4_prefix[char #define yydebug ]b4_prefix[debug #define yynerrs ]b4_prefix[nerrs]b4_locations_if([[ #define yylloc ]b4_prefix[lloc]])])[ ]b4_epilogue[]dnl b4_output_end() PKy0](޴AUTHORSnu[PKy0]49!!THANKSnu[PKy0]|wfKK'COPYINGnu[PKy0]hEREADMEnu[PKy0]w#=7=7\TODOnu[PKy0]]y}l}l ChangeLognu[PKy0]V$.]NEWSnu[PKd1]Y&&java.m4nu[PKd1]e  lalr1.javanu[PKd1]  xslt/bison.xslnu[PKd1],oHoHQxslt/xml2text.xslnu[PKd1]%"22xslt/xml2dot.xslnu[PKd1]~AXAXH xslt/xml2xhtml.xslnu[PKd1]_&& w variant.hhnu[PKd1]ѧ**Ǟ glr.ccnu[PKd1]Ǐ  stack.hhnu[PKd1]~~~ r c++-skel.m4nu[PKd1]LbLb+ c.m4nu[PKd1]W < java-skel.m4nu[PKd1](Od"d" fA location.ccnu[PKd1]zZDVVd bison.m4nu[PKd1]^8 m4sugar/m4sugar.m4nu[PKd1]l99[ m4sugar/foreach.m4nu[PKd1]Y쩉? lalr1.ccnu[PKd1]ڝgg yacc.cnu[PKd1]_xx c-skel.m4nu[PKd1]T67 nc-like.m4nu[PKd1]3s