pax_global_header00006660000000000000000000000064126544064120014516gustar00rootroot0000000000000052 comment=9ec550b9a8284203b7674e894d145bd0d15314ab sablecc-3.7/000077500000000000000000000000001265440641200127635ustar00rootroot00000000000000sablecc-3.7/AUTHORS000066400000000000000000000004421265440641200140330ustar00rootroot00000000000000This file contains the name of all copyright holders. Etienne M. Gagnon Ben Menking Mariusz Nowostawski Komivi Kevin Agbakpem Kis Gergely Benne Otten sablecc-3.7/COPYING-LESSER000066400000000000000000000634741265440641200150270ustar00rootroot00000000000000 GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, 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 this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), 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 distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey 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 library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! sablecc-3.7/ChangeLog000066400000000000000000012511151265440641200145430ustar00rootroot00000000000000------------------------------------------------------------------------ r6214 | egagnon | 2012-11-28 20:00:07 -0500 (Mer, 28 nov 2012) | 2 lines Changed paths: M /sablecc/trunk/README.html M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/Version.java * Updated version to 3.7. ------------------------------------------------------------------------ r6213 | egagnon | 2012-11-28 19:59:14 -0500 (Mer, 28 nov 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/Parser.java M /sablecc/trunk/src/org/sablecc/sablecc/parser.txt * Divided parser method switch into smaller methods. ------------------------------------------------------------------------ r6212 | egagnon | 2012-11-28 19:57:32 -0500 (Mer, 28 nov 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/GenLexer.java M /sablecc/trunk/src/org/sablecc/sablecc/GenUtils.java M /sablecc/trunk/src/org/sablecc/sablecc/analyses.txt M /sablecc/trunk/src/org/sablecc/sablecc/analysis/Analysis.java M /sablecc/trunk/src/org/sablecc/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer/Lexer.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer/LexerException.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer.txt A /sablecc/trunk/src/org/sablecc/sablecc/node/InvalidToken.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/ParserException.java M /sablecc/trunk/src/org/sablecc/sablecc/parser.txt M /sablecc/trunk/src/org/sablecc/sablecc/utils.txt * Added invalid token to lexer exception. ------------------------------------------------------------------------ r6211 | egagnon | 2012-11-28 19:48:50 -0500 (Mer, 28 nov 2012) | 2 lines Changed paths: A /sablecc/trunk/src/org/sablecc/sablecc/lexer/IPushbackReader.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer/Lexer.java * Regenerated lexer. ------------------------------------------------------------------------ r6210 | egagnon | 2012-11-28 19:36:13 -0500 (Mer, 28 nov 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/GenLexer.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer.txt * Added the IPushbackReader interface. ------------------------------------------------------------------------ r6208 | egagnon | 2012-08-20 11:12:55 -0400 (Lun, 20 aoû 2012) | 2 lines Changed paths: M /sablecc/trunk/README.html M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/Version.java * Updated version to 3.6. ------------------------------------------------------------------------ r6207 | egagnon | 2012-08-20 11:12:15 -0400 (Lun, 20 aoû 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/Inlining.java * Fixed inlining bug that removed duplicate alternatives. ------------------------------------------------------------------------ r6206 | egagnon | 2012-08-20 11:11:24 -0400 (Lun, 20 aoû 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/node/AAlt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AAltTransform.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AAst.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AAstAlt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AAstProd.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AConcat.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AGrammar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AHelpers.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AIgnTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AListTerm.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ANewListTerm.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ANewTerm.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AProd.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ARegExp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AStateList.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AStates.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ATokens.java * Regenerated parser. ------------------------------------------------------------------------ r6205 | egagnon | 2012-08-17 19:08:19 -0400 (Ven, 17 aoû 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/alternatives.txt * Fixed a bug in the setter of list elements. ------------------------------------------------------------------------ r6203 | egagnon | 2012-07-26 08:44:44 -0400 (Jeu, 26 jul 2012) | 2 lines Changed paths: M /sablecc/trunk/README.html M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/Version.java * Update version to 3.5. ------------------------------------------------------------------------ r6202 | egagnon | 2012-07-26 08:44:09 -0400 (Jeu, 26 jul 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/lexer/Lexer.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer.txt M /sablecc/trunk/src/org/sablecc/sablecc/parser/Parser.java M /sablecc/trunk/src/org/sablecc/sablecc/parser.txt * Use unsigned shift left instead of integer division by 2. ------------------------------------------------------------------------ r6199 | egagnon | 2012-07-23 22:40:21 -0400 (Lun, 23 jul 2012) | 2 lines Changed paths: M /sablecc/trunk/README.html M /sablecc/trunk/src/org/sablecc/sablecc/Version.java * Regenerated Version.java and README.html. ------------------------------------------------------------------------ r6198 | egagnon | 2012-07-23 22:37:25 -0400 (Lun, 23 jul 2012) | 2 lines Changed paths: M /sablecc/trunk/build.xml * Updated version to 3.4. ------------------------------------------------------------------------ r6197 | egagnon | 2012-07-23 22:34:23 -0400 (Lun, 23 jul 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/analysis/Analysis.java M /sablecc/trunk/src/org/sablecc/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/src/org/sablecc/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/src/org/sablecc/sablecc/analysis/ReversedDepthFirstAdapter.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer/Lexer.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer/LexerException.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AAlt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AAltTransform.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AAst.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AAstAlt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AAstProd.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ACharBasic.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ACharChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AConcat.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ADecChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AElem.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AGrammar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AHelperDef.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AHelpers.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AHexChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AIdBasic.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AIgnTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AIntervalSet.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AListTerm.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AMinusBinOp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ANewListTerm.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ANewTerm.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ANullTerm.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AOperationSet.java M /sablecc/trunk/src/org/sablecc/sablecc/node/APlusBinOp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/APlusUnOp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AProd.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AProdName.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AProductionSpecifier.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AQMarkUnOp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ARegExp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ARegExpBasic.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ASetBasic.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ASimpleListTerm.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ASimpleTerm.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AStarUnOp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AStateList.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AStateListTail.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AStates.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AStringBasic.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ATokenDef.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ATokenSpecifier.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ATokens.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ATransition.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AUnExp.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Cast.java M /sablecc/trunk/src/org/sablecc/sablecc/node/EOF.java D /sablecc/trunk/src/org/sablecc/sablecc/node/NoCast.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Node.java D /sablecc/trunk/src/org/sablecc/sablecc/node/NodeCast.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PAlt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PAltTransform.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PAst.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PAstAlt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PAstProd.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PBasic.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PBinOp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PConcat.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PElem.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PGrammar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PHelperDef.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PHelpers.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PIgnTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PListTerm.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PProd.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PProdName.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PRegExp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PSet.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PSpecifier.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PStateList.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PStateListTail.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PStates.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PTerm.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PTokenDef.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PTransition.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PUnExp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PUnOp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Start.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Switch.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Switchable.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TAbstract.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TArrow.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TBar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TBlank.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TColon.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TComma.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TComment.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TDDot.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TDecChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TDot.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TEqual.java M /sablecc/trunk/src/org/sablecc/sablecc/node/THelpers.java M /sablecc/trunk/src/org/sablecc/sablecc/node/THexChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TId.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TIgnored.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TLBkt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TLBrace.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TLPar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TMinus.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TNew.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TNull.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TPackage.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TPkgId.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TPlus.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TQMark.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TRBkt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TRBrace.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TRPar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TSemicolon.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TSlash.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TStar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TStates.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TString.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TSyntax.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TTree.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Token.java D /sablecc/trunk/src/org/sablecc/sablecc/node/TypedLinkedList.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/Parser.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/ParserException.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/State.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/TokenIndex.java * Regenerated the parser. ------------------------------------------------------------------------ r6196 | egagnon | 2012-07-23 22:31:41 -0400 (Lun, 23 jul 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/AddAstProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/AddProdTransformAndAltTransform.java M /sablecc/trunk/src/org/sablecc/sablecc/AltTransformAdapter.java M /sablecc/trunk/src/org/sablecc/sablecc/AlternativeElementTypes.java M /sablecc/trunk/src/org/sablecc/sablecc/CharSet.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeCGNomenclature.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeInlining.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeSimpleTermPosition.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructNFA.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructParserGenerationDatas.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructProdsMap.java M /sablecc/trunk/src/org/sablecc/sablecc/DFA.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAlts.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAnalyses.java M /sablecc/trunk/src/org/sablecc/sablecc/GenLexer.java M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/GenTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/Grammar.java M /sablecc/trunk/src/org/sablecc/sablecc/In_Production.java M /sablecc/trunk/src/org/sablecc/sablecc/Inlining.java M /sablecc/trunk/src/org/sablecc/sablecc/InternalTransformationsToGrammar.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0Collection.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0ItemSet.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1Collection.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1ItemSet.java M /sablecc/trunk/src/org/sablecc/sablecc/MacroExpander.java M /sablecc/trunk/src/org/sablecc/sablecc/Production.java M /sablecc/trunk/src/org/sablecc/sablecc/RecursiveProductionsDetections.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveAltIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveAstIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveProdTransformIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveTransformIds.java M /sablecc/trunk/src/org/sablecc/sablecc/SableCC.java M /sablecc/trunk/src/org/sablecc/sablecc/Symbol.java M /sablecc/trunk/src/org/sablecc/sablecc/SymbolSet.java M /sablecc/trunk/src/org/sablecc/sablecc/Transitions.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedHashMap.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedLinkedList.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedTreeMap.java * Suppressed missing generic parameters warnings. ------------------------------------------------------------------------ r6195 | egagnon | 2012-07-23 22:31:01 -0400 (Lun, 23 jul 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/AddAstProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/AddEventualEmptyTransformationToProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/AddProdTransformAndAltTransform.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeSimpleTermPosition.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructNFA.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructParserGenerationDatas.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAlts.java M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/GenProds.java M /sablecc/trunk/src/org/sablecc/sablecc/Grammar.java M /sablecc/trunk/src/org/sablecc/sablecc/Inlining.java M /sablecc/trunk/src/org/sablecc/sablecc/InternalTransformationsToGrammar.java M /sablecc/trunk/src/org/sablecc/sablecc/MacroExpander.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveAltIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveProdTransformIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveTransformIds.java * Moved unused local variables into comments. ------------------------------------------------------------------------ r6194 | egagnon | 2012-07-23 22:29:00 -0400 (Lun, 23 jul 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/ComputeCGNomenclature.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeSimpleTermPosition.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructParserGenerationDatas.java M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/InternalTransformationsToGrammar.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveAstIds.java * Fixed calls to static methods. ------------------------------------------------------------------------ r6193 | egagnon | 2012-07-23 22:28:32 -0400 (Lun, 23 jul 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/GenProds.java M /sablecc/trunk/src/org/sablecc/sablecc/InternalTransformationsToGrammar.java * Moved unused private methods into comments. ------------------------------------------------------------------------ r6192 | egagnon | 2012-07-23 22:27:38 -0400 (Lun, 23 jul 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/AcceptStates.java M /sablecc/trunk/src/org/sablecc/sablecc/AddAstProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/AddEventualEmptyTransformationToProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/AddProdTransformAndAltTransform.java M /sablecc/trunk/src/org/sablecc/sablecc/AltTransformAdapter.java M /sablecc/trunk/src/org/sablecc/sablecc/AlternativeElementTypes.java M /sablecc/trunk/src/org/sablecc/sablecc/BooleanCast.java M /sablecc/trunk/src/org/sablecc/sablecc/CharSet.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeCGNomenclature.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeInlining.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeSimpleTermPosition.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructNFA.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructParserGenerationDatas.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructProdsMap.java M /sablecc/trunk/src/org/sablecc/sablecc/DFA.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAlts.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAnalyses.java M /sablecc/trunk/src/org/sablecc/sablecc/GenLexer.java M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/GenProds.java M /sablecc/trunk/src/org/sablecc/sablecc/GenTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/GenUtils.java M /sablecc/trunk/src/org/sablecc/sablecc/GenerateAlternativeCodeForParser.java M /sablecc/trunk/src/org/sablecc/sablecc/In_Production.java M /sablecc/trunk/src/org/sablecc/sablecc/Inlining.java M /sablecc/trunk/src/org/sablecc/sablecc/IntSet.java M /sablecc/trunk/src/org/sablecc/sablecc/IntegerCast.java M /sablecc/trunk/src/org/sablecc/sablecc/IntegerComparator.java M /sablecc/trunk/src/org/sablecc/sablecc/InternalTransformationsToGrammar.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0Collection.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0Item.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0ItemSet.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1Collection.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1Item.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1ItemSet.java M /sablecc/trunk/src/org/sablecc/sablecc/ListCast.java M /sablecc/trunk/src/org/sablecc/sablecc/MacroExpander.java M /sablecc/trunk/src/org/sablecc/sablecc/NFA.java M /sablecc/trunk/src/org/sablecc/sablecc/NoCast.java M /sablecc/trunk/src/org/sablecc/sablecc/NodeCast.java M /sablecc/trunk/src/org/sablecc/sablecc/PrettyPrinter.java M /sablecc/trunk/src/org/sablecc/sablecc/Production.java M /sablecc/trunk/src/org/sablecc/sablecc/RecursiveProductionsDetections.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveAltIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveAstIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveProdTransformIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveTransformIds.java M /sablecc/trunk/src/org/sablecc/sablecc/StringCast.java M /sablecc/trunk/src/org/sablecc/sablecc/StringComparator.java M /sablecc/trunk/src/org/sablecc/sablecc/Symbol.java M /sablecc/trunk/src/org/sablecc/sablecc/SymbolSet.java M /sablecc/trunk/src/org/sablecc/sablecc/Transitions.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedHashMap.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedLinkedList.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedTreeMap.java M /sablecc/trunk/src/org/sablecc/sablecc/alternatives.txt M /sablecc/trunk/src/org/sablecc/sablecc/analyses.txt M /sablecc/trunk/src/org/sablecc/sablecc/tokens.txt M /sablecc/trunk/src/org/sablecc/sablecc/utils.txt * Added missing Override annotations. ------------------------------------------------------------------------ r6191 | egagnon | 2012-07-23 22:26:41 -0400 (Lun, 23 jul 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/AcceptStates.java M /sablecc/trunk/src/org/sablecc/sablecc/AddAstProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/AddEventualEmptyTransformationToProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/AddProdTransformAndAltTransform.java M /sablecc/trunk/src/org/sablecc/sablecc/AltTransformAdapter.java M /sablecc/trunk/src/org/sablecc/sablecc/AlternativeElementTypes.java M /sablecc/trunk/src/org/sablecc/sablecc/BooleanCast.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeCGNomenclature.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeInlining.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeSimpleTermPosition.java M /sablecc/trunk/src/org/sablecc/sablecc/ConflictException.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructNFA.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructParserGenerationDatas.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructProdsMap.java M /sablecc/trunk/src/org/sablecc/sablecc/DFA.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAlts.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAnalyses.java M /sablecc/trunk/src/org/sablecc/sablecc/GenLexer.java M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/GenProds.java M /sablecc/trunk/src/org/sablecc/sablecc/GenTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/GenUtils.java M /sablecc/trunk/src/org/sablecc/sablecc/GenerateAlternativeCodeForParser.java M /sablecc/trunk/src/org/sablecc/sablecc/Grammar.java M /sablecc/trunk/src/org/sablecc/sablecc/In_Production.java M /sablecc/trunk/src/org/sablecc/sablecc/Inlining.java M /sablecc/trunk/src/org/sablecc/sablecc/IntegerCast.java M /sablecc/trunk/src/org/sablecc/sablecc/InternalTransformationsToGrammar.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0Collection.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0ItemSet.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1Item.java M /sablecc/trunk/src/org/sablecc/sablecc/NFA.java M /sablecc/trunk/src/org/sablecc/sablecc/NodeCast.java M /sablecc/trunk/src/org/sablecc/sablecc/PrettyPrinter.java M /sablecc/trunk/src/org/sablecc/sablecc/RecursiveProductionsDetections.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveAltIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveAstIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveProdTransformIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveTransformIds.java M /sablecc/trunk/src/org/sablecc/sablecc/SableCC.java M /sablecc/trunk/src/org/sablecc/sablecc/StringCast.java M /sablecc/trunk/src/org/sablecc/sablecc/SymbolSet.java M /sablecc/trunk/src/org/sablecc/sablecc/Transitions.java * Reorganized import declarations. ------------------------------------------------------------------------ r6190 | egagnon | 2012-07-23 22:25:54 -0400 (Lun, 23 jul 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/AddAstProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/AddEventualEmptyTransformationToProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/AddProdTransformAndAltTransform.java M /sablecc/trunk/src/org/sablecc/sablecc/AltTransformAdapter.java M /sablecc/trunk/src/org/sablecc/sablecc/AlternativeElementTypes.java M /sablecc/trunk/src/org/sablecc/sablecc/CharSet.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeCGNomenclature.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeInlining.java M /sablecc/trunk/src/org/sablecc/sablecc/ComputeSimpleTermPosition.java M /sablecc/trunk/src/org/sablecc/sablecc/ConflictException.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructNFA.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructParserGenerationDatas.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructProdsMap.java M /sablecc/trunk/src/org/sablecc/sablecc/DFA.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAlts.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAnalyses.java M /sablecc/trunk/src/org/sablecc/sablecc/GenLexer.java M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/GenProds.java M /sablecc/trunk/src/org/sablecc/sablecc/GenTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/GenerateAlternativeCodeForParser.java M /sablecc/trunk/src/org/sablecc/sablecc/Grammar.java M /sablecc/trunk/src/org/sablecc/sablecc/In_Production.java M /sablecc/trunk/src/org/sablecc/sablecc/Inlining.java M /sablecc/trunk/src/org/sablecc/sablecc/IntegerComparator.java M /sablecc/trunk/src/org/sablecc/sablecc/InternalTransformationsToGrammar.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0Item.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0ItemSet.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1Collection.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1Item.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1ItemSet.java M /sablecc/trunk/src/org/sablecc/sablecc/ListCast.java M /sablecc/trunk/src/org/sablecc/sablecc/MacroExpander.java M /sablecc/trunk/src/org/sablecc/sablecc/Production.java M /sablecc/trunk/src/org/sablecc/sablecc/RecursiveProductionsDetections.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveAltIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveAstIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveProdTransformIds.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveTransformIds.java M /sablecc/trunk/src/org/sablecc/sablecc/StringComparator.java M /sablecc/trunk/src/org/sablecc/sablecc/Symbol.java M /sablecc/trunk/src/org/sablecc/sablecc/Transitions.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedHashMap.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedLinkedList.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedTreeMap.java M /sablecc/trunk/src/org/sablecc/sablecc/alternatives.txt M /sablecc/trunk/src/org/sablecc/sablecc/parser.txt M /sablecc/trunk/src/org/sablecc/sablecc/utils.txt * Suppressed raw types warnings. ------------------------------------------------------------------------ r6189 | egagnon | 2012-07-23 22:24:30 -0400 (Lun, 23 jul 2012) | 2 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/ComputeInlining.java * Fixed a bug where SableCC was trying to inline the Start production. ------------------------------------------------------------------------ r6188 | egagnon | 2012-07-23 22:22:32 -0400 (Lun, 23 jul 2012) | 3 lines Changed paths: M /sablecc/trunk/build.xml * Add debug information to generated classes. ------------------------------------------------------------------------ r6187 | egagnon | 2012-07-23 22:19:28 -0400 (Lun, 23 jul 2012) | 1 line Changed paths: A /sablecc/trunk/.classpath A /sablecc/trunk/.project Add Eclipseproject. ------------------------------------------------------------------------ r6186 | egagnon | 2012-06-25 10:58:11 -0400 (Lun, 25 jui 2012) | 2 lines Changed paths: M /sablecc/trunk/README.html M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/Version.java * Updated version to 3.3. ------------------------------------------------------------------------ r6185 | egagnon | 2012-06-25 10:55:09 -0400 (Lun, 25 jui 2012) | 4 lines Changed paths: M /sablecc/trunk/AUTHORS M /sablecc/trunk/LICENSE M /sablecc/trunk/src/org/sablecc/sablecc/SableCC.java M /sablecc/trunk/src/org/sablecc/sablecc/utils.txt * Applied patch by Benne Otten: Fix cloneList() by implementing deep cloning. ------------------------------------------------------------------------ r6184 | egagnon | 2012-06-25 10:53:31 -0400 (Lun, 25 jui 2012) | 1 line Changed paths: M /sablecc/trunk/AUTHORS M /sablecc/trunk/LICENSE M /sablecc/trunk/src/org/sablecc/sablecc/SableCC.java * Updated email addresses. ------------------------------------------------------------------------ r6183 | egagnon | 2012-06-25 10:52:00 -0400 (Lun, 25 jui 2012) | 1 line Changed paths: M /sablecc/trunk/README.html M /sablecc/trunk/README.html.in * Updated links. ------------------------------------------------------------------------ r4740 | egagnon | 2005-12-26 11:34:49 -0500 (Lun, 26 déc 2005) | 2 lines Changed paths: M /sablecc/trunk/LICENSE M /sablecc/trunk/src/org/sablecc/sablecc/SableCC.java * Updated copyright date range. ------------------------------------------------------------------------ r4737 | egagnon | 2005-12-24 12:19:36 -0500 (Sam, 24 déc 2005) | 2 lines Changed paths: M /sablecc/trunk/README.html M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/Version.java * Updated version to 3.2. ------------------------------------------------------------------------ r4736 | egagnon | 2005-12-24 12:18:08 -0500 (Sam, 24 déc 2005) | 3 lines Changed paths: M /sablecc/trunk/src/org/sablecc/sablecc/GenAlts.java M /sablecc/trunk/src/org/sablecc/sablecc/GenUtils.java M /sablecc/trunk/src/org/sablecc/sablecc/GenerateAlternativeCodeForParser.java M /sablecc/trunk/src/org/sablecc/sablecc/alternatives.txt M /sablecc/trunk/src/org/sablecc/sablecc/analyses.txt M /sablecc/trunk/src/org/sablecc/sablecc/lexer.txt M /sablecc/trunk/src/org/sablecc/sablecc/parser.txt M /sablecc/trunk/src/org/sablecc/sablecc/productions.txt M /sablecc/trunk/src/org/sablecc/sablecc/tokens.txt M /sablecc/trunk/src/org/sablecc/sablecc/utils.txt * Generated generic code taking advantage of improved Java type system. ------------------------------------------------------------------------ r4570 | egagnon | 2005-09-29 13:23:23 -0400 (Jeu, 29 sep 2005) | 6 lines Changed paths: M /sablecc/trunk/README.html M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/ComputeInlining.java M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/Inlining.java M /sablecc/trunk/src/org/sablecc/sablecc/SableCC.java M /sablecc/trunk/src/org/sablecc/sablecc/Version.java * Updated version to 3.1. * Added a command-line option to control the maximum number of alternatives in inlined productions. Defaults to 20. * Fixed usage message to show all command-line options. * Fixed programming bug. Fixes BUG:157. ------------------------------------------------------------------------ r4545 | egagnon | 2005-09-27 20:30:45 -0400 (Mar, 27 sep 2005) | 9 lines Changed paths: M /sablecc/trunk M /sablecc/trunk/AUTHORS M /sablecc/trunk/README.html M /sablecc/trunk/README.html.in M /sablecc/trunk/bin/sablecc M /sablecc/trunk/bin/sablecc.bat M /sablecc/trunk/build.xml A /sablecc/trunk/doc (from /developers/egagnon/sandbox/sablecc-trunk/doc:4544) M /sablecc/trunk/doc/description.html M /sablecc/trunk/doc/test.sablecc3 D /sablecc/trunk/sablecc-2x.sablecc2 A /sablecc/trunk/sablecc-3x.sablecc3 (from /developers/egagnon/sandbox/sablecc-trunk/sablecc-3x.sablecc3:4544) M /sablecc/trunk/src/org/sablecc/sablecc A /sablecc/trunk/src/org/sablecc/sablecc/AddAstProductions.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/AddAstProductions.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/AddEventualEmptyTransformationToProductions.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/AddEventualEmptyTransformationToProductions.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/AddProdTransformAndAltTransform.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/AddProdTransformAndAltTransform.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/AltTransformAdapter.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/AltTransformAdapter.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/AlternativeElementTypes.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/AlternativeElementTypes.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/BooleanCast.java M /sablecc/trunk/src/org/sablecc/sablecc/Cast.java M /sablecc/trunk/src/org/sablecc/sablecc/CharSet.java A /sablecc/trunk/src/org/sablecc/sablecc/ComputeCGNomenclature.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/ComputeCGNomenclature.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/ComputeInlining.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/ComputeInlining.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/ComputeSimpleTermPosition.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/ComputeSimpleTermPosition.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/ConflictException.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/ConflictException.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/ConstructNFA.java A /sablecc/trunk/src/org/sablecc/sablecc/ConstructParserGenerationDatas.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/ConstructParserGenerationDatas.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/ConstructProdsMap.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/ConstructProdsMap.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/DFA.java M /sablecc/trunk/src/org/sablecc/sablecc/DisplayLicense.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAlts.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAnalyses.java M /sablecc/trunk/src/org/sablecc/sablecc/GenLexer.java M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/GenProds.java M /sablecc/trunk/src/org/sablecc/sablecc/GenTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/GenUtils.java A /sablecc/trunk/src/org/sablecc/sablecc/GenerateAlternativeCodeForParser.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/GenerateAlternativeCodeForParser.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/Grammar.java A /sablecc/trunk/src/org/sablecc/sablecc/In_Production.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/In_Production.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/Inlining.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/Inlining.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/IntSet.java M /sablecc/trunk/src/org/sablecc/sablecc/IntegerCast.java M /sablecc/trunk/src/org/sablecc/sablecc/IntegerComparator.java A /sablecc/trunk/src/org/sablecc/sablecc/InternalTransformationsToGrammar.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/InternalTransformationsToGrammar.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/LR0Collection.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0Item.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0ItemSet.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1Collection.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1Item.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1ItemSet.java M /sablecc/trunk/src/org/sablecc/sablecc/ListCast.java M /sablecc/trunk/src/org/sablecc/sablecc/MacroExpander.java M /sablecc/trunk/src/org/sablecc/sablecc/NFA.java M /sablecc/trunk/src/org/sablecc/sablecc/NodeCast.java A /sablecc/trunk/src/org/sablecc/sablecc/PrettyPrinter.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/PrettyPrinter.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/Production.java A /sablecc/trunk/src/org/sablecc/sablecc/RecursiveProductionsDetections.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/RecursiveProductionsDetections.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/ResolveAltIds.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/ResolveAltIds.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/ResolveAstIds.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/ResolveAstIds.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/ResolveIds.java A /sablecc/trunk/src/org/sablecc/sablecc/ResolveProdTransformIds.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/ResolveProdTransformIds.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/ResolveTransformIds.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/ResolveTransformIds.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/SableCC.java M /sablecc/trunk/src/org/sablecc/sablecc/StringCast.java M /sablecc/trunk/src/org/sablecc/sablecc/StringComparator.java D /sablecc/trunk/src/org/sablecc/sablecc/Switch.java D /sablecc/trunk/src/org/sablecc/sablecc/Switchable.java M /sablecc/trunk/src/org/sablecc/sablecc/Symbol.java M /sablecc/trunk/src/org/sablecc/sablecc/SymbolSet.java M /sablecc/trunk/src/org/sablecc/sablecc/Transitions.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedHashMap.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedTreeMap.java M /sablecc/trunk/src/org/sablecc/sablecc/Version.java M /sablecc/trunk/src/org/sablecc/sablecc/alternatives.txt M /sablecc/trunk/src/org/sablecc/sablecc/analyses.txt M /sablecc/trunk/src/org/sablecc/sablecc/analysis M /sablecc/trunk/src/org/sablecc/sablecc/analysis/Analysis.java M /sablecc/trunk/src/org/sablecc/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/src/org/sablecc/sablecc/analysis/DepthFirstAdapter.java R /sablecc/trunk/src/org/sablecc/sablecc/analysis/ReversedDepthFirstAdapter.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/analysis/ReversedDepthFirstAdapter.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/lexer M /sablecc/trunk/src/org/sablecc/sablecc/lexer/Lexer.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer/lexer.dat M /sablecc/trunk/src/org/sablecc/sablecc/lexer.txt M /sablecc/trunk/src/org/sablecc/sablecc/node A /sablecc/trunk/src/org/sablecc/sablecc/node/AAlt.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/AAlt.java:4544) D /sablecc/trunk/src/org/sablecc/sablecc/node/AAltName.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AAltTransform.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/AAltTransform.java:4544) D /sablecc/trunk/src/org/sablecc/sablecc/node/AAlts.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AAltsTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AAst.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/AAst.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/node/AAstAlt.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/AAstAlt.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/node/AAstProd.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/AAstProd.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/node/AConcat.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AElem.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AElemName.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AGrammar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AHelperDef.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AHelpers.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AIdList.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AIdListTail.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AIgnTokens.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AIgnoredAlt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AIntervalSet.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AListTerm.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/AListTerm.java:4544) D /sablecc/trunk/src/org/sablecc/sablecc/node/ALookAhead.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AMinusBinOp.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ANewListTerm.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/ANewListTerm.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/node/ANewTerm.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/ANewTerm.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/node/ANullTerm.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/ANullTerm.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/node/AOperationSet.java D /sablecc/trunk/src/org/sablecc/sablecc/node/APackage.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AParsedAlt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/APkgName.java D /sablecc/trunk/src/org/sablecc/sablecc/node/APkgNameTail.java M /sablecc/trunk/src/org/sablecc/sablecc/node/APlusBinOp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AProd.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AProdName.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/AProdName.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/node/AProductionSpecifier.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ARegExp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ARegExpBasic.java D /sablecc/trunk/src/org/sablecc/sablecc/node/ARegExpTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ASimpleListTerm.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/ASimpleListTerm.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/node/ASimpleTerm.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/ASimpleTerm.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/node/AStateList.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AStateListTail.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AStates.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ATokenDef.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ATokenSpecifier.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ATokens.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ATransition.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PAltName.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PAltTransform.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/PAltTransform.java:4544) D /sablecc/trunk/src/org/sablecc/sablecc/node/PAlts.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PAltsTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PAst.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/PAst.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/node/PAstAlt.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/PAstAlt.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/node/PAstProd.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/PAstProd.java:4544) D /sablecc/trunk/src/org/sablecc/sablecc/node/PElemName.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PIdList.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PIdListTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PListTerm.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/PListTerm.java:4544) D /sablecc/trunk/src/org/sablecc/sablecc/node/PLookAhead.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PPackage.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PPkgName.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PPkgNameTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PProdName.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/PProdName.java:4544) D /sablecc/trunk/src/org/sablecc/sablecc/node/PRegExpTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PTerm.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/PTerm.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/node/TAbstract.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/TAbstract.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/node/TNew.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/TNew.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/node/TNull.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/TNull.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/node/TSyntax.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/TSyntax.java:4544) A /sablecc/trunk/src/org/sablecc/sablecc/node/TTree.java (from /developers/egagnon/sandbox/sablecc-trunk/src/org/sablecc/sablecc/node/TTree.java:4544) M /sablecc/trunk/src/org/sablecc/sablecc/node/TypedLinkedList.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X1PAltsTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X1PElem.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X1PHelperDef.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X1PIdListTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X1PPkgNameTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X1PProd.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X1PRegExpTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X1PStateListTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X1PTokenDef.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X1PUnExp.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X2PAltsTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X2PElem.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X2PHelperDef.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X2PIdListTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X2PPkgNameTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X2PProd.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X2PRegExpTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X2PStateListTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X2PTokenDef.java D /sablecc/trunk/src/org/sablecc/sablecc/node/X2PUnExp.java D /sablecc/trunk/src/org/sablecc/sablecc/node/XPAltsTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/XPElem.java D /sablecc/trunk/src/org/sablecc/sablecc/node/XPHelperDef.java D /sablecc/trunk/src/org/sablecc/sablecc/node/XPIdListTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/XPPkgNameTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/XPProd.java D /sablecc/trunk/src/org/sablecc/sablecc/node/XPRegExpTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/XPStateListTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/XPTokenDef.java D /sablecc/trunk/src/org/sablecc/sablecc/node/XPUnExp.java M /sablecc/trunk/src/org/sablecc/sablecc/parser M /sablecc/trunk/src/org/sablecc/sablecc/parser/Parser.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/State.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/TokenIndex.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/parser.dat M /sablecc/trunk/src/org/sablecc/sablecc/parser.txt M /sablecc/trunk/src/org/sablecc/sablecc/productions.txt M /sablecc/trunk/src/org/sablecc/sablecc/tokens.txt M /sablecc/trunk/src/org/sablecc/sablecc/utils.txt * Merged: svn merge -r4541:4544 /developers/egagnon/sandbox/sablecc-trunk * Updated version to 3.0. * Added CST->AST grammar-specified transformations. * Added automatic conflict resolution through transparent inlining. (This is enabled by default. To disable, use --no-inline.) * Added the new SableCC 3 grammar in sablecc-3x.sablecc3. * Added example grammar in doc/test.sablecc3. * Added some preliminary documentation in doc/description.html. ------------------------------------------------------------------------ r1413 | egagnon | 2004-01-18 19:53:05 -0500 (Dim, 18 jan 2004) | 3 lines Changed paths: D /sablecc/trunk/ChangeLog D /sablecc/trunk/ChangeLog.header D /sablecc/trunk/ChangeLog.tail D /sablecc/trunk/ChangeLog.usermap M /sablecc/trunk/build.xml * Changed build.xml to generate ChangeLog on-the-fly from the subversion repository log. ------------------------------------------------------------------------ r1412 | egagnon | 2004-01-18 19:32:49 -0500 (Dim, 18 jan 2004) | 3 lines Changed paths: M /sablecc/trunk/README.html M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/Version.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer/Lexer.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer/lexer.dat * Self regenerated. * Increase version to 2.18.2. ------------------------------------------------------------------------ r1409 | egagnon | 2004-01-18 18:06:05 -0500 (Dim, 18 jan 2004) | 3 lines Changed paths: M /sablecc/trunk/sablecc-2x.sablecc2 * Added 'eof = 4' to input grammar to fix a problem on some platform. * Allowed short comments on last line of grammar files. ------------------------------------------------------------------------ r162 | egagnon | 2003-05-22 10:53:00 -0400 (Jeu, 22 mai 2003) | 21 lines Changed paths: M /sablecc/trunk/AUTHORS M /sablecc/trunk/ChangeLog M /sablecc/trunk/README.html M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/TypedHashMap.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedTreeMap.java M /sablecc/trunk/src/org/sablecc/sablecc/Version.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TypedLinkedList.java M /sablecc/trunk/src/org/sablecc/sablecc/utils.txt 2003-05-22 14:52 Etienne M. Gagnon * README.html, build.xml, src/org/sablecc/sablecc/Version.java: Increase version number. 2003-03-28 16:06 Etienne M. Gagnon * src/org/sablecc/sablecc/: TypedHashMap.java, TypedTreeMap.java, node/TypedLinkedList.java: Indent code. 2003-03-28 15:28 Etienne M. Gagnon * AUTHORS, src/org/sablecc/sablecc/TypedHashMap.java, src/org/sablecc/sablecc/TypedTreeMap.java, src/org/sablecc/sablecc/utils.txt: Applied a patch by Kis Gergely to fix a bug in typed collections. ------------------------------------------------------------------------ r157 | egagnon | 2003-03-20 00:47:00 -0500 (Jeu, 20 mar 2003) | 298 lines Changed paths: M /sablecc/trunk/AUTHORS M /sablecc/trunk/ChangeLog D /sablecc/trunk/ChangeLog.old A /sablecc/trunk/ChangeLog.tail (from /sablecc/trunk/ChangeLog.old:156) M /sablecc/trunk/ChangeLog.usermap M /sablecc/trunk/LICENSE M /sablecc/trunk/README.html M /sablecc/trunk/build.xml A /sablecc/trunk/genchangelog A /sablecc/trunk/sablecc-2x.sablecc2 M /sablecc/trunk/src/org/sablecc/sablecc/AcceptStates.java M /sablecc/trunk/src/org/sablecc/sablecc/BooleanCast.java M /sablecc/trunk/src/org/sablecc/sablecc/Cast.java M /sablecc/trunk/src/org/sablecc/sablecc/CharSet.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructNFA.java M /sablecc/trunk/src/org/sablecc/sablecc/DFA.java M /sablecc/trunk/src/org/sablecc/sablecc/DisplayLicense.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAlts.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAnalyses.java M /sablecc/trunk/src/org/sablecc/sablecc/GenLexer.java M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/GenProds.java M /sablecc/trunk/src/org/sablecc/sablecc/GenTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/GenUtils.java M /sablecc/trunk/src/org/sablecc/sablecc/Grammar.java M /sablecc/trunk/src/org/sablecc/sablecc/IntSet.java M /sablecc/trunk/src/org/sablecc/sablecc/IntegerCast.java M /sablecc/trunk/src/org/sablecc/sablecc/IntegerComparator.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0Collection.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0Item.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0ItemSet.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1Collection.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1Item.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1ItemSet.java M /sablecc/trunk/src/org/sablecc/sablecc/ListCast.java M /sablecc/trunk/src/org/sablecc/sablecc/MacroExpander.java M /sablecc/trunk/src/org/sablecc/sablecc/NFA.java M /sablecc/trunk/src/org/sablecc/sablecc/NoCast.java M /sablecc/trunk/src/org/sablecc/sablecc/NodeCast.java D /sablecc/trunk/src/org/sablecc/sablecc/NodeComparator.java M /sablecc/trunk/src/org/sablecc/sablecc/Production.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveIds.java M /sablecc/trunk/src/org/sablecc/sablecc/SableCC.java M /sablecc/trunk/src/org/sablecc/sablecc/StringCast.java M /sablecc/trunk/src/org/sablecc/sablecc/StringComparator.java M /sablecc/trunk/src/org/sablecc/sablecc/Switch.java M /sablecc/trunk/src/org/sablecc/sablecc/Switchable.java M /sablecc/trunk/src/org/sablecc/sablecc/Symbol.java M /sablecc/trunk/src/org/sablecc/sablecc/SymbolSet.java M /sablecc/trunk/src/org/sablecc/sablecc/Transitions.java A /sablecc/trunk/src/org/sablecc/sablecc/TypedHashMap.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedLinkedList.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedTreeMap.java M /sablecc/trunk/src/org/sablecc/sablecc/Version.java M /sablecc/trunk/src/org/sablecc/sablecc/analysis/Analysis.java M /sablecc/trunk/src/org/sablecc/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/src/org/sablecc/sablecc/analysis/DepthFirstAdapter.java A /sablecc/trunk/src/org/sablecc/sablecc/analysis/ReversedDepthFirstAdapter.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer/Lexer.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer/LexerException.java A /sablecc/trunk/src/org/sablecc/sablecc/lexer/lexer.dat A /sablecc/trunk/src/org/sablecc/sablecc/node/AAltName.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AAlts.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AAltsTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ACharBasic.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ACharChar.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AConcat.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ADecChar.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AElem.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AElemName.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AGrammar.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AHelperDef.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AHelpers.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AHexChar.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AIdBasic.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AIdList.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AIdListTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AIgnTokens.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AIgnoredAlt.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AIntervalSet.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ALookAhead.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AMinusBinOp.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AOperationSet.java A /sablecc/trunk/src/org/sablecc/sablecc/node/APackage.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AParsedAlt.java A /sablecc/trunk/src/org/sablecc/sablecc/node/APkgName.java A /sablecc/trunk/src/org/sablecc/sablecc/node/APkgNameTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/APlusBinOp.java A /sablecc/trunk/src/org/sablecc/sablecc/node/APlusUnOp.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AProd.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AProductionSpecifier.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AProductions.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AQMarkUnOp.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ARegExp.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ARegExpBasic.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ARegExpTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ASetBasic.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AStarUnOp.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AStateList.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AStateListTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AStates.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AStringBasic.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ATokenDef.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ATokenSpecifier.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ATokens.java A /sablecc/trunk/src/org/sablecc/sablecc/node/ATransition.java A /sablecc/trunk/src/org/sablecc/sablecc/node/AUnExp.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Alt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Alt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Alt2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AltName.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AltName1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AltNameOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AltNameOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AltNameOpt2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Alts.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Alts1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AltsTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AltsTail1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AltsTails.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AltsTails1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/AltsTails2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Basic.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Basic1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Basic2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Basic3.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Basic4.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Basic5.java D /sablecc/trunk/src/org/sablecc/sablecc/node/BinOp.java D /sablecc/trunk/src/org/sablecc/sablecc/node/BinOp1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/BinOp2.java A /sablecc/trunk/src/org/sablecc/sablecc/node/Cast.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Concat.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Concat1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/EOF.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Elem.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Elem1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/ElemName.java D /sablecc/trunk/src/org/sablecc/sablecc/node/ElemName1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/ElemNameOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/ElemNameOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/ElemNameOpt2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Elems.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Elems1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Elems2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Grammar.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Grammar1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/HelperDef.java D /sablecc/trunk/src/org/sablecc/sablecc/node/HelperDef1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/HelperDefs.java D /sablecc/trunk/src/org/sablecc/sablecc/node/HelperDefs1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/HelperDefs2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Helpers.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Helpers1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/HelpersOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/HelpersOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/HelpersOpt2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IdList.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IdList1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IdListOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IdListOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IdListTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IdListTail1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IdListTails.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IdListTails1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IdListTails2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IgnTokens.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IgnTokens1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IgnTokensOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IgnTokensOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/IgnTokensOpt2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/LookAhead.java D /sablecc/trunk/src/org/sablecc/sablecc/node/LookAhead1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/LookAheadOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/LookAheadOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/LookAheadOpt2.java A /sablecc/trunk/src/org/sablecc/sablecc/node/NoCast.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Node.java A /sablecc/trunk/src/org/sablecc/sablecc/node/NodeCast.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PAlt.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PAltName.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PAlts.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PAltsTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PBasic.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PBinOp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PChar.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PChar1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PChar2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PChar3.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PConcat.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PElem.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PElemName.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PGrammar.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PHelperDef.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PHelpers.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PIdList.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PIdListTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PIgnTokens.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PLookAhead.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PPackage.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PPkgName.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PPkgNameTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PProd.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PProductions.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PRegExp.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PRegExpTail.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PSet.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PSet1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PSet2.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PSpecifier.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PStateList.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PStateListTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PStates.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PTokenDef.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PTokens.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PTransition.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PUnExp.java A /sablecc/trunk/src/org/sablecc/sablecc/node/PUnOp.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Package.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Package1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PackageOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PackageOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PackageOpt2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId10.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId3.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId4.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId5.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId6.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId7.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId8.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId9.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgName.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgName1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameTail1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameTails.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameTails1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameTails2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Prod.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Prod1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Prods.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Prods1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Prods2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Productions.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Productions1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/ProductionsOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/ProductionsOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/ProductionsOpt2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/RegExp.java D /sablecc/trunk/src/org/sablecc/sablecc/node/RegExp1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/RegExpTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/RegExpTail1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/RegExpTails.java D /sablecc/trunk/src/org/sablecc/sablecc/node/RegExpTails1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/RegExpTails2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Specifier.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Specifier1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Specifier2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/SpecifierOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/SpecifierOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/SpecifierOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Start.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Start1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/StateList.java D /sablecc/trunk/src/org/sablecc/sablecc/node/StateList1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/StateListOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/StateListOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/StateListOpt2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/StateListTail.java D /sablecc/trunk/src/org/sablecc/sablecc/node/StateListTail1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/StateListTails.java D /sablecc/trunk/src/org/sablecc/sablecc/node/StateListTails1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/StateListTails2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/States.java D /sablecc/trunk/src/org/sablecc/sablecc/node/States1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/StatesOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/StatesOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/StatesOpt2.java A /sablecc/trunk/src/org/sablecc/sablecc/node/Switch.java A /sablecc/trunk/src/org/sablecc/sablecc/node/Switchable.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TArrow.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TBar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TBlank.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TColon.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TComma.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TComment.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TDDot.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TDecChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TDot.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TEqual.java M /sablecc/trunk/src/org/sablecc/sablecc/node/THelpers.java M /sablecc/trunk/src/org/sablecc/sablecc/node/THexChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TId.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TIgnored.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TLBkt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TLBrace.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TLPar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TMinus.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TPackage.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TPkgId.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TPlus.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TQMark.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TRBkt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TRBrace.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TRPar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TSemicolon.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TSlash.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TStar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TStates.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TString.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Token.java D /sablecc/trunk/src/org/sablecc/sablecc/node/TokenDef.java D /sablecc/trunk/src/org/sablecc/sablecc/node/TokenDef1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/TokenDefs.java D /sablecc/trunk/src/org/sablecc/sablecc/node/TokenDefs1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/TokenDefs2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Tokens.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Tokens1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/TokensOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/TokensOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/TokensOpt2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Transition.java D /sablecc/trunk/src/org/sablecc/sablecc/node/Transition1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/TransitionOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/TransitionOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/TransitionOpt2.java A /sablecc/trunk/src/org/sablecc/sablecc/node/TypedLinkedList.java D /sablecc/trunk/src/org/sablecc/sablecc/node/UnExp.java D /sablecc/trunk/src/org/sablecc/sablecc/node/UnExp1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/UnExps.java D /sablecc/trunk/src/org/sablecc/sablecc/node/UnExps1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/UnExps2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/UnOp.java D /sablecc/trunk/src/org/sablecc/sablecc/node/UnOp1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/UnOp2.java D /sablecc/trunk/src/org/sablecc/sablecc/node/UnOp3.java D /sablecc/trunk/src/org/sablecc/sablecc/node/UnOpOpt.java D /sablecc/trunk/src/org/sablecc/sablecc/node/UnOpOpt1.java D /sablecc/trunk/src/org/sablecc/sablecc/node/UnOpOpt2.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X1PAltsTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X1PElem.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X1PHelperDef.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X1PIdListTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X1PPkgNameTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X1PProd.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X1PRegExpTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X1PStateListTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X1PTokenDef.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X1PUnExp.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X2PAltsTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X2PElem.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X2PHelperDef.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X2PIdListTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X2PPkgNameTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X2PProd.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X2PRegExpTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X2PStateListTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X2PTokenDef.java A /sablecc/trunk/src/org/sablecc/sablecc/node/X2PUnExp.java A /sablecc/trunk/src/org/sablecc/sablecc/node/XPAltsTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/XPElem.java A /sablecc/trunk/src/org/sablecc/sablecc/node/XPHelperDef.java A /sablecc/trunk/src/org/sablecc/sablecc/node/XPIdListTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/XPPkgNameTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/XPProd.java A /sablecc/trunk/src/org/sablecc/sablecc/node/XPRegExpTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/XPStateListTail.java A /sablecc/trunk/src/org/sablecc/sablecc/node/XPTokenDef.java A /sablecc/trunk/src/org/sablecc/sablecc/node/XPUnExp.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/Parser.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/ParserException.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/State.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/TokenIndex.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/parser.dat 2003-03-20 05:47 Etienne M. Gagnon * build.xml: Remove changelog task. 2003-03-20 04:50 Etienne M. Gagnon * README.html, build.xml, src/org/sablecc/sablecc/Version.java: Increase version number. 2003-03-19 05:59 Etienne M. Gagnon * src/org/sablecc/sablecc/SableCC.java: Update copyright notice. 2003-03-19 04:20 Etienne M. Gagnon * build.xml, sablecc-2x.sablecc2: Add grammar file to distribution. 2003-03-19 03:44 Etienne M. Gagnon * src/org/sablecc/sablecc/: lexer/lexer.dat, node/PAlt.java, node/PAltName.java, node/PAlts.java, node/PAltsTail.java, node/PBasic.java, node/PBinOp.java, node/PChar.java, node/PConcat.java, node/PElem.java, node/PElemName.java, node/PGrammar.java, node/PHelperDef.java, node/PHelpers.java, node/PIdList.java, node/PIdListTail.java, node/PIgnTokens.java, node/PLookAhead.java, node/PPackage.java, node/PPkgName.java, node/PPkgNameTail.java, node/PProd.java, node/PProductions.java, node/PRegExp.java, node/PRegExpTail.java, node/PSet.java, node/PSpecifier.java, node/PStateList.java, node/PStateListTail.java, node/PStates.java, node/PTokenDef.java, node/PTokens.java, node/PTransition.java, node/PUnExp.java, node/PUnOp.java, node/Switch.java, node/XPAltsTail.java, node/XPElem.java, node/XPHelperDef.java, node/XPIdListTail.java, node/XPPkgNameTail.java, node/XPProd.java, node/XPRegExpTail.java, node/XPStateListTail.java, node/XPTokenDef.java, node/XPUnExp.java, parser/Parser.java, parser/parser.dat: Add .dat files with keyword expansion off. 2003-03-19 03:27 Etienne M. Gagnon * src/org/sablecc/sablecc/: lexer/lexer.dat, parser/parser.dat: Remove binary files because I forgot to disable keyword expansion. 2003-03-19 03:07 Etienne M. Gagnon * AUTHORS, LICENSE, src/org/sablecc/sablecc/AcceptStates.java, src/org/sablecc/sablecc/ConstructNFA.java, src/org/sablecc/sablecc/GenAlts.java, src/org/sablecc/sablecc/GenAnalyses.java, src/org/sablecc/sablecc/GenLexer.java, src/org/sablecc/sablecc/GenParser.java, src/org/sablecc/sablecc/GenProds.java, src/org/sablecc/sablecc/GenTokens.java, src/org/sablecc/sablecc/GenUtils.java, src/org/sablecc/sablecc/ResolveIds.java, src/org/sablecc/sablecc/SableCC.java, src/org/sablecc/sablecc/Transitions.java, src/org/sablecc/sablecc/analysis/Analysis.java, src/org/sablecc/sablecc/analysis/AnalysisAdapter.java, src/org/sablecc/sablecc/analysis/DepthFirstAdapter.java, src/org/sablecc/sablecc/analysis/ReversedDepthFirstAdapter.java, src/org/sablecc/sablecc/lexer/Lexer.java, src/org/sablecc/sablecc/lexer/LexerException.java, src/org/sablecc/sablecc/lexer/lexer.dat, src/org/sablecc/sablecc/node/AAltName.java, src/org/sablecc/sablecc/node/AAlts.java, src/org/sablecc/sablecc/node/AAltsTail.java, src/org/sablecc/sablecc/node/ACharBasic.java, src/org/sablecc/sablecc/node/ACharChar.java, src/org/sablecc/sablecc/node/AConcat.java, src/org/sablecc/sablecc/node/ADecChar.java, src/org/sablecc/sablecc/node/AElem.java, src/org/sablecc/sablecc/node/AElemName.java, src/org/sablecc/sablecc/node/AGrammar.java, src/org/sablecc/sablecc/node/AHelperDef.java, src/org/sablecc/sablecc/node/AHelpers.java, src/org/sablecc/sablecc/node/AHexChar.java, src/org/sablecc/sablecc/node/AIdBasic.java, src/org/sablecc/sablecc/node/AIdList.java, src/org/sablecc/sablecc/node/AIdListTail.java, src/org/sablecc/sablecc/node/AIgnTokens.java, src/org/sablecc/sablecc/node/AIgnoredAlt.java, src/org/sablecc/sablecc/node/AIntervalSet.java, src/org/sablecc/sablecc/node/ALookAhead.java, src/org/sablecc/sablecc/node/AMinusBinOp.java, src/org/sablecc/sablecc/node/AOperationSet.java, src/org/sablecc/sablecc/node/APackage.java, src/org/sablecc/sablecc/node/AParsedAlt.java, src/org/sablecc/sablecc/node/APkgName.java, src/org/sablecc/sablecc/node/APkgNameTail.java, src/org/sablecc/sablecc/node/APlusBinOp.java, src/org/sablecc/sablecc/node/APlusUnOp.java, src/org/sablecc/sablecc/node/AProd.java, src/org/sablecc/sablecc/node/AProductionSpecifier.java, src/org/sablecc/sablecc/node/AProductions.java, src/org/sablecc/sablecc/node/AQMarkUnOp.java, src/org/sablecc/sablecc/node/ARegExp.java, src/org/sablecc/sablecc/node/ARegExpBasic.java, src/org/sablecc/sablecc/node/ARegExpTail.java, src/org/sablecc/sablecc/node/ASetBasic.java, src/org/sablecc/sablecc/node/AStarUnOp.java, src/org/sablecc/sablecc/node/AStateList.java, src/org/sablecc/sablecc/node/AStateListTail.java, src/org/sablecc/sablecc/node/AStates.java, src/org/sablecc/sablecc/node/AStringBasic.java, src/org/sablecc/sablecc/node/ATokenDef.java, src/org/sablecc/sablecc/node/ATokenSpecifier.java, src/org/sablecc/sablecc/node/ATokens.java, src/org/sablecc/sablecc/node/ATransition.java, src/org/sablecc/sablecc/node/AUnExp.java, src/org/sablecc/sablecc/node/Cast.java, src/org/sablecc/sablecc/node/EOF.java, src/org/sablecc/sablecc/node/NoCast.java, src/org/sablecc/sablecc/node/Node.java, src/org/sablecc/sablecc/node/NodeCast.java, src/org/sablecc/sablecc/node/PAlt.java, src/org/sablecc/sablecc/node/PAltName.java, src/org/sablecc/sablecc/node/PAlts.java, src/org/sablecc/sablecc/node/PAltsTail.java, src/org/sablecc/sablecc/node/PBasic.java, src/org/sablecc/sablecc/node/PBinOp.java, src/org/sablecc/sablecc/node/PChar.java, src/org/sablecc/sablecc/node/PConcat.java, src/org/sablecc/sablecc/node/PElem.java, src/org/sablecc/sablecc/node/PElemName.java, src/org/sablecc/sablecc/node/PGrammar.java, src/org/sablecc/sablecc/node/PHelperDef.java, src/org/sablecc/sablecc/node/PHelpers.java, src/org/sablecc/sablecc/node/PIdList.java, src/org/sablecc/sablecc/node/PIdListTail.java, src/org/sablecc/sablecc/node/PIgnTokens.java, src/org/sablecc/sablecc/node/PLookAhead.java, src/org/sablecc/sablecc/node/PPackage.java, src/org/sablecc/sablecc/node/PPkgName.java, src/org/sablecc/sablecc/node/PPkgNameTail.java, src/org/sablecc/sablecc/node/PProd.java, src/org/sablecc/sablecc/node/PProductions.java, src/org/sablecc/sablecc/node/PRegExp.java, src/org/sablecc/sablecc/node/PRegExpTail.java, src/org/sablecc/sablecc/node/PSet.java, src/org/sablecc/sablecc/node/PSpecifier.java, src/org/sablecc/sablecc/node/PStateList.java, src/org/sablecc/sablecc/node/PStateListTail.java, src/org/sablecc/sablecc/node/PStates.java, src/org/sablecc/sablecc/node/PTokenDef.java, src/org/sablecc/sablecc/node/PTokens.java, src/org/sablecc/sablecc/node/PTransition.java, src/org/sablecc/sablecc/node/PUnExp.java, src/org/sablecc/sablecc/node/PUnOp.java, src/org/sablecc/sablecc/node/Start.java, src/org/sablecc/sablecc/node/Switch.java, src/org/sablecc/sablecc/node/Switchable.java, src/org/sablecc/sablecc/node/TArrow.java, src/org/sablecc/sablecc/node/TBar.java, src/org/sablecc/sablecc/node/TBlank.java, src/org/sablecc/sablecc/node/TChar.java, src/org/sablecc/sablecc/node/TColon.java, src/org/sablecc/sablecc/node/TComma.java, src/org/sablecc/sablecc/node/TComment.java, src/org/sablecc/sablecc/node/TDDot.java, src/org/sablecc/sablecc/node/TDecChar.java, src/org/sablecc/sablecc/node/TDot.java, src/org/sablecc/sablecc/node/TEqual.java, src/org/sablecc/sablecc/node/THelpers.java, src/org/sablecc/sablecc/node/THexChar.java, src/org/sablecc/sablecc/node/TId.java, src/org/sablecc/sablecc/node/TIgnored.java, src/org/sablecc/sablecc/node/TLBkt.java, src/org/sablecc/sablecc/node/TLBrace.java, src/org/sablecc/sablecc/node/TLPar.java, src/org/sablecc/sablecc/node/TMinus.java, src/org/sablecc/sablecc/node/TPackage.java, src/org/sablecc/sablecc/node/TPkgId.java, src/org/sablecc/sablecc/node/TPlus.java, src/org/sablecc/sablecc/node/TProductionSpecifier.java, src/org/sablecc/sablecc/node/TProductions.java, src/org/sablecc/sablecc/node/TQMark.java, src/org/sablecc/sablecc/node/TRBkt.java, src/org/sablecc/sablecc/node/TRBrace.java, src/org/sablecc/sablecc/node/TRPar.java, src/org/sablecc/sablecc/node/TSemicolon.java, src/org/sablecc/sablecc/node/TSlash.java, src/org/sablecc/sablecc/node/TStar.java, src/org/sablecc/sablecc/node/TStates.java, src/org/sablecc/sablecc/node/TString.java, src/org/sablecc/sablecc/node/TTokenSpecifier.java, src/org/sablecc/sablecc/node/TTokens.java, src/org/sablecc/sablecc/node/Token.java, src/org/sablecc/sablecc/node/TypedLinkedList.java, src/org/sablecc/sablecc/node/X1PAltsTail.java, src/org/sablecc/sablecc/node/X1PElem.java, src/org/sablecc/sablecc/node/X1PHelperDef.java, src/org/sablecc/sablecc/node/X1PIdListTail.java, src/org/sablecc/sablecc/node/X1PPkgNameTail.java, src/org/sablecc/sablecc/node/X1PProd.java, src/org/sablecc/sablecc/node/X1PRegExpTail.java, src/org/sablecc/sablecc/node/X1PStateListTail.java, src/org/sablecc/sablecc/node/X1PTokenDef.java, src/org/sablecc/sablecc/node/X1PUnExp.java, src/org/sablecc/sablecc/node/X2PAltsTail.java, src/org/sablecc/sablecc/node/X2PElem.java, src/org/sablecc/sablecc/node/X2PHelperDef.java, src/org/sablecc/sablecc/node/X2PIdListTail.java, src/org/sablecc/sablecc/node/X2PPkgNameTail.java, src/org/sablecc/sablecc/node/X2PProd.java, src/org/sablecc/sablecc/node/X2PRegExpTail.java, src/org/sablecc/sablecc/node/X2PStateListTail.java, src/org/sablecc/sablecc/node/X2PTokenDef.java, src/org/sablecc/sablecc/node/X2PUnExp.java, src/org/sablecc/sablecc/node/XPAltsTail.java, src/org/sablecc/sablecc/node/XPElem.java, src/org/sablecc/sablecc/node/XPHelperDef.java, src/org/sablecc/sablecc/node/XPIdListTail.java, src/org/sablecc/sablecc/node/XPPkgNameTail.java, src/org/sablecc/sablecc/node/XPProd.java, src/org/sablecc/sablecc/node/XPRegExpTail.java, src/org/sablecc/sablecc/node/XPStateListTail.java, src/org/sablecc/sablecc/node/XPTokenDef.java, src/org/sablecc/sablecc/node/XPUnExp.java, src/org/sablecc/sablecc/parser/Parser.java, src/org/sablecc/sablecc/parser/ParserException.java, src/org/sablecc/sablecc/parser/State.java, src/org/sablecc/sablecc/parser/TokenIndex.java, src/org/sablecc/sablecc/parser/parser.dat: A mix of code by Komivi Agbakpem and Etienne Gagnon to make SableCC self generating. This is an important step towards 3.0. Changes were implemented so that generated code should be 100% identical to code produced by SableCC 2.16.2. If you ever detect any failure to produce identical code, you should report a bug. 2002-06-12 19:33 Etienne M. Gagnon * src/org/sablecc/sablecc/: AcceptStates.java, BooleanCast.java, Cast.java, CharSet.java, ConstructNFA.java, DFA.java, DisplayLicense.java, GenAlts.java, GenAnalyses.java, GenLexer.java, GenParser.java, GenProds.java, GenTokens.java, GenUtils.java, Grammar.java, IntSet.java, IntegerCast.java, IntegerComparator.java, LR0Collection.java, LR0Item.java, LR0ItemAndSetPair.java, LR0ItemSet.java, LR1Collection.java, LR1Item.java, LR1ItemSet.java, ListCast.java, MacroExpander.java, NFA.java, NoCast.java, NodeCast.java, Production.java, ResolveIds.java, SableCC.java, StringCast.java, StringComparator.java, Switch.java, Switchable.java, Symbol.java, SymbolSet.java, Transitions.java, TypedHashMap.java, TypedLinkedList.java, TypedTreeMap.java, analysis/Analysis.java, analysis/AnalysisAdapter.java, analysis/DepthFirstAdapter.java, lexer/Lexer.java, lexer/LexerException.java, node/EOF.java, node/Node.java, node/PChar.java, node/PSet.java, node/Start.java, node/TArrow.java, node/TBar.java, node/TBlank.java, node/TChar.java, node/TColon.java, node/TComma.java, node/TComment.java, node/TDDot.java, node/TDecChar.java, node/TDot.java, node/TEqual.java, node/THelpers.java, node/THexChar.java, node/TId.java, node/TIgnored.java, node/TLBkt.java, node/TLBrace.java, node/TLPar.java, node/TMinus.java, node/TPackage.java, node/TPkgId.java, node/TPlus.java, node/TProductionSpecifier.java, node/TProductions.java, node/TQMark.java, node/TRBkt.java, node/TRBrace.java, node/TRPar.java, node/TSemicolon.java, node/TSlash.java, node/TStar.java, node/TStates.java, node/TString.java, node/TTokenSpecifier.java, node/TTokens.java, node/Token.java, parser/Parser.java, parser/ParserException.java, parser/State.java, parser/TokenIndex.java, Grammar.java: Indent with astyle. 2002-06-12 18:23 Etienne M. Gagnon * src/org/sablecc/sablecc/: CharSet.java, ConstructNFA.java, DFA.java, GenAlts.java, GenAnalyses.java, GenProds.java, GenTokens.java, GenUtils.java, Grammar.java, IntSet.java, LR0Collection.java, LR0ItemSet.java, LR1Collection.java, LR1Item.java, LR1ItemSet.java, MacroExpander.java, Production.java, SableCC.java, Symbol.java, analysis/DepthFirstAdapter.java: Indent. 2002-06-07 03:35 Etienne M. Gagnon * LICENSE, build.xml, src/org/sablecc/sablecc/ResolveIds.java, src/org/sablecc/sablecc/Transitions.java, src/org/sablecc/sablecc/TypedHashMap.java, src/org/sablecc/sablecc/analysis/AnalysisAdapter.java: Prepare the transition to a SableCC 2 based front-end. Concretely, this means that we cannot depend anymore on the Node.getId() method which is not generated by SableCC 2. Thus, we must add a new TypedHashMap class and eliminate the NodeComparator class. ------------------------------------------------------------------------ r156 | egagnon | 2003-03-20 00:47:00 -0500 (Jeu, 20 mar 2003) | 2 lines Changed paths: A /sablecc/trunk (from /sablecc/trunk:77) Recover 2.16.x trunk. ------------------------------------------------------------------------ r77 | egagnon | 2001-01-29 22:34:00 -0500 (Lun, 29 jan 2001) | 8 lines Changed paths: M /sablecc/trunk/ChangeLog M /sablecc/trunk/README.html M /sablecc/trunk/README.html.in M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/Version.java M /sablecc/trunk/src/org/sablecc/sablecc/alternatives.txt 2001-01-30 03:30 Etienne M. Gagnon * README.html, README.html.in, build.xml, src/org/sablecc/sablecc/Version.java, src/org/sablecc/sablecc/alternatives.txt: Minor change to node.setXXX in generated code. Updated version. ------------------------------------------------------------------------ r73 | egagnon | 2001-01-22 18:55:00 -0500 (Lun, 22 jan 2001) | 8 lines Changed paths: M /sablecc/trunk/ChangeLog M /sablecc/trunk/README.html M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/Version.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer.txt M /sablecc/trunk/src/org/sablecc/sablecc/parser.txt 2001-01-22 23:54 Etienne M. Gagnon * README.html, build.xml, src/org/sablecc/sablecc/Version.java, src/org/sablecc/sablecc/lexer.txt, src/org/sablecc/sablecc/parser.txt: Improved error message for missing lexer.dat and parser.dat files. ------------------------------------------------------------------------ r71 | egagnon | 2001-01-21 11:24:00 -0500 (Dim, 21 jan 2001) | 21 lines Changed paths: M /sablecc/trunk/ChangeLog M /sablecc/trunk/LICENSE M /sablecc/trunk/README.html M /sablecc/trunk/README.html.in M /sablecc/trunk/THANKS M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/GenTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/Grammar.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0Collection.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveIds.java M /sablecc/trunk/src/org/sablecc/sablecc/SableCC.java M /sablecc/trunk/src/org/sablecc/sablecc/Version.java M /sablecc/trunk/src/org/sablecc/sablecc/parser.txt 2001-01-21 16:24 Etienne M. Gagnon * LICENSE, src/org/sablecc/sablecc/SableCC.java: Change copyright year. 2001-01-21 16:13 Etienne M. Gagnon * README.html, README.html.in, THANKS, build.xml, src/org/sablecc/sablecc/GenParser.java, src/org/sablecc/sablecc/GenTokens.java, src/org/sablecc/sablecc/Grammar.java, src/org/sablecc/sablecc/LR0Collection.java, src/org/sablecc/sablecc/ResolveIds.java, src/org/sablecc/sablecc/SableCC.java, src/org/sablecc/sablecc/Version.java, src/org/sablecc/sablecc/parser.txt: Include token in parser exception. Update version to stable branch 2.16.x. ------------------------------------------------------------------------ r69 | egagnon | 2001-01-02 22:29:00 -0500 (Mar, 02 jan 2001) | 13 lines Changed paths: M /sablecc/trunk/ChangeLog M /sablecc/trunk/README.html M /sablecc/trunk/README.html.in M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/GenTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/Grammar.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveIds.java M /sablecc/trunk/src/org/sablecc/sablecc/Symbol.java M /sablecc/trunk/src/org/sablecc/sablecc/Version.java 2001-01-03 03:28 Etienne M. Gagnon * README.html.in, build.xml, src/org/sablecc/sablecc/GenParser.java, src/org/sablecc/sablecc/GenTokens.java, src/org/sablecc/sablecc/Grammar.java, src/org/sablecc/sablecc/ResolveIds.java, src/org/sablecc/sablecc/Symbol.java, README.html, src/org/sablecc/sablecc/Version.java: Improved error messages. Updated version to experimental branch 2.15.x. ------------------------------------------------------------------------ r67 | egagnon | 2000-12-24 14:34:00 -0500 (Dim, 24 déc 2000) | 14 lines Changed paths: M /sablecc/trunk/ChangeLog M /sablecc/trunk/README.html M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/Version.java 2000-12-24 19:32 Etienne M. Gagnon * README.html, build.xml, src/org/sablecc/sablecc/Version.java: Fixed the build process to get a specific version of ant-task (this is important for historical purpose. Updated project version. 2000-12-22 08:01 Mariusz Nowostawski * build.xml: Adding support to include sablecc ANT task into the binary jar of sablecc. ------------------------------------------------------------------------ r62 | egagnon | 2000-12-16 20:44:00 -0500 (Sam, 16 déc 2000) | 22 lines Changed paths: M /sablecc/trunk/ChangeLog A /sablecc/trunk/ChangeLog.header A /sablecc/trunk/ChangeLog.usermap D /sablecc/trunk/README M /sablecc/trunk/README.html M /sablecc/trunk/README.html.in A /sablecc/trunk/bin A /sablecc/trunk/bin/sablecc A /sablecc/trunk/bin/sablecc.bat M /sablecc/trunk/build.xml M /sablecc/trunk/src/org/sablecc/sablecc/SableCC.java M /sablecc/trunk/src/org/sablecc/sablecc/Version.java 2000-12-17 01:44 Etienne M. Gagnon * README.html, README.html.in, build.xml, src/org/sablecc/sablecc/SableCC.java, src/org/sablecc/sablecc/Version.java: Update version information. 2000-12-17 01:06 Etienne M. Gagnon * README, README.html, README.html.in, build.xml, bin/sablecc, bin/sablecc.bat, src/org/sablecc/sablecc/SableCC.java: Improved the build process. 2000-12-08 17:02 Etienne M. Gagnon * build.xml: Touch regenerated files, and add a dependency on build.xml for *.in files. ------------------------------------------------------------------------ r60 | egagnon | 2000-12-08 02:17:00 -0500 (Ven, 08 déc 2000) | 345 lines Changed paths: A /sablecc/trunk/AUTHORS M /sablecc/trunk/ChangeLog A /sablecc/trunk/ChangeLog.old A /sablecc/trunk/LICENSE (from /sablecc/trunk/SableCC-LICENSE:59) A /sablecc/trunk/README A /sablecc/trunk/README.html A /sablecc/trunk/README.html.in D /sablecc/trunk/SableCC-LICENSE D /sablecc/trunk/SableCC.java A /sablecc/trunk/THANKS A /sablecc/trunk/build.xml D /sablecc/trunk/ca A /sablecc/trunk/etc A /sablecc/trunk/etc/manifest D /sablecc/trunk/grammarv1.txt M /sablecc/trunk/src/org/sablecc/sablecc/AcceptStates.java M /sablecc/trunk/src/org/sablecc/sablecc/BooleanCast.java M /sablecc/trunk/src/org/sablecc/sablecc/Cast.java M /sablecc/trunk/src/org/sablecc/sablecc/CharSet.java M /sablecc/trunk/src/org/sablecc/sablecc/ConstructNFA.java M /sablecc/trunk/src/org/sablecc/sablecc/DFA.java M /sablecc/trunk/src/org/sablecc/sablecc/DisplayLicense.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAlts.java M /sablecc/trunk/src/org/sablecc/sablecc/GenAnalyses.java M /sablecc/trunk/src/org/sablecc/sablecc/GenLexer.java M /sablecc/trunk/src/org/sablecc/sablecc/GenParser.java M /sablecc/trunk/src/org/sablecc/sablecc/GenProds.java M /sablecc/trunk/src/org/sablecc/sablecc/GenTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/GenUtils.java M /sablecc/trunk/src/org/sablecc/sablecc/Grammar.java M /sablecc/trunk/src/org/sablecc/sablecc/IntSet.java M /sablecc/trunk/src/org/sablecc/sablecc/IntegerCast.java M /sablecc/trunk/src/org/sablecc/sablecc/IntegerComparator.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0Collection.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0Item.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/src/org/sablecc/sablecc/LR0ItemSet.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1Collection.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1Item.java M /sablecc/trunk/src/org/sablecc/sablecc/LR1ItemSet.java M /sablecc/trunk/src/org/sablecc/sablecc/ListCast.java M /sablecc/trunk/src/org/sablecc/sablecc/MacroExpander.java M /sablecc/trunk/src/org/sablecc/sablecc/NFA.java M /sablecc/trunk/src/org/sablecc/sablecc/NoCast.java M /sablecc/trunk/src/org/sablecc/sablecc/NodeCast.java M /sablecc/trunk/src/org/sablecc/sablecc/NodeComparator.java M /sablecc/trunk/src/org/sablecc/sablecc/Production.java M /sablecc/trunk/src/org/sablecc/sablecc/ResolveIds.java M /sablecc/trunk/src/org/sablecc/sablecc/SableCC.java M /sablecc/trunk/src/org/sablecc/sablecc/StringCast.java M /sablecc/trunk/src/org/sablecc/sablecc/StringComparator.java M /sablecc/trunk/src/org/sablecc/sablecc/Switch.java M /sablecc/trunk/src/org/sablecc/sablecc/Switchable.java M /sablecc/trunk/src/org/sablecc/sablecc/Symbol.java M /sablecc/trunk/src/org/sablecc/sablecc/SymbolSet.java M /sablecc/trunk/src/org/sablecc/sablecc/Transitions.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedLinkedList.java M /sablecc/trunk/src/org/sablecc/sablecc/TypedTreeMap.java A /sablecc/trunk/src/org/sablecc/sablecc/Version.java A /sablecc/trunk/src/org/sablecc/sablecc/Version.java.in M /sablecc/trunk/src/org/sablecc/sablecc/alternatives.txt M /sablecc/trunk/src/org/sablecc/sablecc/analyses.txt M /sablecc/trunk/src/org/sablecc/sablecc/analysis/Analysis.java M /sablecc/trunk/src/org/sablecc/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/src/org/sablecc/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer/Lexer.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer/LexerException.java M /sablecc/trunk/src/org/sablecc/sablecc/lexer.txt M /sablecc/trunk/src/org/sablecc/sablecc/node/Alt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Alt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Alt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AltName.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AltName1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AltNameOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AltNameOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AltNameOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Alts.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Alts1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AltsTail.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AltsTail1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AltsTails.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AltsTails1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/AltsTails2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Basic.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Basic1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Basic2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Basic3.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Basic4.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Basic5.java M /sablecc/trunk/src/org/sablecc/sablecc/node/BinOp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/BinOp1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/BinOp2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Concat.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Concat1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/EOF.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Elem.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Elem1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ElemName.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ElemName1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ElemNameOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ElemNameOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ElemNameOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Elems.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Elems1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Elems2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Grammar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Grammar1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/HelperDef.java M /sablecc/trunk/src/org/sablecc/sablecc/node/HelperDef1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/HelperDefs.java M /sablecc/trunk/src/org/sablecc/sablecc/node/HelperDefs1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/HelperDefs2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Helpers.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Helpers1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/HelpersOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/HelpersOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/HelpersOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IdList.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IdList1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IdListOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IdListOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IdListTail.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IdListTail1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IdListTails.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IdListTails1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IdListTails2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IgnTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IgnTokens1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IgnTokensOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IgnTokensOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/IgnTokensOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/LookAhead.java M /sablecc/trunk/src/org/sablecc/sablecc/node/LookAhead1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/LookAheadOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/LookAheadOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/LookAheadOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Node.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PChar1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PChar2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PChar3.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PSet.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PSet1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PSet2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Package.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Package1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PackageOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PackageOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PackageOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId10.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId3.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId4.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId5.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId6.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId7.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId8.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgId9.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgName.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgName1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameTail.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameTail1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameTails.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameTails1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/PkgNameTails2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Prod.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Prod1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Prods.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Prods1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Prods2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Productions.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Productions1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ProductionsOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ProductionsOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/ProductionsOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/RegExp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/RegExp1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/RegExpTail.java M /sablecc/trunk/src/org/sablecc/sablecc/node/RegExpTail1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/RegExpTails.java M /sablecc/trunk/src/org/sablecc/sablecc/node/RegExpTails1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/RegExpTails2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Specifier.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Specifier1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Specifier2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/SpecifierOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/SpecifierOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/SpecifierOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Start.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Start1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/StateList.java M /sablecc/trunk/src/org/sablecc/sablecc/node/StateList1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/StateListOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/StateListOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/StateListOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/StateListTail.java M /sablecc/trunk/src/org/sablecc/sablecc/node/StateListTail1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/StateListTails.java M /sablecc/trunk/src/org/sablecc/sablecc/node/StateListTails1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/StateListTails2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/States.java M /sablecc/trunk/src/org/sablecc/sablecc/node/States1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/StatesOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/StatesOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/StatesOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TArrow.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TBar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TBlank.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TColon.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TComma.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TComment.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TDDot.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TDecChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TDot.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TEqual.java M /sablecc/trunk/src/org/sablecc/sablecc/node/THelpers.java M /sablecc/trunk/src/org/sablecc/sablecc/node/THexChar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TId.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TIgnored.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TLBkt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TLBrace.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TLPar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TMinus.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TPackage.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TPkgId.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TPlus.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TProductions.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TQMark.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TRBkt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TRBrace.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TRPar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TSemicolon.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TSlash.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TStar.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TStates.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TString.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TTokens.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Token.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TokenDef.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TokenDef1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TokenDefs.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TokenDefs1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TokenDefs2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Tokens.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Tokens1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TokensOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TokensOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TokensOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Transition.java M /sablecc/trunk/src/org/sablecc/sablecc/node/Transition1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TransitionOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TransitionOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/TransitionOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/UnExp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/UnExp1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/UnExps.java M /sablecc/trunk/src/org/sablecc/sablecc/node/UnExps1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/UnExps2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/UnOp.java M /sablecc/trunk/src/org/sablecc/sablecc/node/UnOp1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/UnOp2.java M /sablecc/trunk/src/org/sablecc/sablecc/node/UnOp3.java M /sablecc/trunk/src/org/sablecc/sablecc/node/UnOpOpt.java M /sablecc/trunk/src/org/sablecc/sablecc/node/UnOpOpt1.java M /sablecc/trunk/src/org/sablecc/sablecc/node/UnOpOpt2.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/Parser.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/ParserException.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/State.java M /sablecc/trunk/src/org/sablecc/sablecc/parser/TokenIndex.java M /sablecc/trunk/src/org/sablecc/sablecc/parser.txt M /sablecc/trunk/src/org/sablecc/sablecc/productions.txt M /sablecc/trunk/src/org/sablecc/sablecc/tokens.txt M /sablecc/trunk/src/org/sablecc/sablecc/utils.txt 2000-12-08 07:17 Etienne M. Gagnon * build.xml: Added reconfigure build target to force re-expansion of *.in files. 2000-12-08 07:10 Etienne M. Gagnon * README.html, src/org/sablecc/sablecc/Version.java: Added generated source files in the CVS repository to simplify the life of casual users. 2000-12-08 07:05 Etienne M. Gagnon * AUTHORS, INSTALL, README, README.html.in, THANKS, build.xml, etc/manifest, src/SableCC.java, src/org/sablecc/sablecc/DisplayLicense.java, src/org/sablecc/sablecc/SableCC.java, src/org/sablecc/sablecc/Version.java.in: Fixed the build file to have the following targets: compile, jar, srcdist, dist, clean, distclean. 2000-12-07 14:09 Etienne M. Gagnon * src/org/sablecc/sablecc/SableCC.java: Fixed command line syntax. 2000-12-07 08:50 Mariusz Nowostawski * src/org/sablecc/sablecc/: DisplayLicense.java, Grammar.java, LR0Collection.java, Production.java, SableCC.java, Symbol.java: Removing dependency on static final structures, adding optional reinitialization to the sablecc engine. From the command line it is now possible to invoke SableCC with multiple grammar files to generate multiple parsers with single sablecc instance. From tools it is possible to invoke sablecc engine for mutliple grammar files and reuse all already loaded and initialized classes. 2000-12-07 04:32 Etienne M. Gagnon * AUTHORS: Added new author. 2000-12-07 04:24 Mariusz Nowostawski * build.xml: Adding copyright info. Removing obsolete deltree construct. Fixing etc/manifest in the dist target. 2000-12-07 04:17 Mariusz Nowostawski * build.xml, etc/manifest: Initial skeleton of built system to work with ANT (ant 1.3 compatibile). 2000-12-06 05:05 Etienne M. Gagnon * src/org/sablecc/sablecc/parser/parser.dat: Adding file as binary. 2000-12-06 05:04 Etienne M. Gagnon * src/org/sablecc/sablecc/parser/parser.dat: Removing file, because not checked-in as binary. 2000-12-06 04:57 Etienne M. Gagnon * AUTHORS, COPYING-LESSER, INSTALL, LICENSE, README, THANKS, src/SableCC.java, src/org/sablecc/sablecc/AcceptStates.java, src/org/sablecc/sablecc/BooleanCast.java, src/org/sablecc/sablecc/Cast.java, src/org/sablecc/sablecc/CharSet.java, src/org/sablecc/sablecc/ConstructNFA.java, src/org/sablecc/sablecc/DFA.java, src/org/sablecc/sablecc/DisplayLicense.java, src/org/sablecc/sablecc/GenAlts.java, src/org/sablecc/sablecc/GenAnalyses.java, src/org/sablecc/sablecc/GenLexer.java, src/org/sablecc/sablecc/GenParser.java, src/org/sablecc/sablecc/GenProds.java, src/org/sablecc/sablecc/GenTokens.java, src/org/sablecc/sablecc/GenUtils.java, src/org/sablecc/sablecc/Grammar.java, src/org/sablecc/sablecc/IntSet.java, src/org/sablecc/sablecc/IntegerCast.java, src/org/sablecc/sablecc/IntegerComparator.java, src/org/sablecc/sablecc/LR0Collection.java, src/org/sablecc/sablecc/LR0Item.java, src/org/sablecc/sablecc/LR0ItemAndSetPair.java, src/org/sablecc/sablecc/LR0ItemSet.java, src/org/sablecc/sablecc/LR1Collection.java, src/org/sablecc/sablecc/LR1Item.java, src/org/sablecc/sablecc/LR1ItemSet.java, src/org/sablecc/sablecc/ListCast.java, src/org/sablecc/sablecc/MacroExpander.java, src/org/sablecc/sablecc/NFA.java, src/org/sablecc/sablecc/NoCast.java, src/org/sablecc/sablecc/NodeCast.java, src/org/sablecc/sablecc/NodeComparator.java, src/org/sablecc/sablecc/Production.java, src/org/sablecc/sablecc/ResolveIds.java, src/org/sablecc/sablecc/SableCC.java, src/org/sablecc/sablecc/StringCast.java, src/org/sablecc/sablecc/StringComparator.java, src/org/sablecc/sablecc/Switch.java, src/org/sablecc/sablecc/Switchable.java, src/org/sablecc/sablecc/Symbol.java, src/org/sablecc/sablecc/SymbolSet.java, src/org/sablecc/sablecc/Transitions.java, src/org/sablecc/sablecc/TypedLinkedList.java, src/org/sablecc/sablecc/TypedTreeMap.java, src/org/sablecc/sablecc/alternatives.txt, src/org/sablecc/sablecc/analyses.txt, src/org/sablecc/sablecc/lexer.txt, src/org/sablecc/sablecc/parser.txt, src/org/sablecc/sablecc/productions.txt, src/org/sablecc/sablecc/tokens.txt, src/org/sablecc/sablecc/utils.txt, src/org/sablecc/sablecc/analysis/Analysis.java, src/org/sablecc/sablecc/analysis/AnalysisAdapter.java, src/org/sablecc/sablecc/analysis/DepthFirstAdapter.java, src/org/sablecc/sablecc/lexer/Lexer.java, src/org/sablecc/sablecc/lexer/LexerException.java, src/org/sablecc/sablecc/node/Alt.java, src/org/sablecc/sablecc/node/Alt1.java, src/org/sablecc/sablecc/node/Alt2.java, src/org/sablecc/sablecc/node/AltName.java, src/org/sablecc/sablecc/node/AltName1.java, src/org/sablecc/sablecc/node/AltNameOpt.java, src/org/sablecc/sablecc/node/AltNameOpt1.java, src/org/sablecc/sablecc/node/AltNameOpt2.java, src/org/sablecc/sablecc/node/Alts.java, src/org/sablecc/sablecc/node/Alts1.java, src/org/sablecc/sablecc/node/AltsTail.java, src/org/sablecc/sablecc/node/AltsTail1.java, src/org/sablecc/sablecc/node/AltsTails.java, src/org/sablecc/sablecc/node/AltsTails1.java, src/org/sablecc/sablecc/node/AltsTails2.java, src/org/sablecc/sablecc/node/Basic.java, src/org/sablecc/sablecc/node/Basic1.java, src/org/sablecc/sablecc/node/Basic2.java, src/org/sablecc/sablecc/node/Basic3.java, src/org/sablecc/sablecc/node/Basic4.java, src/org/sablecc/sablecc/node/Basic5.java, src/org/sablecc/sablecc/node/BinOp.java, src/org/sablecc/sablecc/node/BinOp1.java, src/org/sablecc/sablecc/node/BinOp2.java, src/org/sablecc/sablecc/node/Concat.java, src/org/sablecc/sablecc/node/Concat1.java, src/org/sablecc/sablecc/node/EOF.java, src/org/sablecc/sablecc/node/Elem.java, src/org/sablecc/sablecc/node/Elem1.java, src/org/sablecc/sablecc/node/ElemName.java, src/org/sablecc/sablecc/node/ElemName1.java, src/org/sablecc/sablecc/node/ElemNameOpt.java, src/org/sablecc/sablecc/node/ElemNameOpt1.java, src/org/sablecc/sablecc/node/ElemNameOpt2.java, src/org/sablecc/sablecc/node/Elems.java, src/org/sablecc/sablecc/node/Elems1.java, src/org/sablecc/sablecc/node/Elems2.java, src/org/sablecc/sablecc/node/Grammar.java, src/org/sablecc/sablecc/node/Grammar1.java, src/org/sablecc/sablecc/node/HelperDef.java, src/org/sablecc/sablecc/node/HelperDef1.java, src/org/sablecc/sablecc/node/HelperDefs.java, src/org/sablecc/sablecc/node/HelperDefs1.java, src/org/sablecc/sablecc/node/HelperDefs2.java, src/org/sablecc/sablecc/node/Helpers.java, src/org/sablecc/sablecc/node/Helpers1.java, src/org/sablecc/sablecc/node/HelpersOpt.java, src/org/sablecc/sablecc/node/HelpersOpt1.java, src/org/sablecc/sablecc/node/HelpersOpt2.java, src/org/sablecc/sablecc/node/IdList.java, src/org/sablecc/sablecc/node/IdList1.java, src/org/sablecc/sablecc/node/IdListOpt.java, src/org/sablecc/sablecc/node/IdListOpt1.java, src/org/sablecc/sablecc/node/IdListTail.java, src/org/sablecc/sablecc/node/IdListTail1.java, src/org/sablecc/sablecc/node/IdListTails.java, src/org/sablecc/sablecc/node/IdListTails1.java, src/org/sablecc/sablecc/node/IdListTails2.java, src/org/sablecc/sablecc/node/IgnTokens.java, src/org/sablecc/sablecc/node/IgnTokens1.java, src/org/sablecc/sablecc/node/IgnTokensOpt.java, src/org/sablecc/sablecc/node/IgnTokensOpt1.java, src/org/sablecc/sablecc/node/IgnTokensOpt2.java, src/org/sablecc/sablecc/node/LookAhead.java, src/org/sablecc/sablecc/node/LookAhead1.java, src/org/sablecc/sablecc/node/LookAheadOpt.java, src/org/sablecc/sablecc/node/LookAheadOpt1.java, src/org/sablecc/sablecc/node/LookAheadOpt2.java, src/org/sablecc/sablecc/node/Node.java, src/org/sablecc/sablecc/node/PChar.java, src/org/sablecc/sablecc/node/PChar1.java, src/org/sablecc/sablecc/node/PChar2.java, src/org/sablecc/sablecc/node/PChar3.java, src/org/sablecc/sablecc/node/PSet.java, src/org/sablecc/sablecc/node/PSet1.java, src/org/sablecc/sablecc/node/PSet2.java, src/org/sablecc/sablecc/node/Package.java, src/org/sablecc/sablecc/node/Package1.java, src/org/sablecc/sablecc/node/PackageOpt.java, src/org/sablecc/sablecc/node/PackageOpt1.java, src/org/sablecc/sablecc/node/PackageOpt2.java, src/org/sablecc/sablecc/node/PkgId.java, src/org/sablecc/sablecc/node/PkgId1.java, src/org/sablecc/sablecc/node/PkgId10.java, src/org/sablecc/sablecc/node/PkgId2.java, src/org/sablecc/sablecc/node/PkgId3.java, src/org/sablecc/sablecc/node/PkgId4.java, src/org/sablecc/sablecc/node/PkgId5.java, src/org/sablecc/sablecc/node/PkgId6.java, src/org/sablecc/sablecc/node/PkgId7.java, src/org/sablecc/sablecc/node/PkgId8.java, src/org/sablecc/sablecc/node/PkgId9.java, src/org/sablecc/sablecc/node/PkgName.java, src/org/sablecc/sablecc/node/PkgName1.java, src/org/sablecc/sablecc/node/PkgNameOpt.java, src/org/sablecc/sablecc/node/PkgNameOpt1.java, src/org/sablecc/sablecc/node/PkgNameTail.java, src/org/sablecc/sablecc/node/PkgNameTail1.java, src/org/sablecc/sablecc/node/PkgNameTails.java, src/org/sablecc/sablecc/node/PkgNameTails1.java, src/org/sablecc/sablecc/node/PkgNameTails2.java, src/org/sablecc/sablecc/node/Prod.java, src/org/sablecc/sablecc/node/Prod1.java, src/org/sablecc/sablecc/node/Prods.java, src/org/sablecc/sablecc/node/Prods1.java, src/org/sablecc/sablecc/node/Prods2.java, src/org/sablecc/sablecc/node/Productions.java, src/org/sablecc/sablecc/node/Productions1.java, src/org/sablecc/sablecc/node/ProductionsOpt.java, src/org/sablecc/sablecc/node/ProductionsOpt1.java, src/org/sablecc/sablecc/node/ProductionsOpt2.java, src/org/sablecc/sablecc/node/RegExp.java, src/org/sablecc/sablecc/node/RegExp1.java, src/org/sablecc/sablecc/node/RegExpTail.java, src/org/sablecc/sablecc/node/RegExpTail1.java, src/org/sablecc/sablecc/node/RegExpTails.java, src/org/sablecc/sablecc/node/RegExpTails1.java, src/org/sablecc/sablecc/node/RegExpTails2.java, src/org/sablecc/sablecc/node/Specifier.java, src/org/sablecc/sablecc/node/Specifier1.java, src/org/sablecc/sablecc/node/Specifier2.java, src/org/sablecc/sablecc/node/SpecifierOpt.java, src/org/sablecc/sablecc/node/SpecifierOpt1.java, src/org/sablecc/sablecc/node/SpecifierOpt2.java, src/org/sablecc/sablecc/node/Start.java, src/org/sablecc/sablecc/node/Start1.java, src/org/sablecc/sablecc/node/StateList.java, src/org/sablecc/sablecc/node/StateList1.java, src/org/sablecc/sablecc/node/StateListOpt.java, src/org/sablecc/sablecc/node/StateListOpt1.java, src/org/sablecc/sablecc/node/StateListOpt2.java, src/org/sablecc/sablecc/node/StateListTail.java, src/org/sablecc/sablecc/node/StateListTail1.java, src/org/sablecc/sablecc/node/StateListTails.java, src/org/sablecc/sablecc/node/StateListTails1.java, src/org/sablecc/sablecc/node/StateListTails2.java, src/org/sablecc/sablecc/node/States.java, src/org/sablecc/sablecc/node/States1.java, src/org/sablecc/sablecc/node/StatesOpt.java, src/org/sablecc/sablecc/node/StatesOpt1.java, src/org/sablecc/sablecc/node/StatesOpt2.java, src/org/sablecc/sablecc/node/TArrow.java, src/org/sablecc/sablecc/node/TBar.java, src/org/sablecc/sablecc/node/TBlank.java, src/org/sablecc/sablecc/node/TChar.java, src/org/sablecc/sablecc/node/TColon.java, src/org/sablecc/sablecc/node/TComma.java, src/org/sablecc/sablecc/node/TComment.java, src/org/sablecc/sablecc/node/TDDot.java, src/org/sablecc/sablecc/node/TDecChar.java, src/org/sablecc/sablecc/node/TDot.java, src/org/sablecc/sablecc/node/TEqual.java, src/org/sablecc/sablecc/node/THelpers.java, src/org/sablecc/sablecc/node/THexChar.java, src/org/sablecc/sablecc/node/TId.java, src/org/sablecc/sablecc/node/TIgnored.java, src/org/sablecc/sablecc/node/TLBkt.java, src/org/sablecc/sablecc/node/TLBrace.java, src/org/sablecc/sablecc/node/TLPar.java, src/org/sablecc/sablecc/node/TMinus.java, src/org/sablecc/sablecc/node/TPackage.java, src/org/sablecc/sablecc/node/TPkgId.java, src/org/sablecc/sablecc/node/TPlus.java, src/org/sablecc/sablecc/node/TProductionSpecifier.java, src/org/sablecc/sablecc/node/TProductions.java, src/org/sablecc/sablecc/node/TQMark.java, src/org/sablecc/sablecc/node/TRBkt.java, src/org/sablecc/sablecc/node/TRBrace.java, src/org/sablecc/sablecc/node/TRPar.java, src/org/sablecc/sablecc/node/TSemicolon.java, src/org/sablecc/sablecc/node/TSlash.java, src/org/sablecc/sablecc/node/TStar.java, src/org/sablecc/sablecc/node/TStates.java, src/org/sablecc/sablecc/node/TString.java, src/org/sablecc/sablecc/node/TTokenSpecifier.java, src/org/sablecc/sablecc/node/TTokens.java, src/org/sablecc/sablecc/node/Token.java, src/org/sablecc/sablecc/node/TokenDef.java, src/org/sablecc/sablecc/node/TokenDef1.java, src/org/sablecc/sablecc/node/TokenDefs.java, src/org/sablecc/sablecc/node/TokenDefs1.java, src/org/sablecc/sablecc/node/TokenDefs2.java, src/org/sablecc/sablecc/node/Tokens.java, src/org/sablecc/sablecc/node/Tokens1.java, src/org/sablecc/sablecc/node/TokensOpt.java, src/org/sablecc/sablecc/node/TokensOpt1.java, src/org/sablecc/sablecc/node/TokensOpt2.java, src/org/sablecc/sablecc/node/Transition.java, src/org/sablecc/sablecc/node/Transition1.java, src/org/sablecc/sablecc/node/TransitionOpt.java, src/org/sablecc/sablecc/node/TransitionOpt1.java, src/org/sablecc/sablecc/node/TransitionOpt2.java, src/org/sablecc/sablecc/node/UnExp.java, src/org/sablecc/sablecc/node/UnExp1.java, src/org/sablecc/sablecc/node/UnExps.java, src/org/sablecc/sablecc/node/UnExps1.java, src/org/sablecc/sablecc/node/UnExps2.java, src/org/sablecc/sablecc/node/UnOp.java, src/org/sablecc/sablecc/node/UnOp1.java, src/org/sablecc/sablecc/node/UnOp2.java, src/org/sablecc/sablecc/node/UnOp3.java, src/org/sablecc/sablecc/node/UnOpOpt.java, src/org/sablecc/sablecc/node/UnOpOpt1.java, src/org/sablecc/sablecc/node/UnOpOpt2.java, src/org/sablecc/sablecc/parser/Parser.java, src/org/sablecc/sablecc/parser/ParserException.java, src/org/sablecc/sablecc/parser/State.java, src/org/sablecc/sablecc/parser/TokenIndex.java, src/org/sablecc/sablecc/parser/parser.dat: Changed the directory structure. Use the org.sablecc.sablecc package. ------------------------------------------------------------------------ r59 | egagnon | 2000-12-08 02:17:00 -0500 (Ven, 08 déc 2000) | 2 lines Changed paths: D /sablecc/trunk/ca/mcgill/sable/sablecc A /sablecc/trunk/src A /sablecc/trunk/src/org A /sablecc/trunk/src/org/sablecc A /sablecc/trunk/src/org/sablecc/sablecc (from /sablecc/trunk/ca/mcgill/sable/sablecc:58) Move directory. ------------------------------------------------------------------------ r52 | egagnon | 2000-03-04 21:43:51 -0500 (Sam, 04 mar 2000) | 3 lines Changed paths: A /sablecc/trunk/ChangeLog M /sablecc/trunk/SableCC-LICENSE M /sablecc/trunk/ca/mcgill/sable/sablecc/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Production.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/alternatives.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analyses.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/parser.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/productions.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/tokens.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/utils.txt Added much improved conflict error messages. Applied modifications by Ben Menking . ------------------------------------------------------------------------ r50 | egagnon | 2000-03-03 20:30:20 -0500 (Ven, 03 mar 2000) | 2 lines Changed paths: M /sablecc/trunk/SableCC-LICENSE M /sablecc/trunk/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/AcceptStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/BooleanCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Cast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/CharSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ConstructNFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DisplayLicense.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAlts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAnalyses.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenLexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenParser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenProds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenUtils.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ListCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/MacroExpander.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NoCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Production.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ResolveIds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Switch.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Switchable.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Symbol.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SymbolSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Transitions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/TypedLinkedList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/TypedTreeMap.java M /sablecc/trunk/ca/mcgill/sable/sablecc/alternatives.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analyses.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/Analysis.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/Lexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/LexerException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/EOF.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Node.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId10.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId6.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId7.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId8.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId9.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TArrow.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBlank.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TColon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComma.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComment.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDecChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TEqual.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THelpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THexChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TIgnored.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TMinus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPackage.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPlus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TQMark.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSemicolon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSlash.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TString.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Token.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/Parser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/ParserException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/State.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/TokenIndex.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/productions.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/tokens.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/utils.txt Fixed a bug in TypedLinkedList. ------------------------------------------------------------------------ r48 | egagnon | 1999-12-28 18:05:46 -0500 (Mar, 28 déc 1999) | 2 lines Changed paths: M /sablecc/trunk/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/AcceptStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/BooleanCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Cast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/CharSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ConstructNFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DisplayLicense.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAlts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAnalyses.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenLexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenParser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenProds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenUtils.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ListCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/MacroExpander.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NoCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Production.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ResolveIds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Switch.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Switchable.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Symbol.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SymbolSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Transitions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/TypedLinkedList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/TypedTreeMap.java M /sablecc/trunk/ca/mcgill/sable/sablecc/alternatives.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analyses.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/Analysis.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/Lexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/LexerException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/EOF.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Node.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId10.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId6.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId7.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId8.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId9.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TArrow.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBlank.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TColon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComma.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComment.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDecChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TEqual.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THelpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THexChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TIgnored.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TMinus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPackage.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPlus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TQMark.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSemicolon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSlash.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TString.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Token.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/Parser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/ParserException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/State.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/TokenIndex.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/productions.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/tokens.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/utils.txt Added -d option. ------------------------------------------------------------------------ r46 | egagnon | 1999-11-09 01:23:24 -0500 (Mar, 09 nov 1999) | 2 lines Changed paths: A /sablecc/trunk/COPYING-LESSER A /sablecc/trunk/SableCC-LICENSE (from /sablecc/trunk/ca/mcgill/sable/sablecc/License.txt:45) M /sablecc/trunk/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/AcceptStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/BooleanCast.java A /sablecc/trunk/ca/mcgill/sable/sablecc/Cast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/CharSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ConstructNFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DisplayLicense.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAlts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAnalyses.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenLexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenParser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenProds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenUtils.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1ItemSet.java D /sablecc/trunk/ca/mcgill/sable/sablecc/License.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/ListCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/MacroExpander.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NFA.java A /sablecc/trunk/ca/mcgill/sable/sablecc/NoCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Production.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ResolveIds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringComparator.java A /sablecc/trunk/ca/mcgill/sable/sablecc/Switch.java (from /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switch.java:45) A /sablecc/trunk/ca/mcgill/sable/sablecc/Switchable.java (from /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switchable.java:45) M /sablecc/trunk/ca/mcgill/sable/sablecc/Symbol.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SymbolSet.java A /sablecc/trunk/ca/mcgill/sable/sablecc/Transitions.java A /sablecc/trunk/ca/mcgill/sable/sablecc/TypedLinkedList.java A /sablecc/trunk/ca/mcgill/sable/sablecc/TypedTreeMap.java M /sablecc/trunk/ca/mcgill/sable/sablecc/alternatives.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analyses.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/Analysis.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/Lexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/LexerException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/EOF.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Node.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId10.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId6.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId7.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId8.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId9.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TArrow.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBlank.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TColon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComma.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComment.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDecChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TEqual.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THelpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THexChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TIgnored.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TMinus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPackage.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPlus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TQMark.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSemicolon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSlash.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TString.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Token.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/Parser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/ParserException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/State.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/TokenIndex.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/productions.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/tokens.txt D /sablecc/trunk/ca/mcgill/sable/sablecc/util M /sablecc/trunk/ca/mcgill/sable/sablecc/utils.txt Fixed lexer states. JDK 1.2 only. Removed SableUtil dependency. ------------------------------------------------------------------------ r44 | egagnon | 1999-02-20 17:54:54 -0500 (Sam, 20 fév 1999) | 2 lines Changed paths: M /sablecc/trunk/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/AcceptStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/BooleanCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/CharSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ConstructNFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DisplayLicense.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAlts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAnalyses.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenLexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenParser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenProds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenUtils.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ListCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/MacroExpander.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Production.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ResolveIds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Symbol.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SymbolSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/alternatives.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analyses.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/Analysis.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/Lexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/LexerException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/EOF.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Node.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId10.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId6.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId7.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId8.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId9.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TArrow.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBlank.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TColon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComma.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComment.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDecChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TEqual.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THelpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THexChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TIgnored.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TMinus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPackage.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPlus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TQMark.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSemicolon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSlash.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TString.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Token.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/Parser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/ParserException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/State.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/TokenIndex.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/productions.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/tokens.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switch.java M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switchable.java M /sablecc/trunk/ca/mcgill/sable/sablecc/utils.txt Fixed a bug related to loading resources. ------------------------------------------------------------------------ r42 | egagnon | 1999-02-19 09:48:35 -0500 (Ven, 19 fév 1999) | 2 lines Changed paths: M /sablecc/trunk/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/AcceptStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/BooleanCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/CharSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ConstructNFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DisplayLicense.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAlts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAnalyses.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenLexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenParser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenProds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenUtils.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ListCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/MacroExpander.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Production.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ResolveIds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Symbol.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SymbolSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/alternatives.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analyses.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/Analysis.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/Lexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/LexerException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/EOF.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Node.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId10.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId6.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId7.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId8.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId9.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TArrow.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBlank.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TColon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComma.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComment.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDecChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TEqual.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THelpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THexChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TIgnored.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TMinus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPackage.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPlus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TQMark.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSemicolon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSlash.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TString.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Token.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/Parser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/ParserException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/State.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/TokenIndex.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/productions.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/tokens.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switch.java M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switchable.java M /sablecc/trunk/ca/mcgill/sable/sablecc/utils.txt Added defaultIn/Out methods in AST walkers. ------------------------------------------------------------------------ r40 | egagnon | 1999-01-31 21:29:13 -0500 (Dim, 31 jan 1999) | 2 lines Changed paths: M /sablecc/trunk/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/AcceptStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/BooleanCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/CharSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ConstructNFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DisplayLicense.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAlts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAnalyses.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenLexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenParser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenProds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenUtils.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ListCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/MacroExpander.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Production.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ResolveIds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Symbol.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SymbolSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/alternatives.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analyses.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/Analysis.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/Lexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/LexerException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/EOF.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Node.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId10.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId6.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId7.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId8.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId9.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TArrow.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBlank.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TColon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComma.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComment.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDecChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TEqual.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THelpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THexChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TIgnored.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TMinus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPackage.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPlus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TQMark.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSemicolon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSlash.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TString.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Token.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/Parser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/ParserException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/State.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/TokenIndex.java A /sablecc/trunk/ca/mcgill/sable/sablecc/parser/parser.dat M /sablecc/trunk/ca/mcgill/sable/sablecc/parser.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/productions.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/tokens.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switch.java M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switchable.java M /sablecc/trunk/ca/mcgill/sable/sablecc/utils.txt JDK 1.2 compatibility. ------------------------------------------------------------------------ r30 | egagnon | 1998-11-09 10:35:02 -0500 (Lun, 09 nov 1998) | 2 lines Changed paths: M /sablecc/trunk/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/AcceptStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/BooleanCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/CharSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ConstructNFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DisplayLicense.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAlts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAnalyses.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenLexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenParser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenProds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenUtils.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ListCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/MacroExpander.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Production.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ResolveIds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Symbol.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SymbolSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/alternatives.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analyses.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/Analysis.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/Lexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/LexerException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/EOF.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Node.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId10.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId6.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId7.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId8.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId9.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TArrow.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBlank.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TColon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComma.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComment.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDecChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TEqual.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THelpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THexChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TIgnored.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TMinus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPackage.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPlus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TQMark.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSemicolon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSlash.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TString.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Token.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/Parser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/ParserException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/State.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/TokenIndex.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/productions.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/tokens.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switch.java M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switchable.java M /sablecc/trunk/ca/mcgill/sable/sablecc/utils.txt Made Lexer.getToken() protected. ------------------------------------------------------------------------ r22 | egagnon | 1998-07-24 08:46:50 -0400 (Ven, 24 jul 1998) | 2 lines Changed paths: M /sablecc/trunk/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/AcceptStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/BooleanCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/CharSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ConstructNFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DisplayLicense.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAlts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAnalyses.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenLexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenParser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenProds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenUtils.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ListCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/MacroExpander.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Production.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ResolveIds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Symbol.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SymbolSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/alternatives.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analyses.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/Analysis.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/Lexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/LexerException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/EOF.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Node.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId10.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId6.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId7.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId8.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId9.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TArrow.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBlank.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TColon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComma.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComment.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDecChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TEqual.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THelpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THexChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TIgnored.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TMinus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPackage.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPlus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TQMark.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSemicolon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSlash.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TString.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Token.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/Parser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/ParserException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/State.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/TokenIndex.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/productions.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/tokens.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switch.java M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switchable.java M /sablecc/trunk/ca/mcgill/sable/sablecc/utils.txt Bug fix release. ------------------------------------------------------------------------ r18 | egagnon | 1998-07-23 12:19:27 -0400 (Jeu, 23 jul 1998) | 3 lines Changed paths: M /sablecc/trunk/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/AcceptStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/BooleanCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/CharSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ConstructNFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DisplayLicense.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAlts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAnalyses.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenLexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenParser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenProds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenUtils.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ListCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/MacroExpander.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Production.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ResolveIds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Symbol.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SymbolSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/alternatives.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analyses.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/Analysis.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/Lexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/LexerException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/EOF.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Node.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId10.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId6.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId7.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId8.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId9.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TArrow.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBlank.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TColon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComma.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComment.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDecChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TEqual.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THelpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THexChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TIgnored.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TMinus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPackage.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPlus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TQMark.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSemicolon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSlash.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TString.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Token.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/Parser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/ParserException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/State.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/TokenIndex.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/productions.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/tokens.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switch.java M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switchable.java M /sablecc/trunk/ca/mcgill/sable/sablecc/utils.txt Fixed an bug in an error message and added throws clauses to filter methods. ------------------------------------------------------------------------ r16 | egagnon | 1998-07-18 21:43:30 -0400 (Sam, 18 jul 1998) | 2 lines Changed paths: M /sablecc/trunk/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/AcceptStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/BooleanCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/CharSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ConstructNFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DisplayLicense.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAlts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAnalyses.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenLexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenParser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenProds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenUtils.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/License.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/ListCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/MacroExpander.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Production.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ResolveIds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Symbol.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SymbolSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/alternatives.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analyses.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/Analysis.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/Lexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/LexerException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/EOF.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Node.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId10.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId3.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId4.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId5.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId6.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId7.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId8.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgId9.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TArrow.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBlank.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TColon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComma.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComment.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDecChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TEqual.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THelpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THexChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TIgnored.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TMinus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPackage.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPkgId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPlus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TQMark.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSemicolon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSlash.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TString.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Token.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/Parser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/ParserException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/State.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/TokenIndex.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/productions.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/tokens.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switch.java M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switchable.java M /sablecc/trunk/ca/mcgill/sable/sablecc/utils.txt D /sablecc/trunk/ca/mcgill/sable/util M /sablecc/trunk/grammarv1.txt Fixed the package name bug. It now accepts uppercase letters. ------------------------------------------------------------------------ r7 | egagnon | 1998-07-04 14:21:32 -0400 (Sam, 04 jul 1998) | 4 lines Changed paths: M /sablecc/trunk/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/AcceptStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/BooleanCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/CharSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ConstructNFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/DisplayLicense.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAlts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenAnalyses.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenLexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenParser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenProds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/GenUtils.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemAndSetPair.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Collection.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Item.java M /sablecc/trunk/ca/mcgill/sable/sablecc/LR1ItemSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/License.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/ListCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/MacroExpander.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NFA.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/NodeComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Production.java M /sablecc/trunk/ca/mcgill/sable/sablecc/ResolveIds.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SableCC.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringCast.java M /sablecc/trunk/ca/mcgill/sable/sablecc/StringComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/Symbol.java M /sablecc/trunk/ca/mcgill/sable/sablecc/SymbolSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/alternatives.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analyses.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/Analysis.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/Lexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/LexerException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic4.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic5.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/EOF.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Node.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/States1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TArrow.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBlank.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TColon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComma.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComment.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDecChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TEqual.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THelpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THexChar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TIgnored.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TMinus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPackage.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPlus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TQMark.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBkt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBrace.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRPar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSemicolon.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSlash.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStates.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TString.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Token.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp3.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt1.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/Parser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/ParserException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/State.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/TokenIndex.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/productions.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/tokens.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switch.java M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switchable.java M /sablecc/trunk/ca/mcgill/sable/sablecc/utils.txt M /sablecc/trunk/ca/mcgill/sable/util/AbstractCollection.java M /sablecc/trunk/ca/mcgill/sable/util/AbstractList.java M /sablecc/trunk/ca/mcgill/sable/util/AbstractMap.java M /sablecc/trunk/ca/mcgill/sable/util/AbstractSequentialList.java M /sablecc/trunk/ca/mcgill/sable/util/AbstractSet.java M /sablecc/trunk/ca/mcgill/sable/util/Cast.java M /sablecc/trunk/ca/mcgill/sable/util/Collection.java M /sablecc/trunk/ca/mcgill/sable/util/Comparable.java M /sablecc/trunk/ca/mcgill/sable/util/Comparator.java M /sablecc/trunk/ca/mcgill/sable/util/ConcurrentModificationException.java M /sablecc/trunk/ca/mcgill/sable/util/Iterator.java M /sablecc/trunk/ca/mcgill/sable/util/LinkedList.java M /sablecc/trunk/ca/mcgill/sable/util/List.java M /sablecc/trunk/ca/mcgill/sable/util/ListIterator.java M /sablecc/trunk/ca/mcgill/sable/util/Map.java M /sablecc/trunk/ca/mcgill/sable/util/NoCast.java M /sablecc/trunk/ca/mcgill/sable/util/Set.java M /sablecc/trunk/ca/mcgill/sable/util/SplayTreeMap.java M /sablecc/trunk/ca/mcgill/sable/util/TypedLinkedList.java M /sablecc/trunk/ca/mcgill/sable/util/TypedSplayTreeMap.java M /sablecc/trunk/ca/mcgill/sable/util/UnsupportedOperationException.java Changed the license to the GNU Library General Public License, and divided the work into two parts: SableCC and SableUtil. Also, fixed a minor lexer problem. ------------------------------------------------------------------------ r5 | egagnon | 1998-07-04 14:05:16 -0400 (Sam, 04 jul 1998) | 6 lines Changed paths: D /sablecc/trunk/GDL.grammar M /sablecc/trunk/SableCC.java A /sablecc/trunk/ca/mcgill/sable/sablecc/AcceptStates.java A /sablecc/trunk/ca/mcgill/sable/sablecc/BooleanCast.java A /sablecc/trunk/ca/mcgill/sable/sablecc/CharSet.java D /sablecc/trunk/ca/mcgill/sable/sablecc/CollectIdentifiers.java A /sablecc/trunk/ca/mcgill/sable/sablecc/ConstructNFA.java A /sablecc/trunk/ca/mcgill/sable/sablecc/DFA.java A /sablecc/trunk/ca/mcgill/sable/sablecc/DisplayLicense.java D /sablecc/trunk/ca/mcgill/sable/sablecc/FindPackage.java A /sablecc/trunk/ca/mcgill/sable/sablecc/GenAlts.java A /sablecc/trunk/ca/mcgill/sable/sablecc/GenAnalyses.java A /sablecc/trunk/ca/mcgill/sable/sablecc/GenLexer.java A /sablecc/trunk/ca/mcgill/sable/sablecc/GenParser.java A /sablecc/trunk/ca/mcgill/sable/sablecc/GenProds.java A /sablecc/trunk/ca/mcgill/sable/sablecc/GenTokens.java A /sablecc/trunk/ca/mcgill/sable/sablecc/GenUtils.java A /sablecc/trunk/ca/mcgill/sable/sablecc/Grammar.java A /sablecc/trunk/ca/mcgill/sable/sablecc/IntSet.java A /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerCast.java A /sablecc/trunk/ca/mcgill/sable/sablecc/IntegerComparator.java A /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Collection.java A /sablecc/trunk/ca/mcgill/sable/sablecc/LR0Item.java A /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemAndSetPair.java A /sablecc/trunk/ca/mcgill/sable/sablecc/LR0ItemSet.java A /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Collection.java A /sablecc/trunk/ca/mcgill/sable/sablecc/LR1Item.java A /sablecc/trunk/ca/mcgill/sable/sablecc/LR1ItemSet.java A /sablecc/trunk/ca/mcgill/sable/sablecc/License.txt A /sablecc/trunk/ca/mcgill/sable/sablecc/ListCast.java A /sablecc/trunk/ca/mcgill/sable/sablecc/MacroExpander.java D /sablecc/trunk/ca/mcgill/sable/sablecc/Macros.txt D /sablecc/trunk/ca/mcgill/sable/sablecc/Main.java A /sablecc/trunk/ca/mcgill/sable/sablecc/NFA.java A /sablecc/trunk/ca/mcgill/sable/sablecc/NodeCast.java A /sablecc/trunk/ca/mcgill/sable/sablecc/NodeComparator.java A /sablecc/trunk/ca/mcgill/sable/sablecc/Production.java A /sablecc/trunk/ca/mcgill/sable/sablecc/ResolveIds.java A /sablecc/trunk/ca/mcgill/sable/sablecc/SableCC.java A /sablecc/trunk/ca/mcgill/sable/sablecc/StringCast.java A /sablecc/trunk/ca/mcgill/sable/sablecc/StringComparator.java A /sablecc/trunk/ca/mcgill/sable/sablecc/Symbol.java A /sablecc/trunk/ca/mcgill/sable/sablecc/SymbolSet.java D /sablecc/trunk/ca/mcgill/sable/sablecc/VerifyIdentifiers.java A /sablecc/trunk/ca/mcgill/sable/sablecc/alternatives.txt A /sablecc/trunk/ca/mcgill/sable/sablecc/analyses.txt M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/Analysis.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/AnalysisAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/analysis/DepthFirstAdapter.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/Lexer.java M /sablecc/trunk/ca/mcgill/sable/sablecc/lexer/LexerException.java A /sablecc/trunk/ca/mcgill/sable/sablecc/lexer.txt D /sablecc/trunk/ca/mcgill/sable/sablecc/lexertable A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alt2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltName1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltNameOpt2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alternative.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alternative1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alternatives.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alternatives1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alternatives2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Alts1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTail1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/AltsTails2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Bar.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic3.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic4.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Basic5.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/BasicTerm.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/BasicTerm1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/BasicTerm2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/BasicTerm3.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/BasicTerm4.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/BasicTerm5.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinOp2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinaryOperator.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinaryOperator1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/BinaryOperator2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Blank.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Char.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/CharSet.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/CharSet1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/CharSet2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/CharString.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concat1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concatenation.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concatenation1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Concatenation2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Dot.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/DotDot.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/EOF.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elem1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemName1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/ElemNameOpt2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Elems2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Equal.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Grammar1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDef1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelperDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Helpers2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/HelpersOpt2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdList1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListOpt2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTail1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IdListTails2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Identifier.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Identifiers.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Identifiers1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Identifiers2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokens1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnTokensOpt2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnoredTokens.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnoredTokens1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/IgnoredTokens2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/LBracket.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/LParenthese.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAhead1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/LookAheadOpt2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Minus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Node.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PChar3.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PSet2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Package2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageName.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageName1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageName2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PackageOpt2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgName1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameOpt2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTail1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/PkgNameTails2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Plus.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prod1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Prods2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Production.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Production1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionDefinitions.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionDefinitions1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionDefinitions2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Productions2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/ProductionsOpt2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/QMark.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/RBracket.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/RParenthese.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExp1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTail1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegExpTails2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegularDefinition.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegularDefinition1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegularDefinitions.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegularDefinitions1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegularDefinitions2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegularExpression.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegularExpression1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/RegularExpression2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Semicolon.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Specifier2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/SpecifierOpt2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Star.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Start1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateList1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListOpt2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTail1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/StateListTails2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/States.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/States1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/StatesOpt2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TArrow.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBar.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TBlank.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TChar.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TColon.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComma.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TComment.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDDot.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDecChar.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TDot.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TEqual.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/THelpers.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/THexChar.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TId.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TIgnored.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBkt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLBrace.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TLPar.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TMinus.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPackage.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TPlus.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductionSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TProductions.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TQMark.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBkt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRBrace.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TRPar.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSemicolon.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TSlash.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStar.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TStates.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TString.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokenSpecifier.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/TTokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Token.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDef1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokenDefs2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens.java M /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/Tokens2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TokensOpt2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/Transition1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/TransitionOpt2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExp1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnExps2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp2.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOp3.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt1.java A /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnOpOpt2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnaryOperator.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnaryOperator1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnaryOperator2.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnaryOperator3.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnaryTerm.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnaryTerm1.java D /sablecc/trunk/ca/mcgill/sable/sablecc/node/UnaryTerm2.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/Parser.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/ParserException.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/State.java M /sablecc/trunk/ca/mcgill/sable/sablecc/parser/TokenIndex.java A /sablecc/trunk/ca/mcgill/sable/sablecc/parser.txt D /sablecc/trunk/ca/mcgill/sable/sablecc/parsertable A /sablecc/trunk/ca/mcgill/sable/sablecc/productions.txt A /sablecc/trunk/ca/mcgill/sable/sablecc/tokens.txt D /sablecc/trunk/ca/mcgill/sable/sablecc/util/Comparable.java D /sablecc/trunk/ca/mcgill/sable/sablecc/util/Comparator.java D /sablecc/trunk/ca/mcgill/sable/sablecc/util/IntegerComparator.java D /sablecc/trunk/ca/mcgill/sable/sablecc/util/MacroExpander.java D /sablecc/trunk/ca/mcgill/sable/sablecc/util/Node.java D /sablecc/trunk/ca/mcgill/sable/sablecc/util/SplayTree.java D /sablecc/trunk/ca/mcgill/sable/sablecc/util/SplayTreeEnumeration.java D /sablecc/trunk/ca/mcgill/sable/sablecc/util/StringComparator.java M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switch.java M /sablecc/trunk/ca/mcgill/sable/sablecc/util/Switchable.java A /sablecc/trunk/ca/mcgill/sable/sablecc/utils.txt A /sablecc/trunk/ca/mcgill/sable/util A /sablecc/trunk/ca/mcgill/sable/util/AbstractCollection.java A /sablecc/trunk/ca/mcgill/sable/util/AbstractList.java A /sablecc/trunk/ca/mcgill/sable/util/AbstractMap.java A /sablecc/trunk/ca/mcgill/sable/util/AbstractSequentialList.java A /sablecc/trunk/ca/mcgill/sable/util/AbstractSet.java A /sablecc/trunk/ca/mcgill/sable/util/Cast.java A /sablecc/trunk/ca/mcgill/sable/util/Collection.java A /sablecc/trunk/ca/mcgill/sable/util/Comparable.java A /sablecc/trunk/ca/mcgill/sable/util/Comparator.java A /sablecc/trunk/ca/mcgill/sable/util/ConcurrentModificationException.java A /sablecc/trunk/ca/mcgill/sable/util/Iterator.java A /sablecc/trunk/ca/mcgill/sable/util/LinkedList.java A /sablecc/trunk/ca/mcgill/sable/util/List.java A /sablecc/trunk/ca/mcgill/sable/util/ListIterator.java A /sablecc/trunk/ca/mcgill/sable/util/Map.java A /sablecc/trunk/ca/mcgill/sable/util/NoCast.java A /sablecc/trunk/ca/mcgill/sable/util/Set.java A /sablecc/trunk/ca/mcgill/sable/util/SplayTreeMap.java A /sablecc/trunk/ca/mcgill/sable/util/TypedLinkedList.java A /sablecc/trunk/ca/mcgill/sable/util/TypedSplayTreeMap.java A /sablecc/trunk/ca/mcgill/sable/util/UnsupportedOperationException.java D /sablecc/trunk/com A /sablecc/trunk/grammarv1.txt (from /sablecc/trunk/GDL.grammar:4) This is the first publicly released version of SableCC. This version was released under the GNU General Public License. In order to avoid propagating the GNU GPL restrictions to new code, please DO NOT use this version as a base for any modification; instead, use a version of SableCC licensed under a different license. ------------------------------------------------------------------------ r4 | egagnon | 1998-07-04 14:05:16 -0400 (Sam, 04 jul 1998) | 2 lines Changed paths: A /sablecc/trunk/ca A /sablecc/trunk/ca/mcgill A /sablecc/trunk/ca/mcgill/sable A /sablecc/trunk/ca/mcgill/sable/sablecc (from /sablecc/trunk/com/sprynet/egagnon/sablecc:3) D /sablecc/trunk/com/sprynet/egagnon/sablecc Move directory. ------------------------------------------------------------------------ r2 | egagnon | 1997-08-31 16:00:00 -0400 (Dim, 31 aoû 1997) | 6 lines Changed paths: A /sablecc/trunk/GDL.grammar A /sablecc/trunk/SableCC.java A /sablecc/trunk/com A /sablecc/trunk/com/sprynet A /sablecc/trunk/com/sprynet/egagnon A /sablecc/trunk/com/sprynet/egagnon/sablecc A /sablecc/trunk/com/sprynet/egagnon/sablecc/CollectIdentifiers.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/FindPackage.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/Macros.txt A /sablecc/trunk/com/sprynet/egagnon/sablecc/Main.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/VerifyIdentifiers.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/analysis A /sablecc/trunk/com/sprynet/egagnon/sablecc/analysis/Analysis.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/analysis/AnalysisAdapter.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/analysis/DepthFirstAdapter.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/lexer A /sablecc/trunk/com/sprynet/egagnon/sablecc/lexer/Lexer.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/lexer/LexerException.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/lexertable A /sablecc/trunk/com/sprynet/egagnon/sablecc/lexertable/Chars.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/lexertable/ConstructNFA.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/lexertable/DFA.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/lexertable/Generator.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/lexertable/NFA.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/lexertable/TokenNumber.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Alternative.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Alternative1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Alternatives.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Alternatives1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Alternatives2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Bar.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/BasicTerm.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/BasicTerm1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/BasicTerm2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/BasicTerm3.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/BasicTerm4.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/BasicTerm5.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/BinaryOperator.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/BinaryOperator1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/BinaryOperator2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Blank.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Char.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/CharSet.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/CharSet1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/CharSet2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/CharString.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Concatenation.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Concatenation1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Concatenation2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Dot.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/DotDot.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/EOF.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Equal.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Grammar.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Grammar1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Helpers.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Helpers1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Helpers2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Identifier.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Identifiers.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Identifiers1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Identifiers2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/IgnoredTokens.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/IgnoredTokens1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/IgnoredTokens2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/LBracket.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/LParenthese.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Minus.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Node.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Package.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Package1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Package2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/PackageName.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/PackageName1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/PackageName2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Plus.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Production.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Production1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/ProductionDefinitions.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/ProductionDefinitions1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/ProductionDefinitions2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Productions.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Productions1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Productions2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/QMark.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/RBracket.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/RParenthese.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/RegularDefinition.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/RegularDefinition1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/RegularDefinitions.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/RegularDefinitions1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/RegularDefinitions2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/RegularExpression.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/RegularExpression1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/RegularExpression2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Semicolon.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Star.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Start.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Start1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/THelpers.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/TIgnored.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/TPackage.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/TProductions.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/TTokens.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Token.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Tokens.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Tokens1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/Tokens2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/UnaryOperator.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/UnaryOperator1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/UnaryOperator2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/UnaryOperator3.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/UnaryTerm.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/UnaryTerm1.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/node/UnaryTerm2.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parser A /sablecc/trunk/com/sprynet/egagnon/sablecc/parser/Parser.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parser/ParserException.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parser/State.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parser/TokenIndex.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/ConstructGrammar.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/FindTerminalsAndNonTerminals.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/Generate.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/Grammar.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/LR0Collection.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/LR0Item.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/LR0ItemAndSetPair.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/LR0ItemSet.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/LR1Collection.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/LR1Item.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/LR1ItemSet.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/Production.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/Symbol.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/parsertable/SymbolSet.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/util A /sablecc/trunk/com/sprynet/egagnon/sablecc/util/Comparable.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/util/Comparator.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/util/IntegerComparator.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/util/MacroExpander.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/util/Node.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/util/SplayTree.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/util/SplayTreeEnumeration.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/util/StringComparator.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/util/Switch.java A /sablecc/trunk/com/sprynet/egagnon/sablecc/util/Switchable.java This initial version of SableCC has been entirely written by Etienne Gagnon in 1997, while he was working in Vancouver (BC), Canada. Etienne has built this version as a personal project, without any direct nor indirect support from McGill University. The name SableCC was given later, in September, 1998. ------------------------------------------------------------------------ r1 | egagnon | 1997-08-31 16:00:00 -0400 (Dim, 31 aoû 1997) | 2 lines Changed paths: A /sablecc A /sablecc/branches A /sablecc/tags A /sablecc/trunk Create sablecc project. ------------------------------------------------------------------------ sablecc-3.7/LICENSE000066400000000000000000000017451265440641200137770ustar00rootroot00000000000000SableCC, an object-oriented compiler framework. Copyright (C) 1997-2012 Etienne M. Gagnon and others. All rights reserved. See the file "AUTHORS" for the name of all copyright holders. This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program in the file "COPYING-LESSER"; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA The SableCC web site is located at: http://www.sablecc.org/ sablecc-3.7/README.html000066400000000000000000000145561265440641200146210ustar00rootroot00000000000000 SableCC 3.7 - Read Me

SableCC version 3.7

ReadMe

Welcome to SableCC version 3.7.

Please read this document carefully.

Content

 top

Getting Started

 content

Here are the minimal steps to get SableCC running.

1) If you got sablecc-3.7.tar.gz or sablecc-3.7.zip (binary packages)

  1. Decompress the file sablecc-3.7.tar.gz or sablecc-3.7.zip: 
    	  tar -xzvf sablecc-3.7.tar.gz
    or 
    	  jar -xvf sablecc-3.7.zip
  2. Go into the in sablecc-3.7 directory: 
    	  cd sablecc-3.7
  3. You will find an executable sablecc.jar file in the lib directory: 
    	  java -jar lib/sablecc.jar

This is it. If you have Ant installed on your system, you can install SableCC with the command: 

	ant -Dinstall.dir=destination install

Otherwise, you can manually install SableCC as follow: You should first copy (and edit) the files lib/sablecc.jar and bin/sablecc (GNU/Linux, Mac, Unix) or bin\sablecc.bat (Windows) to an appropriate location, and set your PATH environment variable appropriately.

2) If you got sablecc-3.7-src.tar.gz (source package)

  1. Decompress the file sablecc-3.7-src.tar.gz: 
    	  tar -xzvf sablecc-3.7-src.tar.gz
  2. Go into the in sablecc-3.7 directory: 
    	  cd sablecc-3.7
  3. If you want an automatic build process, you need to have Ant installed on your system. Simply type: 
    	  ant -Dinstall.dir=destination install

License

 content

SableCC is covered by the GNU Lesser General Public License. You can view the copyright notice and the exact terms of the license in the files LICENSE, AUTHORS and COPYING-LESSER.

Documentation

 content

You can find complete and detailed documentation on the SableCC framework and syntax at the site http://sablecc.org/wiki/DocumentationPage .

Getting Help

 content

The easiest way of obtaining help is to get on the SableCC mailing-list, by visiting the site https://groups.google.com/forum/#!forum/sablecc . Many SableCC users around the world are already on this mailing-list. This is the best pool of information available to you.

You can also get professional consulting services from J-Meg inc. Simply get in touch with Etienne Gagnon (egagnon@j-meg.com).

Donations

 content

You are very welcome to express your appreciation of SableCC. If you would like to make a financial donation to the SableCC project, you can get in touch with Etienne Gagnon (egagnon@j-meg.com). Thank you in advance.

sablecc-3.7/THANKS000066400000000000000000000010321265440641200136720ustar00rootroot00000000000000THANKS file. SableCC has been initially developed by Etienne M. Gagnon as his M.Sc. research project. Many people have contributed to SableCC by reporting problems, suggesting various improvements or providing other services. Here is a list of (some of) these people and organizations. Please help us keep it complete and exempt of errors. Thanks to you ------------- * Prof. Laurie J. Hendren : research advisor * Will Hartung small patch for including token in parser exception sablecc-3.7/bin/000077500000000000000000000000001265440641200135335ustar00rootroot00000000000000sablecc-3.7/bin/sablecc000066400000000000000000000007441265440641200150570ustar00rootroot00000000000000#!/bin/sh # # * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * # * This file is part of SableCC. * # * See the file "LICENSE" for copyright information and the * # * terms and conditions for copying, distribution and * # * modification of SableCC. * # * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * # # IMPORTANT: Put the absolute path to sablecc.jar below. java -jar lib/sablecc.jar $* sablecc-3.7/bin/sablecc.bat000066400000000000000000000010161265440641200156150ustar00rootroot00000000000000rem * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * rem * This file is part of SableCC. * rem * See the file "LICENSE" for copyright information and the * rem * terms and conditions for copying, distribution and * rem * modification of SableCC. * rem * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * rem rem IMPORTANT: Put the absolute path to sablecc.jar below. rem java -jar lib\sablecc.jar %1 %2 %3 %4 %5 %6 %7 %8 %9 sablecc-3.7/build.xml000066400000000000000000000277141265440641200146170ustar00rootroot00000000000000 ======================================================================== *** ERROR *** You must provide an installation directory. For example: ant -Dinstall.dir=/usr/local install (on Linux) or ant -Dinstall.dir=C:\sablecc install (on Windows) ======================================================================== ========================================================================== IMPORTANT: You must add ${install.location}/bin to your PATH. For example: export PATH=${install.location}/bin:$$PATH (on Linux) or set PATH=${install.location}\bin;%PATH% (on Windows) ========================================================================== sablecc-3.7/doc/000077500000000000000000000000001265440641200135305ustar00rootroot00000000000000sablecc-3.7/doc/description.html000066400000000000000000000346371265440641200167560ustar00rootroot00000000000000 Description of CST->AST transformations in SableCC3

Description of CST->AST transformations in SableCC3


Contents

INTRODUCTION

What has been changed?

  • Addition of a new section called Abstract Syntax Tree.
  • New syntax for transformations specification.
  • SableCC3 provides support for SableCC2 grammars.

To be able to benefit of AST transformations in SableCC, it is necessary to add a new Abstract Syntax Tree section's to the grammar. This section must be placed after the Productions section's. It contains the grammar of the Abstract Syntax Tree, so all the Nodes in this tree are instances of classes generated using this part of the grammar. In this new section, the syntax of productions(ast_prod) is the same as in the section Productions of SableCC2 grammars. All the classes used to represent this tree are generated using the productions specified in this new section.
A typical grammar of SableCC3 should contains these following sections :

  • Helpers
  • Tokens
  • Ignored Tokens
  • Productions and
  • Abstract Syntax Tree.
All these sections as it is specified in the SableCC3's grammar are optional.

$\cal{I}$ - TRANSFORMATIONS

Transformations

They are specified in the section Productions. Two intrinsically bound transformation's actions are needed to perform :

  • - the first is a for the production itself
  • - and the second is for alternatives of this production

1.1 - Transformation of the production

A production is transformed in one or several AST productions or tokens.

Such a transformation looks like :

  • production {-> prod_transform1 prod_transform2* prod_transform3 ... prod_transformN} = element1 element2 element3 ... elementN
    {-> alt_transform1 alt_transform2 alt_transform3 ... alt_transformN}
where prod_transformation1, prod_transformation2, ..., prod_transformationN are AST productions or Tokens. The existence of the operator * indicates that it is a list of this element and not just the element itself.
During the parsing time of this mini grammar's compliant program, at the reduction phase of the alternative below, instead of constrcuting a traditional production node, the parser will constrcut the following items :
  • a node of type prod_transform1,
  • a homogeneous list containing elements of type prod_transform2,
  • a node of type prod_transform3
  • ...(a type prod_transformi node or list of type prod_transformi node depending on the presence of * operator or not.)
  • and finally a node of type prod_transformN.

1.2 - Transformation of alternatives

(Note: In order to use SableCC grammar terminology, we will refer to : element for transformations of one production and term for tranformations of an alternative.)

The transformation of an alternative is guided by the transformation of the production :

  • the number of terms and the number of elements should be the same.
  • the type of these terms shoud also correspond to the type of elements of the production.

If we look at our example of production in the paragraph 2.1, it means that :

  • prod_transform1 should be the same type that alt_transform1,
  • prod_transform2 should be the same type that alt_transform2 and so forth for all another ones until prod_transformN.

(Note: When we say that prod_transform1 is the same type as alt_transform1, that means : alt_transform1 are one of the alternatives of the production prod_transform1 or alt_transform1 and prod_transform1 can match the same token).

There are four types of terms for the transformation of an alternative:

  • 1 - Getting an already existing element :: (ident)
  • 2 - New alternative (New production[.nameofalternative]) :: creation of a new node
  • 3 - List creation ([elem1 elem2 ...] ) :: creation of a homogeneous list of terms
  • 4 - Elimination (Null) :: used in general to replace an element or to eliminate the effect of another one.
  • 5 - Empty transformation :: used in general to get ride of all the the subtree

In order to describe with more precise manner these terms, let use one example of SableCC3 grammar with transformations.
This example can be found in appendix of this document.

1.2.1 - Getting an already existing element (exp_list_tail {-> exp} = comma exp {-> exp};)

In the production exp_list_tail, we have an alternative with two elements: comma and exp. In the transformation of this alternative, we only keeps the element exp. Here, we are just taking an already existing element of the tree.
Notice that the production exp_list_tail is supposed to change to exp, and the term of the transformation of alternative is also an exp. Therefore the concordance of type is respected.
In the production factor, if we look at the grammar, we realize that term is itself a production that is transformed to exp. It means that in our tree, all the term are transformed to exp. Hence, "term.exp" refers to the element "exp" which already replace production term; so term.exp is not an element of type term but an element of type exp. That makes us once again respect the required concordance of type.

1.2.2 - New alternative ( exp = {plus} exp plus factor {-> New exp.plus(exp, factor.exp)};  )

The syntax is:
New following by the appropriate name the alternative of the production. If the alternative carries an explicitly specified name between like nameofalternative, the syntax must be: New nameofproduction.nameofalternative (parameters), otherwise New nameofproduction (parameters). In this case, nameofproduction and nameofalternatives are similar.
nameofproduction must be the name of a definite production in the AST section. And parameters must be describe as : 

	    parameter1, parameter2, parameter3,... .
In the case of the transformation 2(see Appendix), exp.plus refers to the alternative {plus} [l]:exp [r]:exp of production exp that state in the Abstract Syntax Tree section. This alternative is composed of two elements which types are exp. It is why for parameters of New exp.plus(), we have exp and factor.exp which are two elements of type exp.

1.2.3 - List creation (exp_list {-> exp*} = exp exp_list_tail {-> [exp_list_tail.exp exp] };)

To construct a list elements, the syntax used is (elem1 elem2 elem3... elemN), where elem1 ... elemN are all elements of the same type.
In production exp_list, (exp_list_tail.exp exp) is a list of exp. exp_list_tail.exp represents an exp type's element; because exp_list_tail is transformed to exp.

1.2.4 - Elimination (Null).

In the grammar in appendix, there is no such transformation. To make an illustration, we can modify one of alternatives. For example we can transform the production exp of section Productions to : 

   exp = {plus} exp  plus factor  {-> New exp.plus(exp, factor.exp)} |
         {minus} exp minus factor {-> New exp.minus(exp, Null)}      |
	 {factor} factor	  {-> factor.exp };

It means that we don't keep the term factor anymore in the alternative minus. Null is an element that is compatible with all types except lists. So it can be used everywhere an element is needed. If a empty list is needed, just used this : ().

1.2.5 - Empty transformation. 

   exp_list_tail {-> } = comma exp {-> };

There is a difference between empty and Null transformation :
in the case of null transformation (exp_list_tail {-> exp} = comma exp {-> Null} ), the corresponding node can still be accessed by writing exp_list_tail.exp even if the associated node contains null reference. That is exp_list_tail.exp is an expression type element but it contains null reference.
But in the case of empty transformation, one just get rid of the production. exp_list_tail cannot be accessed anymore.

1.3 - Implicit transformations

When transformation is not specified in the grammar, an implicit transformation is introduced by the parser either for productions and alternatives. Example: A production like

  • production = elem1 elem2 * elem3+ elem4?; is transformed to
  • production  {-> production} = elem1 elem2 * elem3+ elem4? {-> New production(elem1, [elem2], [elem3], elem4) };
This implicit kind of transformation is always done for all productions and alternatives with no explicit transformations.

$\cal{II}$ - Restrictions

1.
*** For the specification of transformations, the first production of Productions' sections should be transformed to the first production of the AST section. In our example(see appendix), we should have :

    grammar {-> grammar} , what is seen to be the case because
    grammar = elems ... is transformed in
    grammar {-> grammar}  =   elems ... by the parser.

2.

*** In transformations of alternative, an element with an operator * or + can only be referred to in a list transformation. For example :
prod {-> elem} = elem1 elem*    {-> elem };   is not correct even if the concordance type is still respected.
It should rather be :
prod {-> elem*} = elem1 elem*  {-> (elem) };

Appendix 

Package expression;

Helpers

    digit = ['0' .. '9'];
    tab = 9;
    cr = 13;
    lf = 10;
    eol = cr lf | cr | lf; // This takes care of different platforms

    blank = (' ' | tab | eol)+;

Tokens
    l_par = '(';
    r_par = ')';
    plus = '+';
    minus = '-';
    mult = '*';
    div = '/';
    comma = ',';

    blank = blank;
    number = digit+;


Ignored Tokens

    blank;

Productions

    grammar   =  exp_list {-> New grammar([exp_list.exp])};

    exp_list 			{-> exp*} 
	= exp exp_list_tail*  	{-> [exp exp_list_tail.exp]};

    exp_list_tail 		{-> exp}
	= comma exp 		{-> exp};

    exp = {plus}   exp plus factor  	{-> New exp.plus(exp, factor.exp)  }
        |  {minus}  exp minus factor 	{-> New exp.minus(exp, factor.exp) }
        |  {factor} factor 		{-> factor.exp}
	;

    factor			   	{-> exp} 
	= {mult}      factor mult term 	{-> New exp.mult(factor.exp, term.exp )}
        | {div}       factor div term  	{-> New exp.div(factor.exp, term.exp ) }
        | {term}      term 		{-> term.exp}
	;

    term 				{-> exp}
	= {number}   number 		{-> New exp.number(number)}
        | {exp}      l_par exp r_par 	{-> exp}
	;


Abstract Syntax Tree

    exp = {plus}   [l]:exp [r]:exp
	| {minus}  [l]:exp [r]:exp
	| {div}    [l]:exp [r]:exp
	| {mult}   [l]:exp [r]:exp
	| {number} number
	;

Appendix


Index

About this document ...

Description of CST->AST transformations in SableCC3

This document was generated using the LaTeX2HTML translator Version 97.1 (release) (July 13th, 1997)

Copyright © 1993, 1994, 1995, 1996, 1997, Nikos Drakos, Computer Based Learning Unit, University of Leeds.

The command line arguments were:
latex2html -no_navigation -split 0 description.tex.

The translation was initiated by Agbakpem Komivi on 5/23/2003

Agbakpem Komivi
5/23/2003
sablecc-3.7/doc/test.sablecc3000066400000000000000000000152411265440641200161130ustar00rootroot00000000000000//This file was conributed by Indrek Mandree. // // This is a demonstration grammar file with transformation rules for the // new SableCC3 parser generator (rel sablecc-3-beta.3.altgen.20040327) // // Points to remember: // // * Why CST and AST? Due to limitations of parser technology the // human described grammar does not represent the "perfect" abstract // form of the language parsed. To get the AST transformations are done. // (AST - Abstract Syntax Tree; CST - Concrete Syntax Tree) // // * The AST section must be complete, nothing from Productions is // automatically placed there. // // * In curly braces are things related to AST, eg. we built the AST in // those things, so everything is built/transformed from the leaves to // root. // // * Transformation is divided into two parts - product transformation // declaration that declares what the alternatives should be // transformed to and alternatives transformations definitions that // define how the transform is actually done. // // * A production can be transformed to multiple elements as seen in the // 'random_x2' rule. // // * Productions with same structure as in the AST can be directly // transformed to AST - see the 'textual' rule. What really happens is // that for productions and alternatives without transform specification // default transformation rules are generated. This also means that you // could omit the transform declaration at exp rule. // // * Lists it seems are represented with brackets '[ elem1, elem2, .. ]' and // not parenthesis as described in the doc. If element is also a list it // is automatically expanded and used. Empty list is []. // // * The output we get from the parser is as described in the AST. We only // have to work with that. The productions section is no longer used. // // * When you just want to get rid of a production declare and define // it and its alternatives as {-> } or with the newer sablecc release // you can just leave it without any rules. See the 'separator' rule. // // * You can't place null-s into lists. When the expression is null // (either by ?) or directly set in transformation and is later added // to a list - it is eliminated by SableCC. // // * With the latest sablecc release '?' and '+' are supported in // the AST section. They are also enforced from productions. // You'll see when errors start popping up. // // * In the product transformation declaration you can similarily use // renaming in the style 'productname { .. [use_name]:name .. } = ..' // This can be very useful when using multiple elements of the same type // at transform. See the 'random_x2' rule for example. // // Written by Indrek Mandre in July-August 2003 // Example constructed from the SableCC docs/Kevin Agbakpem and // Etienne Bergeron e-mail. http://www.mare.ee/indrek/sablecc/ // Package expression; Helpers digit = ['0' .. '9']; tab = 9; cr = 13; lf = 10; eol = cr lf | cr | lf; blank = (' ' | tab | eol)+; Tokens l_par = '('; r_par = ')'; plus = '+'; minus = '-'; mult = '*'; div = '/'; semi = ';'; blank = blank; number = digit+; one = 'one'; two = 'two'; three = 'three'; random = 'random_digit'; Ignored Tokens blank; Productions grammar = exp_list {-> New grammar ([exp_list.exp])} ; exp_list {-> exp*} = {list} exp_list separator exp {-> [exp_list.exp, exp.exp] } | {single} exp {-> [exp.exp] } ; exp {-> exp} = {plus} exp plus factor {-> New exp.plus (exp.exp, factor.exp) } | {minus} exp minus factor {-> New exp.minus (exp.exp, factor.exp) } | {factor} factor {-> factor.exp } ; factor {-> exp} = {mult} factor mult term {-> New exp.mult (factor.exp, term.exp) } | {div} factor div term {-> New exp.div (factor.exp, term.exp) } | {term} term {-> term.exp } ; term {-> exp} = {number} number {-> New exp.number(number) } | {exp} l_par exp r_par {-> exp.exp } | {textual} textual+ {-> New exp.textual ([textual]) } | {random_x2} random_x2 {-> New exp.random_x2 (random_x2.ran1, random_x2.ran2) } ; textual = {t1} one | {t2} two | {t3} three ; random_x2 {-> [ran1]:random [ran2]:random} = [ran1]:random [ran2]:random {-> ran1 ran2 } ; separator {-> } = {semicolon} semi {-> } ; Abstract Syntax Tree grammar = exp+ ; exp = {plus} [l]:exp [r]:exp | {minus} [l]:exp [r]:exp | {div} [l]:exp [r]:exp | {mult} [l]:exp [r]:exp | {textual} textual+ | {random_x2} [r1]:random [r2]:random | {number} number ; textual = {t1} one | {t2} two | {t3} three ; // // A few words about this grammar itself: // - It is supposed to be a little integer based calculator with a few odd // extensions to demonstrate sablecc transformations // - You can use textual words to build up numbers (two one three -> 213) // I didn't really bother to specify all the decimal textual numbers // - The random number rule is a bit superficial, it just expects user to // type 'random_digit random_digit' and produces a two-digit random // number. I didn't figure out any better way to make the multiple // element transform rule "interesting" ;) // // Valid expressions: // (1 + 14 / (3 + 4)) * 14 -> 42 // one + 3 - two -> 2 // two one + three -> 24 // random_digit random_digit -> ?? // random_digit random_digit + 1 -> ?? // 1 + 3 ; 1 ; 4 + 5 -> 4; 1; 9 // // In the Calculate.java is the implementation of the tree visitor that // calculates the values. // sablecc-3.7/etc/000077500000000000000000000000001265440641200135365ustar00rootroot00000000000000sablecc-3.7/etc/manifest000066400000000000000000000000761265440641200152720ustar00rootroot00000000000000Manifest-Version: 1.0 Main-Class: org.sablecc.sablecc.SableCC sablecc-3.7/sablecc-3x.sablecc3000066400000000000000000000267131265440641200163210ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* This grammar defines the SableCC 3.x input language. */ Package org.sablecc.sablecc; // Root Java package for generated files. Helpers /* These are character sets and regular expressions used in the definition of tokens. */ all = [0 .. 0xFFFF]; lowercase = ['a' .. 'z']; uppercase = ['A' .. 'Z']; digit = ['0' .. '9']; hex_digit = [digit + [['a' .. 'f'] + ['A' .. 'F']]]; tab = 9; cr = 13; lf = 10; eol = cr lf | cr | lf; // This takes care of different platforms not_cr_lf = [all - [cr + lf]]; not_star = [all - '*']; not_star_slash = [not_star - '/']; blank = (' ' | tab | eol)+; short_comment = '//' not_cr_lf* eol; long_comment = '/*' not_star* '*'+ (not_star_slash not_star* '*'+)* '/'; comment = short_comment | long_comment; letter = lowercase | uppercase | '_' | '$'; id_part = lowercase (lowercase | digit)*; States normal, /* The first state is the initial state. */ package; Tokens /* These are token definitions. It is allowed to use helper regular * * expressions in the body of a token definition. * * On a given input, the longest valid definition is chosen, In * * case of a match, the definition that appears first is chosen. * * Example: on input -> 's' <- "char" will have precedence on * * "string", because it appears first. */ {package} pkg_id = letter (letter | digit)*; {normal->package} package = 'Package'; states = 'States'; helpers = 'Helpers'; tokens = 'Tokens'; ignored = 'Ignored'; productions = 'Productions'; abstract = 'Abstract'; syntax = 'Syntax'; tree = 'Tree'; new = 'New'; null = 'Null'; token_specifier = 'T'; production_specifier = 'P'; dot = '.'; d_dot = '..'; {normal, package->normal} semicolon = ';'; equal = '='; l_bkt = '['; r_bkt = ']'; l_par = '('; r_par = ')'; l_brace = '{'; r_brace = '}'; plus = '+'; minus = '-'; q_mark = '?'; star = '*'; bar = '|'; comma = ','; slash = '/'; arrow = '->'; colon = ':'; id = id_part ('_' id_part)*; char = ''' not_cr_lf '''; dec_char = digit+; hex_char = '0' ('x' | 'X') hex_digit+; string = ''' [not_cr_lf - ''']+ '''; blank = blank; comment = comment; Ignored Tokens /* These tokens are simply ignored by the parser. */ blank, comment; Productions /* These are the productions of the grammar. The first production is * * used by the implicit start production: * * start = (first production) EOF; * * ?, * and + have the same meaning as in a regular expression. * * In case a token and a production share the same name, the use of * * P. (for production) or T. (for token) is required. * * Each alternative can be explicitely named by preceding it with a * * name enclosed in braces. * * Each alternative element can be explicitely named by preceding it * * with a name enclosed in brackets and followed by a colon. */ grammar = P.package? P.helpers? P.states? P.tokens? ign_tokens? P.productions? P.ast? {-> New grammar([P.package.list_pkg_id], P.helpers, P.states, P.tokens, P.ign_tokens, P.productions, P.ast) }; package {-> [list_pkg_id]:pkg_id*} = T.package pkg_name {-> [pkg_name.pkg_id] }; pkg_name {-> pkg_id*} = pkg_id [pkg_ids]:pkg_name_tail* semicolon {-> [pkg_id, pkg_ids.pkg_id] }; pkg_name_tail {-> pkg_id } = dot pkg_id {-> pkg_id }; helpers = T.helpers [helper_defs]:helper_def+ {-> New helpers([helper_defs]) }; helper_def = id equal reg_exp semicolon {-> New helper_def(id, reg_exp) }; states = T.states id_list semicolon {-> New states([id_list.id]) }; id_list {-> id*} = id [ids]:id_list_tail* {-> [id, ids.id]}; id_list_tail {-> id } = comma id {-> id}; tokens = T.tokens [token_defs]:token_def+ {-> New tokens([token_defs]) }; token_def = state_list? id equal reg_exp look_ahead? semicolon {-> New token_def(state_list, id, reg_exp, look_ahead.slash, look_ahead.reg_exp) }; state_list = l_brace id transition? [state_lists]:state_list_tail* r_brace {-> New state_list(id, transition, [state_lists])}; state_list_tail = comma id transition? {-> New state_list_tail(id, transition) }; transition = arrow id {-> New transition(id)}; ign_tokens = ignored T.tokens id_list? semicolon {-> New ign_tokens([id_list.id]) }; look_ahead {-> slash reg_exp} = slash reg_exp {-> slash reg_exp}; reg_exp = concat [concats]:reg_exp_tail* {-> New reg_exp([concat, concats.concat])}; reg_exp_tail {-> concat } = bar concat {-> concat}; concat = [un_exps]:un_exp* {-> New concat([un_exps])}; un_exp = basic un_op?; basic = {char} P.char {-> New basic.char(P.char)} | {set} set {-> New basic.set(set)} | {string} string {-> New basic.string(string)} | {id} id {-> New basic.id(id)} | {reg_exp} l_par reg_exp r_par {-> New basic.reg_exp(reg_exp)} ; char = {char} T.char | {dec} dec_char | {hex} hex_char; set = {operation} l_bkt [left]:basic bin_op [right]:basic r_bkt {-> New set.operation(left, bin_op, right) } | {interval} l_bkt [left]:P.char d_dot [right]:P.char r_bkt {-> New set.interval(left, right) }; un_op = {star} star {-> New un_op.star(star)} | {q_mark} q_mark {-> New un_op.q_mark(q_mark)} | {plus} plus {-> New un_op.plus(plus)} ; bin_op = {plus} plus {-> New bin_op.plus()} | {minus} minus {-> New bin_op.minus()} ; productions = T.productions [prods]:prod+ {-> New productions([prods]) }; prod = id prod_transform? equal alts semicolon {-> New prod(id, prod_transform.arrow, [prod_transform.elem], [alts.list_alt])}; prod_transform {-> arrow elem*} = l_brace arrow [elems]:elem* r_brace {-> arrow [elems]}; alts {-> [list_alt]:alt*} = alt [alts]:alts_tail* {-> [alt, alts.alt]}; alts_tail {-> alt} = bar alt {-> alt}; alt = alt_name? [elems]:elem* alt_transform? {-> New alt(alt_name.id, [elems], alt_transform)}; alt_transform = l_brace arrow [terms]: term* r_brace {-> New alt_transform(l_brace, [terms], r_brace)}; term = {new} new prod_name l_par params? r_par {-> New term.new(prod_name, l_par, [params.list_term]) } | {list} l_bkt list_of_list_term? r_bkt {-> New term.list(l_bkt, [list_of_list_term.list_terms])} | {simple} specifier? id simple_term_tail? {-> New term.simple(specifier, id, simple_term_tail.id)} | {null} null {-> New term.null()} ; list_of_list_term {-> [list_terms]:list_term* } = list_term [list_terms]:list_term_tail* {-> [list_term, list_terms.list_term] } ; list_term = {new} new prod_name l_par params? r_par {-> New list_term.new(prod_name, l_par, [params.list_term])} | {simple} specifier? id simple_term_tail? {-> New list_term.simple(specifier, id, simple_term_tail.id)}; list_term_tail {-> list_term} = comma list_term {-> list_term} ; simple_term_tail {-> id} = dot id {-> id}; prod_name = id prod_name_tail? {-> New prod_name(id, prod_name_tail.id)}; prod_name_tail {-> id} = dot id {-> id}; params {-> [list_term]:term*} = term [params]:params_tail* {-> [term, params.term]}; params_tail {-> term} = comma term {-> term}; alt_name {-> id} = l_brace id r_brace {-> id}; elem = elem_name? specifier? id un_op? {-> New elem(elem_name.id, specifier, id, un_op) }; elem_name {-> id} = l_bkt id r_bkt colon {-> id}; specifier = {token} token_specifier dot {-> New specifier.token()} | {production} production_specifier dot {-> New specifier.production()} ; ast = abstract syntax tree [prods]:ast_prod+ {-> New ast([prods]) }; ast_prod = id equal [alts]:ast_alts semicolon {-> New ast_prod(id, [alts.list_ast_alt])}; ast_alts {-> [list_ast_alt]:ast_alt*} = ast_alt [ast_alts]:ast_alts_tail* {-> [ast_alt, ast_alts.ast_alt]}; ast_alts_tail {-> ast_alt} = bar ast_alt {-> ast_alt}; ast_alt = alt_name? [elems]:elem* {-> New ast_alt(alt_name.id, [elems])}; /*****************************************************************************************/ /* */ /* */ /* */ /* */ /* */ /*****************************************************************************************/ Abstract Syntax Tree grammar = [package]:pkg_id* P.helpers? P.states? P.tokens? P.ign_tokens? P.productions? P.ast?; helpers = [helper_defs]:helper_def*; helper_def = id reg_exp; states = [list_id]:id*; tokens = [token_defs]:token_def*; token_def = state_list? id reg_exp slash? [look_ahead]:reg_exp?; state_list = id transition? [state_lists]:state_list_tail*; state_list_tail = id transition?; transition = id; ign_tokens = [list_id]:id*; reg_exp = [concats]:concat*; concat = [un_exps]: un_exp*; un_exp = basic un_op?; basic = {char} P.char | {set} set | {string} string | {id} id | {reg_exp} reg_exp; char = {char} T.char | {dec} dec_char | {hex} hex_char; set = {operation} [left]:basic bin_op [right]:basic | {interval} [left]:P.char [right]:P.char ; un_op = {star} star | {q_mark} q_mark | {plus} plus ; bin_op = {plus} | {minus}; productions = [prods]:prod*; prod = id arrow? [prod_transform]:elem* [alts]:alt*; alt = [alt_name]:id? [elems]:elem* alt_transform?; alt_transform = l_brace [terms]:term* r_brace; term = {new} prod_name l_par [params]:term* | {list} l_bkt [list_terms]:list_term* | {simple} specifier? id [simple_term_tail]:id? | {null} ; list_term = {new} prod_name l_par [params]:term* | {simple} specifier? id [simple_term_tail]:id? ; prod_name = id [prod_name_tail]:id? ; elem = [elem_name]:id? specifier? id un_op?; specifier = {token} | {production} ; ast = [prods]:ast_prod*; ast_prod = id [alts]:ast_alt*; ast_alt = [alt_name]:id? [elems]:elem*; sablecc-3.7/sablecc-anttask-1.0.1.tar.gz000066400000000000000000000371611265440641200176140ustar00rootroot00000000000000} $Uy0/&Ag2\{Jln\̱JPkfjgA ` 1QW#;oDA+WgfYdcw_}BTuۋ";<ӟAzCU9.۲i8N/} u`p-[t[#;xIoɧw8Xn(ݪ#ϺDŸy/rʉ>h2cőL!#@z3p#z'lBB{Ga[ȊF[jk~ŝwѠؑXv\mVP<"Dwzޝ] ۅרV,R{ <]9Z(\@!&aOОqFLv8(T>xByXtu'Uu㊙s_$28fP<2St{"!&dVJ xCItNitVC׃ESF!+6މӁ[=7\6!SO]A;?+PCa^\-Zp cY;{ ^%1PpqG A,~r#ѿF_&dHF׵4=) jo -6cY?-[3HCaS ɯl aVܿi\)QjcX|o_ͮh]jd*dȼUZ8*0 V'B0tr,yf&BNf`'욳I\0%peYrjugh>G(95UKߺ?u[+>lVa5G`|p8Aj4%~#k |Vbk?nϺ!rC>B7BMk-cYv >4[{Wn1UnUp떔ߴugwe /:ve5\s"[,FQgF|?/ϡԚAFogfȍUl 4Yý<5\+MZh`ǰM32Y}'e}hU0Ӟ wyyYK,f TK`B Ю;ՊhNR%ų Uww%XVNQa*s!+1mQ#),4&`Z~C,K4qXw|S,v5h{nXjN k4sz\ƥx h0Nj3Kv5`p~@#`+ԁoG-Ãep!g ۖK|c59 < XwJK~Pq~Zە {f(ex`;X=̎ҎP~T<4 rlAeiyvo^T`e;4F I7&\9R`kj:B*k%g!eP!fʹ>pERH1kȄD? A_Rg<zV$۟K! KRx0~`X*^YL ])A4Y©ƛ:N3C h Gu}wH1CQb2u1a>kgEoo@S;at6jK?3.Og/h9P-PPiӅC9X||uEu?cZ¿i?39=u?&8z+0@4.Up| x#sb:,_ι,~mzNs~d/9.ٱ.o=0Cj?߁}G&<@kik[}֞>85 LX>œy/4UNT@$sBRqNh-‰dZ=lLJvҁѩ!G +PJ _X &9A\{bN9!^MxULqf-;^;ak(1#>LNY!Ḉ |!O!n6;7XQFޢ_(`.`t{Q i+fE~bؗO ~#Β <5^;c-Nffȋlqdn,?-榧&g 93Wke`TUz? `SlW*zFX,}fU_uX R_3[*LgMGYK:+^9EI֚iӃ}Y%σ<o̖]ʔ-q)iG۬iXӶC<ğ,lN3ٞ<ÅO]iU]azzGI%soۍj=#{dՕl2ضc%Wk{ a)HY@ɧFU%ӻCC$~ph҆ R*`]$9~KׇzNTyUX ~`On.miF[r~9Kl3CvvD)&("OJ˥Dc(G `,/5D RYun[8XѡjͷZ?lOfލTѺUg `zykD.G +6 %ً@d T`$<Յw[Z"9zLn &zV,I:‹|yz{UwP$GJ~=řԬO1UbZH ](PҠesSaC!8U'rDgՂ+ l9 963GADkH=#!p2|i"OM| 5tF_W$GB5UX3,*'[gE{f^I0[գ.7 {~G)N5JWN2 fGyG*BP6QY&ԎxQގ#R moV\#80$W1/3 -]8Vjz&! $GgK>4 ezF8>e57v-r1(1lTkv]hUS`;?/zE3 "-%EYdpӦ!R)?/jn""vinvm%-넍BM۬*B]DFf 8Ӆ Ǟѿe}Qi^fEҊ if{u‘Xixz+=sX?J=unj<+b m61:q¦DٖMNW*NzX'YLnm}@GZJӨ&MEVWnRUmC 'XDxgD|Woh| m[a'ݵ3:mbDfb^[L4{% p+ ЎbÍ$⁒6%%eEeVA#`9Rs#׮YrCRw0B1ows* r k'~: xklmܔ?uwL>' 8NZ.Lcbjn'C p}EJY1ꔂ>ܖ0?RNW(F(F(lBQ /UPRlY\cKt t6aь@˨m_Tnu@R|KΊL*R\hj F| xg71 q͚% PٸX,+p,zB}5j%X)w!h>kW!CYUЫ9~ TTԄo1&UYXOWkd,x`ۍ`;d`$n}UHa‹-I4r.w[a1+QC-?"@*W߾ՂB^U0ؗ$b_h} Li,!#z{#Kqm'V'f0OȜ/AL`Ѻs! ::2iux4ӻ҂ce.PSci2%HLj=/'cyJ b@k`]$X'DpegRh#u6vYAv ;HCJ9"B#ڋ@>`(HkqDw,JmiyInZ`˽[,|"kD,Y!@1lhmr WXZ'BI jRFjBČD?&0a92*Rale>ŧlG-.rLfsS)4«50ssHY ǴJT4-Ջ! uz!4̡0󽞄}vye'VEɆ ͞A%M@Vr=]Mx}Z$L@$2u.C}"#_N;K,-j\Q=K@ 'I_^'ʮ$}+ZTDxڶJȢAteWtr JNfĪ@ 8\"d͙alMnKV *OZG`x-j@s%}o^; 5MxM -;P&䞨a9JoЋ9/ATۋGH9+)y_bpUA#$2}We[@C`a)@@v֩<gOȘdrx8›^/mQh6;5%i(e+WIl8S:fƕi%K _TnzV}!a[VW|Ӹj TEq*Te/mBNp1R&97ɣ X/ Co&B|,\8zDZ# 1BH lZa8&R& 8qIK1mV)GArȍ('bT w*J ]q,!R&ݨ;GB.sipTI3jӓCI:Zu1 qlMs]Zm2'Us*n5fUL HlX2FzSUrvkl088u>@T1̐ `Pd QeBĽY)$1̙.Z# t` 1,#فEJZY%DuX,92EȂu9:Ӊ fӔ=y($U%Uۡ\ex[13*2JR׶1yČ]eS 7xjC%rc۸Cgn3 :/}!Kq#5tψNBD%A!9u*)(x㩔U4( G-뙚-.ia'`DqQ}|b T1dm1T:[AQafi[hIxF唚{j cȓ $YS!M,Pʅ,/ʦ<Dwũ-J `L4ˊ =Ae;L-ES\CX8Vf:҇wÕ4 *r㔳 㰐 ʣW Z&+A$(MCydV,!64Q?RƒY!Huchd"d8d<Qk^/=1$Ud^.En^y2Uga1mfÒv칈 VYyXijXR*OA6Y-A. `tQj g7E˖R :vNtt`lׁ#E fc}!]itI}c儗hN l¼֜vk71oť+ƘoWi;I ]ʼnByh}RqpeJ;H\~*:hMGÓx"]52+:Ecex[a) L>J洫"Ũg&'JJTz3BsۜDO8d'M3(yLZMͦz*|71a)̙B>aA8#2%ŏɐ'S\Ίc nѫ- PʋLFb\pCwRV1<# ѧ4]`/*e%\9@| H (YׯnrQTDvxs#Cav9C fVBG#\,qh[; ;ln L]>/pT}$`+T̔be]R%Ws&pJY/>BV{:#ݯ+ݒ N[q HRI 4[@II)G+^[2|݋J 9R,氒X*s$m XR֚B2G} ts\}x$d>ѐ) 1`3Sj,5 zzQhFUIċ42ሺ9oV1;bӥaI"@* ߈)`5ÖTxvc»Ag;YeIԕNI;lk5<$cSyegYoqΦ}6l1V񱌑u Y?)ڻݔEk cE ͒fll8 4G`5ŧgHXe5 1.}N Kݩ1,.SU $"sR+2aalOYt6T@(H|4MBs$WmICE+#UzƲ(G6G%a'͍5:jL4z9֞x)NcJ Mܒ)E* 1 -2XIƷ6$IS8[M+ٹPנ:E <D)ʪPdII@Ɍ8Xd![8.N?vX 띥׵ʋ)̢x8hKbAG^7 X܉dԼb`!H7 ƲXJ0@eIvnN"6 j c+F&x[kUHНnl>˔!<#UZ] Shj;Q`#p,jƥr28Lӥ܈Syj+pX$+ykcT䥽R_Y+A245#"f]x K4N*!@VC#kŔ'A%3@} <*0.*db  .C ]#%Gr)J6ɧE ~kᆉ6릊F1G(J 'BlWhf=THJZG 82<8i%1WnĂ.vadqdZYp:_o撴!R 05rU(F%96e,XixB3.䎯׶:9:%Q@]%"T')ՄD+сtY ʪ^WuzUDbG$K smYD{Q'ɯw21ή젤!صݥ(Jest&mu ԃ׮d͏ȄLaqK{yz)LbrJ91&ҨNXt8PڌE!9y Ej𘦷4׼仒^QW1"l]ڃ|uܲ@ -:gD #lJ &ByD5s|Dk|ʕ|R^3ڴ@,I%){,{d!<%'(lIMKⷀ}-%7AU݇B'YTjr"HOU:w*ˎC iV?-W 6js$b BbC6 \BNS]el2~)RܸIQ^_=_INM1MaH6ˉsk܌ 4));K*@U)DCDmS"GӐ l/% 8NՅ ,-KCIC՝wg@.?NT d{A-|I+I٢hɘ'Rd` Ȣ,u*ޚUiW' WRNKBrFDY;CҨoEu[=ƿl\HpHCRmV_,$|X)bPjCĔ,S/@T*U(iY 7[(9ڊ5kgMr*KQZw3S%%dqjAWѱurE"E W%e[ )آq{[Z* x4$ Jň`-b 7`nM 4[*,sQBcQK~Ϩ3;=gْA8p87 v3DwQƻXHrW'_԰Lfgf=RƗL8/>m:I8lO<4Nj{WCT"KIbUpL[3ع0W@Bڶ6@^Z΍-Tq=w&7<^WI"RL}5o 67 ] R=qmQI`+Y[fh~4Nz=+Zn}2_GV Y;}뢸G*A1 P~% >%4D,|kp#x>ptn$GNERG;tIxgsbga$?7S{ bs:?_gTC]btPbdO~zw! 8bbRsQ{ c5I.?[S,̶sOMc0l1]ܽgVU>=o/̈ɽ]=e3uF+x'['veEHΟ>!l8.jfac0lv0cɱjv/L&f;cEX{g'` B]!O[SsS3 atq\;x=o.':'8Gܮ?9 خRQ0Z-Ӆxb|Daŧf {#T8-;429rKI`n`?mbCd£:}EXN~ I1-Y[Lْ @iL3B,<]ŒAl#3S"~҃I` 9q H|dYimB-RgWv+"]ټ ϝmM&_Ni`-O43sl >$b.Ogk4_V41+O qJ@f&Gg YQfFI̓Gx |3X$ר?=ƷiCjO`cX_? ,~`L,k(,7/I5Z<˼Tܷ+D[6eG6Wd7JIrK{&ƪ  BgMjTIK3 fgsl*UZ}=L-nSLv̍A߇6htM D#Fk9LT- Ԕip T LMEsֵ\h#$C1[-ʞ2uׂ)am%: "6fqKIj._(12ä:k=MQ! 9Dt\w>f |oGVr*7H c{vtnhSj'@|o|܃\cni-t,>S#o497^'F{q=S5氓a"G 3c|̹=?4_}8,y]{ΕO'7$@}GGwG(GWuyRj$q mFWŸH?u Oы߾@s/®GtZ|-/Opv=;{w'/o{\/\}_<S(7-K=Xɡ/yg_/8}6땏}_>om?}׽_k&_n(=룧r/ï}C:Mνe=^җꁛOo/|C߻vԽW.{w}f9x߽/mF/^Ao{97/8O|׭psƟ]sƧ_y}8zk__zc/3}[){+< ';:ͧc\Lni2^W9ιF_x㮙nիn:ƫ;OYl|/o?Ӆ7 o>oƥb;'͍|W2w^^ox`շ{/8f'5o? o?r5oS_f3GoK>sj;e}ԙo|޳+?^O{x埽|卍+Ɵ>o>}Їn6?k^=׾%3+}p}cC>whbf?Wݷ^~h=͛w=?ŏtZ}g>\~w ֳ78zux]Ӟmwʛw}׿ן8 yx+~봯~\\:ړmm7g}|:{տ߳']7r'_{קּ;f5j9 ^*N:MO=oxKӎ?Gʝ?#~+.[zc^uOϟ|_tr]/{U7=Wt[>'i^1_k|>s_9p'4k'% ۿvٝ7홯;9ǿos7|17m[{_~]qbpQqC3ᯯ.<{k ~  o㎫[?pJ,1T~qR3UɉG̅۩b:?qbK+OxmJOoH<6ONJ/bYFE8u# Ben Menking Mariusz Nowostawski Komivi Kevin Agbakpem Kis Gergely Benne Otten sablecc-3.7/src/org/sablecc/sablecc/AcceptStates.java000066400000000000000000000027661265440641200225720ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; public class AcceptStates extends DepthFirstAdapter { public DFA dfa; public String stateName; private ResolveIds ids; public AcceptStates(DFA dfa, ResolveIds ids, String stateName) { this.dfa = dfa; this.ids = ids; this.stateName = stateName; } @Override public void caseStart(Start node) { for(int i = 0; i < dfa.states.size(); i++) { DFA.State state = (DFA.State) dfa.states.elementAt(i); state.accept = -1; int accept = -1; for(int k = 0; k < state.nfaStates.size(); k++) { if(state.nfaStates.get(k)) { if(dfa.nfa.states[k].accept != null) { if(accept == -1) { accept = ids.tokenList.indexOf(dfa.nfa.states[k].accept); } else { accept = Math.min( ids.tokenList.indexOf(dfa.nfa.states[k].accept), accept); } } } } state.accept = accept; } } } sablecc-3.7/src/org/sablecc/sablecc/AddAstProductions.java000066400000000000000000000055001265440641200235660ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; /* * AddAstProductions * * This class provide a part of the support of SableCC2.x.x grammars by * SableCC3.x.x. * Its role is to add the section Abstract Syntax Tree and its productions * to the Grammar based on the Production Section. * It's the same result if a copy-paste of Productions section was added * to the SableCC2.x.x original grammar and renammed Abstract Syntax Tree. */ @SuppressWarnings({"rawtypes","unchecked"}) public class AddAstProductions extends DepthFirstAdapter { LinkedList listAstProd = new TypedLinkedList(); // private boolean firstAlt; public AddAstProductions() {} @Override public void caseAProd(AProd node) { // firstAlt = true; listOfAstAlts = new TypedLinkedList(); /* * Here, we assume that if there is no Abstract Syntax Tree Section specified * in the grammar, no transformations syntax is allowed in Productions section */ if(node.getArrow() != null) { error(node.getArrow()); } Object []list_alt = (Object[]) node.getAlts().toArray(); for(int i=0; i 0) { error(((AAltTransform)node.getAltTransform()).getLBrace()); } node.setAltTransform( new AAltTransform(new TLBrace(), new LinkedList(), new TRBrace()) ); } } ); } } } private static void error(Token token) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "This alternative transformation should be transformed to {-> } " ); } } sablecc-3.7/src/org/sablecc/sablecc/AddProdTransformAndAltTransform.java000066400000000000000000000140301265440641200263630ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; /* * AddProdTransformAndAltTransform * * This class provide the second part of the support by SableCC3.x.x * for SableCC2.x.x grammars. * Its role is to add Productions and Alternatives transformations within * Productions section. * Assuming this is run after the eventual AddAstProductions it also add * default transformations to productions and alternatives which have not * not specified them. */ @SuppressWarnings({"rawtypes","unchecked"}) public class AddProdTransformAndAltTransform extends DepthFirstAdapter { private String currentProdId; // private String currentAlt; @Override public void inAProd(final AProd production) { currentProdId = production.getId().getText(); if(production.getArrow() == null) { AElem elem = new AElem(null, new AProductionSpecifier(), new TId(currentProdId), null); LinkedList listOfProdTransformElem = new LinkedList(); listOfProdTransformElem.add(elem); production.setProdTransform(listOfProdTransformElem); production.setArrow(new TArrow()); } } private int i; private LinkedList list; @Override public void inAAlt(AAlt alt) { if(alt.getAltTransform() == null) { // currentAlt = currentProdId; list = new LinkedList(); AProdName aProdName = new AProdName(new TId(currentProdId), null); if(alt.getAltName() != null) { aProdName.setProdNameTail( new TId(alt.getAltName().getText()) ); } if( alt.getElems().size() > 0 ) { Object temp[] = alt.getElems().toArray(); for(i = 0; i < temp.length; i++) { ((PElem) temp[i]).apply(new DepthFirstAdapter() { @Override public void caseAElem(AElem elem) { PTerm term; String termId; boolean elemNameExplicitelySpecified = false; if(elem.getElemName() != null) { termId = elem.getElemName().getText(); elemNameExplicitelySpecified = true; } else { termId = elem.getId().getText(); } if( (elem.getUnOp() != null) && ( (elem.getUnOp() instanceof AStarUnOp) || (elem.getUnOp() instanceof APlusUnOp) ) ) { LinkedList listP = new LinkedList(); if( !elemNameExplicitelySpecified && (elem.getSpecifier()!= null) ) { if(elem.getSpecifier() instanceof ATokenSpecifier) { listP.add( new ASimpleListTerm(new ATokenSpecifier(), new TId(termId), null ) ); term = new AListTerm(new TLBkt(), listP); } else { listP.add( new ASimpleListTerm(new AProductionSpecifier(), new TId(termId), null ) ); term = new AListTerm(new TLBkt(), listP); } } else { listP.add( new ASimpleListTerm(null, new TId(termId), null) ); term = new AListTerm(new TLBkt(), listP); } } else { if( !elemNameExplicitelySpecified && (elem.getSpecifier()!= null) ) { if(elem.getSpecifier() instanceof ATokenSpecifier) { term = new ASimpleTerm( new ATokenSpecifier(), new TId(termId), null); } else { term = new ASimpleTerm( new AProductionSpecifier(), new TId(termId), null); } } else { term = new ASimpleTerm( null, new TId(termId), null); } } list.add(term); } } ); } } ANewTerm newTerm = new ANewTerm(aProdName, new TLPar(), list); LinkedList lst = new LinkedList(); lst.add(newTerm); alt.setAltTransform(new AAltTransform(new TLBrace(), lst, new TRBrace())); } } } sablecc-3.7/src/org/sablecc/sablecc/AltTransformAdapter.java000066400000000000000000000111411265440641200241070ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; @SuppressWarnings({"rawtypes","unchecked"}) public class AltTransformAdapter extends DepthFirstAdapter { ResolveAltIds altIds; String currentNewAltName; private Map isElementIsAlist; private LinkedList listSimpleTermTransform; private Map simpleTermTransform; private Map simpleTermOrsimpleListTermTypes; AltTransformAdapter(Map simpleTermTransform, LinkedList listSimpleTermTransform, String currentNewAltName, ResolveAltIds altIds, Map isElementIsAlist, Map simpleTermOrsimpleListTermTypes) { this.currentNewAltName = currentNewAltName; this.altIds = altIds; this.isElementIsAlist = isElementIsAlist; this.listSimpleTermTransform = listSimpleTermTransform; this.simpleTermTransform = simpleTermTransform; this.simpleTermOrsimpleListTermTypes = simpleTermOrsimpleListTermTypes; } @Override public void inASimpleTerm(ASimpleTerm node) { String name = node.getId().getText(); if( !((LinkedList)altIds.alts_elems.get(currentNewAltName)).contains(name) && !((LinkedList)altIds.alts_elems.get(currentNewAltName)).contains("$"+name) ) { node.replaceBy( new ANullTerm() ); } if( isElementIsAlist.get(currentNewAltName+name) != null ) { TId simpleTermTail; if(node.getSimpleTermTail() != null) { simpleTermTail = node.getSimpleTermTail(); } else { simpleTermTail = new TId( (String)isElementIsAlist.get(currentNewAltName+name) ); } ASimpleTerm asimpleTerm = new ASimpleTerm( node.getSpecifier(), node.getId(), simpleTermTail); if(simpleTermOrsimpleListTermTypes.get(node) != null) { simpleTermOrsimpleListTermTypes.put(asimpleTerm, (String)simpleTermOrsimpleListTermTypes.get(node)); } node.replaceBy(asimpleTerm); simpleTermTransform.put(asimpleTerm, "L"+ResolveIds.name((String)isElementIsAlist.get(currentNewAltName+name)) ); //Terms are added here only if they were implicitely transformed listSimpleTermTransform.add( asimpleTerm ); } } @Override public void inASimpleListTerm(ASimpleListTerm node) { String name = node.getId().getText(); if( !((LinkedList)altIds.alts_elems.get(currentNewAltName)).contains(name) && !((LinkedList)altIds.alts_elems.get(currentNewAltName)).contains("$"+name) ) { node.replaceBy( null ); } if( isElementIsAlist.get(currentNewAltName+name) != null) { TId simpleTermTail; if(node.getSimpleTermTail() != null) { simpleTermTail = node.getSimpleTermTail(); } else { simpleTermTail = new TId((String)isElementIsAlist.get(currentNewAltName+name)); } TId tid; tid = ( ((LinkedList)altIds.alts_elems_list_elemName.get(currentNewAltName)).contains(name) ? node.getId() : new TId( "$" + node.getId().getText() ) ); ASimpleListTerm asimpleListTerm = new ASimpleListTerm( node.getSpecifier(), tid, simpleTermTail); if(simpleTermOrsimpleListTermTypes.get(node) != null) { simpleTermOrsimpleListTermTypes.put(asimpleListTerm, (String)simpleTermOrsimpleListTermTypes.get(node)); } node.replaceBy(asimpleListTerm); simpleTermTransform.put(asimpleListTerm, "L"+ResolveIds.name((String)isElementIsAlist.get(currentNewAltName+name) )); //Terms are added here only if they were implicitely transformed listSimpleTermTransform.add( asimpleListTerm ); } } @Override public void outAListTerm(AListTerm node) { if( (node.getListTerms() != null) && (node.getListTerms().size() > 0) ) { Object[] temp = node.getListTerms().toArray(); if(simpleTermTransform.get(temp[0]) != null) { String firstTermType = (String)simpleTermTransform.get(temp[0]); if(firstTermType != null) { if(!firstTermType.startsWith("L")) { simpleTermTransform.put(node, "L" + firstTermType); } else { simpleTermTransform.put(node, firstTermType); } } } } } } sablecc-3.7/src/org/sablecc/sablecc/AlternativeElementTypes.java000066400000000000000000000033451265440641200250160ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; @SuppressWarnings({"rawtypes","unchecked"}) public class AlternativeElementTypes extends DepthFirstAdapter { private Map altElemTypes = new TypedHashMap(StringCast.instance, StringCast.instance); private ResolveIds ids; private String currentAlt; public AlternativeElementTypes(ResolveIds ids) { this.ids = ids; } public Map getMapOfAltElemType() { return altElemTypes; } @Override public void caseAAst(AAst node) {} @Override public void caseAProd(final AProd production) { Object []temp = production.getAlts().toArray(); for(int i = 0; i Copyright (C) This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! sablecc-3.7/src/org/sablecc/sablecc/Cast.java000066400000000000000000000007151265440641200210710ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; public interface Cast { Object cast(Object o); } sablecc-3.7/src/org/sablecc/sablecc/CharSet.java000066400000000000000000000114441265440641200215310ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; @SuppressWarnings({"rawtypes","unchecked"}) public class CharSet implements Cloneable { private final Vector intervals = new Vector(0); public CharSet(char c) { intervals.addElement(new Interval(c, c)); } public CharSet(char start, char end) { intervals.addElement(new Interval(start, end)); } private CharSet(Vector intervals) { for(Enumeration e = intervals.elements(); e.hasMoreElements();) { this.intervals.addElement(((Interval) e.nextElement()).clone()); } } @Override public Object clone() { return new CharSet(intervals); } public Interval findOverlap(Interval interval1) { int low = 0; int high = intervals.size() - 1; Interval interval2; Interval result = null; while(high >= low) { int middle = (high + low) / 2; interval2 = (Interval) intervals.elementAt(middle); if(interval1.start <= interval2.end) { if(interval1.end >= interval2.start) { result = interval2; // we continue, to find the lowest matching interval! } high = middle - 1; } else { low = middle + 1; } } return result; } private void remove (Interval interval) { intervals.removeElement(interval); } private void add (Interval interval) { for(int i = 0; i < intervals.size(); i++) { Interval iv = (Interval) intervals.elementAt(i); if(iv.start > interval.start) { intervals.insertElementAt(interval, i); return; } } intervals.addElement(interval); } public CharSet union(CharSet chars) { CharSet result = (CharSet) clone(); Interval interval; Interval largeInterval; Interval overlap; for(Enumeration e = chars.intervals.elements(); e.hasMoreElements();) { interval = (Interval) ((Interval) e.nextElement()).clone(); do { largeInterval = new Interval( (interval.start == 0) ? (char) 0 : (char) (interval.start - 1), (interval.end == 0xffff) ? (char) 0xffff : (char) (interval.end + 1)); overlap = result.findOverlap(largeInterval); if(overlap != null) { result.remove(overlap); interval.start = (char) Math.min(interval.start, overlap.start); interval.end = (char) Math.max(interval.end, overlap.end); } } while(overlap != null); result.add(interval); } return result; } public CharSet diff(CharSet chars) { CharSet result = (CharSet) clone(); Interval interval; Interval overlap; for(Enumeration e = chars.intervals.elements(); e.hasMoreElements();) { interval = (Interval) ((Interval) e.nextElement()).clone(); do { overlap = result.findOverlap(interval); if(overlap != null) { result.remove(overlap); if(overlap.start < interval.start) { result.add(new Interval(overlap.start, (char) (interval.start - 1))); } if(overlap.end > interval.end) { result.add(new Interval((char) (interval.end + 1), overlap.end)); } } } while(overlap != null); } return result; } @Override public String toString() { StringBuffer result = new StringBuffer(); for(Enumeration e = intervals.elements(); e.hasMoreElements();) { result.append("[" + e.nextElement() + "] "); } return "" + result; } public static class Interval implements Cloneable { public Interval(char start, char end) { this.start = start; this.end = end; } @Override public Object clone() { return new Interval(start, end); } private String c(char c) { if((c >= 32) && (c < 127)) { return "" + c; } return "" + ((int) c); } @Override public String toString() { if(start < end) { return c(start) + " .. " + c(end); } else { return c(start); } } public char start; public char end; } public static class IntervalCast implements Cast { public final static IntervalCast instance = new IntervalCast(); private IntervalCast() {} @Override public Object cast(Object o) { return (Interval) o; } } } sablecc-3.7/src/org/sablecc/sablecc/ComputeCGNomenclature.java000066400000000000000000000200441265440641200243770ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Last Modification date :: 04-February-2004 * Add termtail to simple term and simple listterm * in order to support scripting generation for parser by * the new scripting engine. * * Fix bug related to code generation. * Method #public void caseASimpleTerm(ASimpleTerm node)# * and #public void caseASimpleTerm(ASimpleTerm node)# * were rewrite. The type of simpleTerm was the problem. */ package org.sablecc.sablecc; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; @SuppressWarnings({"rawtypes","unchecked"}) public class ComputeCGNomenclature extends DepthFirstAdapter { private String currentProd; private String currentAlt; private int counter; private ResolveIds ids; private ResolveProdTransformIds prodTransformIds; private Map altElemTypes; private final Map altTransformElemTypes = new TypedHashMap( NodeCast.instance, StringCast.instance); private final Map termNumbers = new TypedHashMap(NodeCast.instance, IntegerCast.instance); public ComputeCGNomenclature(ResolveIds ids, ResolveProdTransformIds prodTransformIds) { this.ids = ids; this.prodTransformIds = prodTransformIds; } public void setAltElemTypes(Map aMap) { this.altElemTypes = aMap; } public Map getAltTransformElemTypes() { return altTransformElemTypes; } public Map getTermNumbers() { return termNumbers; } @Override public void caseAProd(final AProd production) { currentProd = "P" + ResolveIds.name(production.getId().getText()); Object []temp = production.getAlts().toArray(); for(int i = 0; i 0 ) { Object[] temp = node.getListTerms().toArray(); String firstTermType = (String)altTransformElemTypes.get(temp[0]); if(firstTermType != null) { if(!firstTermType.startsWith("L")) { altTransformElemTypes.put(node, "L" + firstTermType); } else { altTransformElemTypes.put(node, firstTermType); } } } else { altTransformElemTypes.put(node, "Lnull"); } termNumbers.put(node, new Integer(++counter)); } @Override public void caseASimpleTerm(ASimpleTerm node) { String name; String elemType = (String) this.altElemTypes.get( currentAlt+"."+node.getId().getText() ); if(node.getSimpleTermTail() == null) { name = elemType; if(name.startsWith("P") ) { //add termtail to the simpleterm node.setSimpleTermTail( (TId)node.getId().clone() ); } } else { String termTail = node.getSimpleTermTail().getText(); name = (String)prodTransformIds.prodTransformElemTypesString.get(elemType+"."+termTail); } if(name.endsWith("?")) { name = name.substring(0, name.length()-1); } altTransformElemTypes.put(node, name); termNumbers.put(node, new Integer(++counter)); } /* public void caseASimpleTerm(ASimpleTerm node) { String name; String elemType = (String)altElemTypes.get( currentAlt+"."+node.getId().getText() ); if( ( (elemType != null) && elemType.startsWith("T") ) || ( (elemType == null) && ids.tokens.get("T" + ids.name(node.getId().getText())) != null ) ) { if(elemType != null) { name = elemType; } else { name = "T" + ids.name(node.getId().getText()); } } else { if(node.getSimpleTermTail() == null) { if(elemType != null) { name = elemType; } else { name = "P" + ids.name(node.getId().getText()); } //add termtail to the simpleterm node.setSimpleTermTail( (TId)node.getId().clone() ); } else { String prodType; if(elemType != null) { prodType = elemType; } else { prodType = "P" + ids.name(node.getId().getText()); } String termTail = node.getSimpleTermTail().getText(); name = (String)prodTransformIds.prodTransformElemTypesString.get(prodType+"."+termTail); } } if(name.endsWith("?")) { name = name.substring(0, name.length()-1); } altTransformElemTypes.put(node, name); termNumbers.put(node, new Integer(++counter)); } */ @Override public void caseANullTerm(ANullTerm node) { altTransformElemTypes.put(node, "null"); termNumbers.put(node, new Integer(++counter)); } @Override public void caseASimpleListTerm(ASimpleListTerm node) { String name; String elemType = (String)altElemTypes.get( currentAlt+"."+node.getId().getText() ); if(node.getSimpleTermTail() == null) { name = elemType; if( name.startsWith("P") ) { //add termtail to the simpleterm node.setSimpleTermTail( (TId)node.getId().clone() ); } } else { String termTail = node.getSimpleTermTail().getText(); name = (String)prodTransformIds.prodTransformElemTypesString.get(elemType+"."+termTail); } if(name.endsWith("?")) { name = name.substring(0, name.length()-1); } altTransformElemTypes.put(node, name); termNumbers.put(node, new Integer(++counter)); } /* public void caseASimpleListTerm(ASimpleListTerm node) { String name; String elemType = (String)altElemTypes.get( currentAlt+"."+node.getId().getText() ); if( ( (elemType != null) && elemType.startsWith("T") ) || ( (elemType == null) && ids.tokens.get("T" + ids.name(node.getId().getText())) != null ) ) { if(elemType != null) { name = elemType; } else { name = "T" + ids.name(node.getId().getText()); } } //it seems to be a production without a specifier else { if(node.getSimpleTermTail() == null) { if(elemType != null) { name = elemType; } else { name = "P" + ids.name(node.getId().getText()); } //add termtail to the simpleterm node.setSimpleTermTail( (TId)node.getId().clone() ); } else { String prodType; if(elemType != null) { prodType = elemType; } else { prodType = "P" + ids.name(node.getId().getText()); } String termTail = node.getSimpleTermTail().getText(); name = (String)prodTransformIds.prodTransformElemTypesString.get(prodType+"."+termTail); } } if(name.endsWith("?")) { name = name.substring(0, name.length()-1); } altTransformElemTypes.put(node, name); termNumbers.put(node, new Integer(++counter)); } */ } sablecc-3.7/src/org/sablecc/sablecc/ComputeInlining.java000066400000000000000000000140241265440641200233010ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; /* * Last Modification date : 23 07 2004 * fix bug : when an inlining of a production does not resolve a conflict * the associated alternatives transformation should not be transformed. * The bug was about transforming this instead. */ /* * ComputeInlining * This class takes SableCC grammar represented by the tree * and a list of production to inline within this grammar and * try to inline those productions. */ @SuppressWarnings({"rawtypes","unchecked"}) public class ComputeInlining { //Productions implied in a conflict private Set setOfProdToBeInline; //Map of all productions in the grammar private Map productionsMap; private Start tree; public ComputeInlining(Set set , Map productionsMap, Start tree) { this.setOfProdToBeInline = set ; this.productionsMap = productionsMap; this.tree = tree; } /** * This method compute the inline of a all productions implied in a conflict * in the grammar. * It returns : * -- true if at least one production is inlined with success * -- and false otherwise. */ public boolean computeInlining() { final BooleanEx atLeastOneProductionInlined = new BooleanEx(false); String []nameOfProds = (String[])setOfProdToBeInline.toArray(new String[0]); for(int i=0; i= 0 ; i--) { NFA nfa = (NFA) getOut(tokenDefs[i]); if(nfa != null) { if(result == null) { result = nfa; } else { result = nfa.merge(result); } // free memory if(getOut(tokenDefs[i]) != null) setOut(tokenDefs[i], null); } } if(result != null) setOut(node, result); } @Override public void outATokenDef(ATokenDef node) { Set set = (Set) getOut(node.getStateList()); Object o1 = getOut(node.getRegExp()); if((set == null) || (set.size() == 0) || set.contains(stateName)) { //System.out.print("*"); NFA n1 = (o1 instanceof NFA) ? (NFA) o1 : new NFA((CharSet) o1); String name = (String) ids.names.get(node); n1.states[n1.states.length - 1].accept = name; setOut(node, n1); } else { //System.out.print("-"); } // free memory if(getOut(node.getStateList()) != null) setOut(node.getStateList(), null); if(getOut(node.getRegExp()) != null) setOut(node.getRegExp(), null); } @Override public void outAStateList(AStateList node) { Set set = new TreeSet(); AStateListTail[] stateListTails = (AStateListTail[]) node.getStateLists().toArray(new AStateListTail[0]); for(int i = stateListTails.length - 1; i >= 0 ; i--) { String str = stateListTails[i].getId().getText().toUpperCase(); set.add(str); } set.add(node.getId().getText().toUpperCase()); setOut(node, set ); } @Override public void outARegExp(ARegExp node) { AConcat[] concats = (AConcat[]) node.getConcats().toArray(new AConcat[0]); NFA result = null; if(concats.length > 1) { for(int i = concats.length - 1; i >= 0 ; i--) { Object o = getOut(concats[i]); NFA nfa = (o instanceof NFA) ? (NFA) o : new NFA((CharSet) o); if(result == null) { result = nfa; } else { result = nfa.alternate(result); } // free memory if(getOut(concats[i]) != null) setOut(concats[i], null); } setOut(node, result); } else if(concats.length == 1) { setOut(node, getOut(concats[0])); // free memory if(getOut(concats[0]) != null) setOut(concats[0], null); } } @Override public void outAConcat(AConcat node) { AUnExp[] unExps = (AUnExp[]) node.getUnExps().toArray(new AUnExp[0]); if(unExps.length == 0) { setOut(node, new NFA()); } else if(unExps.length == 1) { setOut(node, getOut(unExps[0])); // free memory if(getOut(unExps[0]) != null) setOut(unExps[0], null); } else { NFA result = null; for(int i = unExps.length - 1; i >= 0 ; i--) { Object o = getOut(unExps[i]); NFA nfa = (o instanceof NFA) ? (NFA) o : new NFA((CharSet) o); if(result == null) { result = nfa; } else { result = nfa.concatenate(result); } // free memory if(getOut(unExps[i]) != null) setOut(unExps[i], null); } setOut(node, result); } } @Override public void outAUnExp(AUnExp node) { Object o = getOut(node.getBasic()); char c = ' '; if(node.getUnOp() != null) c = ((Character) getOut(node.getUnOp())).charValue(); switch(c) { case '*': { NFA n = (o instanceof NFA) ? (NFA) o : new NFA((CharSet) o); setOut(node, n.zeroOrMore()); } break; case '?': { NFA n = (o instanceof NFA) ? (NFA) o : new NFA((CharSet) o); setOut(node, n.zeroOrOne()); } break; case '+': { NFA n = (o instanceof NFA) ? (NFA) o : new NFA((CharSet) o); setOut(node, n.oneOrMore()); } break; default: { setOut(node, o); } break; } // free memory if(getOut(node.getBasic()) != null) setOut(node.getBasic(), null); if(getOut(node.getUnOp()) != null) setOut(node.getUnOp(), null); } @Override public void outACharBasic(ACharBasic node) { char c = ((Character) getOut(node.getChar())).charValue(); setOut(node, new CharSet(c)); // free memory if(getOut(node.getChar()) != null) setOut(node.getChar(), null); } @Override public void outASetBasic(ASetBasic node) { setOut(node, getOut(node.getSet())); // free memory if(getOut(node.getSet()) != null) setOut(node.getSet(), null); } @Override public void outAStringBasic(AStringBasic node) { String s = node.getString().getText(); s = s.substring(1, s.length() -1); setOut(node, new NFA(s)); } @Override public void outAIdBasic(AIdBasic node) { Object o = getOut((Node) ids.helpers.get(node.getId().getText())); if(o instanceof NFA) { setOut(node, ((NFA) o).clone()); } else { setOut(node, ((CharSet) o).clone()); } } @Override public void outARegExpBasic(ARegExpBasic node) { setOut(node, getOut(node.getRegExp())); // free memory if(getOut(node.getRegExp()) != null) setOut(node.getRegExp(), null); } @Override public void outACharChar(ACharChar node) { setOut(node, new Character(node.getChar().getText().charAt(1))); } @Override public void outADecChar(ADecChar node) { setOut(node, new Character((char) Integer.parseInt(node.getDecChar().getText()))); } @Override public void outAHexChar(AHexChar node) { setOut(node, new Character((char) Integer.parseInt(node.getHexChar().getText().substring(2), 16))); } @Override public void outAOperationSet(AOperationSet node) { try { CharSet cs1 = (CharSet) getOut(node.getLeft()); CharSet cs2 = (CharSet) getOut(node.getRight()); char binop = ((Character) getOut(node.getBinOp())).charValue(); switch(binop) { case '+': { setOut(node, cs1.union(cs2)); } break; case '-': { setOut(node, cs1.diff(cs2)); } break; } } catch(Exception e) { throw new RuntimeException(node + " is invalid."); } // free memory if(getOut(node.getLeft()) != null) setOut(node.getLeft(), null); if(getOut(node.getBinOp()) != null) setOut(node.getBinOp(), null); if(getOut(node.getRight()) != null) setOut(node.getRight(), null); } @Override public void outAIntervalSet(AIntervalSet node) { char c1 = ((Character) getOut(node.getLeft())).charValue(); char c2 = ((Character) getOut(node.getRight())).charValue(); if(c1 > c2) { throw new RuntimeException(node + " is invalid."); } setOut(node, new CharSet(c1, c2)); // free memory if(getOut(node.getLeft()) != null) setOut(node.getLeft(), null); if(getOut(node.getRight()) != null) setOut(node.getRight(), null); } @Override public void outAStarUnOp(AStarUnOp node) { setOut(node, new Character('*')); } @Override public void outAQMarkUnOp(AQMarkUnOp node) { setOut(node, new Character('?')); } @Override public void outAPlusUnOp(APlusUnOp node) { setOut(node, new Character('+')); } @Override public void outAPlusBinOp(APlusBinOp node) { setOut(node, new Character('+')); } @Override public void outAMinusBinOp(AMinusBinOp node) { setOut(node, new Character('-')); } @Override public Object getOut(Node node) { if(node == null) { return null; } return super.getOut(node); } @Override public void setOut(Node node, Object out) { if(node == null) { throw new NullPointerException(); } super.setOut(node, out); } } sablecc-3.7/src/org/sablecc/sablecc/ConstructParserGenerationDatas.java000066400000000000000000000042761265440641200263370ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; @SuppressWarnings({"rawtypes","unchecked"}) public class ConstructParserGenerationDatas extends DepthFirstAdapter { private ResolveIds ids; private int currentAlt; // private boolean processingAst; private String currentProd; private Map alts; public ConstructParserGenerationDatas(ResolveIds ids, Map alts) { this.ids = ids; this.alts = alts; } @Override public void caseAAst(AAst node) {} @Override public void caseAProd(AProd node) { currentProd = (String) ids.names.get(node); AAlt[] alts = (AAlt[])node.getAlts().toArray(new AAlt[0]); for(int i=0; i max) { max = match; st = k; } } if(max < 2) { ((Vector) transitions.elementAt(i)).addElement( state.transitions.elementAt(j)); } else { DFA.Transition transition1 = (DFA.Transition) state.transitions.elementAt(j); DFA.Transition transition2 = (DFA.Transition) state.transitions.elementAt(j + max - 1); DFA.Transition transition = new DFA.Transition( new CharSet.Interval( transition1.interval().start, transition2.interval().end), -2 - st); ((Vector) transitions.elementAt(i)).addElement(transition); j += max - 1; } } } for(int i = 0; i < states.size(); i++) { DFA.State state = (DFA.State) states.elementAt(i); state.transitions = (Vector) transitions.elementAt(i); } } private int match(int st1, int tr, int st2) { DFA.State state1 = (DFA.State) states.elementAt(st1); DFA.State state2 = (DFA.State) states.elementAt(st2); DFA.Transition first = (DFA.Transition) state1.transitions.elementAt(tr); int j = -1; for(int i = 0; i < state2.transitions.size(); i++) { DFA.Transition transition = (DFA.Transition) state2.transitions.elementAt(i); if(transition.match(first)) { j = i; break; } } if(j == -1) { return 0; } int max = 0; int i = tr; while((i < state1.transitions.size()) && (j < state2.transitions.size())) { DFA.Transition transition1 = (DFA.Transition) state1.transitions.elementAt(i); DFA.Transition transition2 = (DFA.Transition) state2.transitions.elementAt(j); if(!transition1.match(transition2)) { return max; } max++; i++; j++; } return max; } private void construct() { computeEClosures(); IntSet initial = new IntSet(); initial.or(eclosure(0)); State state = new State(initial); states.addElement(state); finder.put(state.nfaStates, new Integer(0)); int i = -1; while(++i < states.size()) { System.out.print("."); state = (State) states.elementAt(i); CharSet.Interval interval = new CharSet.Interval((char) 0, (char) 0xffff); do { IntSet destination = new IntSet(); interval.end = (char) 0xffff; boolean modified = false; int[] elements = state.nfaStates.elements(); for(int k = 0; k < elements.length; k++) { int j = elements[k]; if((nfa.states[j].transitions[0] != null) && (nfa.states[j].transitions[0].chars != null)) { CharSet.Interval overlap = nfa.states[j].transitions[0].chars.findOverlap(interval); if(overlap != null) { if(overlap.start > interval.start) { interval.end = (char) (overlap.start - 1); } else { destination.set(nfa.states[j].transitions[0].destination); modified = true; if(overlap.end < interval.end) { interval.end = overlap.end; } } } } if((nfa.states[j].transitions[1] != null) && (nfa.states[j].transitions[1].chars != null)) { CharSet.Interval overlap = nfa.states[j].transitions[1].chars.findOverlap(interval); if(overlap != null) { if(overlap.start > interval.start) { interval.end = (char) (overlap.start - 1); } else { destination.set(nfa.states[j].transitions[1].destination); if(overlap.end < interval.end) { interval.end = overlap.end; } } } } } if(modified) { destination = eclosure(destination); Integer dest = (Integer) finder.get(destination); if(dest != null) { state.transitions.addElement( new Transition((CharSet.Interval) interval.clone(), dest.intValue())); } else { State s = new State(destination); states.addElement(s); finder.put(s.nfaStates, new Integer(states.size() - 1)); state.transitions.addElement( new Transition((CharSet.Interval) interval.clone(), states.size() - 1)); } } interval.start = (char) (interval.end + 1); } while(interval.end != (char) 0xffff); // System.out.println(state); } // System.out.println(this); } private IntSet[] eclosures; private void computeEClosures() { eclosures = new IntSet[nfa.states.length]; for(int i = 0; i < nfa.states.length; i++) { System.out.print("."); IntSet set = new IntSet(); eclosure(i, set ); eclosures[i] = set ; } System.out.println(); } private IntSet eclosure(int state) { return eclosures[state]; } private void eclosure(int state, IntSet nfaStates) { if(eclosures[state] != null) { nfaStates.or(eclosures[state]); return; } nfaStates.set(state); if((nfa.states[state].transitions[0] != null) && (nfa.states[state].transitions[0].chars == null) && (!nfaStates.get(nfa.states[state].transitions[0].destination))) { eclosure(nfa.states[state].transitions[0].destination, nfaStates); } if((nfa.states[state].transitions[1] != null) && (nfa.states[state].transitions[1].chars == null) && (!nfaStates.get(nfa.states[state].transitions[1].destination))) { eclosure(nfa.states[state].transitions[1].destination, nfaStates); } } private IntSet eclosure(IntSet nfaStates) { IntSet result = new IntSet(); int[] elements = nfaStates.elements(); for(int j = 0; j < elements.length; j++) { int i = elements[j]; result.or(eclosure(i)); } return result; } @Override public String toString() { StringBuffer result = new StringBuffer(); for(int i = 0; i < states.size(); i++) { result.append(i + ": " + states.elementAt(i) + System.getProperty("line.separator")); } return result.toString(); } public static class State { public State(IntSet nfaStates) { this.nfaStates = nfaStates; } public IntSet nfaStates = new IntSet(); public Vector transitions = new Vector(0); public int accept; @Override public String toString() { StringBuffer result = new StringBuffer(); /* for(int i = 0; i < nfaStates.size(); i++) { if(nfaStates.get(i)) { if(nfa.states[i].accept != null) { result.append("(" + nfa.states[i].accept + ")"); } } }*/ for(int i = 0; i < transitions.size(); i++) { result.append(transitions.elementAt(i) + ","); } return result /*+ " " + nfaStates*/ + ""; } } public static class Transition { private char start; private char end; public int destination; public Transition(CharSet.Interval interval, int destination) { this.start = interval.start; this.end = interval.end; this.destination = destination; } public CharSet.Interval interval() { return new CharSet.Interval(start, end); } public Transition(Transition transition) { start = transition.start; end = transition.end; destination = transition.destination; } @Override public String toString() { return destination + ":[" + interval() + "]"; } public boolean match(Transition transition) { return (start == transition.start) && (end == transition.end) && (destination == transition.destination); } } } sablecc-3.7/src/org/sablecc/sablecc/DisplayLicense.java000066400000000000000000000033321265440641200231050ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.io.*; class DisplayLicense { DisplayLicense() { try { BufferedReader in = new BufferedReader( new InputStreamReader( getClass().getResourceAsStream("LICENSE"))); System.out.println("---- FILE: LICENSE ----"); String s; while((s = in.readLine()) != null) { System.out.println(s); } in.close(); System.out.println("---- END OF FILE: SableCC-LICENSE ----"); System.out.println(); System.out.println("---- FILE: AUTHORS ----"); in = new BufferedReader( new InputStreamReader( getClass().getResourceAsStream("AUTHORS"))); while((s = in.readLine()) != null) { System.out.println(s); } in.close(); System.out.println("---- END OF FILE: AUTHORS ----"); System.out.println(); System.out.println("---- FILE: COPYING-LESSER ----"); in = new BufferedReader( new InputStreamReader( getClass().getResourceAsStream("COPYING-LESSER"))); while((s = in.readLine()) != null) { System.out.println(s); } in.close(); System.out.println("---- END OF FILE: COPYING-LESSER ----"); } catch(Exception e) { System.out.println(e); System.exit(1); } } } sablecc-3.7/src/org/sablecc/sablecc/GenAlts.java000066400000000000000000000271071265440641200215400ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.io.*; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; @SuppressWarnings({"rawtypes","unchecked"}) public class GenAlts extends DepthFirstAdapter { private MacroExpander macros; private ResolveAstIds ast_ids; private File pkgDir; private String pkgName; private List elemList; private String currentProd; ElemInfo info; // final GenAlts instance = this; public GenAlts(ResolveAstIds ast_ids) { this.ast_ids = ast_ids; try { macros = new MacroExpander( new InputStreamReader( getClass().getResourceAsStream("alternatives.txt"))); } catch(IOException e) { throw new RuntimeException("unable to open alternatives.txt."); } pkgDir = new File(ast_ids.astIds.pkgDir, "node"); pkgName = ast_ids.astIds.pkgName.equals("") ? "node" : ast_ids.astIds.pkgName + ".node"; if(!pkgDir.exists()) { if(!pkgDir.mkdir()) { throw new RuntimeException("Unable to create " + pkgDir.getAbsolutePath()); } } } @Override public void inAAstProd(AAstProd node) { currentProd = (String) ast_ids.ast_names.get(node); } @Override public void inAAstAlt(AAstAlt node) { elemList = new TypedLinkedList(ElemInfoCast.instance); } @Override public void caseAProductions(AProductions node) {} @Override public void inAElem(AElem node) { info = new ElemInfo(); info.name = (String) ast_ids.ast_names.get(node); info.type = (String) ast_ids.ast_elemTypes.get(node); info.operator = ElemInfo.NONE; if(node.getUnOp() != null) { node.getUnOp().apply(new DepthFirstAdapter() { @Override public void caseAStarUnOp(AStarUnOp node) { info.operator = ElemInfo.STAR; } @Override public void caseAQMarkUnOp(AQMarkUnOp node) { info.operator = ElemInfo.QMARK; } @Override public void caseAPlusUnOp(APlusUnOp node) { info.operator = ElemInfo.PLUS; } } ); } elemList.add(info); info = null; } @Override public void outAAstAlt(AAstAlt node) { String name = (String) ast_ids.ast_names.get(node); BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, name + ".java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, name + ".java").getAbsolutePath()); } try { // boolean hasOperator = false; boolean hasList = false; for(Iterator i = elemList.iterator(); i.hasNext();) { ElemInfo info = (ElemInfo) i.next(); if(info != null) switch(info.operator) { case ElemInfo.STAR: case ElemInfo.PLUS: { hasList = true; } break; } } macros.apply(file, "AlternativeHeader1", new String[] {pkgName}); if(hasList) { macros.apply(file, "AlternativeHeaderList", new String[] {}); } macros.apply(file, "AlternativeHeader2", new String[] { ast_ids.astIds.pkgName.equals("") ? "analysis" : ast_ids.astIds.pkgName + ".analysis", name, currentProd}); for(Iterator i = elemList.iterator(); i.hasNext();) { ElemInfo info = (ElemInfo) i.next(); if(info != null) switch(info.operator) { case ElemInfo.QMARK: case ElemInfo.NONE: { macros.apply(file, "NodeElement", new String[] {info.type, nodeName(info.name)}); } break; case ElemInfo.STAR: case ElemInfo.PLUS: { // hasOperator = true; macros.apply(file, "ListElement", new String[] {info.type, nodeName(info.name)}); } break; } } macros.apply(file, "ConstructorHeader", new String[] {name}); macros.apply(file, "ConstructorBodyHeader", null); macros.apply(file, "ConstructorBodyTail", null); if(elemList.size() > 0) { macros.apply(file, "ConstructorHeader", new String[] {name}); for(Iterator i = elemList.iterator(); i.hasNext();) { ElemInfo info = (ElemInfo) i.next(); if(info != null) switch(info.operator) { case ElemInfo.QMARK: case ElemInfo.NONE: { macros.apply(file, "ConstructorHeaderDeclNode", new String[] {info.type, nodeName(info.name), i.hasNext() ? "," : ""}); } break; case ElemInfo.STAR: case ElemInfo.PLUS: { macros.apply(file, "ConstructorHeaderDeclList", new String[] {info.type, nodeName(info.name), i.hasNext() ? "," : ""}); } break; } } macros.apply(file, "ConstructorBodyHeader", null); for(Iterator i = elemList.iterator(); i.hasNext();) { ElemInfo info = (ElemInfo) i.next(); if(info != null ) switch(info.operator) { case ElemInfo.QMARK: case ElemInfo.NONE: { macros.apply(file, "ConstructorBodyNode", new String[] {info.name, nodeName(info.name)}); } break; case ElemInfo.STAR: case ElemInfo.PLUS: { macros.apply(file, "ConstructorBodyList", new String[] {info.name, nodeName(info.name)}); } break; } } macros.apply(file, "ConstructorBodyTail", null); } //**************** macros.apply(file, "CloneHeader", new String[] {name}); for(Iterator i = elemList.iterator(); i.hasNext();) { ElemInfo info = (ElemInfo) i.next(); if(info != null) switch(info.operator) { case ElemInfo.QMARK: case ElemInfo.NONE: { macros.apply(file, "CloneBodyNode", new String[] {info.type, nodeName(info.name), i.hasNext() ? "," : ""}); } break; case ElemInfo.STAR: case ElemInfo.PLUS: { macros.apply(file, "CloneBodyList", new String[] {nodeName(info.name), i.hasNext() ? "," : ""}); } break; } } macros.apply(file, "CloneTail", null); macros.apply(file, "Apply", new String[] {name}); for(Iterator i = elemList.iterator(); i.hasNext();) { ElemInfo info = (ElemInfo) i.next(); if(info != null) switch(info.operator) { case ElemInfo.QMARK: case ElemInfo.NONE: { macros.apply(file, "GetSetNode", new String[] {info.type, info.name, nodeName(info.name)}); } break; case ElemInfo.STAR: case ElemInfo.PLUS: { macros.apply(file, "GetSetList", new String[] {info.name, nodeName(info.name), info.type}); } break; } } macros.apply(file, "ToStringHeader", null); for(Iterator i = elemList.iterator(); i.hasNext();) { ElemInfo info = (ElemInfo) i.next(); if(info != null) switch(info.operator) { case ElemInfo.QMARK: case ElemInfo.NONE: { macros.apply(file, "ToStringBodyNode", new String[] {nodeName(info.name)}); } break; case ElemInfo.STAR: case ElemInfo.PLUS: { macros.apply(file, "ToStringBodyList", new String[] {nodeName(info.name)}); } break; } } macros.apply(file, "ToStringTail", null); macros.apply(file, "RemoveChildHeader", null); for(Iterator i = elemList.iterator(); i.hasNext();) { ElemInfo info = (ElemInfo) i.next(); if(info != null) switch(info.operator) { case ElemInfo.QMARK: case ElemInfo.NONE: { macros.apply(file, "RemoveChildNode", new String[] {nodeName(info.name)}); } break; case ElemInfo.STAR: case ElemInfo.PLUS: { macros.apply(file, "RemoveChildList", new String[] {nodeName(info.name)}); } break; } } macros.apply(file, "RemoveChildTail", null); macros.apply(file, "ReplaceChildHeader", null); for(Iterator i = elemList.iterator(); i.hasNext();) { ElemInfo info = (ElemInfo) i.next(); if(info != null) switch(info.operator) { case ElemInfo.QMARK: case ElemInfo.NONE: { macros.apply(file, "ReplaceChildNode", new String[] {nodeName(info.name), info.name, info.type}); } break; case ElemInfo.STAR: case ElemInfo.PLUS: { macros.apply(file, "ReplaceChildList", new String[] {nodeName(info.name), info.type}); } break; } } macros.apply(file, "ReplaceChildTail", null); macros.apply(file, "AlternativeTail", null); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, name + ".java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} elemList = null; } public static String nodeName(String s) { StringBuffer result = new StringBuffer(s); if(result.length() > 0) { result.setCharAt(0, Character.toLowerCase(result.charAt(0))); } return result.toString(); } private static class ElemInfo { final static int NONE = 0; final static int STAR = 1; final static int QMARK = 2; final static int PLUS = 3; String name; String type; int operator; } private static class ElemInfoCast implements Cast { public final static ElemInfoCast instance = new ElemInfoCast(); private ElemInfoCast() {} @Override public Object cast(Object o) { return (ElemInfo) o; } } } sablecc-3.7/src/org/sablecc/sablecc/GenAnalyses.java000066400000000000000000000263741265440641200224210ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.io.*; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; @SuppressWarnings({"rawtypes","unchecked"}) public class GenAnalyses extends DepthFirstAdapter { private MacroExpander macros; private ResolveAstIds ast_ids; private File pkgDir; private String pkgName; private List elemList; private List altList = new TypedLinkedList(AltInfoCast.instance); private List tokenList = new TypedLinkedList(StringCast.instance); private String mainProduction; ElemInfo info; // final GenAnalyses instance = this; public GenAnalyses(ResolveAstIds ast_ids) { this.ast_ids = ast_ids; try { macros = new MacroExpander( new InputStreamReader( getClass().getResourceAsStream("analyses.txt"))); } catch(IOException e) { throw new RuntimeException("unable to open analyses.txt."); } pkgDir = new File(ast_ids.astIds.pkgDir, "analysis"); pkgName = ast_ids.astIds.pkgName.equals("") ? "analysis" : ast_ids.astIds.pkgName + ".analysis"; if(!pkgDir.exists()) { if(!pkgDir.mkdir()) { throw new RuntimeException("Unable to create " + pkgDir.getAbsolutePath()); } } } @Override public void inAAstProd(AAstProd node) { if(mainProduction == null) { mainProduction = (String) ast_ids.ast_names.get(node); } } @Override public void inATokenDef(ATokenDef node) { tokenList.add(ast_ids.astIds.names.get(node)); } @Override public void inAAstAlt(AAstAlt node) { elemList = new TypedLinkedList(ElemInfoCast.instance); } @Override public void caseAProductions(AProductions node) {} @Override public void inAElem(AElem node) { info = new ElemInfo(); info.name = (String) ast_ids.ast_names.get(node); info.type = (String) ast_ids.ast_elemTypes.get(node); info.operator = ElemInfo.NONE; if(node.getUnOp() != null) { node.getUnOp().apply(new DepthFirstAdapter() { @Override public void caseAStarUnOp(AStarUnOp node) { info.operator = ElemInfo.STAR; } @Override public void caseAQMarkUnOp(AQMarkUnOp node) { info.operator = ElemInfo.QMARK; } @Override public void caseAPlusUnOp(APlusUnOp node) { info.operator = ElemInfo.PLUS; } } ); } elemList.add(info); info = null; } @Override public void outAAstAlt(AAstAlt node) { AltInfo info = new AltInfo(); info.name = (String) ast_ids.ast_names.get(node); info.elems.addAll(elemList); elemList = null; altList.add(info); } @Override public void outStart(Start node) { createAnalysis(); createAnalysisAdapter(); if(mainProduction != null) { createDepthFirstAdapter(); createReversedDepthFirstAdapter(); } } public void createAnalysis() { BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, "Analysis.java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, "Analysis.java").getAbsolutePath()); } try { macros.apply(file, "AnalysisHeader", new String[] {pkgName, ast_ids.astIds.pkgName.equals("") ? "node" : ast_ids.astIds.pkgName + ".node"}); if(mainProduction != null) { macros.apply(file, "AnalysisStart", null); for(Iterator i = altList.iterator(); i.hasNext();) { AltInfo info = (AltInfo) i.next(); macros.apply(file, "AnalysisBody", new String[] {info.name}); } file.newLine(); } for(Iterator i = tokenList.iterator(); i.hasNext();) { macros.apply(file, "AnalysisBody", new String[] {(String) i.next()}); } macros.apply(file, "AnalysisTail", null); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "Analysis.java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } public void createAnalysisAdapter() { BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, "AnalysisAdapter.java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, "AnalysisAdapter.java").getAbsolutePath()); } try { macros.apply(file, "AnalysisAdapterHeader", new String[] {pkgName, ast_ids.astIds.pkgName.equals("") ? "node" : ast_ids.astIds.pkgName + ".node"}); if(mainProduction != null) { macros.apply(file, "AnalysisAdapterStart", null); for(Iterator i = altList.iterator(); i.hasNext();) { AltInfo info = (AltInfo) i.next(); macros.apply(file, "AnalysisAdapterBody", new String[] {info.name}); } } for(Iterator i = tokenList.iterator(); i.hasNext();) { macros.apply(file, "AnalysisAdapterBody", new String[] {(String) i.next()}); } macros.apply(file, "AnalysisAdapterTail", null); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "AnalysisAdapter.java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } public void createDepthFirstAdapter() { BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, "DepthFirstAdapter.java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, "DepthFirstAdapter.java").getAbsolutePath()); } try { macros.apply(file, "DepthFirstAdapterHeader", new String[] {pkgName, ast_ids.astIds.pkgName.equals("") ? "node" : ast_ids.astIds.pkgName + ".node", mainProduction}); for(Iterator i = altList.iterator(); i.hasNext();) { AltInfo info = (AltInfo) i.next(); macros.apply(file, "DepthFirstAdapterInOut", new String[] {info.name}); macros.apply(file, "DepthFirstAdapterCaseHeader", new String[] {info.name}); for(Iterator j = info.elems.iterator(); j.hasNext();) { ElemInfo eInfo = (ElemInfo) j.next(); switch(eInfo.operator) { case ElemInfo.QMARK: case ElemInfo.NONE: { macros.apply(file, "DepthFirstAdapterCaseBodyNode", new String[] {eInfo.name}); } break; case ElemInfo.STAR: case ElemInfo.PLUS: { macros.apply(file, "DepthFirstAdapterCaseBodyList", new String[] {eInfo.name, eInfo.type}); } break; } } macros.apply(file, "DepthFirstAdapterCaseTail", new String[] {info.name}); } macros.apply(file, "DepthFirstAdapterTail", null); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "DepthFirstAdapter.java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } public void createReversedDepthFirstAdapter() { BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, "ReversedDepthFirstAdapter.java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, "ReversedDepthFirstAdapter.java").getAbsolutePath()); } try { macros.apply(file, "ReversedDepthFirstAdapterHeader", new String[] {pkgName, ast_ids.astIds.pkgName.equals("") ? "node" : ast_ids.astIds.pkgName + ".node", mainProduction}); for(Iterator i = altList.iterator(); i.hasNext();) { AltInfo info = (AltInfo) i.next(); macros.apply(file, "DepthFirstAdapterInOut", new String[] {info.name}); macros.apply(file, "DepthFirstAdapterCaseHeader", new String[] {info.name}); for(ListIterator j = info.elems.listIterator(info.elems.size()); j.hasPrevious();) { ElemInfo eInfo = (ElemInfo) j.previous(); switch(eInfo.operator) { case ElemInfo.QMARK: case ElemInfo.NONE: { macros.apply(file, "DepthFirstAdapterCaseBodyNode", new String[] {eInfo.name}); } break; case ElemInfo.STAR: case ElemInfo.PLUS: { macros.apply(file, "ReversedDepthFirstAdapterCaseBodyList", new String[] {eInfo.name, eInfo.type}); } break; } } macros.apply(file, "DepthFirstAdapterCaseTail", new String[] {info.name}); } macros.apply(file, "DepthFirstAdapterTail", null); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "ReversedDepthFirstAdapter.java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } private static class ElemInfo { final static int NONE = 0; final static int STAR = 1; final static int QMARK = 2; final static int PLUS = 3; String name; String type; int operator; } private static class ElemInfoCast implements Cast { final static ElemInfoCast instance = new ElemInfoCast(); private ElemInfoCast() {} @Override public Object cast(Object o) { return (ElemInfo) o; } } private static class AltInfo { String name; final List elems = new TypedLinkedList(ElemInfoCast.instance); } private static class AltInfoCast implements Cast { final static AltInfoCast instance = new AltInfoCast(); private AltInfoCast() {} @Override public Object cast(Object o) { return (AltInfo) o; } } } sablecc-3.7/src/org/sablecc/sablecc/GenLexer.java000066400000000000000000000254001265440641200217060ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.io.*; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; @SuppressWarnings({"rawtypes","unchecked"}) public class GenLexer extends AnalysisAdapter { private MacroExpander macros; private ResolveIds ids; private File pkgDir; private String pkgName; private AcceptStates[] acceptStatesArray; private Transitions transitions; public GenLexer(ResolveIds ids) { this.ids = ids; try { macros = new MacroExpander( new InputStreamReader( getClass().getResourceAsStream("lexer.txt"))); } catch(IOException e) { throw new RuntimeException("unable to open lexer.txt."); } pkgDir = new File(ids.pkgDir, "lexer"); pkgName = ids.pkgName.equals("") ? "lexer" : ids.pkgName + ".lexer"; if(!pkgDir.exists()) { if(!pkgDir.mkdir()) { throw new RuntimeException("Unable to create " + pkgDir.getAbsolutePath()); } } } @Override public void caseStart(Start tree) { String[] names; int numStates = Math.max(1, ids.stateList.size()); acceptStatesArray = new AcceptStates[numStates]; names = new String[numStates]; if(ids.stateList.size() == 0) { names[0] = "INITIAL"; } else { Iterator iter = ids.stateList.iterator(); for(int i = 0; i < numStates; i++) { names[i] = (String) iter.next(); } } for(int i = 0; i < numStates; i++) { System.out.println(" State: " + names[i]); System.out.println(" - Constructing NFA."); ConstructNFA nfaConstructor = new ConstructNFA(ids, names[i]); tree.apply(nfaConstructor); System.out.println(); NFA nfa = (NFA) nfaConstructor.getOut(tree); nfaConstructor = null; System.out.println(" - Constructing DFA."); DFA dfa = new DFA(nfa); System.out.println(); System.out.println(" - resolving ACCEPT states."); acceptStatesArray[i] = new AcceptStates(dfa, ids, names[i]); tree.apply(acceptStatesArray[i]); } transitions = new Transitions(); tree.apply(transitions); createLexerException(); createIPushbackReader(); createLexer(); } private void createLexerException() { BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, "LexerException.java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, "LexerException.java").getAbsolutePath()); } try { macros.apply(file, "LexerException", new String[] {pkgName, ids.pkgName.equals("") ? "node" : ids.pkgName + ".node"}); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "LexerException.java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } private void createIPushbackReader() { BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, "IPushbackReader.java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, "IPushbackReader.java").getAbsolutePath()); } try { macros.apply(file, "IPushbackReader", new String[] {pkgName}); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "IPushbackReader.java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } private void createLexer() { BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, "Lexer.java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, "Lexer.java").getAbsolutePath()); } try { String startState = "INITIAL"; if(ids.stateList.size() > 0) { startState = (String) ids.stateList.getFirst(); } macros.apply(file, "LexerHeader", new String[] {pkgName, ids.pkgName.equals("") ? "node" : ids.pkgName + ".node", startState}); for(ListIterator i = ids.tokenList.listIterator(); i.hasNext();) { String name = (String) i.next(); Node node = (Node) ids.tokens.get(name); boolean fixed = ((Boolean) ids.fixedTokens.get(node)) .booleanValue(); if(fixed) { macros.apply(file, "LexerFixedToken", new String[] {"" + i.previousIndex(), name}); } else { macros.apply(file, "LexerVariableToken", new String[] {"" + i.previousIndex(), name}); } Map map = (Map) transitions.tokenStates.get(node); if(map.size() > 0) { macros.apply(file, "TokenSwitchHeader", null); for(Iterator j = map.entrySet().iterator(); j.hasNext();) { Map.Entry entry = (Map.Entry) j.next(); macros.apply(file, "TokenCase", new String[] {ids.stateList.indexOf((String) entry.getKey()) + "", (String) entry.getValue()}); } macros.apply(file, "TokenSwitchTail", null); } macros.apply(file, "LexerTokenTail", null); } macros.apply(file, "LexerBody1"); for(ListIterator i = ids.tokenList.listIterator(); i.hasNext();) { String name = (String) i.next(); Node node = (Node) ids.tokens.get(name); boolean fixed = ((Boolean) ids.fixedTokens.get(node)) .booleanValue(); if(fixed) { macros.apply(file, "LexerNewFixedToken", new String[] {"" + i.previousIndex(), name}); } else { macros.apply(file, "LexerNewVariableToken", new String[] {"" + i.previousIndex(), name}); } } macros.apply(file, "LexerBody2"); DataOutputStream out = new DataOutputStream( new BufferedOutputStream( new FileOutputStream( new File(pkgDir, "lexer.dat")))); out.writeInt(acceptStatesArray.length); for(int accSt = 0; accSt < acceptStatesArray.length; accSt++) { DFA dfa = acceptStatesArray[accSt].dfa; file.write(" { // " + acceptStatesArray[accSt].stateName + System.getProperty("line.separator")); Vector outerArray = new Vector(); for(int i = 0; i < dfa.states.size(); i++) { Vector innerArray = new Vector(); DFA.State state = (DFA.State) dfa.states.elementAt(i); file.write(" {"); for(int j = 0; j < state.transitions.size(); j++) { DFA.Transition transition = (DFA.Transition) state.transitions.elementAt(j); file.write("{" + ((int) transition.interval().start) + ", " + ((int) transition.interval().end) + ", " + transition.destination + "}, "); innerArray.addElement(new int[] { ((int) transition.interval().start), ((int) transition.interval().end), transition.destination}); } file.write("}," + System.getProperty("line.separator")); outerArray.addElement(innerArray); } file.write(" }" + System.getProperty("line.separator")); out.writeInt(outerArray.size()); for(Enumeration e = outerArray.elements(); e.hasMoreElements();) { Vector innerArray = (Vector) e.nextElement(); out.writeInt(innerArray.size()); for(Enumeration n = innerArray.elements(); n.hasMoreElements();) { int[] array = (int[]) n.nextElement(); for(int i = 0; i < 3; i++) { out.writeInt(array[i]); } } } } macros.apply(file, "LexerAcceptHeader"); final int stateNumber = acceptStatesArray.length; Vector outerArray = new Vector(); for(int i = 0; i < stateNumber; i++) { DFA dfa = acceptStatesArray[i].dfa; Vector innerArray = new Vector(); file.write(" // " + acceptStatesArray[i].stateName + System.getProperty("line.separator")); file.write(" {"); for(int j = 0; j < dfa.states.size(); j++) { DFA.State state = (DFA.State) dfa.states.elementAt(j); file.write(state.accept + ", "); innerArray.addElement(new Integer(state.accept)); } file.write("}," + System.getProperty("line.separator")); outerArray.addElement(innerArray); } out.writeInt(outerArray.size()); for(Enumeration e = outerArray.elements(); e.hasMoreElements();) { Vector innerArray = (Vector) e.nextElement(); out.writeInt(innerArray.size()); for(Enumeration n = innerArray.elements(); n.hasMoreElements();) { Integer i = (Integer) n.nextElement(); out.writeInt(i.intValue()); } } out.close(); file.write(System.getProperty("line.separator")); macros.apply(file, "LexerAcceptTail"); macros.apply(file, "LexerStateHeader"); if(ids.stateList.size() > 0) { for(ListIterator i = ids.stateList.listIterator(); i.hasNext();) { String s = (String) i.next(); macros.apply(file, "LexerStateBody", new String[] {s, "" + i.previousIndex()}); } } else { macros.apply(file, "LexerStateBody", new String[] {"INITIAL", "" + 0}); } macros.apply(file, "LexerStateTail"); macros.apply(file, "LexerTail"); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "Lexer.java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } } sablecc-3.7/src/org/sablecc/sablecc/GenParser.java000066400000000000000000000670071265440641200220740ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.io.*; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; /* * GenParser * * This class is the responsible of generation of the parser. * It calls another classes which will do internal transformations * to the grammar in order to made it support by BNF parser generator * algorithm whereas SableCC3.x.x grammars can be written with some * operators of the EBNF form. * It can also call an appropriate Tree-Walker which in case of conflict * will try to inline productions involved in the conflict with the aim of * resolving it. */ @SuppressWarnings({"rawtypes","unchecked"}) public class GenParser extends DepthFirstAdapter { //This is the tree-walker field which made internal transformations("EBNF"->BNF) to the grammar InternalTransformationsToGrammar bnf_and_CST_AST_Transformations; //tree-walker field which construct data structures for generating of parsing tables. ConstructParserGenerationDatas genParserAdapter; private MacroExpander macros; private ResolveIds ids; private ResolveAltIds altIds; private ResolveTransformIds transformIds; // This class reference variable fills the map "altsElemTypes" from class AlternativeElementTypes. It associates // the name of elements with its types private AlternativeElementTypes AET; //This computes variables declarations position and type for parser generation. //In fact it helps to determine how many elements are needed to pop from the stack private ComputeCGNomenclature CG; //This helps to compute alternative transformations code generation. private ComputeSimpleTermPosition CTP; private File pkgDir; private String pkgName; private boolean hasProductions; private String firstProductionName; private boolean processInlining; private boolean prettyPrinting; private boolean grammarHasTransformations; // This boolean is used to check weither the filter() method in class Parser.java // should be present or not. private boolean activateFilter = true; //This tree-walker field generate the code of parsing and construction of the AST. GenerateAlternativeCodeForParser aParsedAltAdapter; private LinkedList listSimpleTermTransform = new LinkedList(); public final Map simpleTermTransform = new TypedHashMap(NodeCast.instance, StringCast.instance); //This map contains Productions which were explicitely transformed in the grammar //Those transformations was specified by the grammar-writer. private final Map mapProductionTransformations = new TypedHashMap(StringCast.instance, ListCast.instance); private Map alts; public GenParser(ResolveIds ids, ResolveAltIds altIds, ResolveTransformIds transformIds, String firstProductionName, boolean processInlining, boolean prettyPrinting, boolean grammarHasTransformations) { this.ids = ids; this.altIds = altIds; this.transformIds = transformIds; this.processInlining = processInlining; this.prettyPrinting = prettyPrinting; this.grammarHasTransformations = grammarHasTransformations; AET = new AlternativeElementTypes(ids); CG = new ComputeCGNomenclature(ids, transformIds.getProdTransformIds()); CTP = new ComputeSimpleTermPosition(ids); this.firstProductionName = firstProductionName; try { macros = new MacroExpander( new InputStreamReader( getClass().getResourceAsStream("parser.txt"))); } catch(IOException e) { throw new RuntimeException("unable to open parser.txt."); } pkgDir = new File(ids.pkgDir, "parser"); pkgName = ids.pkgName.equals("") ? "parser" : ids.pkgName + ".parser"; if(!pkgDir.exists()) { if(!pkgDir.mkdir()) { throw new RuntimeException("Unable to create " + pkgDir.getAbsolutePath()); } } } @Override public void caseStart(Start tree) { tree.getPGrammar().apply(new DepthFirstAdapter() { @Override public void caseAProd(AProd node) { hasProductions = true; if(node.getProdTransform() != null) { mapProductionTransformations.put("P"+ResolveIds.name(node.getId().getText()), node.getProdTransform().clone() ); } } } ); if(!hasProductions) { return; } //Performing internal transformations bnf_and_CST_AST_Transformations = new InternalTransformationsToGrammar(ids, altIds, transformIds, listSimpleTermTransform, simpleTermTransform, mapProductionTransformations, transformIds.simpleTermOrsimpleListTermTypes); //apply internal transformations to the grammar. tree.getPGrammar().apply(bnf_and_CST_AST_Transformations); if(prettyPrinting) { tree.apply(new PrettyPrinter()); return; } ConstructProdsMap mapOfProds = new ConstructProdsMap(); tree.apply(mapOfProds); boolean computeLALR = false; //This do-while loop is managing the inlining process. do { //Initialization of parsing tables and some symbol tables //names and elemTypes from ResolveIds. reinit(); reConstructSymbolTables(tree); tree.apply(new DepthFirstAdapter() { private boolean hasAlternative; @Override public void caseATokenDef(ATokenDef node) { String name = (String) ids.names.get(node); String errorName = (String) ids.errorNames.get(node); if(!ids.ignTokens.containsKey(name)) { Grammar.addTerminal(name, errorName); } } @Override public void inAProd(AProd node) { hasAlternative = false; } @Override public void inAAlt(AAlt node) { hasAlternative = true; } @Override public void outAProd(AProd node) { if(hasAlternative) { Grammar.addNonterminal((String) ids.names.get(node)); } } } ); //Construct all necessary informations for generation of the parser. //This map contains all the alternatives of the transformed final grammar alts = new TypedHashMap(StringCast.instance, NodeCast.instance); tree.getPGrammar().apply(new ConstructParserGenerationDatas(ids, alts)); try { //Generation of parsing symbol tables Grammar.computeLALR(); computeLALR = true; } catch(ConflictException ce) { if(activateFilter) { activateFilter = false; } //Here, we are trying to inline the grammar with production imply in the conflict. if(processInlining) { ComputeInlining grammarToBeInlinedWithConflictualProductions = new ComputeInlining(ce.getConflictualProductions(), mapOfProds.productionsMap, tree); if(!grammarToBeInlinedWithConflictualProductions.computeInlining()) { System.out.println("\nA previous conflict that we've tried to solve by inline some productions inside the grammars cannot be solved that way. The transformed grammar is : "); tree.apply(new PrettyPrinter()); throw new RuntimeException(ce.getMessage()); } System.out.println(); System.out.println("Inlining."); } else { throw new RuntimeException(ce.getMessage()); } } } while(!computeLALR); tree.getPGrammar().apply(AET); CG.setAltElemTypes(AET.getMapOfAltElemType()); tree.getPGrammar().apply(CG); tree.getPGrammar().apply(CTP); createParser(); createParserException(); createState(); createTokenIndex(); } public void reinit() { // re-initialize all static structures in the engine LR0Collection.reinit(); Symbol.reinit(); Production.reinit(); Grammar.reinit(); ids.reinit(); } private String currentProd; private String currentAlt; //reconstruction of map names of class ResolveIds public void reConstructSymbolTables(Start tree) { tree.apply(new DepthFirstAdapter() { @Override public void caseAProd(AProd node) { currentProd = ResolveIds.name(node.getId().getText()); String name = "P" + currentProd; ids.names.put(node, name); //list of inAAlt code. Object []list_alt = (Object [])node.getAlts().toArray(); for(int i = 0; i< list_alt.length; i++) { ((PAlt)list_alt[i]).apply(this); } } @Override public void outAHelperDef(AHelperDef node) { String name = node.getId().getText(); ids.names.put(node, name); } @Override public void outATokenDef(ATokenDef node) { String name = "T" + ResolveIds.name(node.getId().getText()); ids.names.put(node, name); } @Override public void caseAAlt(final AAlt alt) { if(alt.getAltName() != null) { currentAlt = "A" + ResolveIds.name(alt.getAltName().getText()) + currentProd; ids.names.put(alt, currentAlt); } else { currentAlt = "A" + currentProd; ids.names.put(alt, currentAlt); } AElem list_elem[] = (AElem[]) alt.getElems().toArray(new AElem[0]); for(int i=0; i frequence) { frequence = freq; mostFrequentAction = "REDUCE"; mostFrequentDestination = Grammar.action_[i][j][1]; } } } } table.append("\t\t\t{"); table.append("{" + -1 + ", " + mostFrequentAction + ", " + mostFrequentDestination + "}, "); innerArray.addElement( new int[] {-1, mostFrequentAction.equals("ERROR") ? 3 : 1, mostFrequentDestination}); for(int j = 0; j < Grammar.action_[i].length; j++) { if(Grammar.action_[i][j] != null) { switch(Grammar.action_[i][j][0]) { case 0: table.append("{" + j + ", SHIFT, " + Grammar.action_[i][j][1] + "}, "); innerArray.addElement(new int[] {j, 0, Grammar.action_[i][j][1]}); break; case 1: if(Grammar.action_[i][j][1] != mostFrequentDestination) { table.append("{" + j + ", REDUCE, " + Grammar.action_[i][j][1] + "}, "); innerArray.addElement(new int[] {j, 1, Grammar.action_[i][j][1]}); } break; case 2: table.append("{" + j + ", ACCEPT, -1}, "); innerArray.addElement(new int[] {j, 2, -1}); break; } } } table.append("}," + System.getProperty("line.separator")); outerArray.addElement(innerArray); } file.write("" + table); out.writeInt(outerArray.size()); for(Enumeration e = outerArray.elements(); e.hasMoreElements();) { Vector innerArray = (Vector) e.nextElement(); out.writeInt(innerArray.size()); for(Enumeration n = innerArray.elements(); n.hasMoreElements();) { int[] array = (int[]) n.nextElement(); for(int i = 0; i < 3; i++) { out.writeInt(array[i]); } } } macros.apply(file, "ParserActionTail"); macros.apply(file, "ParserGotoHeader"); table = new StringBuffer(); outerArray = new Vector(); for(int j = 0; j < nonterminals.length - 1; j++) { Vector innerArray = new Vector(); int mostFrequent = -1; int frequence = 0; Map map = new TreeMap(IntegerComparator.instance); for(int i = 0; i < Grammar.goto_.length; i++) { if(Grammar.goto_[i][j] != -1) { Integer index = new Integer(Grammar.goto_[i][j]); Integer count = (Integer) map.get(index); int freq = count == null ? 0 : count.intValue(); map.put(index, new Integer(++freq)); if(freq > frequence) { frequence = freq; mostFrequent = Grammar.goto_[i][j]; } } } table.append("\t\t\t{"); table.append("{" + (-1) + ", " + mostFrequent + "}, "); innerArray.addElement(new int[] {-1, mostFrequent}); for(int i = 0; i < Grammar.goto_.length; i++) { if((Grammar.goto_[i][j] != -1) && (Grammar.goto_[i][j] != mostFrequent)) { table.append("{" + i + ", " + Grammar.goto_[i][j] + "}, "); innerArray.addElement(new int[] {i, Grammar.goto_[i][j]}); } } table.append("}," + System.getProperty("line.separator")); outerArray.addElement(innerArray); } file.write("" + table); out.writeInt(outerArray.size()); for(Enumeration e = outerArray.elements(); e.hasMoreElements();) { Vector innerArray = (Vector) e.nextElement(); out.writeInt(innerArray.size()); for(Enumeration n = innerArray.elements(); n.hasMoreElements();) { int[] array = (int[]) n.nextElement(); for(int i = 0; i < 2; i++) { out.writeInt(array[i]); } } } macros.apply(file, "ParserGotoTail"); macros.apply(file, "ParserErrorsHeader"); table = new StringBuffer(); StringBuffer index = new StringBuffer(); int nextIndex = 0; Map errorIndex = new TypedTreeMap( StringComparator.instance, StringCast.instance, IntegerCast.instance); outerArray = new Vector(); Vector indexArray = new Vector(); index.append("\t\t\t"); for(int i = 0; i < Grammar.action_.length; i++) { StringBuffer s = new StringBuffer(); s.append("expecting: "); boolean comma = false; for(int j = 0; j < Grammar.action_[i].length; j++) { if(Grammar.action_[i][j] != null) { if(comma) { s.append(", "); } else { comma = true; } s.append(Symbol.symbol(j, true).errorName); } } if(errorIndex.containsKey(s.toString())) { index.append(errorIndex.get(s.toString()) + ", "); indexArray.addElement(errorIndex.get(s.toString())); } else { table.append("\t\t\t\"" + s + "\"," + System.getProperty("line.separator")); outerArray.addElement(s.toString()); errorIndex.put(s.toString(), new Integer(nextIndex)); indexArray.addElement(new Integer(nextIndex)); index.append(nextIndex++ + ", "); } } file.write("" + table); out.writeInt(outerArray.size()); for(Enumeration e = outerArray.elements(); e.hasMoreElements();) { String s = (String) e.nextElement(); out.writeInt(s.length()); int length = s.length(); for(int i = 0; i < length; i++) { out.writeChar(s.charAt(i)); } } out.writeInt(indexArray.size()); for(Enumeration e = indexArray.elements(); e.hasMoreElements();) { Integer n = (Integer) e.nextElement(); out.writeInt(n.intValue()); } out.close(); macros.apply(file, "ParserErrorsTail"); macros.apply(file, "ParserErrorIndexHeader"); file.write("" + index); macros.apply(file, "ParserErrorIndexTail"); macros.apply(file, "ParserTail"); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "Parser.java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } private void createTokenIndex() { BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, "TokenIndex.java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, "TokenIndex.java").getAbsolutePath()); } try { Symbol[] terminals = Symbol.terminals(); macros.apply(file, "TokenIndexHeader", new String[] {pkgName, ids.pkgName.equals("") ? "node" : ids.pkgName + ".node", ids.pkgName.equals("") ? "analysis" : ids.pkgName + ".analysis"}); for(int i = 0; i < (terminals.length - 2); i++) { macros.apply(file, "TokenIndexBody", new String[] {terminals[i].name, "" + i}); } macros.apply(file, "TokenIndexTail", new String[] {"" + (terminals.length - 2)}); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "TokenIndex.java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } private void createParserException() { BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, "ParserException.java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, "ParserException.java").getAbsolutePath()); } try { macros.apply(file, "ParserException", new String[] {pkgName, ids.pkgName.equals("") ? "node" : ids.pkgName + ".node"}); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "ParserException.java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } private void createState() { BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, "State.java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, "State.java").getAbsolutePath()); } try { macros.apply(file, "State", new String[] {pkgName}); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "State.java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } /* private int count(String name) { if(name.charAt(0) != 'X') { return 0; } StringBuffer s = new StringBuffer(); int i = 1; while((i < name.length()) && (name.charAt(i) >= '0') && (name.charAt(i) <= '9')) { s.append(name.charAt(i++)); } return Integer.parseInt(s.toString()); } */ /* private String name(String name) { if(name.charAt(0) != 'X') { return name; } int i = 1; while((i < name.length()) && (name.charAt(i) >= '0') && (name.charAt(i) <= '9')) { i++; } return name.substring(i); } */ static class Element { String macro; String[] arguments; Element(String macro, String[] arguments) { this.macro = macro; this.arguments = arguments; } } } sablecc-3.7/src/org/sablecc/sablecc/GenProds.java000066400000000000000000000061351265440641200217220ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.io.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; @SuppressWarnings("rawtypes") public class GenProds extends DepthFirstAdapter { private MacroExpander macros; private ResolveAstIds ast_ids; private File pkgDir; private String pkgName; // private Map hiddenProds = new TypedTreeMap( // StringComparator.instance, // StringCast.instance, // NodeCast.instance); public GenProds(ResolveAstIds ast_ids) { this.ast_ids = ast_ids; try { macros = new MacroExpander( new InputStreamReader( getClass().getResourceAsStream("productions.txt"))); } catch(IOException e) { throw new RuntimeException("unable to open productions.txt."); } pkgDir = new File(ast_ids.astIds.pkgDir, "node"); pkgName = ast_ids.astIds.pkgName.equals("") ? "node" : ast_ids.astIds.pkgName + ".node"; if(!pkgDir.exists()) { if(!pkgDir.mkdir()) { throw new RuntimeException("Unable to create " + pkgDir.getAbsolutePath()); } } } @Override public void inAAstProd(AAstProd node) { String name = (String) ast_ids.ast_names.get(node); createProduction(name); } private void createProduction(String name) { BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, name + ".java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, name + ".java").getAbsolutePath()); } try { macros.apply(file, "Production", new String[] {pkgName, name}); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, name + ".java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } /* private void createAlternative(String name, String macro, String[] arg) { BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, name + ".java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, name + ".java").getAbsolutePath()); } try { macros.apply(file, macro, arg); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, name + ".java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } */ } sablecc-3.7/src/org/sablecc/sablecc/GenTokens.java000066400000000000000000000111121265440641200220650ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.io.*; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; @SuppressWarnings({"rawtypes","unchecked"}) public class GenTokens extends DepthFirstAdapter { private MacroExpander macros; private ResolveIds ids; private File pkgDir; private String pkgName; // final GenTokens instance = this; String text; public GenTokens(ResolveIds ids) { this.ids = ids; try { macros = new MacroExpander( new InputStreamReader( getClass().getResourceAsStream("tokens.txt"))); } catch(IOException e) { throw new RuntimeException("unable to open tokens.txt."); } pkgDir = new File(ids.pkgDir, "node"); pkgName = ids.pkgName.equals("") ? "node" : ids.pkgName + ".node"; if(!pkgDir.exists()) { if(!pkgDir.mkdir()) { throw new RuntimeException("Unable to create " + pkgDir.getAbsolutePath()); } } } @Override public void inATokenDef(ATokenDef node) { String name = (String) ids.names.get(node); BufferedWriter file; try { file = new BufferedWriter( new FileWriter( new File(pkgDir, name + ".java"))); } catch(IOException e) { throw new RuntimeException("Unable to create " + new File(pkgDir, name + ".java").getAbsolutePath()); } text = null; ARegExp regExp = (ARegExp) node.getRegExp(); LinkedList concats = regExp.getConcats(); if(concats.size() == 1) { AConcat concat = (AConcat)concats.getFirst(); LinkedList unExps = concat.getUnExps(); if(unExps.size() == 1) { AUnExp unExp = (AUnExp) unExps.getFirst(); PBasic basic = unExp.getBasic(); if((basic instanceof AStringBasic) && (unExp.getUnOp() == null)) { text = ((AStringBasic) basic).getString().getText(); text = text.substring(1, text.length() - 1); } else if((basic instanceof ACharBasic) && (unExp.getUnOp() == null)) { PChar pChar = ((ACharBasic) basic).getChar(); if(pChar instanceof ACharChar) { text = ((ACharChar) pChar).getChar().getText(); text = text.substring(1, text.length() - 1); } } } } try { if(text == null) { ids.fixedTokens.put(node, new Boolean(false)); macros.apply(file, "VariableTextToken", new String[] { pkgName, ids.pkgName.equals("") ? "analysis" : ids.pkgName + ".analysis", name}); } else { ids.fixedTokens.put(node, new Boolean(true)); macros.apply(file, "FixedTextToken", new String[] { pkgName, ids.pkgName.equals("") ? "analysis" : ids.pkgName + ".analysis", name, processText(text)}); ids.errorNames.put(node, "'" + text + "'"); } } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, name + ".java").getAbsolutePath()); } try { file.close(); } catch(IOException e) {} } private String processText(String s) { StringBuffer result = new StringBuffer(); for(int i = 0; i < s.length(); i++) { char c = s.charAt(i); switch(c) { case '\b': { result.append("\\t"); break; } case '\t': { result.append("\\t"); break; } case '\n': { result.append("\\n"); break; } case '\f': { result.append("\\f"); break; } case '\r': { result.append("\\r"); break; } case '\"': { result.append("\\\""); break; } case '\'': { result.append("\\\'"); break; } case '\\': { result.append("\\\\"); break; } default: { result.append(c); } } } return result.toString(); } } sablecc-3.7/src/org/sablecc/sablecc/GenUtils.java000066400000000000000000000150111265440641200217240ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.io.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; public class GenUtils extends DepthFirstAdapter { private MacroExpander macros; private ResolveAstIds ast_ids; private File pkgDir; private String pkgName; private String mainProduction; public GenUtils(ResolveAstIds ast_ids) { this.ast_ids = ast_ids; try { macros = new MacroExpander( new InputStreamReader( getClass().getResourceAsStream("utils.txt"))); } catch(IOException e) { throw new RuntimeException("unable to open utils.txt."); } pkgDir = new File(ast_ids.astIds.pkgDir, "node"); pkgName = ast_ids.astIds.pkgName.equals("") ? "node" : ast_ids.astIds.pkgName + ".node"; if(!pkgDir.exists()) { if(!pkgDir.mkdir()) { throw new RuntimeException("Unable to create " + pkgDir.getAbsolutePath()); } } } /* public void caseAGrammar(AGrammar node) { AAstProd []temp = (AAstProd[])node.getAst().toArray(new AAstProd[0]); for(int i=0; i= 0 ) { positionMap = list.indexOf( node.getSimpleTermTail().getText() ); } } if(simpleTermOrsimpleListTermTypes.get(node) != null) { String type = (String)simpleTermOrsimpleListTermTypes.get(node); LinkedList list = (LinkedList)transformIds.getProdTransformIds().prod_transforms.get(type); if( list.indexOf( node.getSimpleTermTail().getText() ) >= 0 ) { positionMap = list.indexOf( node.getSimpleTermTail().getText() ); } } } String type; if(type_name.startsWith("L")) { type_name = "list"; type = "LinkedList"; } else if(type_name.equals("null")) { type_name = "null"; type = "Object"; } else { type = type_name; } macros.apply(file, "ParserSimpleTerm", new String[] { type_name.toLowerCase(), ""+position, type, ""+elemPosition, ""+positionMap } ); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "Parser.java").getAbsolutePath()); } } @Override public void inASimpleListTerm(ASimpleListTerm node) { try { String type_name; if(simpleTermTransformMap.get(node) != null) { type_name = (String)simpleTermTransformMap.get(node); } else { type_name = (String)CG.getAltTransformElemTypes().get(node); } String termKey = currentAlt+"."+node.getId().getText(); int position = ((Integer)CG.getTermNumbers().get(node)).intValue(); int elemPosition = ((Integer)CTP.elems_position.get(termKey)).intValue(); int positionMap = 0; if(node.getSimpleTermTail() != null ) { if( !listSimpleTermTransform.contains(node.getId().getText()) ) { String type = (String)CTP.positionsMap.get( realcurrentAlt+"."+node.getId().getText() ); LinkedList list = (LinkedList)transformIds.getProdTransformIds().prod_transforms.get(type); if( list.indexOf( node.getSimpleTermTail().getText() ) >= 0 ) { positionMap = list.indexOf( node.getSimpleTermTail().getText() ); } } if(simpleTermOrsimpleListTermTypes.get(node) != null) { String type = (String)simpleTermOrsimpleListTermTypes.get(node); LinkedList list = (LinkedList)transformIds.getProdTransformIds().prod_transforms.get(type); if( list.indexOf( node.getSimpleTermTail().getText() ) >= 0 ) { positionMap = list.indexOf( node.getSimpleTermTail().getText() ); } } } String type; if(type_name.startsWith("L")) { type_name = "list"; type = "LinkedList"; } else if(type_name.equals("null")) { type_name = "null"; type = "Object"; } else { type = type_name; } macros.apply(file, "ParserSimpleTerm", new String[] { type_name.toLowerCase(), ""+position, type, ""+elemPosition, ""+positionMap } ); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "Parser.java").getAbsolutePath()); } } @Override public void inANewTerm(ANewTerm node) { try { macros.apply(file, "ParserBraceOpening"); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "Parser.java").getAbsolutePath()); } inAParams(node.getParams()); } @Override public void inANewListTerm(ANewListTerm node) { try { macros.apply(file, "ParserBraceOpening"); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "Parser.java").getAbsolutePath()); } inAParams(node.getParams()); } @Override public void inAListTerm(AListTerm node) { try { macros.apply(file, "ParserBraceOpening"); Object temp[] = node.getListTerms().toArray(); for(int i = 0; i < temp.length; i++) { String type_name; if(simpleTermTransformMap.get(temp[i]) != null) { type_name = (String)simpleTermTransformMap.get(temp[i]); } else { type_name = (String)CG.getAltTransformElemTypes().get(temp[i]); } int position = ((Integer)CG.getTermNumbers().get(temp[i])).intValue(); if(type_name.startsWith("L")) { macros.apply(file, "ParserListVariableDeclaration", new String[] {"" + position}); } else if(type_name.equals("null")) { macros.apply(file, "ParserNullVariableDeclaration", new String[] {"" + position}); } else { macros.apply(file, "ParserSimpleVariableDeclaration", new String[] {type_name, type_name.toLowerCase(), "" + position}); } } } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "Parser.java").getAbsolutePath()); } } @Override public void outAListTerm(AListTerm node) { try { Object temp[] = node.getListTerms().toArray(); int listPosition = ((Integer)CG.getTermNumbers().get(node)).intValue(); for(int i = 0; i < temp.length; i++) { String type_name; if(simpleTermTransformMap.get(temp[i]) != null) { type_name = (String)simpleTermTransformMap.get(temp[i]); } else { type_name = (String)CG.getAltTransformElemTypes().get(temp[i]); } int position = ((Integer)CG.getTermNumbers().get(temp[i])).intValue(); if(!type_name.equals("null")) { if(type_name.startsWith("L")) { macros.apply(file, "ParserTypedLinkedListAddAll", new String[] {"list", ""+listPosition, "list", ""+ position}); } else { macros.apply(file, "ParserTypedLinkedListAdd", new String[] {"list", ""+listPosition, type_name.toLowerCase(), ""+ position}); } } } macros.apply(file, "ParserBraceClosing"); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "Parser.java").getAbsolutePath()); } } @Override public void outANewTerm(ANewTerm node) { String type_name = (String)CG.getAltTransformElemTypes().get(node); if(simpleTermTransformMap.get(node) != null) { type_name = (String)simpleTermTransformMap.get(node); } else { type_name = (String)CG.getAltTransformElemTypes().get(node); } int position = ((Integer)CG.getTermNumbers().get(node)).intValue(); String newAltName = name((AProdName)node.getProdName()); try { if(type_name.startsWith("L")) { type_name = "list"; } else { type_name = type_name.toLowerCase(); } macros.apply(file, "ParserNewBodyNew", new String[] {type_name, ""+position, newAltName}); if(node.getParams().size() > 0) { Object temp[] = node.getParams().toArray(); String isNotTheFirstParam = ""; for(int i = 0; i < temp.length; i++) { if(simpleTermTransformMap.get(temp[i]) != null) { type_name = (String)simpleTermTransformMap.get(temp[i]); } else { type_name = (String)CG.getAltTransformElemTypes().get(temp[i]); } position = ((Integer)CG.getTermNumbers().get(temp[i])).intValue(); if(i != 0) { isNotTheFirstParam = ", "; } if(type_name.equals("null")) { macros.apply(file, "ParserNew&ListBodyParamsNull", new String[] {isNotTheFirstParam+"null"}); } else { if(type_name.startsWith("L")) { type_name = "list"; } else { type_name = type_name.toLowerCase(); } macros.apply(file, "ParserNew&ListBodyParams", new String[] {isNotTheFirstParam+type_name, ""+position}); } } } macros.apply(file, "ParserNewBodyNewTail"); macros.apply(file, "ParserBraceClosing"); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "TokenIndex.java").getAbsolutePath()); } } @Override public void outANewListTerm(ANewListTerm node) { String type_name; if(simpleTermTransformMap.get(node) != null) { type_name = (String)simpleTermTransformMap.get(node); } else { type_name = (String)CG.getAltTransformElemTypes().get(node); } int position = ((Integer)CG.getTermNumbers().get(node)).intValue(); String newAltName = name((AProdName)node.getProdName()); try { if(type_name.startsWith("L")) { type_name = "list"; } else { type_name = type_name.toLowerCase(); } macros.apply(file, "ParserNewBodyNew", new String[] {type_name, ""+position, newAltName}); if(node.getParams().size() > 0) { Object temp[] = node.getParams().toArray(); String isNotTheFirstParam = ""; for(int i = 0; i < temp.length; i++) { if(simpleTermTransformMap.get(temp[i]) != null) { type_name = (String)simpleTermTransformMap.get(temp[i]); } else { type_name = (String)CG.getAltTransformElemTypes().get(temp[i]); } position = ((Integer)CG.getTermNumbers().get(temp[i])).intValue(); if(i != 0) { isNotTheFirstParam = ", "; } if(type_name.equals("null")) { macros.apply(file, "ParserNew&ListBodyParamsNull", new String[] {isNotTheFirstParam+"null"}); } else { if(type_name.startsWith("L")) { type_name = "list"; } else { type_name = type_name.toLowerCase(); } macros.apply(file, "ParserNew&ListBodyParams", new String[] {isNotTheFirstParam+type_name, ""+position}); } } } macros.apply(file, "ParserNewBodyNewTail"); macros.apply(file, "ParserBraceClosing"); } catch(IOException e) { throw new RuntimeException("An error occured while writing to " + new File(pkgDir, "TokenIndex.java").getAbsolutePath()); } } public String name(AProdName node) { if(node.getProdNameTail() != null) { return "A" + ResolveIds.name(node.getProdNameTail().getText()) + ResolveIds.name(node.getId().getText()); } return "A" + ResolveIds.name(node.getId().getText()); } } sablecc-3.7/src/org/sablecc/sablecc/Grammar.java000066400000000000000000000441761265440641200215760ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; @SuppressWarnings({"rawtypes","unchecked"}) public final class Grammar { private static TreeMap fastLr0Closure = new TreeMap(); private static TreeMap fastLr1Closure = new TreeMap(); static int startSymbol; static int startProduction; static int eof ; static int dummy ; static int[][][] action_; static int[][] goto_; static { reinit(); } private Grammar() {} public static int addTerminal(String name, String errorName) { return new Symbol(name, errorName, true).index; } public static int addNonterminal(String name) { return new Symbol(name, null, false).index; } public static int addProduction(String nonterminal, String name) { Symbol symbol = Symbol.symbol(nonterminal); if(symbol.terminal) { throw new IllegalArgumentException("The symbol " + nonterminal + " is a terminal."); } return new Production(symbol.index, name).index; } public static void addSymbolToProduction(String symbol, int production) { Production.production(production).addSymbol(Symbol.symbol(symbol)); } public static void reinit() { fastLr0Closure = new TreeMap(); fastLr1Closure = new TreeMap(); startSymbol = 0; startProduction = -1; eof = -1; dummy = -1; action_ = null; goto_ = null; } public static void computeLALR() throws ConflictException { // Add EOF to terminals eof = addTerminal("EOF", "EOF"); // Add dummy to terminals dummy = addTerminal("#", null); // Add the production S'->S startSymbol = addNonterminal("Start"); Production start = new Production(startSymbol, "Start"); start.addSymbol(Symbol.symbol(0, false)); startProduction = start.index; computeFirst(); LR0ItemSet set = new LR0ItemSet(); set.set(new LR0Item(startProduction, 0)); LR1Collection collection = new LR1Collection(set ); LR0ItemSet[] sets = collection.collection.sets(); Symbol[] terminals = Symbol.terminals(); Symbol[] nonterminals = Symbol.nonterminals(); action_ = new int[sets.length][terminals.length - 1][]; goto_ = new int[sets.length][nonterminals.length - 1]; Set listOfConflictualProds = new HashSet(); StringBuffer conflictMessage = new StringBuffer(); for(int i = 0; i < sets.length; i++) { System.out.print("."); LR1ItemSet state = new LR1ItemSet(); { LR0Item[] items = sets[i].items(); for(int j = 0; j < items.length; j++) { Symbol[] lookaheads = ((SymbolSet) collection.lookaheads[i]. get (items[j])).getSymbols(); for(int k = 0; k < lookaheads.length; k++) { state.set(new LR1Item(items[j], lookaheads[k].index)); } } } state = CLOSURE(state); LR1Item[] items = state.items(); for(int j = 0; j < terminals.length; j++) { Integer destination = collection.collection.GOTO(i, terminals[j]); if(destination != null) { //Shift action is taken action_[i][j] = new int[] {0, destination.intValue()}; } for(int k = 0; k < items.length; k++) { Production production = Production. production(items[k].lr0Item.production); //A conflict occurs only if one is on the end of an alternative try { production.rightside(items[k].lr0Item.position); } catch(Exception e) { if(production.leftside != startSymbol) { if(items[k].terminal == terminals[j].index) { int[] action = action_[i][j]; if(action != null) { /* The current alternative is conflictual (reduce in a XXX/reduce conflict) */ listOfConflictualProds.add(Symbol.symbol(production.leftside, false).toString()); /* */ switch(action[0]) { case 0: conflictMessage.append( "\n\nshift/reduce conflict in state [stack:" + collection.collection.names.elementAt(i) + "*] on " + terminals[j] + " in " + state.toString(terminals[j])); /* nothing else to do */ break; case 1: conflictMessage.append( "\n\nreduce/reduce conflict in state [stack:" + collection.collection.names.elementAt(i) + "*] on " + terminals[j] + " in " + state.toString(terminals[j])); listOfConflictualProds.add(Symbol.symbol(Production.production(action[1]).leftside, false).toString()); break; case 2: conflictMessage.append( "\n\nreduce/accept conflict in state [stack:" + collection.collection.names.elementAt(i) + "*] on " + terminals[j] + " in " + state.toString(terminals[j])); listOfConflictualProds.add(Symbol.symbol(Production.production(action[1]).leftside, false).toString()); break; } } else { //it's a reduction action action_[i][j] = new int[] {1, items[k].lr0Item.production}; } } } else { if(terminals[j].index == eof) { int[] action = action_[i][j]; if(action != null) { /* The current alternative is conflictual (accept in a XXX/accept conflict) */ listOfConflictualProds.add(Symbol.symbol(production.leftside, false).toString()); /* */ switch(action[0]) { case 0: conflictMessage.append( "shift/accept conflict in state [stack:" + collection.collection.names.elementAt(i) + "*] on " + terminals[j] + " in " + state); /* nothing else to do */ break; case 1: conflictMessage.append( "reduce/accept conflict in state [stack:" + collection.collection.names.elementAt(i) + "*] on " + terminals[j] + " in " + state); listOfConflictualProds.add(Symbol.symbol(Production.production(action[1]).leftside, false).toString()); break; } } else { //accept action is taken action_[i][j] = new int[] {2}; } } } }//End of catch } } if (listOfConflictualProds.size() > 0) { throw new ConflictException(listOfConflictualProds, conflictMessage.toString()); } for(int j = 0; j < nonterminals.length - 1; j++) { Integer destination = collection.collection.GOTO(i, nonterminals[j]); if(destination != null) { goto_[i][j] = destination.intValue(); } else { goto_[i][j] = -1; } } } System.out.println(); } static SymbolSet[] FIRST_Terminal; static SymbolSet[] FIRST_Nonterminal; static void computeFirst() { // Get terminals, nonterminals and productions Symbol[] terminals = Symbol.terminals(); Symbol[] nonterminals = Symbol.nonterminals(); Production[] productions = Production.productions(); // Initialize FIRST(X) to {} FIRST_Terminal = new SymbolSet[terminals.length]; for(int i = 0; i < terminals.length; i++) { FIRST_Terminal[i] = new SymbolSet(); } FIRST_Nonterminal = new SymbolSet[nonterminals.length]; for(int i = 0; i < nonterminals.length; i++) { FIRST_Nonterminal[i] = new SymbolSet(); } // if X is terminal, then FIRST(X) is {X} for(int i = 0; i < terminals.length; i++) { FIRST_Terminal[i].setTerminal(terminals[i].index); } // if X -> empty is a production, then add empty to FIRST(X) for(int i = 0; i < productions.length; i++) { if(productions[i].rightside().length == 0) { FIRST_Nonterminal[productions[i].leftside]. setEmpty(); } } // if X is nonterminal and X -> Y(1) Y(2) ... Y(k) is a production, // then place t in FIRST(X) if for some i, t is in FIRST(Y(i)), and // empty is in all of FIRST(Y(1)), ... , FIRST(Y(i-1)). boolean changed; do { changed = false; for(int i = 0; i < productions.length; i++) { SymbolSet before = (SymbolSet) FIRST_Nonterminal[productions[i].leftside].clone(); FIRST_Nonterminal[productions[i].leftside]. or(FIRST(productions[i].rightside())); if(!before.equals(FIRST_Nonterminal[productions[i].leftside])) { changed = true; } } } while(changed); } static SymbolSet FIRST(Symbol[] symbols) { return FIRST(symbols, 0, symbols.length); } static SymbolSet FIRST(Symbol[] symbols, int begin) { return FIRST(symbols, begin, symbols.length); } static SymbolSet FIRST(Symbol[] symbols, int begin, int end) { SymbolSet result = new SymbolSet(); boolean previousContainsEmpty = true; for(int i = begin; i < end; i++) { if(!previousContainsEmpty) { break; } if(symbols[i].terminal) { result.or(FIRST_Terminal[symbols[i].index]); previousContainsEmpty = FIRST_Terminal[symbols[i].index].getEmpty(); } else { result.or(FIRST_Nonterminal[symbols[i].index]); previousContainsEmpty = FIRST_Nonterminal[symbols[i].index].getEmpty(); } } if(previousContainsEmpty) { result.setEmpty(); } else { result.clearEmpty(); } return result; } static SymbolSet[] FOLLOW; static void computeFollow() { // Get terminals, nonterminals and productions // Symbol[] terminals = Symbol.terminals(); Symbol[] nonterminals = Symbol.nonterminals(); Production[] productions = Production.productions(); // Initialize FOLLOW(A) to {} FOLLOW = new SymbolSet[nonterminals.length]; for(int i = 0; i < nonterminals.length; i++) { FOLLOW[i] = new SymbolSet(); } // Place eof in FOLLOW(S) where S is the start symbol. FOLLOW[startSymbol].setTerminal(eof); // If there is a production A->xBy, then everything in FIRST(y) except // for empty is placed in FOLLOW(B). for(int i = 0; i < productions.length; i++) { Symbol[] rightside = productions[i].rightside(); for(int j = 0; j < rightside.length; j++) { if(!rightside[j].terminal) { SymbolSet set = FIRST(rightside, j + 1); set.clearEmpty(); FOLLOW[rightside[j].index].or(set ); } } } // If there is a production A->xB, or a production A->xBy where FIRST(y) // contains empty, then everything in FOLLOW(A) is in FOLLOW(B). boolean changed; do { changed = false; for(int i = 0; i < productions.length; i++) { Symbol[] rightside = productions[i].rightside(); for(int j = 0; j < rightside.length; j++) { if(!rightside[j].terminal) { SymbolSet before = (SymbolSet) FOLLOW[rightside[j].index].clone(); if(FIRST(rightside, j + 1).getEmpty()) { FOLLOW[rightside[j].index]. or(FOLLOW[productions[i].leftside]); } if(!before.equals(FOLLOW[rightside[j].index])) { changed = true; } } } } } while(changed); } static SymbolSet FOLLOW(int nonterminal) { return FOLLOW[nonterminal]; } static LR0ItemSet CLOSURE(LR0Item item) { LR0ItemSet result = (LR0ItemSet) fastLr0Closure.get(item); if(result != null) { return result; } result = new LR0ItemSet(); result.set(item); LR0ItemSet newItems = result; boolean modified; do { modified = false; LR0Item[] items = newItems.items(); newItems = new LR0ItemSet(); for(int i = 0; i < items.length; i++) { Production production = Production.production(items[i].production); Symbol[] rightside = production.rightside(); if(items[i].position < rightside.length) { Symbol symbol = rightside[items[i].position]; if(!symbol.terminal) { Production[] alternatives = Production.alternatives(symbol.index); for(int j = 0; j < alternatives.length; j++) { LR0Item newItem = new LR0Item(alternatives[j].index, 0); if(!result.get(newItem)) { result.set(newItem); newItems.set(newItem); modified = true; } } } } } } while(modified); fastLr0Closure.put(item, result); return result; } // private static final SplayTreeMap fastLr0SetClosure = new SplayTreeMap(); static LR0ItemSet CLOSURE(LR0ItemSet set ) { LR0ItemSet result = /* (LR0ItemSet) fastLr0SetClosure.get(set); if(result != null) { return result; } result =*/ new LR0ItemSet(); LR0Item[] setItems = set.items(); for(int i = 0; i < setItems.length; i++) { LR0Item[] items = CLOSURE(setItems[i]).items(); for(int j = 0; j < items.length; j++) { result.set(items[j]); } } // fastLr0SetClosure.put(set, result); return result; } static LR1ItemSet CLOSURE(LR1Item item) { LR1ItemSet result = (LR1ItemSet) fastLr1Closure.get(item); if(result != null) { return result; } result = new LR1ItemSet(); result.set(item); LR1ItemSet newItems = result; boolean modified; do { modified = false; LR1Item[] items = newItems.items(); newItems = new LR1ItemSet(); for(int i = 0; i < items.length; i++) { Production production = Production.production(items[i].lr0Item.production); Symbol[] rightside = production.rightside(); if(items[i].lr0Item.position < rightside.length) { Symbol symbol = rightside[items[i].lr0Item.position]; if(!symbol.terminal) { Vector tailVector = new Vector(0); for(int k = items[i].lr0Item.position + 1; k < rightside.length; k++) { tailVector.addElement(rightside[k]); } tailVector.addElement(Symbol.symbol(items[i].terminal, true)); Symbol[] tail = new Symbol[tailVector.size()]; tailVector.copyInto(tail); Symbol[] symbols = FIRST(tail).getSymbols(); Production[] alternatives = Production.alternatives(symbol.index); for(int k = 0; k < symbols.length; k++) { if(symbols[k].terminal) { for(int j = 0; j < alternatives.length; j++) { LR1Item newItem = new LR1Item( new LR0Item(alternatives[j].index, 0), symbols[k].index); if(!result.get(newItem)) { result.set(newItem); newItems.set(newItem); modified = true; } } } } } } } } while(modified); fastLr1Closure.put(item, result); return result; } // private static final SplayTreeMap fastLr1SetClosure = new SplayTreeMap(); static LR1ItemSet CLOSURE(LR1ItemSet set ) { LR1ItemSet result = /* (LR1ItemSet) fastLr1SetClosure.get(set); if(result != null) { return result; } result =*/ new LR1ItemSet(); LR1Item[] setItems = set.items(); for(int i = 0; i < setItems.length; i++) { LR1Item[] items = CLOSURE(new LR1Item(setItems[i].lr0Item, dummy)).items(); for(int j = 0; j < items.length; j++) { result.set(new LR1Item(items[j].lr0Item, items[j].terminal == dummy ? setItems[i].terminal : items[j].terminal)); } } // fastLr1SetClosure.put(set, result); return result; } static LR0ItemSet GOTO(LR0ItemSet set , Symbol symbol) { // LR0ItemSet initialset = set ; set = CLOSURE(set ); LR0ItemSet result = new LR0ItemSet(); // return all items A->xS.y such that A->x.Sy is in set. (S=symbol) LR0Item[] items = set.items(); for(int i = 0; i < items.length; i++) { Production production = Production.production(items[i].production); Symbol[] rightside = production.rightside(); if(items[i].position < rightside.length) { if(symbol.equals(rightside[items[i].position])) { result.set(new LR0Item(items[i].production, items[i].position + 1)); } } } return result; } } sablecc-3.7/src/org/sablecc/sablecc/In_Production.java000066400000000000000000000107071265440641200227550ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; @SuppressWarnings({"rawtypes","unchecked"}) public class In_Production { private String name; private String[] prodTransformElems; private int nbAlts; private In_Alternative[] alternatives; public In_Production(AProd prod) { setName(prod.getId().getText()); AElem[] prodTransforms = (AElem [])prod.getProdTransform().toArray(new AElem[0]); prodTransformElems = new String[prodTransforms.length]; for(int i=0; i set.elements[r])) { length++; r++; } else { length++; l++; r++; } } int[] old = elements; elements = new int[length]; length = l = r = 0; while((l < old.length) || (r < set.elements.length)) { // if(DEBUG) // { // System.out.println( // " l:" + l + // " r:" + r + // " length:" + length); // } if((r == set.elements.length) || ((l != old.length) && (old[l] < set.elements[r]))) { elements[length++] = old[l]; l++; } else if((l == old.length) || (old[l] > set.elements[r])) { elements[length++] = set.elements[r]; r++; } else { elements[length++] = old[l]; l++; r++; } } } public void set (int bit) { if(!get (bit)) { int[] old = elements; elements = new int[old.length + 1]; int old_pos = 0; boolean bit_inserted = false; int pos = 0; while(pos < elements.length) { if(!bit_inserted) { if(old_pos < old.length) { if(bit < old[old_pos]) { elements[pos++] = bit; bit_inserted = true; } else { elements[pos++] = old[old_pos++]; } } else { elements[pos++] = bit; bit_inserted = true; } } else { elements[pos++] = old[old_pos++]; } } } } public int size() { if(elements.length == 0) { return 0; } return elements[elements.length - 1] + 1; } @Override public String toString() { StringBuffer s = new StringBuffer(); s.append("{"); boolean comma = false; for(int i = 0; i < elements.length; i++) { if(comma) { s.append(", "); } else { comma = true; } s.append(elements[i]); } s.append("}"); return s.toString(); } public void xor(IntSet set ) { if(set == this) { set = (IntSet) set.clone(); } int length = 0; int l = 0; int r = 0; while((l < elements.length) || (r < set.elements.length)) { if((r == set.elements.length) || ((l != elements.length) && (elements[l] < set.elements[r]))) { length++; l++; } else if((l == elements.length) || (elements[l] > set.elements[r])) { length++; r++; } else { l++; r++; } } int[] old = elements; elements = new int[length]; length = l = r = 0; while((l < old.length) || (r < set.elements.length)) { if((r == set.elements.length) || ((l != old.length) && (old[l] < set.elements[r]))) { elements[length++] = old[l]; l++; } else if((l == old.length) || (old[l] > set.elements[r])) { elements[length++] = set.elements[r]; r++; } else { l++; r++; } } } public int[] elements() { return (int[]) elements/*.clone()*/; } } sablecc-3.7/src/org/sablecc/sablecc/IntegerCast.java000066400000000000000000000011631265440641200224050ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; public class IntegerCast implements Cast { public final static IntegerCast instance = new IntegerCast(); private IntegerCast() {} @Override public Object cast(Object o) { return (Integer) o; } } sablecc-3.7/src/org/sablecc/sablecc/IntegerComparator.java000066400000000000000000000013701265440641200236220ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; @SuppressWarnings("rawtypes") public class IntegerComparator implements Comparator { public final static IntegerComparator instance = new IntegerComparator(); private IntegerComparator() {} @Override public int compare(Object o1, Object o2) { return ((Integer) o1).intValue() - ((Integer) o2).intValue(); } } sablecc-3.7/src/org/sablecc/sablecc/InternalTransformationsToGrammar.java000066400000000000000000000526731265440641200267110ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Last Modification date : October, the 11th 2003 * Goal of the modification : addition of specifier to * the generated production($prod) to handle list of element. * * */ package org.sablecc.sablecc; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; @SuppressWarnings({"rawtypes","unchecked"}) public class InternalTransformationsToGrammar extends DepthFirstAdapter { private ResolveIds ids; private ResolveAltIds altIds; private ResolveTransformIds transformIds; private String currentProd; // private int currentAlt; private String currentAltName; private boolean processingAst; // private boolean processingProdTransform; static final int NONE = 0; static final int STAR = 1; static final int QMARK = 2; static final int PLUS = 3; int count; int elem; private LinkedList listSimpleTermTransform; public final Map simpleTermTransform; Map mapProductionTransformations; Map simpleTermOrsimpleListTermTypes; private Map isElementIsAlist = new TypedTreeMap( StringComparator.instance, StringCast.instance, StringCast.instance); private LinkedList listProd; public InternalTransformationsToGrammar(ResolveIds ids, ResolveAltIds altIds, ResolveTransformIds transformIds, LinkedList listSimpleTermTransform, Map simpleTermTransform, Map mapProductionTransformations, Map simpleTermOrsimpleListTermTypes) { this.ids = ids; this.altIds = altIds; this.transformIds = transformIds; this.listSimpleTermTransform = listSimpleTermTransform; this.simpleTermTransform = simpleTermTransform; this.mapProductionTransformations = mapProductionTransformations; this.simpleTermOrsimpleListTermTypes = simpleTermOrsimpleListTermTypes; } @Override public void inAProductions(AProductions node) { listProd = node.getProds(); } private LinkedList listOfAlts; @Override public void inAAst(AAst node) { processingAst = true; } @Override public void outAAst(AAst node) { processingAst = false; } @Override public void caseAProd(AProd node) { currentProd = (String) ids.names.get(node); listOfAlts = new LinkedList(); Object[] list_alt = (Object[])node.getAlts().toArray(); for(int i=0; i $elem | elem This creates the production :: $elem {-> elem* } = {nonTerminal} $elem elem {-> [$elem.elem elem] } | {terminal} elem {-> [elem] } ; */ public AProd createXelemProduction(final String name, final String elemTypeName, String XproductionName, LinkedList nodeProdTransform) { final String rname = name.substring(1); LinkedList listOfAltsXelem = new LinkedList(); if(nodeProdTransform != null) { nodeProdTransform = (LinkedList)cloneList(nodeProdTransform); //Creation of the production transformation for Xelem //if the production transformation is introduced by the software if(nodeProdTransform.size() == 1) { AElem elem = (AElem)nodeProdTransform.get(0); if(elem.getUnOp() == null && elem.getId().getText().equals(rname)) { LinkedList elemsProdTransform = new LinkedList(); elemsProdTransform.add( new AElem( null, new AProductionSpecifier(), new TId(rname), new AStarUnOp() ) ); nodeProdTransform = elemsProdTransform; } } } //That means elem is token type else { // String name_resolved = ResolveIds.name(name); LinkedList elemsProdTransform = new LinkedList(); elemsProdTransform.add( new AElem( null, new ATokenSpecifier(), new TId(rname), new AStarUnOp() ) ); nodeProdTransform = elemsProdTransform; } final LinkedList listProdTransformationOfXelem = new LinkedList(); AElem []temp_listProdTransform = (AElem[])nodeProdTransform.toArray(new AElem[0]); for(int i=0; i and others. All rights reserved. See the file "AUTHORS" for the name of all copyright holders. This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program in the file "COPYING-LESSER"; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA The SableCC web site is located at: http://www.sablecc.org/ sablecc-3.7/src/org/sablecc/sablecc/LR0Collection.java000066400000000000000000000066421265440641200226150ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; @SuppressWarnings({"rawtypes","unchecked"}) final class LR0Collection { private final Vector sets = new Vector(0); private final TreeMap setIndices = new TreeMap(); private final Vector GOTO = new Vector(0); final Vector names = new Vector(0); LR0Collection(LR0ItemSet set ) { add (set , -1, null); for(int i = 0; i < sets.size(); i++) { System.out.print("."); Symbol[] symbols = Symbol.symbols(); for(int j = 0; j < symbols.length; j++) { addGoto(i, symbols[j], Grammar.GOTO(set (i), symbols[j])); } } System.out.println(); } private int add (LR0ItemSet set , int from, Symbol symbol) { Integer result = set (set ); if(result == null) { result = new Integer(sets.size()); setIndices.put(set , result); sets.addElement(set ); GOTO.addElement(new TreeMap()); if(from == -1) { names.addElement(" "); } else { names.addElement(names.elementAt(from) + "" + symbol + " "); } } return result.intValue(); } private static LR0ItemSet empty = new LR0ItemSet(); public static void reinit() { empty = new LR0ItemSet(); } private void addGoto(int from, Symbol symbol, LR0ItemSet to) { if(!to.equals(empty)) { ((TreeMap) GOTO.elementAt(from)).put(symbol, new Integer(add (to, from, symbol))); } } private Integer set (LR0ItemSet set ) { return (Integer) setIndices.get(set ); } private LR0ItemSet set (int index) { return (LR0ItemSet) sets.elementAt(index); } LR0ItemSet[] sets() { LR0ItemSet[] result = new LR0ItemSet[sets.size()]; sets.copyInto(result); return result; } Integer GOTO(int set , Symbol symbol) { return (Integer) ((TreeMap) GOTO.elementAt(set )).get(symbol); } @Override public String toString() { StringBuffer result = new StringBuffer(); result.append("{[LR0ItemCollection]" + System.getProperty("line.separator")); LR0ItemSet[] sets = sets(); Symbol[] symbols = Symbol.symbols(); for(int i = 0; i < sets.length; i++) { result.append(i + ":" + Grammar.CLOSURE(sets[i])); result.append(System.getProperty("line.separator")); for(int j = 0; j < symbols.length; j++) { if(GOTO(i, symbols[j]) != null) { result.append("["); result.append(symbols[j]); result.append(":"); result.append(GOTO(i, symbols[j])); result.append("]"); } } result.append(System.getProperty("line.separator")); } result.append("}"); return result.toString(); } } sablecc-3.7/src/org/sablecc/sablecc/LR0Item.java000066400000000000000000000041101265440641200214040ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; @SuppressWarnings("rawtypes") final class LR0Item implements Cloneable, Comparable { final int production; final int position; LR0Item(int production, int position) { this.production = production; this.position = position; } @Override public int compareTo(Object object) { LR0Item item = (LR0Item) object; int result = production - item.production; if(result == 0) { result = position - item.position; } return result; } @Override public Object clone() { return new LR0Item(production, position); } @Override public boolean equals(Object obj) { if((obj == null) || (obj.getClass() != this.getClass())) { return false; } LR0Item item = (LR0Item) obj; return (item.production == production) && (item.position == position); } @Override public int hashCode() { return (production * 13) ^ (position * 17); } @Override public String toString() { StringBuffer result = new StringBuffer(); String prodStr = (Production.production(production)).toString(); int pos = 0; StringTokenizer list = new StringTokenizer(prodStr, "= "); // we know that there is at least one token (lhs) result.append(list.nextToken()); result.append(" ="); while(list.hasMoreElements()) { String tmp = list.nextToken(); if(pos == position) { result.append(" * "); result.append(tmp); } else { result.append(" "); result.append(tmp); } pos++; } if(pos == position) { result.append(" *"); } return "[ " + result + " ]"; } } sablecc-3.7/src/org/sablecc/sablecc/LR0ItemAndSetPair.java000066400000000000000000000011741265440641200233260ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; final class LR0ItemAndSetPair { public final LR0Item item; public final int set ; LR0ItemAndSetPair(LR0Item item, int set ) { this.item = item; this.set = set ; } } sablecc-3.7/src/org/sablecc/sablecc/LR0ItemSet.java000066400000000000000000000064371265440641200220760ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; @SuppressWarnings({"rawtypes","unchecked"}) final class LR0ItemSet implements Cloneable, Comparable { private final TreeMap items; private int hashCode; LR0ItemSet() { items = new TreeMap(); } private LR0ItemSet(LR0ItemSet set ) { items = (TreeMap) set.items.clone(); } void set (LR0Item item) { if(items.put(item, item) == null) { hashCode += item.hashCode(); modified_ = true; } } boolean get (LR0Item item) { return items.get(item) != null; } LR0Item[] items_; boolean modified_ = true; private void computeArray() { Vector itemVector = new Vector(0); for(Iterator e = items.keySet().iterator(); e.hasNext();) { itemVector.addElement(e.next()); } items_ = new LR0Item[itemVector.size()]; itemVector.copyInto(items_); modified_ = false; } LR0Item[] items() { if(modified_) { computeArray(); } return items_; } @Override public String toString() { StringBuffer result = new StringBuffer(); result.append("{"); Production[] productions = Production.productions(); boolean space = false; for(int i = 0; i < productions.length; i++) { int rightsideLength = productions[i].rightside().length; for(int j = 0; j <= rightsideLength; j++) { LR0Item item = new LR0Item(productions[i].index, j); if(get (item)) { if(space) { result.append(","); } else { space = true; } result.append(item); } } } result.append("}"); return result.toString(); } @Override public Object clone() { return new LR0ItemSet(this); } @Override public boolean equals(Object obj) { if((obj == null) || (obj.getClass() != this.getClass())) { return false; } LR0ItemSet set = (LR0ItemSet) obj; if(set.items.size() != items.size()) { return false; } for(Iterator e = items.keySet().iterator(); e.hasNext();) { if(!set.get((LR0Item) e.next())) { return false; } } return true; } @Override public int hashCode() { return hashCode; } @Override public int compareTo(Object object) { LR0ItemSet set = (LR0ItemSet) object; int result = items.size() - set.items.size(); if(result == 0) { Iterator e = items.keySet().iterator(); Iterator f = set.items.keySet().iterator(); while(e.hasNext() && f.hasNext() && (result == 0)) { result = ((LR0Item) e.next()).compareTo(f.next()); } if(result == 0) { if(e.hasNext()) { return 1; } if(f.hasNext()) { return -1; } } } return result; } } sablecc-3.7/src/org/sablecc/sablecc/LR1Collection.java000066400000000000000000000134151265440641200226120ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; @SuppressWarnings({"rawtypes","unchecked"}) final class LR1Collection { final LR0Collection collection; final TreeMap[] lookaheads; private final TreeMap[] propagation; LR1Collection(LR0ItemSet set ) { collection = new LR0Collection(set ); // Initialize lookaheads to nothing, propagation to nothing LR0ItemSet[] sets = collection.sets(); lookaheads = new TreeMap[sets.length]; propagation = new TreeMap[sets.length]; for(int i = 0; i < sets.length; i++) { System.out.print("."); lookaheads[i] = new TreeMap(); propagation[i] = new TreeMap(); LR0Item[] items = sets[i].items(); for(int j = 0; j < items.length; j++) { lookaheads[i].put(items[j], new SymbolSet()); propagation[i].put(items[j], new Vector(0)); } } System.out.println(); ((SymbolSet) lookaheads[0].get(set.items()[0])).setTerminal(Grammar.eof); for(int i = 0; i < sets.length; i++) { System.out.print("."); LR0Item[] items = sets[i].items(); for(int j = 0; j < items.length; j++) { LR1ItemSet lr1Set = new LR1ItemSet(); lr1Set.set(new LR1Item(items[j], Grammar.dummy)); LR1Item[] closure = Grammar.CLOSURE(lr1Set).items(); for(int k = 0; k < closure.length; k++) { if(closure[k].terminal != Grammar.dummy) { Symbol[] rightside = Production. production(closure[k].lr0Item.production). rightside(); if(closure[k].lr0Item.position < rightside.length) { Integer destination = collection.GOTO(i, rightside[closure[k].lr0Item.position]); if(destination != null) { ((SymbolSet) lookaheads[destination.intValue()]. get (new LR0Item(closure[k].lr0Item.production, closure[k].lr0Item.position + 1))). setTerminal(closure[k].terminal); /*((SymbolSet) lookaheads[collection.GOTO(i, Production.production(closure[k].lr0Item.production). rightside(closure[k].lr0Item.position)).intValue()]. get(new LR0Item(closure[k].lr0Item.production, closure[k].lr0Item.position + 1))). setTerminal(closure[k].terminal);*/ } } } else { Symbol[] rightside = Production. production(closure[k].lr0Item.production). rightside(); if(closure[k].lr0Item.position < rightside.length) { Integer destination = collection.GOTO(i, rightside[closure[k].lr0Item.position]); if(destination != null) { ((Vector) propagation[i].get(items[j])). addElement(new LR0ItemAndSetPair( new LR0Item(closure[k].lr0Item.production, closure[k].lr0Item.position + 1), destination.intValue())); /*((Vector) propagation[i].get(items[j])). addElement(new LR0ItemAndSetPair( new LR0Item(closure[k].lr0Item.production, closure[k].lr0Item.position + 1), collection.GOTO(i, Production.production(closure[k].lr0Item.production). rightside(closure[k].lr0Item.position)).intValue()));*/ } } } } } } System.out.println(); boolean changed; do { System.out.print("."); changed = false; for(int i = 0; i < sets.length; i++) { LR0Item[] items = sets[i].items(); for(int j = 0; j < items.length; j++) { for(Enumeration e = ((Vector) propagation[i].get(items[j])). elements(); e.hasMoreElements();) { LR0ItemAndSetPair pair = (LR0ItemAndSetPair) e.nextElement(); SymbolSet before = (SymbolSet) ((SymbolSet) lookaheads[pair.set].get(pair.item)).clone(); ((SymbolSet) lookaheads[pair.set].get(pair.item)). or((SymbolSet) lookaheads[i].get(items[j])); if(!before.equals(lookaheads[pair.set].get(pair.item))) { changed = true; } } } } } while(changed); System.out.println(); } @Override public String toString() { StringBuffer result = new StringBuffer(); result.append(collection); result.append(System.getProperty("line.separator")); result.append("Lookaheads" + System.getProperty("line.separator")); LR0ItemSet[] sets = collection.sets(); for(int i = 0; i < sets.length; i++) { result.append(i + ":" + System.getProperty("line.separator")); LR0Item[] items = sets[i].items(); for(int j = 0; j < items.length; j++) { result.append(items[j] + ":" + lookaheads[i].get(items[j]) + System.getProperty("line.separator")); } } return result.toString(); } } sablecc-3.7/src/org/sablecc/sablecc/LR1Item.java000066400000000000000000000042151265440641200214130ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; @SuppressWarnings("rawtypes") final class LR1Item implements Cloneable, Comparable { final LR0Item lr0Item; final int terminal; LR1Item(LR0Item lr0Item, int terminal) { this.lr0Item = lr0Item; this.terminal = terminal; } @Override public Object clone() { return new LR1Item(lr0Item, terminal); } @Override public boolean equals(Object obj) { if((obj == null) || (obj.getClass() != this.getClass())) { return false; } LR1Item item = (LR1Item) obj; return (item.lr0Item.equals(lr0Item)) && (item.terminal == terminal); } @Override public int hashCode() { return lr0Item.hashCode() * (terminal + 1) * 37; } @Override public String toString() { return lr0Item + ":" + Symbol.symbol(terminal, true); } public String toString(Symbol lookahead) { // two cases: // (1) we are facing a reduction, and the lookahed // should match // (2) we are in the middle of a production. The // next element should match. Symbol[] rightside = Production.production(lr0Item.production).rightside(); if(lr0Item.position == rightside.length) { Symbol term = Symbol.symbol(terminal, true); if(term == lookahead) { return lr0Item + " followed by " + term + " (reduce)"; } else { return null; } } if(rightside[lr0Item.position] == lookahead) { return lr0Item + " (shift)"; } else { return null; } } @Override public int compareTo(Object object) { LR1Item item = (LR1Item) object; int result = lr0Item.compareTo(item.lr0Item); if(result == 0) { result = terminal - item.terminal; } return result; } } sablecc-3.7/src/org/sablecc/sablecc/LR1ItemSet.java000066400000000000000000000110351265440641200220650ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; @SuppressWarnings({"rawtypes","unchecked"}) final class LR1ItemSet implements Cloneable, Comparable { private final TreeMap items; private int hashCode = 0; LR1ItemSet() { this.items = new TreeMap(); } private LR1ItemSet(LR1ItemSet set ) { this.items = (TreeMap) set.items.clone(); this.hashCode = set.hashCode; } void set (LR1Item item) { if(items.put(item, item) == null) { hashCode += item.hashCode(); modified_ = true; } } boolean get (LR1Item item) { return items.get(item) != null; } LR1Item[] items_; boolean modified_ = true; private void computeArray() { Vector itemVector = new Vector(0); for(Iterator e = items.keySet().iterator(); e.hasNext();) { itemVector.addElement(e.next()); } items_ = new LR1Item[itemVector.size()]; itemVector.copyInto(items_); modified_ = false; } LR1Item[] items() { if(modified_) { computeArray(); } return items_; } @Override public String toString() { String nl = System.getProperty("line.separator"); StringBuffer result = new StringBuffer(); result.append("{" + nl + "\t"); Production[] productions = Production.productions(); Symbol[] terminals = Symbol.terminals(); boolean comma = false; for(int i = 0; i < productions.length; i++) { int rightsideLength = productions[i].rightside().length; for(int j = 0; j <= rightsideLength; j++) { LR0Item lr0Item = new LR0Item(productions[i].index, j); for(int k = 0; k < terminals.length; k++) { LR1Item item = new LR1Item(lr0Item, terminals[k].index); if(get (item)) { if(comma) { result.append("," + nl + "\t"); } else { comma = true; } result.append(item); } } } } result.append(nl + "}"); return result.toString(); } public String toString(Symbol lookahead) { String nl = System.getProperty("line.separator"); LR1Item[] items = items(); int length = items.length; TreeSet strings = new TreeSet(); for(int i = 0; i < length; i++) { String s = items[i].toString(lookahead); //System.out.println("s = " + s + " " + " items[i] : " + items[i] + " lookahead : " + lookahead); if(s != null) { strings.add(s); } } StringBuffer result = new StringBuffer(); result.append("{"); boolean colon = false; for(Iterator i = strings.iterator(); i.hasNext(); ) { if(colon) { result.append(","); result.append(nl); } else { colon = true; result.append(nl); } result.append("\t"); result.append(i.next()); } result.append(nl); result.append("}"); return result.toString(); } @Override public Object clone() { return new LR1ItemSet(this); } @Override public boolean equals(Object obj) { if((obj == null) || (obj.getClass() != this.getClass())) { return false; } LR1ItemSet set = (LR1ItemSet) obj; if(set.items.size() != items.size()) { return false; } for(Iterator e = items.keySet().iterator(); e.hasNext();) { if(!set.get((LR1Item) e.next())) { return false; } } return true; } @Override public int hashCode() { return hashCode; } @Override public int compareTo(Object object) { LR1ItemSet set = (LR1ItemSet) object; int result = items.size() - set.items.size(); if(result == 0) { Iterator e = items.keySet().iterator(); Iterator f = set.items.keySet().iterator(); while(e.hasNext() && f.hasNext() && (result == 0)) { result = ((LR1Item) e.next()).compareTo(f.next()); } if(result == 0) { if(e.hasNext()) { return 1; } if(f.hasNext()) { return -1; } } } return result; } } sablecc-3.7/src/org/sablecc/sablecc/ListCast.java000066400000000000000000000012251265440641200217220ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.util.*; @SuppressWarnings("rawtypes") public class ListCast implements Cast { public final static ListCast instance = new ListCast(); private ListCast() {} @Override public Object cast(Object o) { return (List) o; } } sablecc-3.7/src/org/sablecc/sablecc/MacroExpander.java000066400000000000000000000052131265440641200227250ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.io.*; import java.util.*; @SuppressWarnings({"rawtypes","unchecked"}) public class MacroExpander { private static final String MACRO = "Macro:"; // private static final String lineSeparator = System.getProperty("line.separator"); private Map macros = new TypedTreeMap( StringComparator.instance, StringCast.instance, ListCast.instance); public MacroExpander(Reader in) throws IOException { BufferedReader br = new BufferedReader(in); while(readInMacro(br)) ; in.close(); } private boolean readInMacro(BufferedReader in) throws IOException { String line; while((line = in.readLine()) != null) { if(line.startsWith(MACRO)) { String name = line.substring(MACRO.length()); List macro = new TypedLinkedList(StringCast.instance); while((line = in.readLine()) != null) { if(line.equals("$")) { macros.put(name, macro); return true; } macro.add(line); } macros.put(name, macro); return false; } } return false; } @Override public String toString() { return this.getClass().getName() + macros; } public void apply(BufferedWriter out, String macroName) throws IOException { apply(out, macroName, null); } public void apply(BufferedWriter out, String macroName, String[] arguments) throws IOException { List macro = (List) macros.get(macroName); for(ListIterator li = macro.listIterator(); li.hasNext();) { if(li.nextIndex() != 0) { out.newLine(); } String line = (String) li.next(); char c; for(int i = 0; i < line.length(); i++) { if((c = line.charAt(i)) == '$') { StringBuffer index = new StringBuffer(); while((c = line.charAt(++i)) != '$') { index.append(c); } if(index.length() == 0) { out.write('$'); } else { out.write(arguments[Integer.parseInt(index.toString())]); } } else { out.write(c); } } } } } sablecc-3.7/src/org/sablecc/sablecc/NFA.java000066400000000000000000000210461265440641200206030ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; public class NFA implements Cloneable { public State[] states; private NFA(int size) { System.out.print("."); states = new State[size]; } public NFA() { this(2); states[0] = new State(); states[0].transitions[0] = new Transition(null, 1); states[1] = new State(); } public NFA(CharSet chars) { this(2); states[0] = new State(); states[0].transitions[0] = new Transition(chars, 1); states[1] = new State(); } public NFA(String string) { this(string.length() + 1); for(int i = 0; i < string.length(); i++) { states[i] = new State(); states[i].transitions[0] = new Transition(new CharSet(string.charAt(i)), i + 1); } states[string.length()] = new State(); } private NFA(NFA nfa) { this(nfa.states.length); for(int i = 0; i < nfa.states.length; i++) { states[i] = new State(nfa.states[i]); } } public NFA zeroOrMore() { NFA nfa = new NFA(states.length + 2); nfa.states[0] = new State(); nfa.states[0].transitions[0] = new Transition(null, 1); nfa.states[0].transitions[1] = new Transition(null, states.length + 1); for(int i = 0; i < states.length; i++) { nfa.states[i + 1] = new State(states[i]); if(nfa.states[i + 1].transitions[0] != null) { nfa.states[i + 1].transitions[0].destination += 1; } if(nfa.states[i + 1].transitions[1] != null) { nfa.states[i + 1].transitions[1].destination += 1; } } nfa.states[states.length].transitions[0] = new Transition(null, 1); nfa.states[states.length].transitions[1] = new Transition(null, states.length + 1); nfa.states[states.length + 1] = new State(); return nfa; } public NFA zeroOrOne() { NFA nfa = new NFA(states.length + 2); nfa.states[0] = new State(); nfa.states[0].transitions[0] = new Transition(null, 1); nfa.states[0].transitions[1] = new Transition(null, states.length + 1); for(int i = 0; i < states.length; i++) { nfa.states[i + 1] = new State(states[i]); if(nfa.states[i + 1].transitions[0] != null) { nfa.states[i + 1].transitions[0].destination += 1; } if(nfa.states[i + 1].transitions[1] != null) { nfa.states[i + 1].transitions[1].destination += 1; } } nfa.states[states.length].transitions[1] = new Transition(null, states.length + 1); nfa.states[states.length + 1] = new State(); return nfa; } public NFA oneOrMore() { NFA nfa = new NFA(states.length + 2); nfa.states[0] = new State(); nfa.states[0].transitions[0] = new Transition(null, 1); for(int i = 0; i < states.length; i++) { nfa.states[i + 1] = new State(states[i]); if(nfa.states[i + 1].transitions[0] != null) { nfa.states[i + 1].transitions[0].destination += 1; } if(nfa.states[i + 1].transitions[1] != null) { nfa.states[i + 1].transitions[1].destination += 1; } } nfa.states[states.length].transitions[0] = new Transition(null, 1); nfa.states[states.length].transitions[1] = new Transition(null, states.length + 1); nfa.states[states.length + 1] = new State(); return nfa; } public NFA concatenate(NFA next) { NFA nfa = new NFA(states.length + next.states.length - 1); for(int i = 0; i < states.length - 1; i++) { nfa.states[i] = new State(states[i]); } for(int i = 0; i < next.states.length; i++) { nfa.states[states.length + i - 1] = new State(next.states[i]); if(nfa.states[states.length + i - 1].transitions[0] != null) { nfa.states[states.length + i - 1].transitions[0].destination += states.length - 1; } if(nfa.states[states.length + i - 1].transitions[1] != null) { nfa.states[states.length + i - 1].transitions[1].destination += states.length - 1; } } return nfa; } public NFA alternate(NFA next) { NFA nfa = new NFA(states.length + next.states.length + 2); nfa.states[0] = new State(); nfa.states[0].transitions[0] = new Transition(null, 1); nfa.states[0].transitions[1] = new Transition(null, states.length + 1); for(int i = 0; i < states.length; i++) { nfa.states[i + 1] = new State(states[i]); if(nfa.states[i + 1].transitions[0] != null) { nfa.states[i + 1].transitions[0].destination += 1; } if(nfa.states[i + 1].transitions[1] != null) { nfa.states[i + 1].transitions[1].destination += 1; } } nfa.states[states.length].transitions[0] = new Transition(null, states.length + next.states.length + 1); for(int i = 0; i < next.states.length; i++) { nfa.states[states.length + i + 1] = new State(next.states[i]); if(nfa.states[states.length + i + 1].transitions[0] != null) { nfa.states[states.length + i + 1].transitions[0].destination += states.length + 1; } if(nfa.states[states.length + i + 1].transitions[1] != null) { nfa.states[states.length + i + 1].transitions[1].destination += states.length + 1; } } nfa.states[states.length + next.states.length].transitions[0] = new Transition(null, states.length + next.states.length + 1); nfa.states[states.length + next.states.length + 1] = new State(); return nfa; } public NFA merge(NFA next) { NFA nfa = new NFA(states.length + next.states.length + 1); nfa.states[0] = new State(); nfa.states[0].transitions[0] = new Transition(null, 1); nfa.states[0].transitions[1] = new Transition(null, states.length + 1); for(int i = 0; i < states.length; i++) { nfa.states[i + 1] = new State(states[i]); if(nfa.states[i + 1].transitions[0] != null) { nfa.states[i + 1].transitions[0].destination += 1; } if(nfa.states[i + 1].transitions[1] != null) { nfa.states[i + 1].transitions[1].destination += 1; } } for(int i = 0; i < next.states.length; i++) { nfa.states[states.length + i + 1] = new State(next.states[i]); if(nfa.states[states.length + i + 1].transitions[0] != null) { nfa.states[states.length + i + 1].transitions[0].destination += states.length + 1; } if(nfa.states[states.length + i + 1].transitions[1] != null) { nfa.states[states.length + i + 1].transitions[1].destination += states.length + 1; } } return nfa; } @Override public Object clone() { return new NFA(this); } @Override public String toString() { StringBuffer result = new StringBuffer(); for(int i = 0; i < states.length; i++) { result.append(i + ":" + states[i] + System.getProperty("line.separator")); } return result.toString(); } public static class State { public String accept; public Transition[] transitions = new Transition[2]; public State() {} public State(State state) { if(state.accept != null) { accept = state.accept; } if(state.transitions[0] != null) { transitions[0] = new Transition(state.transitions[0]); } if(state.transitions[1] != null) { transitions[1] = new Transition(state.transitions[1]); } } @Override public String toString() { StringBuffer result = new StringBuffer(); if(accept != null) { result.append("(" + accept + ") "); } if(transitions[0] != null) { result.append(" " + transitions[0]); } if(transitions[1] != null) { result.append(" " + transitions[1]); } return result.toString(); } } public static class Transition { public CharSet chars; public int destination; public Transition(CharSet chars, int destination) { this.chars = chars; this.destination = destination; } public Transition(Transition transition) { chars = transition.chars; destination = transition.destination; } @Override public String toString() { return destination + ":{" + chars + "}"; } } } sablecc-3.7/src/org/sablecc/sablecc/NoCast.java000066400000000000000000000011231265440641200213600ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; public class NoCast implements Cast { public final static NoCast instance = new NoCast(); private NoCast() {} @Override public Object cast(Object o) { return o; } } sablecc-3.7/src/org/sablecc/sablecc/NodeCast.java000066400000000000000000000012061265440641200216730ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import org.sablecc.sablecc.node.*; public class NodeCast implements Cast { public final static NodeCast instance = new NodeCast(); private NodeCast() {} @Override public Object cast(Object o) { return (Node) o; } } sablecc-3.7/src/org/sablecc/sablecc/PrettyPrinter.java000066400000000000000000000172101265440641200230300ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; public class PrettyPrinter extends DepthFirstAdapter { public static String production_INDENT = " " ; public static String prod_transform_INDENT = " "; public static String alternative_INDENT = " " ; public static String alt_transform_INDENT = " " ; @Override public void caseAProductions(AProductions node) { System.err.println("Productions \n"); AProd [] prods = (AProd [])node.getProds().toArray(new AProd[0]); for(int i = 0; i < prods.length; i++) { prods[i].apply(this); } } @Override public void caseAProd(AProd node) { System.err.print(production_INDENT + node.getId().getText()); String hasProdTransform = "="; if(node.getArrow() == null) { hasProdTransform = ""; System.err.println(" = "); } System.err.println(); AElem[] elems = (AElem [])node.getProdTransform().toArray(new AElem[0]); //if(node.getArrow() != null) if(elems.length > 0) { System.err.print(prod_transform_INDENT + "{-> "); for(int i=0; i "); Object []terms = (Object[]) node.getTerms().toArray(); for(int i=0; i 0) { for(int i=0; i 0) { for(int i=0; i 0) { AAstProd firstAstProd = (AAstProd)listProds.getFirst(); firstAstProduction = "P" + ResolveIds.name(firstAstProd.getId().getText()); } } @Override public void inAAstProd(AAstProd node) { currentProd = ResolveIds.name(node.getId().getText()); String name = "P" + currentProd; if(ast_prods.put(name, node) != null) { error(node.getId(), name); } ast_names.put(node, name); } @Override public void inAAstAlt(final AAstAlt alt) { if(alt.getAltName() != null) { currentAlt = "A" + ResolveIds.name(alt.getAltName().getText()) + currentProd; if(ast_alts.put(currentAlt, alt) != null) { error(alt.getAltName(), currentAlt); } ast_names.put(alt, currentAlt); } else { currentAlt = "A" + currentProd; if(ast_alts.put(currentAlt, alt) != null) { error(currentAlt); } ast_names.put(alt, currentAlt); } } //Only Abstract Syntax Tree section is concerned by the visitor here. @Override public void caseAProductions(AProductions node) {} @Override public void caseAElem(final AElem elem) { String name; String elem_name; TId tid; if(elem.getElemName() != null) { tid = elem.getElemName(); } else { tid = elem.getId(); } elem_name = tid.getText(); name = currentAlt + "." + ResolveIds.name(elem_name); if(ast_elems.put(name, elem) != null) { error(tid, name); } if(elem_name.equals("class")) { error5(tid); } ast_names.put(elem, ResolveIds.name(elem_name)); } @Override public void outAAstProd(AAstProd prod) { prod.apply(new DepthFirstAdapter() { @Override public void caseAElem(AElem node) { String name = ResolveIds.name(node.getId().getText()); if(node.getSpecifier() != null) { if(node.getSpecifier() instanceof ATokenSpecifier) { ast_elemTypes.put(node, "T" + name); } else { ast_elemTypes.put(node, "P" + name); } } else { Object token = astIds.tokens.get("T" + name); if(token != null) { ast_elemTypes.put(node, "T" + name); } else { ast_elemTypes.put(node, "P" + name); } } } } ); } @Override public void outAAst(AAst prod) { prod.apply(new DepthFirstAdapter() { @Override public void caseAElem(AElem node) { String name = ResolveIds.name(node.getId().getText()); if(node.getSpecifier() != null) { if(node.getSpecifier() instanceof ATokenSpecifier) { if(astIds.tokens.get("T" + name) == null) { error2(node.getId(), "T" + name); } if(astIds.ignTokens.get("T" + name) != null) { error3(node.getId(), "T" + name); } ast_elemTypes.put(node, "T" + name); } else { if(ast_prods.get("P" + name) == null) { error2(node.getId(), "P" + name); } ast_elemTypes.put(node, "P" + name); } } else { Object token = astIds.tokens.get("T" + name); Object ignToken = astIds.ignTokens.get("T" + name); //Object production = astIds.prods.get("P" + name); Object ast_production = ast_prods.get("P" + name); //if() if((token == null) && (ast_production == null)) { error2(node.getId(), "P" + name + " and T" + name ); } //if the alternative element is a token if(token != null) { //and also appears to be a valid production, there is an ambiguity if( ast_production != null ) { error4(node.getId(), "P" + name + " and T" + name); } //it should not be an ignored token if(ignToken != null) { error3(node.getId(), "T" + name); } ast_elemTypes.put(node, "T" + name); } //the alternative element is a production and everything is fine else { ast_elemTypes.put(node, "P" + name); } } } } ); } public void defaultcase(Node node) { if(node instanceof Token) { Token t = (Token) node; lastLine = t.getLine(); lastPos = t.getPos() + t.getText().length(); } } private static void error(Token token, String name) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "Redefinition of " + name + "."); } private void error(String name) { throw new RuntimeException( "[" + lastLine + "," + lastPos + "] " + "Redefinition of " + name + "."); } private static void error2(Token token, String name) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + name + " undefined. If it is a production, It should be defined in AST section"); } private static void error3(Token token, String name) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + name + " is ignored."); } private static void error4(Token token, String name) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "ambiguous " + name + "."); } private static void error5(Token token) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "class is an invalid element name."); } @Override public String toString() { StringBuffer s = new StringBuffer(); String nl = System.getProperty("line.separator"); s.append("Productions:"); s.append(nl); s.append(ast_prods); s.append(nl); s.append("Alternatives:"); s.append(nl); s.append(ast_alts); s.append(nl); s.append("Elements:"); s.append(nl); s.append(ast_elems); s.append(nl); return s.toString(); } } sablecc-3.7/src/org/sablecc/sablecc/ResolveIds.java000066400000000000000000000441751265440641200222660ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.io.*; import java.util.*; import org.sablecc.sablecc.analysis.*; import org.sablecc.sablecc.node.*; @SuppressWarnings({"rawtypes","unchecked"}) public class ResolveIds extends DepthFirstAdapter { public final Map helpers = new TypedTreeMap( StringComparator.instance, StringCast.instance, NodeCast.instance); public final Map states = new TypedTreeMap( StringComparator.instance, StringCast.instance, NodeCast.instance); public final Map tokens = new TypedTreeMap( StringComparator.instance, StringCast.instance, NodeCast.instance); public final Map ignTokens = new TypedTreeMap( StringComparator.instance, StringCast.instance, NodeCast.instance); public final Map prods = new TypedTreeMap( StringComparator.instance, StringCast.instance, NodeCast.instance); public final Map alts = new TypedHashMap( StringCast.instance, NodeCast.instance); public final Map elems = new TypedHashMap( StringCast.instance, NodeCast.instance); public final Map names = new TypedHashMap( NodeCast.instance, StringCast.instance); public final Map errorNames = new TypedHashMap( NodeCast.instance, StringCast.instance); public final Map elemTypes = new TypedHashMap( NodeCast.instance, StringCast.instance); public final Map altsElemNameTypes = new TypedHashMap( StringCast.instance, StringCast.instance); // This map will serve for simpleTerm and simplelistTerm type within an altTransform // Inside an altTransform, one would look at this map to know its type. (P... or T...) public final Map altsElemTypes = new TypedHashMap( StringCast.instance, StringCast.instance); public final Map fixedTokens = new TypedHashMap( NodeCast.instance, BooleanCast.instance); public final List tokenList = new TypedLinkedList(StringCast.instance); public final LinkedList stateList = new TypedLinkedList(StringCast.instance); public File pkgDir; public String pkgName = ""; // private boolean processingStates; // private boolean processingIgnTokens; String currentProd; String currentAlt; private int lastLine; private int lastPos; public ResolveIds(File currentDir) { pkgDir = currentDir; } @Override public void inAGrammar(AGrammar node) { TPkgId[] temp = (TPkgId []) node.getPackage().toArray(new TPkgId[0]); if(temp.length > 0) { pkgName = temp[0].getText(); pkgDir = new File(pkgDir, temp[0].getText()); for(int i=1; i prod_transform1 prod_transform2 prod_transform3...}) * are defined as production in the section Abstract Syntax Tree. */ @SuppressWarnings({"rawtypes","unchecked"}) public class ResolveProdTransformIds extends DepthFirstAdapter { private ResolveAstIds transformIds; private LinkedList listElems; private String prod_name; public LinkedList listProdTransformList = new LinkedList(); private LinkedList listProdTransformContainsList; //Map of production transformation element type. The key of this map //is the node of this element in the AST. public final Map prodTransformElemTypes = new TypedHashMap( NoCast.instance, StringCast.instance); //This map contains the same information as the other one just above. //But the keys for this map are String ("ProdName.ElemTransformationName") public final Map prodTransformElemTypesString = new TypedHashMap( StringCast.instance, StringCast.instance); //Map of Productions which transformations contains list elements. public Map mapProdTransformContainsList = new TypedTreeMap( StringComparator.instance, StringCast.instance, ListCast.instance); //Map of all Production transformations elements. public final Map prod_transforms = new TypedTreeMap( StringComparator.instance, StringCast.instance, NoCast.instance); public ResolveProdTransformIds(ResolveAstIds ids) { transformIds = ids; } @Override public void caseAProd(final AProd production) { prod_name = (String)transformIds.astIds.names.get(production); AElem temp[] = (AElem [])production.getProdTransform().toArray(new AElem[0]); listProdTransformContainsList = new LinkedList(); listElems = new LinkedList(); if( temp.length > 1 ) { listProdTransformList.add(prod_name); } for(int i=0; i 0) { sizeNewTerm = node.getParams().size(); } int sizeAstAlt = 0; if( ((AAstAlt)transformIds.ast_alts.get(currentAstAlt) ).getElems() != null) { sizeAstAlt = ( (LinkedList)((AAstAlt)transformIds.ast_alts.get(currentAstAlt) ).getElems()).size(); } if(sizeNewTerm != sizeAstAlt) { error8( ((AProdName)node.getProdName()).getId(), currentAstAlt); } AProdName aProdName = (AProdName)node.getProdName(); String type = "P" + ResolveIds.name(aProdName.getId().getText()); altTransformElemTypes.put(node, type); AAstAlt astAlt = (AAstAlt)transformIds.ast_alts.get(currentAstAlt); if(node.getParams().size() > 0 && astAlt.getElems().size() > 0) { Object elemsTable[] = astAlt.getElems().toArray(); Object paramsTable[] = node.getParams().toArray(); String termType, elemType; //here, we're checking the type compabitlity between for a new node creation for(int j=0; j 0) { sizeNewTerm = node.getParams().size(); } int sizeAstAlt = 0; if( ((AAstAlt)transformIds.ast_alts.get(currentAstAlt) ).getElems() != null) { sizeAstAlt = ( (LinkedList)((AAstAlt)transformIds.ast_alts.get(currentAstAlt) ).getElems()).size(); } if(sizeNewTerm != sizeAstAlt) { error8( ((AProdName)node.getProdName()).getId(), currentAstAlt); } AProdName aProdName = (AProdName)node.getProdName(); String type = "P" + ResolveIds.name(aProdName.getId().getText()); altTransformElemTypes.put(node, type); AAstAlt astAlt = (AAstAlt)transformIds.ast_alts.get(currentAstAlt); if(node.getParams().size() > 0 && astAlt.getElems().size() > 0) { Object elemsTable[] = astAlt.getElems().toArray(); Object paramsTable[] = node.getParams().toArray(); String termType, elemType; //here, we're checking the type compabitlity between for a new node creation for(int j=0; j= 1) { curr_prod_has_prodTransform = true; curr_prodTransformElems = prodTransform.toArray(); prodTransformElemType = (String)prodTransformIds.prodTransformElemTypes.get(curr_prodTransformElems[0]); } else if(production.getArrow() == null) { curr_prod_has_prodTransform = false; String []tab = new String[1]; tab[0] = "P" + ResolveIds.name(production.getId().getText()); curr_prodTransformElems = (Object[])tab; prodTransformElemType = (String)curr_prodTransformElems[0]; } else { curr_prod_has_prodTransform = false; String []tab = new String[1]; tab[0] = "nothing"; curr_prodTransformElems = (Object[])tab; prodTransformIds.prodTransformElemTypes.put(prodTransform, "nothing"); prodTransformElemType = (String)curr_prodTransformElems[0]; } if(firstProduction) { if( !prodTransformElemType.equals(transformIds.getFirstAstProduction()) ) { error11(); } firstProduction = false; } } @Override public void inAAltTransform(AAltTransform node) { Object curr_altTransformTerms[] = node.getTerms().toArray(); for(int k = 0; k < curr_altTransformTerms.length; k++) { String prodTransformElemType, altTransformTermType; if(curr_prod_has_prodTransform) { prodTransformElemType = (String)prodTransformIds.prodTransformElemTypes.get(curr_prodTransformElems[k]); } else { prodTransformElemType = (String)curr_prodTransformElems[k]; } altTransformTermType = (String)altTransformElemTypes.get(curr_altTransformTerms[k]); PUnOp elemOp = ((AElem)curr_prodTransformElems[k]).getUnOp(); checkTypeCompability(prodTransformElemType, altTransformTermType, elemOp, node.getLBrace()); /* if( !checkTypeCompability(prodTransformElemType, altTransformTermType, elemOp) ) { error10(node.getLBrace(), prodTransformElemType, altTransformTermType); } */ } if(curr_altTransformTerms.length == 0) { String prodTransformElemType = (String)curr_prodTransformElems[0]; String altTransformTermType = (String)altTransformElemTypes.get(node); if(!prodTransformElemType.equals(altTransformTermType)) { error10(node.getLBrace(), prodTransformElemType, altTransformTermType); } } } } ); } } private void checkTypeCompability(String elemType, String termType, PUnOp elemOp, Token token) { if( elemOp != null ) { if( elemOp instanceof AStarUnOp) { if(!elemType.startsWith("L") ) { elemType = "L" + elemType; } if(!elemType.endsWith("?")) { elemType = elemType + "?"; } } else if( elemOp instanceof APlusUnOp) { if(!elemType.startsWith("L")) { elemType = "L" + elemType; } } else { if(!elemType.endsWith("?")) { elemType = elemType + "?"; } } } boolean result; if(!elemType.endsWith("?")) { result = termType.equals(elemType); } //elemType ends with a ? else { //the elem type is a list. (elem type is the excpecting type) if(elemType.startsWith("L")) { result = termType.equals(elemType) || termType.equals(elemType.substring(0, elemType.length()-1)) || termType.equals("LNull") ; } else { result = termType.equals(elemType) || termType.equals(elemType.substring(0, elemType.length()-1)) || termType.equals("Null") ; } } if(!result) { error10(token, elemType, termType); } } private static void error1(Token token, String name) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "production " + name + " was transformed, and may not appear here undecorated."); } private void error2(Token token) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "this alternative transformation is incorrect because the number of "+ " production transformations and alternatives don't match" ); } private static void error3(Token token, String name) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + name + " must be one of the elements on the left side of the arrow "+ " or is already refered to in this alternative" ); } private static void error4(Token token) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "tokens are never transformed. This syntax is incorrect"); } private static void error5(Token token, String prod_name, String name) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "production " + prod_name + " was never transformed to "+name+ " or #"+name+"# cannot be refered by #" + prod_name + "# twice in the same alternative"); } private static void error6(Token token, String name) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "alternative "+ name +" doesn't exist in section AST"); } private static void error7(Token token, String name) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "Production "+ name + " doesn't exist in section AST"); } private static void error8(Token token, String name) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "The number of parameters request for this alternative in "+ "section AST doesn't match"); } private static void error9(Token token) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "All the elements within a list must have the same type"); } private static void error10(Token token, String prodName, String altName) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "expecting #" + prodName + "# when #" + altName + "# was found"); } private static void error11() { throw new RuntimeException( "The first production transformation must refered to the first production in section AST" ); } private static void error_0(Token token) { throw new RuntimeException( "[" + token.getLine() + "," + token.getPos() + "] " + "The first production's transformation must be only one elements without an operator."); } @Override public String toString() { StringBuffer s = new StringBuffer(); String nl = System.getProperty("line.separator"); s.append("ast_elems"); s.append(nl); s.append(nl); return s.toString(); } } sablecc-3.7/src/org/sablecc/sablecc/SableCC.java000066400000000000000000000202661265440641200214360ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ package org.sablecc.sablecc; import java.io.*; import java.util.*; import org.sablecc.sablecc.lexer.*; import org.sablecc.sablecc.node.*; import org.sablecc.sablecc.parser.*; @SuppressWarnings({"rawtypes","unchecked"}) public class SableCC { private static boolean processInlining = true; static int inliningMaxAlts = 20; private static boolean prettyPrinting = false; private static final String OPT_LICENSE = "--license"; private static final String OPT_D = "-d"; private static final String OPT_NO_INLINE = "--no-inline"; private static final String OPT_INLINE_MAX_ALTS = "--inline-max-alts"; private static final String OPT_PRETTY_PRINT = "--pretty-print"; private static void displayCopyright() { System.out.println(); System.out.println("SableCC version " + Version.VERSION); System.out.println("Copyright (C) 1997-2012 Etienne M. Gagnon and"); System.out.println("others. All rights reserved."); System.out.println(); System.out.println("This software comes with ABSOLUTELY NO WARRANTY. This is free software,"); System.out.println("and you are welcome to redistribute it under certain conditions."); System.out.println(); System.out.println("Type 'sablecc -license' to view"); System.out.println("the complete copyright notice and license."); System.out.println(); } private static void displayUsage() { System.out.println("Usage:"); System.out.println(" sablecc [" + OPT_D + " destination] [" + OPT_NO_INLINE + "] [" + OPT_INLINE_MAX_ALTS + " number] [" + OPT_PRETTY_PRINT + "] filename [filename]..."); System.out.println(" sablecc " + OPT_LICENSE); } public static void main(String[] arguments) { String d_option = null; Vector filename = new Vector(); if(arguments.length == 0) { displayCopyright(); displayUsage(); System.exit(1); } if((arguments.length == 1) && (arguments[0].equals(OPT_LICENSE))) { new DisplayLicense(); System.exit(0); } displayCopyright(); { int arg = 0; while(arg < arguments.length) { if(arguments[arg].equals(OPT_D)) { if((d_option == null) && (++arg < arguments.length)) { d_option = arguments[arg]; } else { displayUsage(); System.exit(1); } } else if(arguments[arg].equals(OPT_NO_INLINE)) { processInlining = false; } /* A production is not inlined if it has more than * inliningMaxAlts alternatives. The default value is 20. */ else if(arguments[arg].equals(OPT_INLINE_MAX_ALTS)) { try { inliningMaxAlts = Integer.parseInt(arguments[++arg]); } catch(Exception e) { displayUsage(); System.exit(1); } } /* if prettyprint flag is set to true, only the transformed grammar is printed on standard output */ else if(arguments[arg].equals(OPT_PRETTY_PRINT)) { prettyPrinting = true; } else { filename.addElement(arguments[arg]); } arg++; } if(filename.size() == 0) { displayUsage(); System.exit(1); } } try { for(int i=0; i _$1$_ = new LinkedList<$0$>(); $ Macro:ConstructorHeader public $0$( $ Macro:ConstructorHeaderDeclNode @SuppressWarnings("hiding") $0$ _$1$_$2$ $ Macro:ConstructorHeaderDeclList @SuppressWarnings("hiding") List _$1$_$2$ $ Macro:ConstructorBodyHeader ) { // Constructor $ Macro:ConstructorBodyNode set$0$(_$1$_); $ Macro:ConstructorBodyList set$0$(_$1$_); $ Macro:ConstructorBodyTail } $ Macro:CloneHeader @Override public Object clone() { return new $0$( $ Macro:CloneBodyNode cloneNode(this._$1$_)$2$ $ Macro:CloneBodyList cloneList(this._$0$_)$1$ $ Macro:CloneTail ); } $ Macro:Apply @Override public void apply(Switch sw) { ((Analysis) sw).case$0$(this); } $ Macro:GetSetNode public $0$ get$1$() { return this._$2$_; } public void set$1$($0$ node) { if(this._$2$_ != null) { this._$2$_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._$2$_ = node; } $ Macro:GetSetList public LinkedList<$2$> get$0$() { return this._$1$_; } public void set$0$(List list) { for($2$ e : this._$1$_) { e.parent(null); } this._$1$_.clear(); for(Object obj_e : list) { $2$ e = ($2$) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._$1$_.add(e); } } $ Macro:ToStringHeader @Override public String toString() { return "" $ Macro:ToStringBodyNode + toString(this._$0$_) $ Macro:ToStringBodyList + toString(this._$0$_) $ Macro:ToStringTail ; } $ Macro:RemoveChildHeader @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child $ Macro:RemoveChildNode if(this._$0$_ == child) { this._$0$_ = null; return; } $ Macro:RemoveChildList if(this._$0$_.remove(child)) { return; } $ Macro:RemoveChildTail throw new RuntimeException("Not a child."); } $ Macro:ReplaceChildHeader @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child $ Macro:ReplaceChildNode if(this._$0$_ == oldChild) { set$1$(($2$) newChild); return; } $ Macro:ReplaceChildList for(ListIterator<$1$> i = this._$0$_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set(($1$) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } $ Macro:ReplaceChildTail throw new RuntimeException("Not a child."); } $ Macro:AlternativeTail } $ sablecc-3.7/src/org/sablecc/sablecc/analyses.txt000066400000000000000000000121231265440641200217100ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ Macro:AnalysisHeader /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import $1$.*; public interface Analysis extends Switch { Object getIn(Node node); void setIn(Node node, Object o); Object getOut(Node node); void setOut(Node node, Object o); $ Macro:AnalysisStart void caseStart(Start node); $ Macro:AnalysisBody void case$0$($0$ node); $ Macro:AnalysisTail void caseEOF(EOF node); void caseInvalidToken(InvalidToken node); } $ Macro:AnalysisAdapterHeader /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import java.util.*; import $1$.*; public class AnalysisAdapter implements Analysis { private Hashtable in; private Hashtable out; @Override public Object getIn(Node node) { if(this.in == null) { return null; } return this.in.get(node); } @Override public void setIn(Node node, Object o) { if(this.in == null) { this.in = new Hashtable(1); } if(o != null) { this.in.put(node, o); } else { this.in.remove(node); } } @Override public Object getOut(Node node) { if(this.out == null) { return null; } return this.out.get(node); } @Override public void setOut(Node node, Object o) { if(this.out == null) { this.out = new Hashtable(1); } if(o != null) { this.out.put(node, o); } else { this.out.remove(node); } } $ Macro:AnalysisAdapterStart @Override public void caseStart(Start node) { defaultCase(node); } $ Macro:AnalysisAdapterBody @Override public void case$0$($0$ node) { defaultCase(node); } $ Macro:AnalysisAdapterTail @Override public void caseEOF(EOF node) { defaultCase(node); } @Override public void caseInvalidToken(InvalidToken node) { defaultCase(node); } public void defaultCase(@SuppressWarnings("unused") Node node) { // do nothing } } $ Macro:DepthFirstAdapterHeader /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import java.util.*; import $1$.*; public class DepthFirstAdapter extends AnalysisAdapter { public void inStart(Start node) { defaultIn(node); } public void outStart(Start node) { defaultOut(node); } public void defaultIn(@SuppressWarnings("unused") Node node) { // Do nothing } public void defaultOut(@SuppressWarnings("unused") Node node) { // Do nothing } @Override public void caseStart(Start node) { inStart(node); node.get$2$().apply(this); node.getEOF().apply(this); outStart(node); } $ Macro:ReversedDepthFirstAdapterHeader /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import java.util.*; import $1$.*; public class ReversedDepthFirstAdapter extends AnalysisAdapter { public void inStart(Start node) { defaultIn(node); } public void outStart(Start node) { defaultOut(node); } public void defaultIn(@SuppressWarnings("unused") Node node) { // Do nothing } public void defaultOut(@SuppressWarnings("unused") Node node) { // Do nothing } @Override public void caseStart(Start node) { inStart(node); node.getEOF().apply(this); node.get$2$().apply(this); outStart(node); } $ Macro:DepthFirstAdapterInOut public void in$0$($0$ node) { defaultIn(node); } public void out$0$($0$ node) { defaultOut(node); } $ Macro:DepthFirstAdapterCaseHeader @Override public void case$0$($0$ node) { in$0$(node); $ Macro:DepthFirstAdapterCaseBodyNode if(node.get$0$() != null) { node.get$0$().apply(this); } $ Macro:DepthFirstAdapterCaseBodyList { List<$1$> copy = new ArrayList<$1$>(node.get$0$()); for($1$ e : copy) { e.apply(this); } } $ Macro:ReversedDepthFirstAdapterCaseBodyList { List<$1$> copy = new ArrayList<$1$>(node.get$0$()); Collections.reverse(copy); for($1$ e : copy) { e.apply(this); } } $ Macro:DepthFirstAdapterCaseTail out$0$(node); } $ Macro:DepthFirstAdapterTail } $ sablecc-3.7/src/org/sablecc/sablecc/analysis/000077500000000000000000000000001265440641200211545ustar00rootroot00000000000000sablecc-3.7/src/org/sablecc/sablecc/analysis/Analysis.java000066400000000000000000000071771265440641200236160ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.analysis; import org.sablecc.sablecc.node.*; public interface Analysis extends Switch { Object getIn(Node node); void setIn(Node node, Object o); Object getOut(Node node); void setOut(Node node, Object o); void caseStart(Start node); void caseAGrammar(AGrammar node); void caseAHelpers(AHelpers node); void caseAHelperDef(AHelperDef node); void caseAStates(AStates node); void caseATokens(ATokens node); void caseATokenDef(ATokenDef node); void caseAStateList(AStateList node); void caseAStateListTail(AStateListTail node); void caseATransition(ATransition node); void caseAIgnTokens(AIgnTokens node); void caseARegExp(ARegExp node); void caseAConcat(AConcat node); void caseAUnExp(AUnExp node); void caseACharBasic(ACharBasic node); void caseASetBasic(ASetBasic node); void caseAStringBasic(AStringBasic node); void caseAIdBasic(AIdBasic node); void caseARegExpBasic(ARegExpBasic node); void caseACharChar(ACharChar node); void caseADecChar(ADecChar node); void caseAHexChar(AHexChar node); void caseAOperationSet(AOperationSet node); void caseAIntervalSet(AIntervalSet node); void caseAStarUnOp(AStarUnOp node); void caseAQMarkUnOp(AQMarkUnOp node); void caseAPlusUnOp(APlusUnOp node); void caseAPlusBinOp(APlusBinOp node); void caseAMinusBinOp(AMinusBinOp node); void caseAProductions(AProductions node); void caseAProd(AProd node); void caseAAlt(AAlt node); void caseAAltTransform(AAltTransform node); void caseANewTerm(ANewTerm node); void caseAListTerm(AListTerm node); void caseASimpleTerm(ASimpleTerm node); void caseANullTerm(ANullTerm node); void caseANewListTerm(ANewListTerm node); void caseASimpleListTerm(ASimpleListTerm node); void caseAProdName(AProdName node); void caseAElem(AElem node); void caseATokenSpecifier(ATokenSpecifier node); void caseAProductionSpecifier(AProductionSpecifier node); void caseAAst(AAst node); void caseAAstProd(AAstProd node); void caseAAstAlt(AAstAlt node); void caseTPkgId(TPkgId node); void caseTPackage(TPackage node); void caseTStates(TStates node); void caseTHelpers(THelpers node); void caseTTokens(TTokens node); void caseTIgnored(TIgnored node); void caseTProductions(TProductions node); void caseTAbstract(TAbstract node); void caseTSyntax(TSyntax node); void caseTTree(TTree node); void caseTNew(TNew node); void caseTNull(TNull node); void caseTTokenSpecifier(TTokenSpecifier node); void caseTProductionSpecifier(TProductionSpecifier node); void caseTDot(TDot node); void caseTDDot(TDDot node); void caseTSemicolon(TSemicolon node); void caseTEqual(TEqual node); void caseTLBkt(TLBkt node); void caseTRBkt(TRBkt node); void caseTLPar(TLPar node); void caseTRPar(TRPar node); void caseTLBrace(TLBrace node); void caseTRBrace(TRBrace node); void caseTPlus(TPlus node); void caseTMinus(TMinus node); void caseTQMark(TQMark node); void caseTStar(TStar node); void caseTBar(TBar node); void caseTComma(TComma node); void caseTSlash(TSlash node); void caseTArrow(TArrow node); void caseTColon(TColon node); void caseTId(TId node); void caseTChar(TChar node); void caseTDecChar(TDecChar node); void caseTHexChar(THexChar node); void caseTString(TString node); void caseTBlank(TBlank node); void caseTComment(TComment node); void caseEOF(EOF node); void caseInvalidToken(InvalidToken node); } sablecc-3.7/src/org/sablecc/sablecc/analysis/AnalysisAdapter.java000066400000000000000000000234721265440641200251130ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.analysis; import java.util.*; import org.sablecc.sablecc.node.*; public class AnalysisAdapter implements Analysis { private Hashtable in; private Hashtable out; @Override public Object getIn(Node node) { if(this.in == null) { return null; } return this.in.get(node); } @Override public void setIn(Node node, Object o) { if(this.in == null) { this.in = new Hashtable(1); } if(o != null) { this.in.put(node, o); } else { this.in.remove(node); } } @Override public Object getOut(Node node) { if(this.out == null) { return null; } return this.out.get(node); } @Override public void setOut(Node node, Object o) { if(this.out == null) { this.out = new Hashtable(1); } if(o != null) { this.out.put(node, o); } else { this.out.remove(node); } } @Override public void caseStart(Start node) { defaultCase(node); } @Override public void caseAGrammar(AGrammar node) { defaultCase(node); } @Override public void caseAHelpers(AHelpers node) { defaultCase(node); } @Override public void caseAHelperDef(AHelperDef node) { defaultCase(node); } @Override public void caseAStates(AStates node) { defaultCase(node); } @Override public void caseATokens(ATokens node) { defaultCase(node); } @Override public void caseATokenDef(ATokenDef node) { defaultCase(node); } @Override public void caseAStateList(AStateList node) { defaultCase(node); } @Override public void caseAStateListTail(AStateListTail node) { defaultCase(node); } @Override public void caseATransition(ATransition node) { defaultCase(node); } @Override public void caseAIgnTokens(AIgnTokens node) { defaultCase(node); } @Override public void caseARegExp(ARegExp node) { defaultCase(node); } @Override public void caseAConcat(AConcat node) { defaultCase(node); } @Override public void caseAUnExp(AUnExp node) { defaultCase(node); } @Override public void caseACharBasic(ACharBasic node) { defaultCase(node); } @Override public void caseASetBasic(ASetBasic node) { defaultCase(node); } @Override public void caseAStringBasic(AStringBasic node) { defaultCase(node); } @Override public void caseAIdBasic(AIdBasic node) { defaultCase(node); } @Override public void caseARegExpBasic(ARegExpBasic node) { defaultCase(node); } @Override public void caseACharChar(ACharChar node) { defaultCase(node); } @Override public void caseADecChar(ADecChar node) { defaultCase(node); } @Override public void caseAHexChar(AHexChar node) { defaultCase(node); } @Override public void caseAOperationSet(AOperationSet node) { defaultCase(node); } @Override public void caseAIntervalSet(AIntervalSet node) { defaultCase(node); } @Override public void caseAStarUnOp(AStarUnOp node) { defaultCase(node); } @Override public void caseAQMarkUnOp(AQMarkUnOp node) { defaultCase(node); } @Override public void caseAPlusUnOp(APlusUnOp node) { defaultCase(node); } @Override public void caseAPlusBinOp(APlusBinOp node) { defaultCase(node); } @Override public void caseAMinusBinOp(AMinusBinOp node) { defaultCase(node); } @Override public void caseAProductions(AProductions node) { defaultCase(node); } @Override public void caseAProd(AProd node) { defaultCase(node); } @Override public void caseAAlt(AAlt node) { defaultCase(node); } @Override public void caseAAltTransform(AAltTransform node) { defaultCase(node); } @Override public void caseANewTerm(ANewTerm node) { defaultCase(node); } @Override public void caseAListTerm(AListTerm node) { defaultCase(node); } @Override public void caseASimpleTerm(ASimpleTerm node) { defaultCase(node); } @Override public void caseANullTerm(ANullTerm node) { defaultCase(node); } @Override public void caseANewListTerm(ANewListTerm node) { defaultCase(node); } @Override public void caseASimpleListTerm(ASimpleListTerm node) { defaultCase(node); } @Override public void caseAProdName(AProdName node) { defaultCase(node); } @Override public void caseAElem(AElem node) { defaultCase(node); } @Override public void caseATokenSpecifier(ATokenSpecifier node) { defaultCase(node); } @Override public void caseAProductionSpecifier(AProductionSpecifier node) { defaultCase(node); } @Override public void caseAAst(AAst node) { defaultCase(node); } @Override public void caseAAstProd(AAstProd node) { defaultCase(node); } @Override public void caseAAstAlt(AAstAlt node) { defaultCase(node); } @Override public void caseTPkgId(TPkgId node) { defaultCase(node); } @Override public void caseTPackage(TPackage node) { defaultCase(node); } @Override public void caseTStates(TStates node) { defaultCase(node); } @Override public void caseTHelpers(THelpers node) { defaultCase(node); } @Override public void caseTTokens(TTokens node) { defaultCase(node); } @Override public void caseTIgnored(TIgnored node) { defaultCase(node); } @Override public void caseTProductions(TProductions node) { defaultCase(node); } @Override public void caseTAbstract(TAbstract node) { defaultCase(node); } @Override public void caseTSyntax(TSyntax node) { defaultCase(node); } @Override public void caseTTree(TTree node) { defaultCase(node); } @Override public void caseTNew(TNew node) { defaultCase(node); } @Override public void caseTNull(TNull node) { defaultCase(node); } @Override public void caseTTokenSpecifier(TTokenSpecifier node) { defaultCase(node); } @Override public void caseTProductionSpecifier(TProductionSpecifier node) { defaultCase(node); } @Override public void caseTDot(TDot node) { defaultCase(node); } @Override public void caseTDDot(TDDot node) { defaultCase(node); } @Override public void caseTSemicolon(TSemicolon node) { defaultCase(node); } @Override public void caseTEqual(TEqual node) { defaultCase(node); } @Override public void caseTLBkt(TLBkt node) { defaultCase(node); } @Override public void caseTRBkt(TRBkt node) { defaultCase(node); } @Override public void caseTLPar(TLPar node) { defaultCase(node); } @Override public void caseTRPar(TRPar node) { defaultCase(node); } @Override public void caseTLBrace(TLBrace node) { defaultCase(node); } @Override public void caseTRBrace(TRBrace node) { defaultCase(node); } @Override public void caseTPlus(TPlus node) { defaultCase(node); } @Override public void caseTMinus(TMinus node) { defaultCase(node); } @Override public void caseTQMark(TQMark node) { defaultCase(node); } @Override public void caseTStar(TStar node) { defaultCase(node); } @Override public void caseTBar(TBar node) { defaultCase(node); } @Override public void caseTComma(TComma node) { defaultCase(node); } @Override public void caseTSlash(TSlash node) { defaultCase(node); } @Override public void caseTArrow(TArrow node) { defaultCase(node); } @Override public void caseTColon(TColon node) { defaultCase(node); } @Override public void caseTId(TId node) { defaultCase(node); } @Override public void caseTChar(TChar node) { defaultCase(node); } @Override public void caseTDecChar(TDecChar node) { defaultCase(node); } @Override public void caseTHexChar(THexChar node) { defaultCase(node); } @Override public void caseTString(TString node) { defaultCase(node); } @Override public void caseTBlank(TBlank node) { defaultCase(node); } @Override public void caseTComment(TComment node) { defaultCase(node); } @Override public void caseEOF(EOF node) { defaultCase(node); } @Override public void caseInvalidToken(InvalidToken node) { defaultCase(node); } public void defaultCase(@SuppressWarnings("unused") Node node) { // do nothing } } sablecc-3.7/src/org/sablecc/sablecc/analysis/DepthFirstAdapter.java000066400000000000000000000563111265440641200254020ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.analysis; import java.util.*; import org.sablecc.sablecc.node.*; public class DepthFirstAdapter extends AnalysisAdapter { public void inStart(Start node) { defaultIn(node); } public void outStart(Start node) { defaultOut(node); } public void defaultIn(@SuppressWarnings("unused") Node node) { // Do nothing } public void defaultOut(@SuppressWarnings("unused") Node node) { // Do nothing } @Override public void caseStart(Start node) { inStart(node); node.getPGrammar().apply(this); node.getEOF().apply(this); outStart(node); } public void inAGrammar(AGrammar node) { defaultIn(node); } public void outAGrammar(AGrammar node) { defaultOut(node); } @Override public void caseAGrammar(AGrammar node) { inAGrammar(node); { List copy = new ArrayList(node.getPackage()); for(TPkgId e : copy) { e.apply(this); } } if(node.getHelpers() != null) { node.getHelpers().apply(this); } if(node.getStates() != null) { node.getStates().apply(this); } if(node.getTokens() != null) { node.getTokens().apply(this); } if(node.getIgnTokens() != null) { node.getIgnTokens().apply(this); } if(node.getProductions() != null) { node.getProductions().apply(this); } if(node.getAst() != null) { node.getAst().apply(this); } outAGrammar(node); } public void inAHelpers(AHelpers node) { defaultIn(node); } public void outAHelpers(AHelpers node) { defaultOut(node); } @Override public void caseAHelpers(AHelpers node) { inAHelpers(node); { List copy = new ArrayList(node.getHelperDefs()); for(PHelperDef e : copy) { e.apply(this); } } outAHelpers(node); } public void inAHelperDef(AHelperDef node) { defaultIn(node); } public void outAHelperDef(AHelperDef node) { defaultOut(node); } @Override public void caseAHelperDef(AHelperDef node) { inAHelperDef(node); if(node.getId() != null) { node.getId().apply(this); } if(node.getRegExp() != null) { node.getRegExp().apply(this); } outAHelperDef(node); } public void inAStates(AStates node) { defaultIn(node); } public void outAStates(AStates node) { defaultOut(node); } @Override public void caseAStates(AStates node) { inAStates(node); { List copy = new ArrayList(node.getListId()); for(TId e : copy) { e.apply(this); } } outAStates(node); } public void inATokens(ATokens node) { defaultIn(node); } public void outATokens(ATokens node) { defaultOut(node); } @Override public void caseATokens(ATokens node) { inATokens(node); { List copy = new ArrayList(node.getTokenDefs()); for(PTokenDef e : copy) { e.apply(this); } } outATokens(node); } public void inATokenDef(ATokenDef node) { defaultIn(node); } public void outATokenDef(ATokenDef node) { defaultOut(node); } @Override public void caseATokenDef(ATokenDef node) { inATokenDef(node); if(node.getStateList() != null) { node.getStateList().apply(this); } if(node.getId() != null) { node.getId().apply(this); } if(node.getRegExp() != null) { node.getRegExp().apply(this); } if(node.getSlash() != null) { node.getSlash().apply(this); } if(node.getLookAhead() != null) { node.getLookAhead().apply(this); } outATokenDef(node); } public void inAStateList(AStateList node) { defaultIn(node); } public void outAStateList(AStateList node) { defaultOut(node); } @Override public void caseAStateList(AStateList node) { inAStateList(node); if(node.getId() != null) { node.getId().apply(this); } if(node.getTransition() != null) { node.getTransition().apply(this); } { List copy = new ArrayList(node.getStateLists()); for(PStateListTail e : copy) { e.apply(this); } } outAStateList(node); } public void inAStateListTail(AStateListTail node) { defaultIn(node); } public void outAStateListTail(AStateListTail node) { defaultOut(node); } @Override public void caseAStateListTail(AStateListTail node) { inAStateListTail(node); if(node.getId() != null) { node.getId().apply(this); } if(node.getTransition() != null) { node.getTransition().apply(this); } outAStateListTail(node); } public void inATransition(ATransition node) { defaultIn(node); } public void outATransition(ATransition node) { defaultOut(node); } @Override public void caseATransition(ATransition node) { inATransition(node); if(node.getId() != null) { node.getId().apply(this); } outATransition(node); } public void inAIgnTokens(AIgnTokens node) { defaultIn(node); } public void outAIgnTokens(AIgnTokens node) { defaultOut(node); } @Override public void caseAIgnTokens(AIgnTokens node) { inAIgnTokens(node); { List copy = new ArrayList(node.getListId()); for(TId e : copy) { e.apply(this); } } outAIgnTokens(node); } public void inARegExp(ARegExp node) { defaultIn(node); } public void outARegExp(ARegExp node) { defaultOut(node); } @Override public void caseARegExp(ARegExp node) { inARegExp(node); { List copy = new ArrayList(node.getConcats()); for(PConcat e : copy) { e.apply(this); } } outARegExp(node); } public void inAConcat(AConcat node) { defaultIn(node); } public void outAConcat(AConcat node) { defaultOut(node); } @Override public void caseAConcat(AConcat node) { inAConcat(node); { List copy = new ArrayList(node.getUnExps()); for(PUnExp e : copy) { e.apply(this); } } outAConcat(node); } public void inAUnExp(AUnExp node) { defaultIn(node); } public void outAUnExp(AUnExp node) { defaultOut(node); } @Override public void caseAUnExp(AUnExp node) { inAUnExp(node); if(node.getBasic() != null) { node.getBasic().apply(this); } if(node.getUnOp() != null) { node.getUnOp().apply(this); } outAUnExp(node); } public void inACharBasic(ACharBasic node) { defaultIn(node); } public void outACharBasic(ACharBasic node) { defaultOut(node); } @Override public void caseACharBasic(ACharBasic node) { inACharBasic(node); if(node.getChar() != null) { node.getChar().apply(this); } outACharBasic(node); } public void inASetBasic(ASetBasic node) { defaultIn(node); } public void outASetBasic(ASetBasic node) { defaultOut(node); } @Override public void caseASetBasic(ASetBasic node) { inASetBasic(node); if(node.getSet() != null) { node.getSet().apply(this); } outASetBasic(node); } public void inAStringBasic(AStringBasic node) { defaultIn(node); } public void outAStringBasic(AStringBasic node) { defaultOut(node); } @Override public void caseAStringBasic(AStringBasic node) { inAStringBasic(node); if(node.getString() != null) { node.getString().apply(this); } outAStringBasic(node); } public void inAIdBasic(AIdBasic node) { defaultIn(node); } public void outAIdBasic(AIdBasic node) { defaultOut(node); } @Override public void caseAIdBasic(AIdBasic node) { inAIdBasic(node); if(node.getId() != null) { node.getId().apply(this); } outAIdBasic(node); } public void inARegExpBasic(ARegExpBasic node) { defaultIn(node); } public void outARegExpBasic(ARegExpBasic node) { defaultOut(node); } @Override public void caseARegExpBasic(ARegExpBasic node) { inARegExpBasic(node); if(node.getRegExp() != null) { node.getRegExp().apply(this); } outARegExpBasic(node); } public void inACharChar(ACharChar node) { defaultIn(node); } public void outACharChar(ACharChar node) { defaultOut(node); } @Override public void caseACharChar(ACharChar node) { inACharChar(node); if(node.getChar() != null) { node.getChar().apply(this); } outACharChar(node); } public void inADecChar(ADecChar node) { defaultIn(node); } public void outADecChar(ADecChar node) { defaultOut(node); } @Override public void caseADecChar(ADecChar node) { inADecChar(node); if(node.getDecChar() != null) { node.getDecChar().apply(this); } outADecChar(node); } public void inAHexChar(AHexChar node) { defaultIn(node); } public void outAHexChar(AHexChar node) { defaultOut(node); } @Override public void caseAHexChar(AHexChar node) { inAHexChar(node); if(node.getHexChar() != null) { node.getHexChar().apply(this); } outAHexChar(node); } public void inAOperationSet(AOperationSet node) { defaultIn(node); } public void outAOperationSet(AOperationSet node) { defaultOut(node); } @Override public void caseAOperationSet(AOperationSet node) { inAOperationSet(node); if(node.getLeft() != null) { node.getLeft().apply(this); } if(node.getBinOp() != null) { node.getBinOp().apply(this); } if(node.getRight() != null) { node.getRight().apply(this); } outAOperationSet(node); } public void inAIntervalSet(AIntervalSet node) { defaultIn(node); } public void outAIntervalSet(AIntervalSet node) { defaultOut(node); } @Override public void caseAIntervalSet(AIntervalSet node) { inAIntervalSet(node); if(node.getLeft() != null) { node.getLeft().apply(this); } if(node.getRight() != null) { node.getRight().apply(this); } outAIntervalSet(node); } public void inAStarUnOp(AStarUnOp node) { defaultIn(node); } public void outAStarUnOp(AStarUnOp node) { defaultOut(node); } @Override public void caseAStarUnOp(AStarUnOp node) { inAStarUnOp(node); if(node.getStar() != null) { node.getStar().apply(this); } outAStarUnOp(node); } public void inAQMarkUnOp(AQMarkUnOp node) { defaultIn(node); } public void outAQMarkUnOp(AQMarkUnOp node) { defaultOut(node); } @Override public void caseAQMarkUnOp(AQMarkUnOp node) { inAQMarkUnOp(node); if(node.getQMark() != null) { node.getQMark().apply(this); } outAQMarkUnOp(node); } public void inAPlusUnOp(APlusUnOp node) { defaultIn(node); } public void outAPlusUnOp(APlusUnOp node) { defaultOut(node); } @Override public void caseAPlusUnOp(APlusUnOp node) { inAPlusUnOp(node); if(node.getPlus() != null) { node.getPlus().apply(this); } outAPlusUnOp(node); } public void inAPlusBinOp(APlusBinOp node) { defaultIn(node); } public void outAPlusBinOp(APlusBinOp node) { defaultOut(node); } @Override public void caseAPlusBinOp(APlusBinOp node) { inAPlusBinOp(node); outAPlusBinOp(node); } public void inAMinusBinOp(AMinusBinOp node) { defaultIn(node); } public void outAMinusBinOp(AMinusBinOp node) { defaultOut(node); } @Override public void caseAMinusBinOp(AMinusBinOp node) { inAMinusBinOp(node); outAMinusBinOp(node); } public void inAProductions(AProductions node) { defaultIn(node); } public void outAProductions(AProductions node) { defaultOut(node); } @Override public void caseAProductions(AProductions node) { inAProductions(node); { List copy = new ArrayList(node.getProds()); for(PProd e : copy) { e.apply(this); } } outAProductions(node); } public void inAProd(AProd node) { defaultIn(node); } public void outAProd(AProd node) { defaultOut(node); } @Override public void caseAProd(AProd node) { inAProd(node); if(node.getId() != null) { node.getId().apply(this); } if(node.getArrow() != null) { node.getArrow().apply(this); } { List copy = new ArrayList(node.getProdTransform()); for(PElem e : copy) { e.apply(this); } } { List copy = new ArrayList(node.getAlts()); for(PAlt e : copy) { e.apply(this); } } outAProd(node); } public void inAAlt(AAlt node) { defaultIn(node); } public void outAAlt(AAlt node) { defaultOut(node); } @Override public void caseAAlt(AAlt node) { inAAlt(node); if(node.getAltName() != null) { node.getAltName().apply(this); } { List copy = new ArrayList(node.getElems()); for(PElem e : copy) { e.apply(this); } } if(node.getAltTransform() != null) { node.getAltTransform().apply(this); } outAAlt(node); } public void inAAltTransform(AAltTransform node) { defaultIn(node); } public void outAAltTransform(AAltTransform node) { defaultOut(node); } @Override public void caseAAltTransform(AAltTransform node) { inAAltTransform(node); if(node.getLBrace() != null) { node.getLBrace().apply(this); } { List copy = new ArrayList(node.getTerms()); for(PTerm e : copy) { e.apply(this); } } if(node.getRBrace() != null) { node.getRBrace().apply(this); } outAAltTransform(node); } public void inANewTerm(ANewTerm node) { defaultIn(node); } public void outANewTerm(ANewTerm node) { defaultOut(node); } @Override public void caseANewTerm(ANewTerm node) { inANewTerm(node); if(node.getProdName() != null) { node.getProdName().apply(this); } if(node.getLPar() != null) { node.getLPar().apply(this); } { List copy = new ArrayList(node.getParams()); for(PTerm e : copy) { e.apply(this); } } outANewTerm(node); } public void inAListTerm(AListTerm node) { defaultIn(node); } public void outAListTerm(AListTerm node) { defaultOut(node); } @Override public void caseAListTerm(AListTerm node) { inAListTerm(node); if(node.getLBkt() != null) { node.getLBkt().apply(this); } { List copy = new ArrayList(node.getListTerms()); for(PListTerm e : copy) { e.apply(this); } } outAListTerm(node); } public void inASimpleTerm(ASimpleTerm node) { defaultIn(node); } public void outASimpleTerm(ASimpleTerm node) { defaultOut(node); } @Override public void caseASimpleTerm(ASimpleTerm node) { inASimpleTerm(node); if(node.getSpecifier() != null) { node.getSpecifier().apply(this); } if(node.getId() != null) { node.getId().apply(this); } if(node.getSimpleTermTail() != null) { node.getSimpleTermTail().apply(this); } outASimpleTerm(node); } public void inANullTerm(ANullTerm node) { defaultIn(node); } public void outANullTerm(ANullTerm node) { defaultOut(node); } @Override public void caseANullTerm(ANullTerm node) { inANullTerm(node); outANullTerm(node); } public void inANewListTerm(ANewListTerm node) { defaultIn(node); } public void outANewListTerm(ANewListTerm node) { defaultOut(node); } @Override public void caseANewListTerm(ANewListTerm node) { inANewListTerm(node); if(node.getProdName() != null) { node.getProdName().apply(this); } if(node.getLPar() != null) { node.getLPar().apply(this); } { List copy = new ArrayList(node.getParams()); for(PTerm e : copy) { e.apply(this); } } outANewListTerm(node); } public void inASimpleListTerm(ASimpleListTerm node) { defaultIn(node); } public void outASimpleListTerm(ASimpleListTerm node) { defaultOut(node); } @Override public void caseASimpleListTerm(ASimpleListTerm node) { inASimpleListTerm(node); if(node.getSpecifier() != null) { node.getSpecifier().apply(this); } if(node.getId() != null) { node.getId().apply(this); } if(node.getSimpleTermTail() != null) { node.getSimpleTermTail().apply(this); } outASimpleListTerm(node); } public void inAProdName(AProdName node) { defaultIn(node); } public void outAProdName(AProdName node) { defaultOut(node); } @Override public void caseAProdName(AProdName node) { inAProdName(node); if(node.getId() != null) { node.getId().apply(this); } if(node.getProdNameTail() != null) { node.getProdNameTail().apply(this); } outAProdName(node); } public void inAElem(AElem node) { defaultIn(node); } public void outAElem(AElem node) { defaultOut(node); } @Override public void caseAElem(AElem node) { inAElem(node); if(node.getElemName() != null) { node.getElemName().apply(this); } if(node.getSpecifier() != null) { node.getSpecifier().apply(this); } if(node.getId() != null) { node.getId().apply(this); } if(node.getUnOp() != null) { node.getUnOp().apply(this); } outAElem(node); } public void inATokenSpecifier(ATokenSpecifier node) { defaultIn(node); } public void outATokenSpecifier(ATokenSpecifier node) { defaultOut(node); } @Override public void caseATokenSpecifier(ATokenSpecifier node) { inATokenSpecifier(node); outATokenSpecifier(node); } public void inAProductionSpecifier(AProductionSpecifier node) { defaultIn(node); } public void outAProductionSpecifier(AProductionSpecifier node) { defaultOut(node); } @Override public void caseAProductionSpecifier(AProductionSpecifier node) { inAProductionSpecifier(node); outAProductionSpecifier(node); } public void inAAst(AAst node) { defaultIn(node); } public void outAAst(AAst node) { defaultOut(node); } @Override public void caseAAst(AAst node) { inAAst(node); { List copy = new ArrayList(node.getProds()); for(PAstProd e : copy) { e.apply(this); } } outAAst(node); } public void inAAstProd(AAstProd node) { defaultIn(node); } public void outAAstProd(AAstProd node) { defaultOut(node); } @Override public void caseAAstProd(AAstProd node) { inAAstProd(node); if(node.getId() != null) { node.getId().apply(this); } { List copy = new ArrayList(node.getAlts()); for(PAstAlt e : copy) { e.apply(this); } } outAAstProd(node); } public void inAAstAlt(AAstAlt node) { defaultIn(node); } public void outAAstAlt(AAstAlt node) { defaultOut(node); } @Override public void caseAAstAlt(AAstAlt node) { inAAstAlt(node); if(node.getAltName() != null) { node.getAltName().apply(this); } { List copy = new ArrayList(node.getElems()); for(PElem e : copy) { e.apply(this); } } outAAstAlt(node); } } sablecc-3.7/src/org/sablecc/sablecc/analysis/ReversedDepthFirstAdapter.java000066400000000000000000000576661265440641200271200ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.analysis; import java.util.*; import org.sablecc.sablecc.node.*; public class ReversedDepthFirstAdapter extends AnalysisAdapter { public void inStart(Start node) { defaultIn(node); } public void outStart(Start node) { defaultOut(node); } public void defaultIn(@SuppressWarnings("unused") Node node) { // Do nothing } public void defaultOut(@SuppressWarnings("unused") Node node) { // Do nothing } @Override public void caseStart(Start node) { inStart(node); node.getEOF().apply(this); node.getPGrammar().apply(this); outStart(node); } public void inAGrammar(AGrammar node) { defaultIn(node); } public void outAGrammar(AGrammar node) { defaultOut(node); } @Override public void caseAGrammar(AGrammar node) { inAGrammar(node); if(node.getAst() != null) { node.getAst().apply(this); } if(node.getProductions() != null) { node.getProductions().apply(this); } if(node.getIgnTokens() != null) { node.getIgnTokens().apply(this); } if(node.getTokens() != null) { node.getTokens().apply(this); } if(node.getStates() != null) { node.getStates().apply(this); } if(node.getHelpers() != null) { node.getHelpers().apply(this); } { List copy = new ArrayList(node.getPackage()); Collections.reverse(copy); for(TPkgId e : copy) { e.apply(this); } } outAGrammar(node); } public void inAHelpers(AHelpers node) { defaultIn(node); } public void outAHelpers(AHelpers node) { defaultOut(node); } @Override public void caseAHelpers(AHelpers node) { inAHelpers(node); { List copy = new ArrayList(node.getHelperDefs()); Collections.reverse(copy); for(PHelperDef e : copy) { e.apply(this); } } outAHelpers(node); } public void inAHelperDef(AHelperDef node) { defaultIn(node); } public void outAHelperDef(AHelperDef node) { defaultOut(node); } @Override public void caseAHelperDef(AHelperDef node) { inAHelperDef(node); if(node.getRegExp() != null) { node.getRegExp().apply(this); } if(node.getId() != null) { node.getId().apply(this); } outAHelperDef(node); } public void inAStates(AStates node) { defaultIn(node); } public void outAStates(AStates node) { defaultOut(node); } @Override public void caseAStates(AStates node) { inAStates(node); { List copy = new ArrayList(node.getListId()); Collections.reverse(copy); for(TId e : copy) { e.apply(this); } } outAStates(node); } public void inATokens(ATokens node) { defaultIn(node); } public void outATokens(ATokens node) { defaultOut(node); } @Override public void caseATokens(ATokens node) { inATokens(node); { List copy = new ArrayList(node.getTokenDefs()); Collections.reverse(copy); for(PTokenDef e : copy) { e.apply(this); } } outATokens(node); } public void inATokenDef(ATokenDef node) { defaultIn(node); } public void outATokenDef(ATokenDef node) { defaultOut(node); } @Override public void caseATokenDef(ATokenDef node) { inATokenDef(node); if(node.getLookAhead() != null) { node.getLookAhead().apply(this); } if(node.getSlash() != null) { node.getSlash().apply(this); } if(node.getRegExp() != null) { node.getRegExp().apply(this); } if(node.getId() != null) { node.getId().apply(this); } if(node.getStateList() != null) { node.getStateList().apply(this); } outATokenDef(node); } public void inAStateList(AStateList node) { defaultIn(node); } public void outAStateList(AStateList node) { defaultOut(node); } @Override public void caseAStateList(AStateList node) { inAStateList(node); { List copy = new ArrayList(node.getStateLists()); Collections.reverse(copy); for(PStateListTail e : copy) { e.apply(this); } } if(node.getTransition() != null) { node.getTransition().apply(this); } if(node.getId() != null) { node.getId().apply(this); } outAStateList(node); } public void inAStateListTail(AStateListTail node) { defaultIn(node); } public void outAStateListTail(AStateListTail node) { defaultOut(node); } @Override public void caseAStateListTail(AStateListTail node) { inAStateListTail(node); if(node.getTransition() != null) { node.getTransition().apply(this); } if(node.getId() != null) { node.getId().apply(this); } outAStateListTail(node); } public void inATransition(ATransition node) { defaultIn(node); } public void outATransition(ATransition node) { defaultOut(node); } @Override public void caseATransition(ATransition node) { inATransition(node); if(node.getId() != null) { node.getId().apply(this); } outATransition(node); } public void inAIgnTokens(AIgnTokens node) { defaultIn(node); } public void outAIgnTokens(AIgnTokens node) { defaultOut(node); } @Override public void caseAIgnTokens(AIgnTokens node) { inAIgnTokens(node); { List copy = new ArrayList(node.getListId()); Collections.reverse(copy); for(TId e : copy) { e.apply(this); } } outAIgnTokens(node); } public void inARegExp(ARegExp node) { defaultIn(node); } public void outARegExp(ARegExp node) { defaultOut(node); } @Override public void caseARegExp(ARegExp node) { inARegExp(node); { List copy = new ArrayList(node.getConcats()); Collections.reverse(copy); for(PConcat e : copy) { e.apply(this); } } outARegExp(node); } public void inAConcat(AConcat node) { defaultIn(node); } public void outAConcat(AConcat node) { defaultOut(node); } @Override public void caseAConcat(AConcat node) { inAConcat(node); { List copy = new ArrayList(node.getUnExps()); Collections.reverse(copy); for(PUnExp e : copy) { e.apply(this); } } outAConcat(node); } public void inAUnExp(AUnExp node) { defaultIn(node); } public void outAUnExp(AUnExp node) { defaultOut(node); } @Override public void caseAUnExp(AUnExp node) { inAUnExp(node); if(node.getUnOp() != null) { node.getUnOp().apply(this); } if(node.getBasic() != null) { node.getBasic().apply(this); } outAUnExp(node); } public void inACharBasic(ACharBasic node) { defaultIn(node); } public void outACharBasic(ACharBasic node) { defaultOut(node); } @Override public void caseACharBasic(ACharBasic node) { inACharBasic(node); if(node.getChar() != null) { node.getChar().apply(this); } outACharBasic(node); } public void inASetBasic(ASetBasic node) { defaultIn(node); } public void outASetBasic(ASetBasic node) { defaultOut(node); } @Override public void caseASetBasic(ASetBasic node) { inASetBasic(node); if(node.getSet() != null) { node.getSet().apply(this); } outASetBasic(node); } public void inAStringBasic(AStringBasic node) { defaultIn(node); } public void outAStringBasic(AStringBasic node) { defaultOut(node); } @Override public void caseAStringBasic(AStringBasic node) { inAStringBasic(node); if(node.getString() != null) { node.getString().apply(this); } outAStringBasic(node); } public void inAIdBasic(AIdBasic node) { defaultIn(node); } public void outAIdBasic(AIdBasic node) { defaultOut(node); } @Override public void caseAIdBasic(AIdBasic node) { inAIdBasic(node); if(node.getId() != null) { node.getId().apply(this); } outAIdBasic(node); } public void inARegExpBasic(ARegExpBasic node) { defaultIn(node); } public void outARegExpBasic(ARegExpBasic node) { defaultOut(node); } @Override public void caseARegExpBasic(ARegExpBasic node) { inARegExpBasic(node); if(node.getRegExp() != null) { node.getRegExp().apply(this); } outARegExpBasic(node); } public void inACharChar(ACharChar node) { defaultIn(node); } public void outACharChar(ACharChar node) { defaultOut(node); } @Override public void caseACharChar(ACharChar node) { inACharChar(node); if(node.getChar() != null) { node.getChar().apply(this); } outACharChar(node); } public void inADecChar(ADecChar node) { defaultIn(node); } public void outADecChar(ADecChar node) { defaultOut(node); } @Override public void caseADecChar(ADecChar node) { inADecChar(node); if(node.getDecChar() != null) { node.getDecChar().apply(this); } outADecChar(node); } public void inAHexChar(AHexChar node) { defaultIn(node); } public void outAHexChar(AHexChar node) { defaultOut(node); } @Override public void caseAHexChar(AHexChar node) { inAHexChar(node); if(node.getHexChar() != null) { node.getHexChar().apply(this); } outAHexChar(node); } public void inAOperationSet(AOperationSet node) { defaultIn(node); } public void outAOperationSet(AOperationSet node) { defaultOut(node); } @Override public void caseAOperationSet(AOperationSet node) { inAOperationSet(node); if(node.getRight() != null) { node.getRight().apply(this); } if(node.getBinOp() != null) { node.getBinOp().apply(this); } if(node.getLeft() != null) { node.getLeft().apply(this); } outAOperationSet(node); } public void inAIntervalSet(AIntervalSet node) { defaultIn(node); } public void outAIntervalSet(AIntervalSet node) { defaultOut(node); } @Override public void caseAIntervalSet(AIntervalSet node) { inAIntervalSet(node); if(node.getRight() != null) { node.getRight().apply(this); } if(node.getLeft() != null) { node.getLeft().apply(this); } outAIntervalSet(node); } public void inAStarUnOp(AStarUnOp node) { defaultIn(node); } public void outAStarUnOp(AStarUnOp node) { defaultOut(node); } @Override public void caseAStarUnOp(AStarUnOp node) { inAStarUnOp(node); if(node.getStar() != null) { node.getStar().apply(this); } outAStarUnOp(node); } public void inAQMarkUnOp(AQMarkUnOp node) { defaultIn(node); } public void outAQMarkUnOp(AQMarkUnOp node) { defaultOut(node); } @Override public void caseAQMarkUnOp(AQMarkUnOp node) { inAQMarkUnOp(node); if(node.getQMark() != null) { node.getQMark().apply(this); } outAQMarkUnOp(node); } public void inAPlusUnOp(APlusUnOp node) { defaultIn(node); } public void outAPlusUnOp(APlusUnOp node) { defaultOut(node); } @Override public void caseAPlusUnOp(APlusUnOp node) { inAPlusUnOp(node); if(node.getPlus() != null) { node.getPlus().apply(this); } outAPlusUnOp(node); } public void inAPlusBinOp(APlusBinOp node) { defaultIn(node); } public void outAPlusBinOp(APlusBinOp node) { defaultOut(node); } @Override public void caseAPlusBinOp(APlusBinOp node) { inAPlusBinOp(node); outAPlusBinOp(node); } public void inAMinusBinOp(AMinusBinOp node) { defaultIn(node); } public void outAMinusBinOp(AMinusBinOp node) { defaultOut(node); } @Override public void caseAMinusBinOp(AMinusBinOp node) { inAMinusBinOp(node); outAMinusBinOp(node); } public void inAProductions(AProductions node) { defaultIn(node); } public void outAProductions(AProductions node) { defaultOut(node); } @Override public void caseAProductions(AProductions node) { inAProductions(node); { List copy = new ArrayList(node.getProds()); Collections.reverse(copy); for(PProd e : copy) { e.apply(this); } } outAProductions(node); } public void inAProd(AProd node) { defaultIn(node); } public void outAProd(AProd node) { defaultOut(node); } @Override public void caseAProd(AProd node) { inAProd(node); { List copy = new ArrayList(node.getAlts()); Collections.reverse(copy); for(PAlt e : copy) { e.apply(this); } } { List copy = new ArrayList(node.getProdTransform()); Collections.reverse(copy); for(PElem e : copy) { e.apply(this); } } if(node.getArrow() != null) { node.getArrow().apply(this); } if(node.getId() != null) { node.getId().apply(this); } outAProd(node); } public void inAAlt(AAlt node) { defaultIn(node); } public void outAAlt(AAlt node) { defaultOut(node); } @Override public void caseAAlt(AAlt node) { inAAlt(node); if(node.getAltTransform() != null) { node.getAltTransform().apply(this); } { List copy = new ArrayList(node.getElems()); Collections.reverse(copy); for(PElem e : copy) { e.apply(this); } } if(node.getAltName() != null) { node.getAltName().apply(this); } outAAlt(node); } public void inAAltTransform(AAltTransform node) { defaultIn(node); } public void outAAltTransform(AAltTransform node) { defaultOut(node); } @Override public void caseAAltTransform(AAltTransform node) { inAAltTransform(node); if(node.getRBrace() != null) { node.getRBrace().apply(this); } { List copy = new ArrayList(node.getTerms()); Collections.reverse(copy); for(PTerm e : copy) { e.apply(this); } } if(node.getLBrace() != null) { node.getLBrace().apply(this); } outAAltTransform(node); } public void inANewTerm(ANewTerm node) { defaultIn(node); } public void outANewTerm(ANewTerm node) { defaultOut(node); } @Override public void caseANewTerm(ANewTerm node) { inANewTerm(node); { List copy = new ArrayList(node.getParams()); Collections.reverse(copy); for(PTerm e : copy) { e.apply(this); } } if(node.getLPar() != null) { node.getLPar().apply(this); } if(node.getProdName() != null) { node.getProdName().apply(this); } outANewTerm(node); } public void inAListTerm(AListTerm node) { defaultIn(node); } public void outAListTerm(AListTerm node) { defaultOut(node); } @Override public void caseAListTerm(AListTerm node) { inAListTerm(node); { List copy = new ArrayList(node.getListTerms()); Collections.reverse(copy); for(PListTerm e : copy) { e.apply(this); } } if(node.getLBkt() != null) { node.getLBkt().apply(this); } outAListTerm(node); } public void inASimpleTerm(ASimpleTerm node) { defaultIn(node); } public void outASimpleTerm(ASimpleTerm node) { defaultOut(node); } @Override public void caseASimpleTerm(ASimpleTerm node) { inASimpleTerm(node); if(node.getSimpleTermTail() != null) { node.getSimpleTermTail().apply(this); } if(node.getId() != null) { node.getId().apply(this); } if(node.getSpecifier() != null) { node.getSpecifier().apply(this); } outASimpleTerm(node); } public void inANullTerm(ANullTerm node) { defaultIn(node); } public void outANullTerm(ANullTerm node) { defaultOut(node); } @Override public void caseANullTerm(ANullTerm node) { inANullTerm(node); outANullTerm(node); } public void inANewListTerm(ANewListTerm node) { defaultIn(node); } public void outANewListTerm(ANewListTerm node) { defaultOut(node); } @Override public void caseANewListTerm(ANewListTerm node) { inANewListTerm(node); { List copy = new ArrayList(node.getParams()); Collections.reverse(copy); for(PTerm e : copy) { e.apply(this); } } if(node.getLPar() != null) { node.getLPar().apply(this); } if(node.getProdName() != null) { node.getProdName().apply(this); } outANewListTerm(node); } public void inASimpleListTerm(ASimpleListTerm node) { defaultIn(node); } public void outASimpleListTerm(ASimpleListTerm node) { defaultOut(node); } @Override public void caseASimpleListTerm(ASimpleListTerm node) { inASimpleListTerm(node); if(node.getSimpleTermTail() != null) { node.getSimpleTermTail().apply(this); } if(node.getId() != null) { node.getId().apply(this); } if(node.getSpecifier() != null) { node.getSpecifier().apply(this); } outASimpleListTerm(node); } public void inAProdName(AProdName node) { defaultIn(node); } public void outAProdName(AProdName node) { defaultOut(node); } @Override public void caseAProdName(AProdName node) { inAProdName(node); if(node.getProdNameTail() != null) { node.getProdNameTail().apply(this); } if(node.getId() != null) { node.getId().apply(this); } outAProdName(node); } public void inAElem(AElem node) { defaultIn(node); } public void outAElem(AElem node) { defaultOut(node); } @Override public void caseAElem(AElem node) { inAElem(node); if(node.getUnOp() != null) { node.getUnOp().apply(this); } if(node.getId() != null) { node.getId().apply(this); } if(node.getSpecifier() != null) { node.getSpecifier().apply(this); } if(node.getElemName() != null) { node.getElemName().apply(this); } outAElem(node); } public void inATokenSpecifier(ATokenSpecifier node) { defaultIn(node); } public void outATokenSpecifier(ATokenSpecifier node) { defaultOut(node); } @Override public void caseATokenSpecifier(ATokenSpecifier node) { inATokenSpecifier(node); outATokenSpecifier(node); } public void inAProductionSpecifier(AProductionSpecifier node) { defaultIn(node); } public void outAProductionSpecifier(AProductionSpecifier node) { defaultOut(node); } @Override public void caseAProductionSpecifier(AProductionSpecifier node) { inAProductionSpecifier(node); outAProductionSpecifier(node); } public void inAAst(AAst node) { defaultIn(node); } public void outAAst(AAst node) { defaultOut(node); } @Override public void caseAAst(AAst node) { inAAst(node); { List copy = new ArrayList(node.getProds()); Collections.reverse(copy); for(PAstProd e : copy) { e.apply(this); } } outAAst(node); } public void inAAstProd(AAstProd node) { defaultIn(node); } public void outAAstProd(AAstProd node) { defaultOut(node); } @Override public void caseAAstProd(AAstProd node) { inAAstProd(node); { List copy = new ArrayList(node.getAlts()); Collections.reverse(copy); for(PAstAlt e : copy) { e.apply(this); } } if(node.getId() != null) { node.getId().apply(this); } outAAstProd(node); } public void inAAstAlt(AAstAlt node) { defaultIn(node); } public void outAAstAlt(AAstAlt node) { defaultOut(node); } @Override public void caseAAstAlt(AAstAlt node) { inAAstAlt(node); { List copy = new ArrayList(node.getElems()); Collections.reverse(copy); for(PElem e : copy) { e.apply(this); } } if(node.getAltName() != null) { node.getAltName().apply(this); } outAAstAlt(node); } } sablecc-3.7/src/org/sablecc/sablecc/lexer.txt000066400000000000000000000262671265440641200212260ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ Macro:LexerException /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import $1$.*; @SuppressWarnings("serial") public class LexerException extends Exception { private InvalidToken invalidToken; public LexerException(@SuppressWarnings("hiding") InvalidToken invalidToken, String message) { super(message); this.invalidToken = invalidToken; } public InvalidToken getToken() { return this.invalidToken; } } $ Macro:IPushbackReader /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import java.io.*; @SuppressWarnings("serial") public interface IPushbackReader { public int read() throws IOException; public void unread(int c) throws IOException; } $ Macro:LexerHeader /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import java.io.*; import $1$.*; @SuppressWarnings("nls") public class Lexer { protected Token token; protected State state = State.$2$; private IPushbackReader in; private int line; private int pos; private boolean cr; private boolean eof; private final StringBuffer text = new StringBuffer(); @SuppressWarnings("unused") protected void filter() throws LexerException, IOException { // Do nothing } public Lexer(@SuppressWarnings("hiding") final PushbackReader in) { this.in = new IPushbackReader() { private PushbackReader pushbackReader = in; @Override public void unread(int c) throws IOException { pushbackReader.unread(c); } @Override public int read() throws IOException { return pushbackReader.read(); } }; } public Lexer(@SuppressWarnings("hiding") IPushbackReader in) { this.in = in; } public Token peek() throws LexerException, IOException { while(this.token == null) { this.token = getToken(); filter(); } return this.token; } public Token next() throws LexerException, IOException { while(this.token == null) { this.token = getToken(); filter(); } Token result = this.token; this.token = null; return result; } protected Token getToken() throws IOException, LexerException { int dfa_state = 0; int start_pos = this.pos; int start_line = this.line; int accept_state = -1; int accept_token = -1; int accept_length = -1; int accept_pos = -1; int accept_line = -1; @SuppressWarnings("hiding") int[][][] gotoTable = Lexer.gotoTable[this.state.id()]; @SuppressWarnings("hiding") int[] accept = Lexer.accept[this.state.id()]; this.text.setLength(0); while(true) { int c = getChar(); if(c != -1) { switch(c) { case 10: if(this.cr) { this.cr = false; } else { this.line++; this.pos = 0; } break; case 13: this.line++; this.pos = 0; this.cr = true; break; default: this.pos++; this.cr = false; break; } this.text.append((char) c); do { int oldState = (dfa_state < -1) ? (-2 -dfa_state) : dfa_state; dfa_state = -1; int[][] tmp1 = gotoTable[oldState]; int low = 0; int high = tmp1.length - 1; while(low <= high) { // int middle = (low + high) / 2; int middle = (low + high) >>> 1; int[] tmp2 = tmp1[middle]; if(c < tmp2[0]) { high = middle - 1; } else if(c > tmp2[1]) { low = middle + 1; } else { dfa_state = tmp2[2]; break; } } }while(dfa_state < -1); } else { dfa_state = -1; } if(dfa_state >= 0) { if(accept[dfa_state] != -1) { accept_state = dfa_state; accept_token = accept[dfa_state]; accept_length = this.text.length(); accept_pos = this.pos; accept_line = this.line; } } else { if(accept_state != -1) { switch(accept_token) { $ Macro:LexerVariableToken case $0$: { @SuppressWarnings("hiding") Token token = new$0$( getText(accept_length), start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; $ Macro:LexerFixedToken case $0$: { @SuppressWarnings("hiding") Token token = new$0$( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; $ Macro:TokenSwitchHeader switch(state.id()) { $ Macro:TokenCase case $0$: state = State.$1$; break; $ Macro:TokenSwitchTail } $ Macro:LexerTokenTail return token; } $ Macro:LexerBody1 } } else { if(this.text.length() > 0) { throw new LexerException( new InvalidToken(this.text.substring(0, 1), start_line + 1, start_pos + 1), "[" + (start_line + 1) + "," + (start_pos + 1) + "]" + " Unknown token: " + this.text); } @SuppressWarnings("hiding") EOF token = new EOF( start_line + 1, start_pos + 1); return token; } } } } $ Macro:LexerNewVariableToken Token new$0$(@SuppressWarnings("hiding") String text, @SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new $1$(text, line, pos); } $ Macro:LexerNewFixedToken Token new$0$(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new $1$(line, pos); } $ Macro:LexerBody2 private int getChar() throws IOException { if(this.eof) { return -1; } int result = this.in.read(); if(result == -1) { this.eof = true; } return result; } private void pushBack(int acceptLength) throws IOException { int length = this.text.length(); for(int i = length - 1; i >= acceptLength; i--) { this.eof = false; this.in.unread(this.text.charAt(i)); } } protected void unread(@SuppressWarnings("hiding") Token token) throws IOException { @SuppressWarnings("hiding") String text = token.getText(); int length = text.length(); for(int i = length - 1; i >= 0; i--) { this.eof = false; this.in.unread(text.charAt(i)); } this.pos = token.getPos() - 1; this.line = token.getLine() - 1; } private String getText(int acceptLength) { StringBuffer s = new StringBuffer(acceptLength); for(int i = 0; i < acceptLength; i++) { s.append(this.text.charAt(i)); } return s.toString(); } private static int[][][][] gotoTable; /* { $ Macro:LexerAcceptHeader };*/ private static int[][] accept; /* { $ Macro:LexerAcceptTail };*/ $ Macro:LexerStateHeader public static class State { $ Macro:LexerStateBody public final static State $0$ = new State($1$); $ Macro:LexerStateTail private int id; private State(@SuppressWarnings("hiding") int id) { this.id = id; } public int id() { return this.id; } } $ Macro:LexerTail static { try { DataInputStream s = new DataInputStream( new BufferedInputStream( Lexer.class.getResourceAsStream("lexer.dat"))); // read gotoTable int length = s.readInt(); gotoTable = new int[length][][][]; for(int i = 0; i < gotoTable.length; i++) { length = s.readInt(); gotoTable[i] = new int[length][][]; for(int j = 0; j < gotoTable[i].length; j++) { length = s.readInt(); gotoTable[i][j] = new int[length][3]; for(int k = 0; k < gotoTable[i][j].length; k++) { for(int l = 0; l < 3; l++) { gotoTable[i][j][k][l] = s.readInt(); } } } } // read accept length = s.readInt(); accept = new int[length][]; for(int i = 0; i < accept.length; i++) { length = s.readInt(); accept[i] = new int[length]; for(int j = 0; j < accept[i].length; j++) { accept[i][j] = s.readInt(); } } s.close(); } catch(Exception e) { throw new RuntimeException("The file \"lexer.dat\" is either missing or corrupted."); } } } $ sablecc-3.7/src/org/sablecc/sablecc/lexer/000077500000000000000000000000001265440641200204505ustar00rootroot00000000000000sablecc-3.7/src/org/sablecc/sablecc/lexer/IPushbackReader.java000066400000000000000000000004311265440641200243050ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.lexer; import java.io.*; @SuppressWarnings("serial") public interface IPushbackReader { public int read() throws IOException; public void unread(int c) throws IOException; } sablecc-3.7/src/org/sablecc/sablecc/lexer/Lexer.java000066400000000000000000001277061265440641200224070ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.lexer; import java.io.*; import org.sablecc.sablecc.node.*; @SuppressWarnings("nls") public class Lexer { protected Token token; protected State state = State.NORMAL; private IPushbackReader in; private int line; private int pos; private boolean cr; private boolean eof; private final StringBuffer text = new StringBuffer(); @SuppressWarnings("unused") protected void filter() throws LexerException, IOException { // Do nothing } public Lexer(@SuppressWarnings("hiding") final PushbackReader in) { this.in = new IPushbackReader() { private PushbackReader pushbackReader = in; @Override public void unread(int c) throws IOException { pushbackReader.unread(c); } @Override public int read() throws IOException { return pushbackReader.read(); } }; } public Lexer(@SuppressWarnings("hiding") IPushbackReader in) { this.in = in; } public Token peek() throws LexerException, IOException { while(this.token == null) { this.token = getToken(); filter(); } return this.token; } public Token next() throws LexerException, IOException { while(this.token == null) { this.token = getToken(); filter(); } Token result = this.token; this.token = null; return result; } protected Token getToken() throws IOException, LexerException { int dfa_state = 0; int start_pos = this.pos; int start_line = this.line; int accept_state = -1; int accept_token = -1; int accept_length = -1; int accept_pos = -1; int accept_line = -1; @SuppressWarnings("hiding") int[][][] gotoTable = Lexer.gotoTable[this.state.id()]; @SuppressWarnings("hiding") int[] accept = Lexer.accept[this.state.id()]; this.text.setLength(0); while(true) { int c = getChar(); if(c != -1) { switch(c) { case 10: if(this.cr) { this.cr = false; } else { this.line++; this.pos = 0; } break; case 13: this.line++; this.pos = 0; this.cr = true; break; default: this.pos++; this.cr = false; break; } this.text.append((char) c); do { int oldState = (dfa_state < -1) ? (-2 -dfa_state) : dfa_state; dfa_state = -1; int[][] tmp1 = gotoTable[oldState]; int low = 0; int high = tmp1.length - 1; while(low <= high) { // int middle = (low + high) / 2; int middle = (low + high) >>> 1; int[] tmp2 = tmp1[middle]; if(c < tmp2[0]) { high = middle - 1; } else if(c > tmp2[1]) { low = middle + 1; } else { dfa_state = tmp2[2]; break; } } }while(dfa_state < -1); } else { dfa_state = -1; } if(dfa_state >= 0) { if(accept[dfa_state] != -1) { accept_state = dfa_state; accept_token = accept[dfa_state]; accept_length = this.text.length(); accept_pos = this.pos; accept_line = this.line; } } else { if(accept_state != -1) { switch(accept_token) { case 0: { @SuppressWarnings("hiding") Token token = new0( getText(accept_length), start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; switch(state.id()) { case 1: state = State.PACKAGE; break; } return token; } case 1: { @SuppressWarnings("hiding") Token token = new1( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; switch(state.id()) { case 0: state = State.PACKAGE; break; } return token; } case 2: { @SuppressWarnings("hiding") Token token = new2( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 3: { @SuppressWarnings("hiding") Token token = new3( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 4: { @SuppressWarnings("hiding") Token token = new4( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 5: { @SuppressWarnings("hiding") Token token = new5( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 6: { @SuppressWarnings("hiding") Token token = new6( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 7: { @SuppressWarnings("hiding") Token token = new7( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 8: { @SuppressWarnings("hiding") Token token = new8( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 9: { @SuppressWarnings("hiding") Token token = new9( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 10: { @SuppressWarnings("hiding") Token token = new10( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 11: { @SuppressWarnings("hiding") Token token = new11( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 12: { @SuppressWarnings("hiding") Token token = new12( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 13: { @SuppressWarnings("hiding") Token token = new13( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 14: { @SuppressWarnings("hiding") Token token = new14( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 15: { @SuppressWarnings("hiding") Token token = new15( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 16: { @SuppressWarnings("hiding") Token token = new16( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; switch(state.id()) { case 0: state = State.NORMAL; break; case 1: state = State.NORMAL; break; } return token; } case 17: { @SuppressWarnings("hiding") Token token = new17( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 18: { @SuppressWarnings("hiding") Token token = new18( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 19: { @SuppressWarnings("hiding") Token token = new19( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 20: { @SuppressWarnings("hiding") Token token = new20( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 21: { @SuppressWarnings("hiding") Token token = new21( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 22: { @SuppressWarnings("hiding") Token token = new22( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 23: { @SuppressWarnings("hiding") Token token = new23( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 24: { @SuppressWarnings("hiding") Token token = new24( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 25: { @SuppressWarnings("hiding") Token token = new25( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 26: { @SuppressWarnings("hiding") Token token = new26( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 27: { @SuppressWarnings("hiding") Token token = new27( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 28: { @SuppressWarnings("hiding") Token token = new28( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 29: { @SuppressWarnings("hiding") Token token = new29( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 30: { @SuppressWarnings("hiding") Token token = new30( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 31: { @SuppressWarnings("hiding") Token token = new31( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 32: { @SuppressWarnings("hiding") Token token = new32( start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 33: { @SuppressWarnings("hiding") Token token = new33( getText(accept_length), start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 34: { @SuppressWarnings("hiding") Token token = new34( getText(accept_length), start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 35: { @SuppressWarnings("hiding") Token token = new35( getText(accept_length), start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 36: { @SuppressWarnings("hiding") Token token = new36( getText(accept_length), start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 37: { @SuppressWarnings("hiding") Token token = new37( getText(accept_length), start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 38: { @SuppressWarnings("hiding") Token token = new38( getText(accept_length), start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } case 39: { @SuppressWarnings("hiding") Token token = new39( getText(accept_length), start_line + 1, start_pos + 1); pushBack(accept_length); this.pos = accept_pos; this.line = accept_line; return token; } } } else { if(this.text.length() > 0) { throw new LexerException( new InvalidToken(this.text.substring(0, 1), start_line + 1, start_pos + 1), "[" + (start_line + 1) + "," + (start_pos + 1) + "]" + " Unknown token: " + this.text); } @SuppressWarnings("hiding") EOF token = new EOF( start_line + 1, start_pos + 1); return token; } } } } Token new0(@SuppressWarnings("hiding") String text, @SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TPkgId(text, line, pos); } Token new1(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TPackage(line, pos); } Token new2(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TStates(line, pos); } Token new3(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new THelpers(line, pos); } Token new4(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TTokens(line, pos); } Token new5(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TIgnored(line, pos); } Token new6(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TProductions(line, pos); } Token new7(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TAbstract(line, pos); } Token new8(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TSyntax(line, pos); } Token new9(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TTree(line, pos); } Token new10(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TNew(line, pos); } Token new11(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TNull(line, pos); } Token new12(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TTokenSpecifier(line, pos); } Token new13(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TProductionSpecifier(line, pos); } Token new14(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TDot(line, pos); } Token new15(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TDDot(line, pos); } Token new16(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TSemicolon(line, pos); } Token new17(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TEqual(line, pos); } Token new18(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TLBkt(line, pos); } Token new19(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TRBkt(line, pos); } Token new20(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TLPar(line, pos); } Token new21(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TRPar(line, pos); } Token new22(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TLBrace(line, pos); } Token new23(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TRBrace(line, pos); } Token new24(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TPlus(line, pos); } Token new25(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TMinus(line, pos); } Token new26(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TQMark(line, pos); } Token new27(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TStar(line, pos); } Token new28(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TBar(line, pos); } Token new29(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TComma(line, pos); } Token new30(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TSlash(line, pos); } Token new31(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TArrow(line, pos); } Token new32(@SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TColon(line, pos); } Token new33(@SuppressWarnings("hiding") String text, @SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TId(text, line, pos); } Token new34(@SuppressWarnings("hiding") String text, @SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TChar(text, line, pos); } Token new35(@SuppressWarnings("hiding") String text, @SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TDecChar(text, line, pos); } Token new36(@SuppressWarnings("hiding") String text, @SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new THexChar(text, line, pos); } Token new37(@SuppressWarnings("hiding") String text, @SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TString(text, line, pos); } Token new38(@SuppressWarnings("hiding") String text, @SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TBlank(text, line, pos); } Token new39(@SuppressWarnings("hiding") String text, @SuppressWarnings("hiding") int line, @SuppressWarnings("hiding") int pos) { return new TComment(text, line, pos); } private int getChar() throws IOException { if(this.eof) { return -1; } int result = this.in.read(); if(result == -1) { this.eof = true; } return result; } private void pushBack(int acceptLength) throws IOException { int length = this.text.length(); for(int i = length - 1; i >= acceptLength; i--) { this.eof = false; this.in.unread(this.text.charAt(i)); } } protected void unread(@SuppressWarnings("hiding") Token token) throws IOException { @SuppressWarnings("hiding") String text = token.getText(); int length = text.length(); for(int i = length - 1; i >= 0; i--) { this.eof = false; this.in.unread(text.charAt(i)); } this.pos = token.getPos() - 1; this.line = token.getLine() - 1; } private String getText(int acceptLength) { StringBuffer s = new StringBuffer(acceptLength); for(int i = 0; i < acceptLength; i++) { s.append(this.text.charAt(i)); } return s.toString(); } private static int[][][][] gotoTable; /* { { // NORMAL {{9, 9, 1}, {10, 10, 2}, {13, 13, 3}, {32, 32, 4}, {39, 39, 5}, {40, 40, 6}, {41, 41, 7}, {42, 42, 8}, {43, 43, 9}, {44, 44, 10}, {45, 45, 11}, {46, 46, 12}, {47, 47, 13}, {48, 48, 14}, {49, 57, 15}, {58, 58, 16}, {59, 59, 17}, {61, 61, 18}, {63, 63, 19}, {65, 65, 20}, {72, 72, 21}, {73, 73, 22}, {78, 78, 23}, {80, 80, 24}, {83, 83, 25}, {84, 84, 26}, {91, 91, 27}, {93, 93, 28}, {97, 122, 29}, {123, 123, 30}, {124, 124, 31}, {125, 125, 32}, }, {{9, 32, -2}, }, {{9, 32, -2}, }, {{9, 9, 1}, {10, 10, 33}, {13, 32, -2}, }, {{9, 32, -2}, }, {{0, 9, 34}, {11, 12, 34}, {14, 38, 34}, {39, 39, 35}, {40, 65535, 34}, }, {}, {}, {}, {}, {}, {{62, 62, 36}, }, {{46, 46, 37}, }, {{42, 42, 38}, {47, 47, 39}, }, {{48, 57, 15}, {88, 88, 40}, {120, 120, 41}, }, {{48, 57, 15}, }, {}, {}, {}, {}, {{98, 98, 42}, }, {{101, 101, 43}, }, {{103, 103, 44}, }, {{101, 101, 45}, {117, 117, 46}, }, {{97, 97, 47}, {114, 114, 48}, }, {{116, 116, 49}, {121, 121, 50}, }, {{111, 111, 51}, {114, 114, 52}, }, {}, {}, {{48, 57, 53}, {95, 95, 54}, {97, 122, 55}, }, {}, {}, {}, {{9, 32, -2}, }, {{0, 9, 56}, {11, 12, 56}, {14, 38, 56}, {39, 39, 57}, {40, 65535, 56}, }, {{39, 39, 58}, }, {}, {}, {{0, 41, 59}, {42, 42, 60}, {43, 65535, 59}, }, {{0, 9, 61}, {10, 10, 62}, {11, 12, 61}, {13, 13, 63}, {14, 65535, 61}, }, {{48, 57, 64}, {65, 70, 64}, {97, 102, 64}, }, {{48, 102, -42}, }, {{115, 115, 65}, }, {{108, 108, 66}, }, {{110, 110, 67}, }, {{119, 119, 68}, }, {{108, 108, 69}, }, {{99, 99, 70}, }, {{111, 111, 71}, }, {{97, 97, 72}, }, {{110, 110, 73}, }, {{107, 107, 74}, }, {{101, 101, 75}, }, {{48, 122, -31}, }, {{97, 122, 76}, }, {{48, 122, -31}, }, {{0, 38, -36}, {39, 39, 77}, {40, 65535, 56}, }, {}, {}, {{0, 65535, -40}, }, {{0, 41, 78}, {42, 42, 60}, {43, 46, 78}, {47, 47, 79}, {48, 65535, 78}, }, {{0, 65535, -41}, }, {}, {{10, 10, 80}, }, {{48, 102, -42}, }, {{116, 116, 81}, }, {{112, 112, 82}, }, {{111, 111, 83}, }, {}, {{108, 108, 84}, }, {{107, 107, 85}, }, {{100, 100, 86}, }, {{116, 116, 87}, }, {{116, 116, 88}, }, {{101, 101, 89}, }, {{101, 101, 90}, }, {{48, 57, 91}, {95, 95, 54}, {97, 122, 92}, }, {}, {{0, 41, 93}, {42, 42, 94}, {43, 65535, 93}, }, {}, {}, {{114, 114, 95}, }, {{101, 101, 96}, }, {{114, 114, 97}, }, {}, {{97, 97, 98}, }, {{117, 117, 99}, }, {{101, 101, 100}, }, {{97, 97, 101}, }, {{110, 110, 102}, }, {}, {{48, 122, -78}, }, {{48, 122, -78}, }, {{0, 65535, -80}, }, {{0, 41, 78}, {42, 42, 94}, {43, 65535, -62}, }, {{97, 97, 103}, }, {{114, 114, 104}, }, {{101, 101, 105}, }, {{103, 103, 106}, }, {{99, 99, 107}, }, {{115, 115, 108}, }, {{120, 120, 109}, }, {{115, 115, 110}, }, {{99, 99, 111}, }, {{115, 115, 112}, }, {{100, 100, 113}, }, {{101, 101, 114}, }, {{116, 116, 115}, }, {}, {}, {}, {{116, 116, 116}, }, {}, {}, {}, {{105, 105, 117}, }, {}, {{111, 111, 118}, }, {{110, 110, 119}, }, {{115, 115, 120}, }, {}, } { // PACKAGE {{9, 9, 1}, {10, 10, 2}, {13, 13, 3}, {32, 32, 4}, {36, 36, 5}, {39, 39, 6}, {40, 40, 7}, {41, 41, 8}, {42, 42, 9}, {43, 43, 10}, {44, 44, 11}, {45, 45, 12}, {46, 46, 13}, {47, 47, 14}, {48, 48, 15}, {49, 57, 16}, {58, 58, 17}, {59, 59, 18}, {61, 61, 19}, {63, 63, 20}, {65, 65, 21}, {66, 71, 22}, {72, 72, 23}, {73, 73, 24}, {74, 77, 22}, {78, 78, 25}, {79, 79, 22}, {80, 80, 26}, {81, 82, 22}, {83, 83, 27}, {84, 84, 28}, {85, 90, 22}, {91, 91, 29}, {93, 93, 30}, {95, 95, 31}, {97, 122, 32}, {123, 123, 33}, {124, 124, 34}, {125, 125, 35}, }, {{9, 32, -2}, }, {{9, 32, -2}, }, {{9, 9, 1}, {10, 10, 36}, {13, 32, -2}, }, {{9, 32, -2}, }, {{36, 36, 37}, {48, 57, 38}, {65, 90, 39}, {95, 95, 40}, {97, 122, 41}, }, {{0, 9, 42}, {11, 12, 42}, {14, 38, 42}, {39, 39, 43}, {40, 65535, 42}, }, {}, {}, {}, {}, {}, {{62, 62, 44}, }, {{46, 46, 45}, }, {{42, 42, 46}, {47, 47, 47}, }, {{48, 57, 16}, {88, 88, 48}, {120, 120, 49}, }, {{48, 57, 16}, }, {}, {}, {}, {}, {{36, 95, -7}, {97, 97, 41}, {98, 98, 50}, {99, 122, 41}, }, {{36, 122, -7}, }, {{36, 95, -7}, {97, 100, 41}, {101, 101, 51}, {102, 122, 41}, }, {{36, 95, -7}, {97, 102, 41}, {103, 103, 52}, {104, 122, 41}, }, {{36, 100, -25}, {101, 101, 53}, {102, 116, 41}, {117, 117, 54}, {118, 122, 41}, }, {{36, 95, -7}, {97, 113, 41}, {114, 114, 55}, {115, 122, 41}, }, {{36, 95, -7}, {97, 115, 41}, {116, 116, 56}, {117, 120, 41}, {121, 121, 57}, {122, 122, 41}, }, {{36, 95, -7}, {97, 110, 41}, {111, 111, 58}, {112, 113, 41}, {114, 114, 59}, {115, 122, 41}, }, {}, {}, {{36, 122, -7}, }, {{36, 36, 37}, {48, 57, 60}, {65, 90, 39}, {95, 95, 61}, {97, 122, 62}, }, {}, {}, {}, {{9, 32, -2}, }, {{36, 122, -7}, }, {{36, 122, -7}, }, {{36, 122, -7}, }, {{36, 122, -7}, }, {{36, 122, -7}, }, {{0, 9, 63}, {11, 12, 63}, {14, 38, 63}, {39, 39, 64}, {40, 65535, 63}, }, {{39, 39, 65}, }, {}, {}, {{0, 41, 66}, {42, 42, 67}, {43, 65535, 66}, }, {{0, 9, 68}, {10, 10, 69}, {11, 12, 68}, {13, 13, 70}, {14, 65535, 68}, }, {{48, 57, 71}, {65, 70, 71}, {97, 102, 71}, }, {{48, 102, -50}, }, {{36, 95, -7}, {97, 114, 41}, {115, 115, 72}, {116, 122, 41}, }, {{36, 95, -7}, {97, 107, 41}, {108, 108, 73}, {109, 122, 41}, }, {{36, 95, -7}, {97, 109, 41}, {110, 110, 74}, {111, 122, 41}, }, {{36, 95, -7}, {97, 118, 41}, {119, 119, 75}, {120, 122, 41}, }, {{36, 107, -53}, {108, 108, 76}, {109, 122, 41}, }, {{36, 110, -30}, {111, 111, 77}, {112, 122, 41}, }, {{36, 95, -7}, {97, 97, 78}, {98, 122, 41}, }, {{36, 109, -54}, {110, 110, 79}, {111, 122, 41}, }, {{36, 95, -7}, {97, 106, 41}, {107, 107, 80}, {108, 122, 41}, }, {{36, 100, -25}, {101, 101, 81}, {102, 122, 41}, }, {{36, 122, -34}, }, {{36, 95, -7}, {97, 122, 82}, }, {{36, 122, -34}, }, {{0, 38, -44}, {39, 39, 83}, {40, 65535, 63}, }, {}, {}, {{0, 65535, -48}, }, {{0, 41, 84}, {42, 42, 67}, {43, 46, 84}, {47, 47, 85}, {48, 65535, 84}, }, {{0, 65535, -49}, }, {}, {{10, 10, 86}, }, {{48, 102, -50}, }, {{36, 115, -29}, {116, 116, 87}, {117, 122, 41}, }, {{36, 95, -7}, {97, 111, 41}, {112, 112, 88}, {113, 122, 41}, }, {{36, 110, -30}, {111, 111, 89}, {112, 122, 41}, }, {{36, 122, -7}, }, {{36, 107, -53}, {108, 108, 90}, {109, 122, 41}, }, {{36, 95, -7}, {97, 99, 41}, {100, 100, 91}, {101, 122, 41}, }, {{36, 115, -29}, {116, 116, 92}, {117, 122, 41}, }, {{36, 115, -29}, {116, 116, 93}, {117, 122, 41}, }, {{36, 100, -25}, {101, 101, 94}, {102, 122, 41}, }, {{36, 100, -25}, {101, 101, 95}, {102, 122, 41}, }, {{36, 36, 37}, {48, 57, 96}, {65, 95, -34}, {97, 122, 97}, }, {}, {{0, 41, 98}, {42, 42, 99}, {43, 65535, 98}, }, {}, {}, {{36, 113, -28}, {114, 114, 100}, {115, 122, 41}, }, {{36, 100, -25}, {101, 101, 101}, {102, 122, 41}, }, {{36, 113, -28}, {114, 114, 102}, {115, 122, 41}, }, {{36, 122, -7}, }, {{36, 95, -7}, {97, 116, 41}, {117, 117, 103}, {118, 122, 41}, }, {{36, 100, -25}, {101, 101, 104}, {102, 122, 41}, }, {{36, 95, -7}, {97, 97, 105}, {98, 122, 41}, }, {{36, 109, -54}, {110, 110, 106}, {111, 122, 41}, }, {{36, 122, -7}, }, {{36, 122, -84}, }, {{36, 122, -84}, }, {{0, 65535, -86}, }, {{0, 41, 84}, {42, 42, 99}, {43, 65535, -69}, }, {{36, 95, -7}, {97, 97, 107}, {98, 122, 41}, }, {{36, 113, -28}, {114, 114, 108}, {115, 122, 41}, }, {{36, 100, -25}, {101, 101, 109}, {102, 122, 41}, }, {{36, 95, -7}, {97, 98, 41}, {99, 99, 110}, {100, 122, 41}, }, {{36, 114, -52}, {115, 115, 111}, {116, 122, 41}, }, {{36, 95, -7}, {97, 119, 41}, {120, 120, 112}, {121, 122, 41}, }, {{36, 114, -52}, {115, 115, 113}, {116, 122, 41}, }, {{36, 98, -105}, {99, 99, 114}, {100, 122, 41}, }, {{36, 114, -52}, {115, 115, 115}, {116, 122, 41}, }, {{36, 99, -79}, {100, 100, 116}, {101, 122, 41}, }, {{36, 115, -29}, {116, 116, 117}, {117, 122, 41}, }, {{36, 122, -7}, }, {{36, 122, -7}, }, {{36, 122, -7}, }, {{36, 115, -29}, {116, 116, 118}, {117, 122, 41}, }, {{36, 122, -7}, }, {{36, 122, -7}, }, {{36, 95, -7}, {97, 104, 41}, {105, 105, 119}, {106, 122, 41}, }, {{36, 122, -7}, }, {{36, 110, -30}, {111, 111, 120}, {112, 122, 41}, }, {{36, 109, -54}, {110, 110, 121}, {111, 122, 41}, }, {{36, 114, -52}, {115, 115, 122}, {116, 122, 41}, }, {{36, 122, -7}, }, } };*/ private static int[][] accept; /* { // NORMAL {-1, 38, 38, 38, 38, -1, 20, 21, 27, 24, 29, 25, 14, 30, 35, 35, 32, 16, 17, 26, -1, -1, -1, -1, 13, -1, 12, 18, 19, 33, 22, 28, 23, 38, -1, -1, 31, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 33, -1, 33, -1, 34, 34, -1, -1, -1, 39, 39, 36, -1, -1, -1, 10, -1, -1, -1, -1, -1, -1, -1, 33, 37, -1, 39, 39, -1, -1, -1, 11, -1, -1, -1, -1, -1, 9, 33, 33, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 2, 8, 4, -1, 3, 5, 1, -1, 7, -1, -1, -1, 6, }, // PACKAGE {-1, 38, 38, 38, 38, 0, -1, 20, 21, 27, 24, 29, 25, 14, 30, 35, 35, 32, 16, 17, 26, 0, 0, 0, 0, 0, 0, 0, 0, 18, 19, 0, 0, 22, 28, 23, 38, 0, 0, 0, 0, 0, -1, -1, 31, 15, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 34, 34, -1, -1, -1, 39, 39, 36, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 37, -1, 39, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, }, };*/ public static class State { public final static State NORMAL = new State(0); public final static State PACKAGE = new State(1); private int id; private State(@SuppressWarnings("hiding") int id) { this.id = id; } public int id() { return this.id; } } static { try { DataInputStream s = new DataInputStream( new BufferedInputStream( Lexer.class.getResourceAsStream("lexer.dat"))); // read gotoTable int length = s.readInt(); gotoTable = new int[length][][][]; for(int i = 0; i < gotoTable.length; i++) { length = s.readInt(); gotoTable[i] = new int[length][][]; for(int j = 0; j < gotoTable[i].length; j++) { length = s.readInt(); gotoTable[i][j] = new int[length][3]; for(int k = 0; k < gotoTable[i][j].length; k++) { for(int l = 0; l < 3; l++) { gotoTable[i][j][k][l] = s.readInt(); } } } } // read accept length = s.readInt(); accept = new int[length][]; for(int i = 0; i < accept.length; i++) { length = s.readInt(); accept[i] = new int[length]; for(int j = 0; j < accept[i].length; j++) { accept[i][j] = s.readInt(); } } s.close(); } catch(Exception e) { throw new RuntimeException("The file \"lexer.dat\" is either missing or corrupted."); } } } sablecc-3.7/src/org/sablecc/sablecc/lexer/LexerException.java000066400000000000000000000010101265440641200242410ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.lexer; import org.sablecc.sablecc.node.*; @SuppressWarnings("serial") public class LexerException extends Exception { private InvalidToken invalidToken; public LexerException(@SuppressWarnings("hiding") InvalidToken invalidToken, String message) { super(message); this.invalidToken = invalidToken; } public InvalidToken getToken() { return this.invalidToken; } } sablecc-3.7/src/org/sablecc/sablecc/lexer/lexer.dat000066400000000000000000000165241265440641200222710ustar00rootroot00000000000000y    ''(())**++ ,, -- .. // 0019::;;==??AAHHIINNPPSSTT[[]]az{{||}}     !   " "&"''#(">>$..%**&//'09XX(xx)09bb*ee+gg,ee-uu.aa/rr0tt1yy2oo3rr4095__6az7  8 8&8''9(8'':);**<+; = > = ?=09@AF@af@0fssAllBnnCwwDllEccFooGaaHnnIkkJeeK0zazL0z&''M(8)N**<+.N//O0N P0fttQppRooSllTkkUddVttWttXeeYeeZ09[__6az\)]**^+]rr_ee`rraaabuuceedaaennf0z0z)N**^+aagrrheeiggjccksslxxmssnccosspddqeerttstttiiuoovnnwssx{'    $$''(())** ++ ,, -- .. //0019::;;==??AABGHHIIJMNNOOPPQRSSTTUZ[[]]__az {{!||"}}#    $  $$%09&AZ'__(az) * *&*''+(*>>,..-**.///09XX0xx109$_aa)bb2cz)$z$_ad)ee3fz)$_af)gg4hz)$dee5ft)uu6vz)$_aq)rr7sz)$_as)tt8ux)yy9zz)$_an)oo:pq)rr;sz)$z$$%09<AZ'__=az> $z$z$z$z$z ? ?&?''@(?''A)B**C+B D E D FD09GAFGafG0f$_ar)ssHtz)$_ak)llImz)$_am)nnJoz)$_av)wwKxz)$kllLmz)$nooMpz)$_aaNbz)$mnnOoz)$_aj)kkPlz)$deeQfz)$z$_azR$z&''S(?)T**C+.T//U0T V0f$sttWuz)$_ao)ppXqz)$nooYpz)$z$kllZmz)$_ac)dd[ez)$stt\uz)$stt]uz)$dee^fz)$dee_fz)$$%09`A_aza)b**c+b$qrrdsz)$deeefz)$qrrfsz)$z$_at)uugvz)$deehfz)$_aaibz)$mnnjoz)$z$z$z)T**c+$_aakbz)$qrrlsz)$deemfz)$_ab)ccndz)$rssotz)$_aw)xxpyz)$rssqtz)$bccrdz)$rssstz)$cddtez)$sttuuz)$z$z$z$sttvuz)$z$z$_ah)iiwjz)$z$nooxpz)$mnnyoz)$rssztz)$zy&&&&##  !&!!""''$ !%'' !!{&&&&## &""''$%''sablecc-3.7/src/org/sablecc/sablecc/node/000077500000000000000000000000001265440641200202565ustar00rootroot00000000000000sablecc-3.7/src/org/sablecc/sablecc/node/AAlt.java000066400000000000000000000100351265440641200217410ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AAlt extends PAlt { private TId _altName_; private final LinkedList _elems_ = new LinkedList(); private PAltTransform _altTransform_; public AAlt() { // Constructor } public AAlt( @SuppressWarnings("hiding") TId _altName_, @SuppressWarnings("hiding") List _elems_, @SuppressWarnings("hiding") PAltTransform _altTransform_) { // Constructor setAltName(_altName_); setElems(_elems_); setAltTransform(_altTransform_); } @Override public Object clone() { return new AAlt( cloneNode(this._altName_), cloneList(this._elems_), cloneNode(this._altTransform_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAAlt(this); } public TId getAltName() { return this._altName_; } public void setAltName(TId node) { if(this._altName_ != null) { this._altName_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._altName_ = node; } public LinkedList getElems() { return this._elems_; } public void setElems(List list) { for(PElem e : this._elems_) { e.parent(null); } this._elems_.clear(); for(Object obj_e : list) { PElem e = (PElem) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._elems_.add(e); } } public PAltTransform getAltTransform() { return this._altTransform_; } public void setAltTransform(PAltTransform node) { if(this._altTransform_ != null) { this._altTransform_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._altTransform_ = node; } @Override public String toString() { return "" + toString(this._altName_) + toString(this._elems_) + toString(this._altTransform_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._altName_ == child) { this._altName_ = null; return; } if(this._elems_.remove(child)) { return; } if(this._altTransform_ == child) { this._altTransform_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._altName_ == oldChild) { setAltName((TId) newChild); return; } for(ListIterator i = this._elems_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PElem) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } if(this._altTransform_ == oldChild) { setAltTransform((PAltTransform) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AAltTransform.java000066400000000000000000000077311265440641200236460ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AAltTransform extends PAltTransform { private TLBrace _lBrace_; private final LinkedList _terms_ = new LinkedList(); private TRBrace _rBrace_; public AAltTransform() { // Constructor } public AAltTransform( @SuppressWarnings("hiding") TLBrace _lBrace_, @SuppressWarnings("hiding") List _terms_, @SuppressWarnings("hiding") TRBrace _rBrace_) { // Constructor setLBrace(_lBrace_); setTerms(_terms_); setRBrace(_rBrace_); } @Override public Object clone() { return new AAltTransform( cloneNode(this._lBrace_), cloneList(this._terms_), cloneNode(this._rBrace_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAAltTransform(this); } public TLBrace getLBrace() { return this._lBrace_; } public void setLBrace(TLBrace node) { if(this._lBrace_ != null) { this._lBrace_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._lBrace_ = node; } public LinkedList getTerms() { return this._terms_; } public void setTerms(List list) { for(PTerm e : this._terms_) { e.parent(null); } this._terms_.clear(); for(Object obj_e : list) { PTerm e = (PTerm) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._terms_.add(e); } } public TRBrace getRBrace() { return this._rBrace_; } public void setRBrace(TRBrace node) { if(this._rBrace_ != null) { this._rBrace_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._rBrace_ = node; } @Override public String toString() { return "" + toString(this._lBrace_) + toString(this._terms_) + toString(this._rBrace_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._lBrace_ == child) { this._lBrace_ = null; return; } if(this._terms_.remove(child)) { return; } if(this._rBrace_ == child) { this._rBrace_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._lBrace_ == oldChild) { setLBrace((TLBrace) newChild); return; } for(ListIterator i = this._terms_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PTerm) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } if(this._rBrace_ == oldChild) { setRBrace((TRBrace) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AAst.java000066400000000000000000000043651265440641200217610ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AAst extends PAst { private final LinkedList _prods_ = new LinkedList(); public AAst() { // Constructor } public AAst( @SuppressWarnings("hiding") List _prods_) { // Constructor setProds(_prods_); } @Override public Object clone() { return new AAst( cloneList(this._prods_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAAst(this); } public LinkedList getProds() { return this._prods_; } public void setProds(List list) { for(PAstProd e : this._prods_) { e.parent(null); } this._prods_.clear(); for(Object obj_e : list) { PAstProd e = (PAstProd) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._prods_.add(e); } } @Override public String toString() { return "" + toString(this._prods_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._prods_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child for(ListIterator i = this._prods_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PAstProd) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AAstAlt.java000066400000000000000000000061161265440641200224160ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AAstAlt extends PAstAlt { private TId _altName_; private final LinkedList _elems_ = new LinkedList(); public AAstAlt() { // Constructor } public AAstAlt( @SuppressWarnings("hiding") TId _altName_, @SuppressWarnings("hiding") List _elems_) { // Constructor setAltName(_altName_); setElems(_elems_); } @Override public Object clone() { return new AAstAlt( cloneNode(this._altName_), cloneList(this._elems_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAAstAlt(this); } public TId getAltName() { return this._altName_; } public void setAltName(TId node) { if(this._altName_ != null) { this._altName_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._altName_ = node; } public LinkedList getElems() { return this._elems_; } public void setElems(List list) { for(PElem e : this._elems_) { e.parent(null); } this._elems_.clear(); for(Object obj_e : list) { PElem e = (PElem) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._elems_.add(e); } } @Override public String toString() { return "" + toString(this._altName_) + toString(this._elems_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._altName_ == child) { this._altName_ = null; return; } if(this._elems_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._altName_ == oldChild) { setAltName((TId) newChild); return; } for(ListIterator i = this._elems_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PElem) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AAstProd.java000066400000000000000000000060061265440641200226000ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AAstProd extends PAstProd { private TId _id_; private final LinkedList _alts_ = new LinkedList(); public AAstProd() { // Constructor } public AAstProd( @SuppressWarnings("hiding") TId _id_, @SuppressWarnings("hiding") List _alts_) { // Constructor setId(_id_); setAlts(_alts_); } @Override public Object clone() { return new AAstProd( cloneNode(this._id_), cloneList(this._alts_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAAstProd(this); } public TId getId() { return this._id_; } public void setId(TId node) { if(this._id_ != null) { this._id_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._id_ = node; } public LinkedList getAlts() { return this._alts_; } public void setAlts(List list) { for(PAstAlt e : this._alts_) { e.parent(null); } this._alts_.clear(); for(Object obj_e : list) { PAstAlt e = (PAstAlt) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._alts_.add(e); } } @Override public String toString() { return "" + toString(this._id_) + toString(this._alts_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._id_ == child) { this._id_ = null; return; } if(this._alts_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._id_ == oldChild) { setId((TId) newChild); return; } for(ListIterator i = this._alts_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PAstAlt) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ACharBasic.java000066400000000000000000000034141265440641200230430ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ACharBasic extends PBasic { private PChar _char_; public ACharBasic() { // Constructor } public ACharBasic( @SuppressWarnings("hiding") PChar _char_) { // Constructor setChar(_char_); } @Override public Object clone() { return new ACharBasic( cloneNode(this._char_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseACharBasic(this); } public PChar getChar() { return this._char_; } public void setChar(PChar node) { if(this._char_ != null) { this._char_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._char_ = node; } @Override public String toString() { return "" + toString(this._char_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._char_ == child) { this._char_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._char_ == oldChild) { setChar((PChar) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ACharChar.java000066400000000000000000000034061265440641200227000ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ACharChar extends PChar { private TChar _char_; public ACharChar() { // Constructor } public ACharChar( @SuppressWarnings("hiding") TChar _char_) { // Constructor setChar(_char_); } @Override public Object clone() { return new ACharChar( cloneNode(this._char_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseACharChar(this); } public TChar getChar() { return this._char_; } public void setChar(TChar node) { if(this._char_ != null) { this._char_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._char_ = node; } @Override public String toString() { return "" + toString(this._char_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._char_ == child) { this._char_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._char_ == oldChild) { setChar((TChar) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AConcat.java000066400000000000000000000044051265440641200224340ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AConcat extends PConcat { private final LinkedList _unExps_ = new LinkedList(); public AConcat() { // Constructor } public AConcat( @SuppressWarnings("hiding") List _unExps_) { // Constructor setUnExps(_unExps_); } @Override public Object clone() { return new AConcat( cloneList(this._unExps_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAConcat(this); } public LinkedList getUnExps() { return this._unExps_; } public void setUnExps(List list) { for(PUnExp e : this._unExps_) { e.parent(null); } this._unExps_.clear(); for(Object obj_e : list) { PUnExp e = (PUnExp) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._unExps_.add(e); } } @Override public String toString() { return "" + toString(this._unExps_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._unExps_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child for(ListIterator i = this._unExps_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PUnExp) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ADecChar.java000066400000000000000000000035001265440641200225110ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ADecChar extends PChar { private TDecChar _decChar_; public ADecChar() { // Constructor } public ADecChar( @SuppressWarnings("hiding") TDecChar _decChar_) { // Constructor setDecChar(_decChar_); } @Override public Object clone() { return new ADecChar( cloneNode(this._decChar_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseADecChar(this); } public TDecChar getDecChar() { return this._decChar_; } public void setDecChar(TDecChar node) { if(this._decChar_ != null) { this._decChar_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._decChar_ = node; } @Override public String toString() { return "" + toString(this._decChar_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._decChar_ == child) { this._decChar_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._decChar_ == oldChild) { setDecChar((TDecChar) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AElem.java000066400000000000000000000104221265440641200221030ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AElem extends PElem { private TId _elemName_; private PSpecifier _specifier_; private TId _id_; private PUnOp _unOp_; public AElem() { // Constructor } public AElem( @SuppressWarnings("hiding") TId _elemName_, @SuppressWarnings("hiding") PSpecifier _specifier_, @SuppressWarnings("hiding") TId _id_, @SuppressWarnings("hiding") PUnOp _unOp_) { // Constructor setElemName(_elemName_); setSpecifier(_specifier_); setId(_id_); setUnOp(_unOp_); } @Override public Object clone() { return new AElem( cloneNode(this._elemName_), cloneNode(this._specifier_), cloneNode(this._id_), cloneNode(this._unOp_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAElem(this); } public TId getElemName() { return this._elemName_; } public void setElemName(TId node) { if(this._elemName_ != null) { this._elemName_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._elemName_ = node; } public PSpecifier getSpecifier() { return this._specifier_; } public void setSpecifier(PSpecifier node) { if(this._specifier_ != null) { this._specifier_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._specifier_ = node; } public TId getId() { return this._id_; } public void setId(TId node) { if(this._id_ != null) { this._id_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._id_ = node; } public PUnOp getUnOp() { return this._unOp_; } public void setUnOp(PUnOp node) { if(this._unOp_ != null) { this._unOp_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._unOp_ = node; } @Override public String toString() { return "" + toString(this._elemName_) + toString(this._specifier_) + toString(this._id_) + toString(this._unOp_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._elemName_ == child) { this._elemName_ = null; return; } if(this._specifier_ == child) { this._specifier_ = null; return; } if(this._id_ == child) { this._id_ = null; return; } if(this._unOp_ == child) { this._unOp_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._elemName_ == oldChild) { setElemName((TId) newChild); return; } if(this._specifier_ == oldChild) { setSpecifier((PSpecifier) newChild); return; } if(this._id_ == oldChild) { setId((TId) newChild); return; } if(this._unOp_ == oldChild) { setUnOp((PUnOp) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AGrammar.java000066400000000000000000000167511265440641200226220ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AGrammar extends PGrammar { private final LinkedList _package_ = new LinkedList(); private PHelpers _helpers_; private PStates _states_; private PTokens _tokens_; private PIgnTokens _ignTokens_; private PProductions _productions_; private PAst _ast_; public AGrammar() { // Constructor } public AGrammar( @SuppressWarnings("hiding") List _package_, @SuppressWarnings("hiding") PHelpers _helpers_, @SuppressWarnings("hiding") PStates _states_, @SuppressWarnings("hiding") PTokens _tokens_, @SuppressWarnings("hiding") PIgnTokens _ignTokens_, @SuppressWarnings("hiding") PProductions _productions_, @SuppressWarnings("hiding") PAst _ast_) { // Constructor setPackage(_package_); setHelpers(_helpers_); setStates(_states_); setTokens(_tokens_); setIgnTokens(_ignTokens_); setProductions(_productions_); setAst(_ast_); } @Override public Object clone() { return new AGrammar( cloneList(this._package_), cloneNode(this._helpers_), cloneNode(this._states_), cloneNode(this._tokens_), cloneNode(this._ignTokens_), cloneNode(this._productions_), cloneNode(this._ast_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAGrammar(this); } public LinkedList getPackage() { return this._package_; } public void setPackage(List list) { for(TPkgId e : this._package_) { e.parent(null); } this._package_.clear(); for(Object obj_e : list) { TPkgId e = (TPkgId) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._package_.add(e); } } public PHelpers getHelpers() { return this._helpers_; } public void setHelpers(PHelpers node) { if(this._helpers_ != null) { this._helpers_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._helpers_ = node; } public PStates getStates() { return this._states_; } public void setStates(PStates node) { if(this._states_ != null) { this._states_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._states_ = node; } public PTokens getTokens() { return this._tokens_; } public void setTokens(PTokens node) { if(this._tokens_ != null) { this._tokens_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._tokens_ = node; } public PIgnTokens getIgnTokens() { return this._ignTokens_; } public void setIgnTokens(PIgnTokens node) { if(this._ignTokens_ != null) { this._ignTokens_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._ignTokens_ = node; } public PProductions getProductions() { return this._productions_; } public void setProductions(PProductions node) { if(this._productions_ != null) { this._productions_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._productions_ = node; } public PAst getAst() { return this._ast_; } public void setAst(PAst node) { if(this._ast_ != null) { this._ast_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._ast_ = node; } @Override public String toString() { return "" + toString(this._package_) + toString(this._helpers_) + toString(this._states_) + toString(this._tokens_) + toString(this._ignTokens_) + toString(this._productions_) + toString(this._ast_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._package_.remove(child)) { return; } if(this._helpers_ == child) { this._helpers_ = null; return; } if(this._states_ == child) { this._states_ = null; return; } if(this._tokens_ == child) { this._tokens_ = null; return; } if(this._ignTokens_ == child) { this._ignTokens_ = null; return; } if(this._productions_ == child) { this._productions_ = null; return; } if(this._ast_ == child) { this._ast_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child for(ListIterator i = this._package_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((TPkgId) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } if(this._helpers_ == oldChild) { setHelpers((PHelpers) newChild); return; } if(this._states_ == oldChild) { setStates((PStates) newChild); return; } if(this._tokens_ == oldChild) { setTokens((PTokens) newChild); return; } if(this._ignTokens_ == oldChild) { setIgnTokens((PIgnTokens) newChild); return; } if(this._productions_ == oldChild) { setProductions((PProductions) newChild); return; } if(this._ast_ == oldChild) { setAst((PAst) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AHelperDef.java000066400000000000000000000051111265440641200230560ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AHelperDef extends PHelperDef { private TId _id_; private PRegExp _regExp_; public AHelperDef() { // Constructor } public AHelperDef( @SuppressWarnings("hiding") TId _id_, @SuppressWarnings("hiding") PRegExp _regExp_) { // Constructor setId(_id_); setRegExp(_regExp_); } @Override public Object clone() { return new AHelperDef( cloneNode(this._id_), cloneNode(this._regExp_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAHelperDef(this); } public TId getId() { return this._id_; } public void setId(TId node) { if(this._id_ != null) { this._id_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._id_ = node; } public PRegExp getRegExp() { return this._regExp_; } public void setRegExp(PRegExp node) { if(this._regExp_ != null) { this._regExp_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._regExp_ = node; } @Override public String toString() { return "" + toString(this._id_) + toString(this._regExp_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._id_ == child) { this._id_ = null; return; } if(this._regExp_ == child) { this._regExp_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._id_ == oldChild) { setId((TId) newChild); return; } if(this._regExp_ == oldChild) { setRegExp((PRegExp) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AHelpers.java000066400000000000000000000045431265440641200226320ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AHelpers extends PHelpers { private final LinkedList _helperDefs_ = new LinkedList(); public AHelpers() { // Constructor } public AHelpers( @SuppressWarnings("hiding") List _helperDefs_) { // Constructor setHelperDefs(_helperDefs_); } @Override public Object clone() { return new AHelpers( cloneList(this._helperDefs_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAHelpers(this); } public LinkedList getHelperDefs() { return this._helperDefs_; } public void setHelperDefs(List list) { for(PHelperDef e : this._helperDefs_) { e.parent(null); } this._helperDefs_.clear(); for(Object obj_e : list) { PHelperDef e = (PHelperDef) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._helperDefs_.add(e); } } @Override public String toString() { return "" + toString(this._helperDefs_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._helperDefs_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child for(ListIterator i = this._helperDefs_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PHelperDef) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AHexChar.java000066400000000000000000000035001265440641200225420ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AHexChar extends PChar { private THexChar _hexChar_; public AHexChar() { // Constructor } public AHexChar( @SuppressWarnings("hiding") THexChar _hexChar_) { // Constructor setHexChar(_hexChar_); } @Override public Object clone() { return new AHexChar( cloneNode(this._hexChar_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAHexChar(this); } public THexChar getHexChar() { return this._hexChar_; } public void setHexChar(THexChar node) { if(this._hexChar_ != null) { this._hexChar_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._hexChar_ = node; } @Override public String toString() { return "" + toString(this._hexChar_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._hexChar_ == child) { this._hexChar_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._hexChar_ == oldChild) { setHexChar((THexChar) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AIdBasic.java000066400000000000000000000033301265440641200225170ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AIdBasic extends PBasic { private TId _id_; public AIdBasic() { // Constructor } public AIdBasic( @SuppressWarnings("hiding") TId _id_) { // Constructor setId(_id_); } @Override public Object clone() { return new AIdBasic( cloneNode(this._id_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAIdBasic(this); } public TId getId() { return this._id_; } public void setId(TId node) { if(this._id_ != null) { this._id_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._id_ = node; } @Override public String toString() { return "" + toString(this._id_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._id_ == child) { this._id_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._id_ == oldChild) { setId((TId) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AIgnTokens.java000066400000000000000000000043771265440641200231360ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AIgnTokens extends PIgnTokens { private final LinkedList _listId_ = new LinkedList(); public AIgnTokens() { // Constructor } public AIgnTokens( @SuppressWarnings("hiding") List _listId_) { // Constructor setListId(_listId_); } @Override public Object clone() { return new AIgnTokens( cloneList(this._listId_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAIgnTokens(this); } public LinkedList getListId() { return this._listId_; } public void setListId(List list) { for(TId e : this._listId_) { e.parent(null); } this._listId_.clear(); for(Object obj_e : list) { TId e = (TId) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._listId_.add(e); } } @Override public String toString() { return "" + toString(this._listId_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._listId_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child for(ListIterator i = this._listId_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((TId) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AIntervalSet.java000066400000000000000000000051351265440641200234660ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AIntervalSet extends PSet { private PChar _left_; private PChar _right_; public AIntervalSet() { // Constructor } public AIntervalSet( @SuppressWarnings("hiding") PChar _left_, @SuppressWarnings("hiding") PChar _right_) { // Constructor setLeft(_left_); setRight(_right_); } @Override public Object clone() { return new AIntervalSet( cloneNode(this._left_), cloneNode(this._right_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAIntervalSet(this); } public PChar getLeft() { return this._left_; } public void setLeft(PChar node) { if(this._left_ != null) { this._left_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._left_ = node; } public PChar getRight() { return this._right_; } public void setRight(PChar node) { if(this._right_ != null) { this._right_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._right_ = node; } @Override public String toString() { return "" + toString(this._left_) + toString(this._right_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._left_ == child) { this._left_ = null; return; } if(this._right_ == child) { this._right_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._left_ == oldChild) { setLeft((PChar) newChild); return; } if(this._right_ == oldChild) { setRight((PChar) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AListTerm.java000066400000000000000000000062101265440641200227640ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AListTerm extends PTerm { private TLBkt _lBkt_; private final LinkedList _listTerms_ = new LinkedList(); public AListTerm() { // Constructor } public AListTerm( @SuppressWarnings("hiding") TLBkt _lBkt_, @SuppressWarnings("hiding") List _listTerms_) { // Constructor setLBkt(_lBkt_); setListTerms(_listTerms_); } @Override public Object clone() { return new AListTerm( cloneNode(this._lBkt_), cloneList(this._listTerms_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAListTerm(this); } public TLBkt getLBkt() { return this._lBkt_; } public void setLBkt(TLBkt node) { if(this._lBkt_ != null) { this._lBkt_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._lBkt_ = node; } public LinkedList getListTerms() { return this._listTerms_; } public void setListTerms(List list) { for(PListTerm e : this._listTerms_) { e.parent(null); } this._listTerms_.clear(); for(Object obj_e : list) { PListTerm e = (PListTerm) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._listTerms_.add(e); } } @Override public String toString() { return "" + toString(this._lBkt_) + toString(this._listTerms_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._lBkt_ == child) { this._lBkt_ = null; return; } if(this._listTerms_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._lBkt_ == oldChild) { setLBkt((TLBkt) newChild); return; } for(ListIterator i = this._listTerms_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PListTerm) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AMinusBinOp.java000066400000000000000000000016351265440641200232520ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AMinusBinOp extends PBinOp { public AMinusBinOp() { // Constructor } @Override public Object clone() { return new AMinusBinOp(); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAMinusBinOp(this); } @Override public String toString() { return ""; } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ANewListTerm.java000066400000000000000000000077361265440641200234540ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ANewListTerm extends PListTerm { private PProdName _prodName_; private TLPar _lPar_; private final LinkedList _params_ = new LinkedList(); public ANewListTerm() { // Constructor } public ANewListTerm( @SuppressWarnings("hiding") PProdName _prodName_, @SuppressWarnings("hiding") TLPar _lPar_, @SuppressWarnings("hiding") List _params_) { // Constructor setProdName(_prodName_); setLPar(_lPar_); setParams(_params_); } @Override public Object clone() { return new ANewListTerm( cloneNode(this._prodName_), cloneNode(this._lPar_), cloneList(this._params_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseANewListTerm(this); } public PProdName getProdName() { return this._prodName_; } public void setProdName(PProdName node) { if(this._prodName_ != null) { this._prodName_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._prodName_ = node; } public TLPar getLPar() { return this._lPar_; } public void setLPar(TLPar node) { if(this._lPar_ != null) { this._lPar_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._lPar_ = node; } public LinkedList getParams() { return this._params_; } public void setParams(List list) { for(PTerm e : this._params_) { e.parent(null); } this._params_.clear(); for(Object obj_e : list) { PTerm e = (PTerm) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._params_.add(e); } } @Override public String toString() { return "" + toString(this._prodName_) + toString(this._lPar_) + toString(this._params_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._prodName_ == child) { this._prodName_ = null; return; } if(this._lPar_ == child) { this._lPar_ = null; return; } if(this._params_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._prodName_ == oldChild) { setProdName((PProdName) newChild); return; } if(this._lPar_ == oldChild) { setLPar((TLPar) newChild); return; } for(ListIterator i = this._params_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PTerm) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ANewTerm.java000066400000000000000000000077061265440641200226150ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ANewTerm extends PTerm { private PProdName _prodName_; private TLPar _lPar_; private final LinkedList _params_ = new LinkedList(); public ANewTerm() { // Constructor } public ANewTerm( @SuppressWarnings("hiding") PProdName _prodName_, @SuppressWarnings("hiding") TLPar _lPar_, @SuppressWarnings("hiding") List _params_) { // Constructor setProdName(_prodName_); setLPar(_lPar_); setParams(_params_); } @Override public Object clone() { return new ANewTerm( cloneNode(this._prodName_), cloneNode(this._lPar_), cloneList(this._params_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseANewTerm(this); } public PProdName getProdName() { return this._prodName_; } public void setProdName(PProdName node) { if(this._prodName_ != null) { this._prodName_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._prodName_ = node; } public TLPar getLPar() { return this._lPar_; } public void setLPar(TLPar node) { if(this._lPar_ != null) { this._lPar_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._lPar_ = node; } public LinkedList getParams() { return this._params_; } public void setParams(List list) { for(PTerm e : this._params_) { e.parent(null); } this._params_.clear(); for(Object obj_e : list) { PTerm e = (PTerm) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._params_.add(e); } } @Override public String toString() { return "" + toString(this._prodName_) + toString(this._lPar_) + toString(this._params_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._prodName_ == child) { this._prodName_ = null; return; } if(this._lPar_ == child) { this._lPar_ = null; return; } if(this._params_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._prodName_ == oldChild) { setProdName((PProdName) newChild); return; } if(this._lPar_ == oldChild) { setLPar((TLPar) newChild); return; } for(ListIterator i = this._params_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PTerm) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ANullTerm.java000066400000000000000000000016241265440641200227670ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ANullTerm extends PTerm { public ANullTerm() { // Constructor } @Override public Object clone() { return new ANullTerm(); } @Override public void apply(Switch sw) { ((Analysis) sw).caseANullTerm(this); } @Override public String toString() { return ""; } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AOperationSet.java000066400000000000000000000066721265440641200236510ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AOperationSet extends PSet { private PBasic _left_; private PBinOp _binOp_; private PBasic _right_; public AOperationSet() { // Constructor } public AOperationSet( @SuppressWarnings("hiding") PBasic _left_, @SuppressWarnings("hiding") PBinOp _binOp_, @SuppressWarnings("hiding") PBasic _right_) { // Constructor setLeft(_left_); setBinOp(_binOp_); setRight(_right_); } @Override public Object clone() { return new AOperationSet( cloneNode(this._left_), cloneNode(this._binOp_), cloneNode(this._right_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAOperationSet(this); } public PBasic getLeft() { return this._left_; } public void setLeft(PBasic node) { if(this._left_ != null) { this._left_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._left_ = node; } public PBinOp getBinOp() { return this._binOp_; } public void setBinOp(PBinOp node) { if(this._binOp_ != null) { this._binOp_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._binOp_ = node; } public PBasic getRight() { return this._right_; } public void setRight(PBasic node) { if(this._right_ != null) { this._right_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._right_ = node; } @Override public String toString() { return "" + toString(this._left_) + toString(this._binOp_) + toString(this._right_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._left_ == child) { this._left_ = null; return; } if(this._binOp_ == child) { this._binOp_ = null; return; } if(this._right_ == child) { this._right_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._left_ == oldChild) { setLeft((PBasic) newChild); return; } if(this._binOp_ == oldChild) { setBinOp((PBinOp) newChild); return; } if(this._right_ == oldChild) { setRight((PBasic) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/APlusBinOp.java000066400000000000000000000016311265440641200230760ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class APlusBinOp extends PBinOp { public APlusBinOp() { // Constructor } @Override public Object clone() { return new APlusBinOp(); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAPlusBinOp(this); } @Override public String toString() { return ""; } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/APlusUnOp.java000066400000000000000000000034061265440641200227520ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class APlusUnOp extends PUnOp { private TPlus _plus_; public APlusUnOp() { // Constructor } public APlusUnOp( @SuppressWarnings("hiding") TPlus _plus_) { // Constructor setPlus(_plus_); } @Override public Object clone() { return new APlusUnOp( cloneNode(this._plus_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAPlusUnOp(this); } public TPlus getPlus() { return this._plus_; } public void setPlus(TPlus node) { if(this._plus_ != null) { this._plus_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._plus_ = node; } @Override public String toString() { return "" + toString(this._plus_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._plus_ == child) { this._plus_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._plus_ == oldChild) { setPlus((TPlus) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AProd.java000066400000000000000000000122601265440641200221270ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AProd extends PProd { private TId _id_; private TArrow _arrow_; private final LinkedList _prodTransform_ = new LinkedList(); private final LinkedList _alts_ = new LinkedList(); public AProd() { // Constructor } public AProd( @SuppressWarnings("hiding") TId _id_, @SuppressWarnings("hiding") TArrow _arrow_, @SuppressWarnings("hiding") List _prodTransform_, @SuppressWarnings("hiding") List _alts_) { // Constructor setId(_id_); setArrow(_arrow_); setProdTransform(_prodTransform_); setAlts(_alts_); } @Override public Object clone() { return new AProd( cloneNode(this._id_), cloneNode(this._arrow_), cloneList(this._prodTransform_), cloneList(this._alts_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAProd(this); } public TId getId() { return this._id_; } public void setId(TId node) { if(this._id_ != null) { this._id_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._id_ = node; } public TArrow getArrow() { return this._arrow_; } public void setArrow(TArrow node) { if(this._arrow_ != null) { this._arrow_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._arrow_ = node; } public LinkedList getProdTransform() { return this._prodTransform_; } public void setProdTransform(List list) { for(PElem e : this._prodTransform_) { e.parent(null); } this._prodTransform_.clear(); for(Object obj_e : list) { PElem e = (PElem) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._prodTransform_.add(e); } } public LinkedList getAlts() { return this._alts_; } public void setAlts(List list) { for(PAlt e : this._alts_) { e.parent(null); } this._alts_.clear(); for(Object obj_e : list) { PAlt e = (PAlt) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._alts_.add(e); } } @Override public String toString() { return "" + toString(this._id_) + toString(this._arrow_) + toString(this._prodTransform_) + toString(this._alts_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._id_ == child) { this._id_ = null; return; } if(this._arrow_ == child) { this._arrow_ = null; return; } if(this._prodTransform_.remove(child)) { return; } if(this._alts_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._id_ == oldChild) { setId((TId) newChild); return; } if(this._arrow_ == oldChild) { setArrow((TArrow) newChild); return; } for(ListIterator i = this._prodTransform_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PElem) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } for(ListIterator i = this._alts_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PAlt) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AProdName.java000066400000000000000000000052171265440641200227340ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AProdName extends PProdName { private TId _id_; private TId _prodNameTail_; public AProdName() { // Constructor } public AProdName( @SuppressWarnings("hiding") TId _id_, @SuppressWarnings("hiding") TId _prodNameTail_) { // Constructor setId(_id_); setProdNameTail(_prodNameTail_); } @Override public Object clone() { return new AProdName( cloneNode(this._id_), cloneNode(this._prodNameTail_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAProdName(this); } public TId getId() { return this._id_; } public void setId(TId node) { if(this._id_ != null) { this._id_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._id_ = node; } public TId getProdNameTail() { return this._prodNameTail_; } public void setProdNameTail(TId node) { if(this._prodNameTail_ != null) { this._prodNameTail_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._prodNameTail_ = node; } @Override public String toString() { return "" + toString(this._id_) + toString(this._prodNameTail_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._id_ == child) { this._id_ = null; return; } if(this._prodNameTail_ == child) { this._prodNameTail_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._id_ == oldChild) { setId((TId) newChild); return; } if(this._prodNameTail_ == oldChild) { setProdNameTail((TId) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AProductionSpecifier.java000066400000000000000000000017051265440641200252050ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AProductionSpecifier extends PSpecifier { public AProductionSpecifier() { // Constructor } @Override public Object clone() { return new AProductionSpecifier(); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAProductionSpecifier(this); } @Override public String toString() { return ""; } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AProductions.java000066400000000000000000000044151265440641200235370ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AProductions extends PProductions { private final LinkedList _prods_ = new LinkedList(); public AProductions() { // Constructor } public AProductions( @SuppressWarnings("hiding") List _prods_) { // Constructor setProds(_prods_); } @Override public Object clone() { return new AProductions( cloneList(this._prods_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAProductions(this); } public LinkedList getProds() { return this._prods_; } public void setProds(List list) { for(PProd e : this._prods_) { e.parent(null); } this._prods_.clear(); for(Object obj_e : list) { PProd e = (PProd) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._prods_.add(e); } } @Override public String toString() { return "" + toString(this._prods_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._prods_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child for(ListIterator i = this._prods_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PProd) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AQMarkUnOp.java000066400000000000000000000034401265440641200230400ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AQMarkUnOp extends PUnOp { private TQMark _qMark_; public AQMarkUnOp() { // Constructor } public AQMarkUnOp( @SuppressWarnings("hiding") TQMark _qMark_) { // Constructor setQMark(_qMark_); } @Override public Object clone() { return new AQMarkUnOp( cloneNode(this._qMark_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAQMarkUnOp(this); } public TQMark getQMark() { return this._qMark_; } public void setQMark(TQMark node) { if(this._qMark_ != null) { this._qMark_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._qMark_ = node; } @Override public String toString() { return "" + toString(this._qMark_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._qMark_ == child) { this._qMark_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._qMark_ == oldChild) { setQMark((TQMark) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ARegExp.java000066400000000000000000000044331265440641200224200ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ARegExp extends PRegExp { private final LinkedList _concats_ = new LinkedList(); public ARegExp() { // Constructor } public ARegExp( @SuppressWarnings("hiding") List _concats_) { // Constructor setConcats(_concats_); } @Override public Object clone() { return new ARegExp( cloneList(this._concats_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseARegExp(this); } public LinkedList getConcats() { return this._concats_; } public void setConcats(List list) { for(PConcat e : this._concats_) { e.parent(null); } this._concats_.clear(); for(Object obj_e : list) { PConcat e = (PConcat) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._concats_.add(e); } } @Override public String toString() { return "" + toString(this._concats_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._concats_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child for(ListIterator i = this._concats_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PConcat) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ARegExpBasic.java000066400000000000000000000035001265440641200233540ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ARegExpBasic extends PBasic { private PRegExp _regExp_; public ARegExpBasic() { // Constructor } public ARegExpBasic( @SuppressWarnings("hiding") PRegExp _regExp_) { // Constructor setRegExp(_regExp_); } @Override public Object clone() { return new ARegExpBasic( cloneNode(this._regExp_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseARegExpBasic(this); } public PRegExp getRegExp() { return this._regExp_; } public void setRegExp(PRegExp node) { if(this._regExp_ != null) { this._regExp_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._regExp_ = node; } @Override public String toString() { return "" + toString(this._regExp_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._regExp_ == child) { this._regExp_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._regExp_ == oldChild) { setRegExp((PRegExp) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ASetBasic.java000066400000000000000000000033621265440641200227230ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ASetBasic extends PBasic { private PSet _set_; public ASetBasic() { // Constructor } public ASetBasic( @SuppressWarnings("hiding") PSet _set_) { // Constructor setSet(_set_); } @Override public Object clone() { return new ASetBasic( cloneNode(this._set_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseASetBasic(this); } public PSet getSet() { return this._set_; } public void setSet(PSet node) { if(this._set_ != null) { this._set_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._set_ = node; } @Override public String toString() { return "" + toString(this._set_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._set_ == child) { this._set_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._set_ == oldChild) { setSet((PSet) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ASimpleListTerm.java000066400000000000000000000071571265440641200241510ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ASimpleListTerm extends PListTerm { private PSpecifier _specifier_; private TId _id_; private TId _simpleTermTail_; public ASimpleListTerm() { // Constructor } public ASimpleListTerm( @SuppressWarnings("hiding") PSpecifier _specifier_, @SuppressWarnings("hiding") TId _id_, @SuppressWarnings("hiding") TId _simpleTermTail_) { // Constructor setSpecifier(_specifier_); setId(_id_); setSimpleTermTail(_simpleTermTail_); } @Override public Object clone() { return new ASimpleListTerm( cloneNode(this._specifier_), cloneNode(this._id_), cloneNode(this._simpleTermTail_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseASimpleListTerm(this); } public PSpecifier getSpecifier() { return this._specifier_; } public void setSpecifier(PSpecifier node) { if(this._specifier_ != null) { this._specifier_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._specifier_ = node; } public TId getId() { return this._id_; } public void setId(TId node) { if(this._id_ != null) { this._id_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._id_ = node; } public TId getSimpleTermTail() { return this._simpleTermTail_; } public void setSimpleTermTail(TId node) { if(this._simpleTermTail_ != null) { this._simpleTermTail_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._simpleTermTail_ = node; } @Override public String toString() { return "" + toString(this._specifier_) + toString(this._id_) + toString(this._simpleTermTail_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._specifier_ == child) { this._specifier_ = null; return; } if(this._id_ == child) { this._id_ = null; return; } if(this._simpleTermTail_ == child) { this._simpleTermTail_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._specifier_ == oldChild) { setSpecifier((PSpecifier) newChild); return; } if(this._id_ == oldChild) { setId((TId) newChild); return; } if(this._simpleTermTail_ == oldChild) { setSimpleTermTail((TId) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ASimpleTerm.java000066400000000000000000000071271265440641200233120ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ASimpleTerm extends PTerm { private PSpecifier _specifier_; private TId _id_; private TId _simpleTermTail_; public ASimpleTerm() { // Constructor } public ASimpleTerm( @SuppressWarnings("hiding") PSpecifier _specifier_, @SuppressWarnings("hiding") TId _id_, @SuppressWarnings("hiding") TId _simpleTermTail_) { // Constructor setSpecifier(_specifier_); setId(_id_); setSimpleTermTail(_simpleTermTail_); } @Override public Object clone() { return new ASimpleTerm( cloneNode(this._specifier_), cloneNode(this._id_), cloneNode(this._simpleTermTail_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseASimpleTerm(this); } public PSpecifier getSpecifier() { return this._specifier_; } public void setSpecifier(PSpecifier node) { if(this._specifier_ != null) { this._specifier_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._specifier_ = node; } public TId getId() { return this._id_; } public void setId(TId node) { if(this._id_ != null) { this._id_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._id_ = node; } public TId getSimpleTermTail() { return this._simpleTermTail_; } public void setSimpleTermTail(TId node) { if(this._simpleTermTail_ != null) { this._simpleTermTail_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._simpleTermTail_ = node; } @Override public String toString() { return "" + toString(this._specifier_) + toString(this._id_) + toString(this._simpleTermTail_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._specifier_ == child) { this._specifier_ = null; return; } if(this._id_ == child) { this._id_ = null; return; } if(this._simpleTermTail_ == child) { this._simpleTermTail_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._specifier_ == oldChild) { setSpecifier((PSpecifier) newChild); return; } if(this._id_ == oldChild) { setId((TId) newChild); return; } if(this._simpleTermTail_ == oldChild) { setSimpleTermTail((TId) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AStarUnOp.java000066400000000000000000000034061265440641200227400ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AStarUnOp extends PUnOp { private TStar _star_; public AStarUnOp() { // Constructor } public AStarUnOp( @SuppressWarnings("hiding") TStar _star_) { // Constructor setStar(_star_); } @Override public Object clone() { return new AStarUnOp( cloneNode(this._star_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAStarUnOp(this); } public TStar getStar() { return this._star_; } public void setStar(TStar node) { if(this._star_ != null) { this._star_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._star_ = node; } @Override public String toString() { return "" + toString(this._star_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._star_ == child) { this._star_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._star_ == oldChild) { setStar((TStar) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AStateList.java000066400000000000000000000101251265440641200231350ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AStateList extends PStateList { private TId _id_; private PTransition _transition_; private final LinkedList _stateLists_ = new LinkedList(); public AStateList() { // Constructor } public AStateList( @SuppressWarnings("hiding") TId _id_, @SuppressWarnings("hiding") PTransition _transition_, @SuppressWarnings("hiding") List _stateLists_) { // Constructor setId(_id_); setTransition(_transition_); setStateLists(_stateLists_); } @Override public Object clone() { return new AStateList( cloneNode(this._id_), cloneNode(this._transition_), cloneList(this._stateLists_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAStateList(this); } public TId getId() { return this._id_; } public void setId(TId node) { if(this._id_ != null) { this._id_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._id_ = node; } public PTransition getTransition() { return this._transition_; } public void setTransition(PTransition node) { if(this._transition_ != null) { this._transition_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._transition_ = node; } public LinkedList getStateLists() { return this._stateLists_; } public void setStateLists(List list) { for(PStateListTail e : this._stateLists_) { e.parent(null); } this._stateLists_.clear(); for(Object obj_e : list) { PStateListTail e = (PStateListTail) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._stateLists_.add(e); } } @Override public String toString() { return "" + toString(this._id_) + toString(this._transition_) + toString(this._stateLists_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._id_ == child) { this._id_ = null; return; } if(this._transition_ == child) { this._transition_ = null; return; } if(this._stateLists_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._id_ == oldChild) { setId((TId) newChild); return; } if(this._transition_ == oldChild) { setTransition((PTransition) newChild); return; } for(ListIterator i = this._stateLists_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PStateListTail) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AStateListTail.java000066400000000000000000000052651265440641200237600ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AStateListTail extends PStateListTail { private TId _id_; private PTransition _transition_; public AStateListTail() { // Constructor } public AStateListTail( @SuppressWarnings("hiding") TId _id_, @SuppressWarnings("hiding") PTransition _transition_) { // Constructor setId(_id_); setTransition(_transition_); } @Override public Object clone() { return new AStateListTail( cloneNode(this._id_), cloneNode(this._transition_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAStateListTail(this); } public TId getId() { return this._id_; } public void setId(TId node) { if(this._id_ != null) { this._id_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._id_ = node; } public PTransition getTransition() { return this._transition_; } public void setTransition(PTransition node) { if(this._transition_ != null) { this._transition_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._transition_ = node; } @Override public String toString() { return "" + toString(this._id_) + toString(this._transition_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._id_ == child) { this._id_ = null; return; } if(this._transition_ == child) { this._transition_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._id_ == oldChild) { setId((TId) newChild); return; } if(this._transition_ == oldChild) { setTransition((PTransition) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AStates.java000066400000000000000000000043551265440641200224740ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AStates extends PStates { private final LinkedList _listId_ = new LinkedList(); public AStates() { // Constructor } public AStates( @SuppressWarnings("hiding") List _listId_) { // Constructor setListId(_listId_); } @Override public Object clone() { return new AStates( cloneList(this._listId_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAStates(this); } public LinkedList getListId() { return this._listId_; } public void setListId(List list) { for(TId e : this._listId_) { e.parent(null); } this._listId_.clear(); for(Object obj_e : list) { TId e = (TId) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._listId_.add(e); } } @Override public String toString() { return "" + toString(this._listId_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._listId_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child for(ListIterator i = this._listId_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((TId) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AStringBasic.java000066400000000000000000000035001265440641200234300ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AStringBasic extends PBasic { private TString _string_; public AStringBasic() { // Constructor } public AStringBasic( @SuppressWarnings("hiding") TString _string_) { // Constructor setString(_string_); } @Override public Object clone() { return new AStringBasic( cloneNode(this._string_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAStringBasic(this); } public TString getString() { return this._string_; } public void setString(TString node) { if(this._string_ != null) { this._string_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._string_ = node; } @Override public String toString() { return "" + toString(this._string_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._string_ == child) { this._string_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._string_ == oldChild) { setString((TString) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ATokenDef.java000066400000000000000000000123061265440641200227230ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ATokenDef extends PTokenDef { private PStateList _stateList_; private TId _id_; private PRegExp _regExp_; private TSlash _slash_; private PRegExp _lookAhead_; public ATokenDef() { // Constructor } public ATokenDef( @SuppressWarnings("hiding") PStateList _stateList_, @SuppressWarnings("hiding") TId _id_, @SuppressWarnings("hiding") PRegExp _regExp_, @SuppressWarnings("hiding") TSlash _slash_, @SuppressWarnings("hiding") PRegExp _lookAhead_) { // Constructor setStateList(_stateList_); setId(_id_); setRegExp(_regExp_); setSlash(_slash_); setLookAhead(_lookAhead_); } @Override public Object clone() { return new ATokenDef( cloneNode(this._stateList_), cloneNode(this._id_), cloneNode(this._regExp_), cloneNode(this._slash_), cloneNode(this._lookAhead_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseATokenDef(this); } public PStateList getStateList() { return this._stateList_; } public void setStateList(PStateList node) { if(this._stateList_ != null) { this._stateList_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._stateList_ = node; } public TId getId() { return this._id_; } public void setId(TId node) { if(this._id_ != null) { this._id_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._id_ = node; } public PRegExp getRegExp() { return this._regExp_; } public void setRegExp(PRegExp node) { if(this._regExp_ != null) { this._regExp_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._regExp_ = node; } public TSlash getSlash() { return this._slash_; } public void setSlash(TSlash node) { if(this._slash_ != null) { this._slash_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._slash_ = node; } public PRegExp getLookAhead() { return this._lookAhead_; } public void setLookAhead(PRegExp node) { if(this._lookAhead_ != null) { this._lookAhead_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._lookAhead_ = node; } @Override public String toString() { return "" + toString(this._stateList_) + toString(this._id_) + toString(this._regExp_) + toString(this._slash_) + toString(this._lookAhead_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._stateList_ == child) { this._stateList_ = null; return; } if(this._id_ == child) { this._id_ = null; return; } if(this._regExp_ == child) { this._regExp_ = null; return; } if(this._slash_ == child) { this._slash_ = null; return; } if(this._lookAhead_ == child) { this._lookAhead_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._stateList_ == oldChild) { setStateList((PStateList) newChild); return; } if(this._id_ == oldChild) { setId((TId) newChild); return; } if(this._regExp_ == oldChild) { setRegExp((PRegExp) newChild); return; } if(this._slash_ == oldChild) { setSlash((TSlash) newChild); return; } if(this._lookAhead_ == oldChild) { setLookAhead((PRegExp) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ATokenSpecifier.java000066400000000000000000000016611265440641200241400ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ATokenSpecifier extends PSpecifier { public ATokenSpecifier() { // Constructor } @Override public Object clone() { return new ATokenSpecifier(); } @Override public void apply(Switch sw) { ((Analysis) sw).caseATokenSpecifier(this); } @Override public String toString() { return ""; } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ATokens.java000066400000000000000000000045071265440641200224730ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ATokens extends PTokens { private final LinkedList _tokenDefs_ = new LinkedList(); public ATokens() { // Constructor } public ATokens( @SuppressWarnings("hiding") List _tokenDefs_) { // Constructor setTokenDefs(_tokenDefs_); } @Override public Object clone() { return new ATokens( cloneList(this._tokenDefs_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseATokens(this); } public LinkedList getTokenDefs() { return this._tokenDefs_; } public void setTokenDefs(List list) { for(PTokenDef e : this._tokenDefs_) { e.parent(null); } this._tokenDefs_.clear(); for(Object obj_e : list) { PTokenDef e = (PTokenDef) obj_e; if(e.parent() != null) { e.parent().removeChild(e); } e.parent(this); this._tokenDefs_.add(e); } } @Override public String toString() { return "" + toString(this._tokenDefs_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._tokenDefs_.remove(child)) { return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child for(ListIterator i = this._tokenDefs_.listIterator(); i.hasNext();) { if(i.next() == oldChild) { if(newChild != null) { i.set((PTokenDef) newChild); newChild.parent(this); oldChild.parent(null); return; } i.remove(); oldChild.parent(null); return; } } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/ATransition.java000066400000000000000000000033541265440641200233610ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class ATransition extends PTransition { private TId _id_; public ATransition() { // Constructor } public ATransition( @SuppressWarnings("hiding") TId _id_) { // Constructor setId(_id_); } @Override public Object clone() { return new ATransition( cloneNode(this._id_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseATransition(this); } public TId getId() { return this._id_; } public void setId(TId node) { if(this._id_ != null) { this._id_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._id_ = node; } @Override public String toString() { return "" + toString(this._id_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._id_ == child) { this._id_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._id_ == oldChild) { setId((TId) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/AUnExp.java000066400000000000000000000051061265440641200222630ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class AUnExp extends PUnExp { private PBasic _basic_; private PUnOp _unOp_; public AUnExp() { // Constructor } public AUnExp( @SuppressWarnings("hiding") PBasic _basic_, @SuppressWarnings("hiding") PUnOp _unOp_) { // Constructor setBasic(_basic_); setUnOp(_unOp_); } @Override public Object clone() { return new AUnExp( cloneNode(this._basic_), cloneNode(this._unOp_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseAUnExp(this); } public PBasic getBasic() { return this._basic_; } public void setBasic(PBasic node) { if(this._basic_ != null) { this._basic_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._basic_ = node; } public PUnOp getUnOp() { return this._unOp_; } public void setUnOp(PUnOp node) { if(this._unOp_ != null) { this._unOp_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._unOp_ = node; } @Override public String toString() { return "" + toString(this._basic_) + toString(this._unOp_); } @Override void removeChild(@SuppressWarnings("unused") Node child) { // Remove child if(this._basic_ == child) { this._basic_ = null; return; } if(this._unOp_ == child) { this._unOp_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { // Replace child if(this._basic_ == oldChild) { setBasic((PBasic) newChild); return; } if(this._unOp_ == oldChild) { setUnOp((PUnOp) newChild); return; } throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/node/EOF.java000066400000000000000000000010711265440641200215310ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class EOF extends Token { public EOF() { setText(""); } public EOF(int line, int pos) { setText(""); setLine(line); setPos(pos); } @Override public Object clone() { return new EOF(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseEOF(this); } } sablecc-3.7/src/org/sablecc/sablecc/node/InvalidToken.java000066400000000000000000000012151265440641200235070ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class InvalidToken extends Token { public InvalidToken(String text) { setText(text); } public InvalidToken(String text, int line, int pos) { setText(text); setLine(line); setPos(pos); } @Override public Object clone() { return new InvalidToken(getText(), getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseInvalidToken(this); } } sablecc-3.7/src/org/sablecc/sablecc/node/Node.java000066400000000000000000000027621265440641200220150ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import java.util.*; @SuppressWarnings("nls") public abstract class Node implements Switchable, Cloneable { private Node parent; @Override public abstract Object clone(); public Node parent() { return this.parent; } void parent(@SuppressWarnings("hiding") Node parent) { this.parent = parent; } abstract void removeChild(Node child); abstract void replaceChild(Node oldChild, Node newChild); public void replaceBy(Node node) { this.parent.replaceChild(this, node); } protected String toString(Node node) { if(node != null) { return node.toString(); } return ""; } protected String toString(List list) { StringBuffer s = new StringBuffer(); for(Iterator i = list.iterator(); i.hasNext();) { s.append(i.next()); } return s.toString(); } @SuppressWarnings("unchecked") protected T cloneNode(T node) { if(node != null) { return (T) node.clone(); } return null; } @SuppressWarnings("unchecked") protected List cloneList(List list) { List clone = new LinkedList(); for(T n : list) { clone.add((T) n.clone()); } return clone; } } sablecc-3.7/src/org/sablecc/sablecc/node/PAlt.java000066400000000000000000000002461265440641200217630ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PAlt extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PAltTransform.java000066400000000000000000000002571265440641200236610ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PAltTransform extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PAst.java000066400000000000000000000002461265440641200217720ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PAst extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PAstAlt.java000066400000000000000000000002511265440641200224270ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PAstAlt extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PAstProd.java000066400000000000000000000002521265440641200226140ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PAstProd extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PBasic.java000066400000000000000000000002501265440641200222570ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PBasic extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PBinOp.java000066400000000000000000000002501265440641200222450ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PBinOp extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PChar.java000066400000000000000000000002471265440641200221210ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PChar extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PConcat.java000066400000000000000000000002511265440641200224460ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PConcat extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PElem.java000066400000000000000000000002471265440641200221260ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PElem extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PGrammar.java000066400000000000000000000002521265440641200226260ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PGrammar extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PHelperDef.java000066400000000000000000000002541265440641200231000ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PHelperDef extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PHelpers.java000066400000000000000000000002521265440641200226420ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PHelpers extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PIgnTokens.java000066400000000000000000000002541265440641200231430ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PIgnTokens extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PListTerm.java000066400000000000000000000002531265440641200230040ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PListTerm extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PProd.java000066400000000000000000000002471265440641200221500ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PProd extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PProdName.java000066400000000000000000000002531265440641200227460ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PProdName extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PProductions.java000066400000000000000000000002561265440641200235550ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PProductions extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PRegExp.java000066400000000000000000000002511265440641200224310ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PRegExp extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PSet.java000066400000000000000000000002461265440641200217760ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PSet extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PSpecifier.java000066400000000000000000000002541265440641200231530ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PSpecifier extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PStateList.java000066400000000000000000000002541265440641200231560ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PStateList extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PStateListTail.java000066400000000000000000000002601265440641200237650ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PStateListTail extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PStates.java000066400000000000000000000002511265440641200225020ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PStates extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PTerm.java000066400000000000000000000002471265440641200221530ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PTerm extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PTokenDef.java000066400000000000000000000002531265440641200227400ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PTokenDef extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PTokens.java000066400000000000000000000002511265440641200225020ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PTokens extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PTransition.java000066400000000000000000000002551265440641200233750ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PTransition extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PUnExp.java000066400000000000000000000002501265440641200222750ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PUnExp extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/PUnOp.java000066400000000000000000000002471265440641200221250ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public abstract class PUnOp extends Node { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/Start.java000066400000000000000000000047001265440641200222170ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class Start extends Node { private PGrammar _pGrammar_; private EOF _eof_; public Start() { // Empty body } public Start( @SuppressWarnings("hiding") PGrammar _pGrammar_, @SuppressWarnings("hiding") EOF _eof_) { setPGrammar(_pGrammar_); setEOF(_eof_); } @Override public Object clone() { return new Start( cloneNode(this._pGrammar_), cloneNode(this._eof_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseStart(this); } public PGrammar getPGrammar() { return this._pGrammar_; } public void setPGrammar(PGrammar node) { if(this._pGrammar_ != null) { this._pGrammar_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._pGrammar_ = node; } public EOF getEOF() { return this._eof_; } public void setEOF(EOF node) { if(this._eof_ != null) { this._eof_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._eof_ = node; } @Override void removeChild(Node child) { if(this._pGrammar_ == child) { this._pGrammar_ = null; return; } if(this._eof_ == child) { this._eof_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(Node oldChild, Node newChild) { if(this._pGrammar_ == oldChild) { setPGrammar((PGrammar) newChild); return; } if(this._eof_ == oldChild) { setEOF((EOF) newChild); return; } throw new RuntimeException("Not a child."); } @Override public String toString() { return "" + toString(this._pGrammar_) + toString(this._eof_); } } sablecc-3.7/src/org/sablecc/sablecc/node/Switch.java000066400000000000000000000002321265440641200223570ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public interface Switch { // Empty body } sablecc-3.7/src/org/sablecc/sablecc/node/Switchable.java000066400000000000000000000002431265440641200232050ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; public interface Switchable { void apply(Switch sw); } sablecc-3.7/src/org/sablecc/sablecc/node/TAbstract.java000066400000000000000000000014221265440641200230070ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TAbstract extends Token { public TAbstract() { super.setText("Abstract"); } public TAbstract(int line, int pos) { super.setText("Abstract"); setLine(line); setPos(pos); } @Override public Object clone() { return new TAbstract(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTAbstract(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TAbstract text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TArrow.java000066400000000000000000000013641265440641200223430ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TArrow extends Token { public TArrow() { super.setText("->"); } public TArrow(int line, int pos) { super.setText("->"); setLine(line); setPos(pos); } @Override public Object clone() { return new TArrow(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTArrow(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TArrow text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TBar.java000066400000000000000000000013461265440641200217550ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TBar extends Token { public TBar() { super.setText("|"); } public TBar(int line, int pos) { super.setText("|"); setLine(line); setPos(pos); } @Override public Object clone() { return new TBar(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTBar(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TBar text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TBlank.java000066400000000000000000000011551265440641200222760ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TBlank extends Token { public TBlank(String text) { setText(text); } public TBlank(String text, int line, int pos) { setText(text); setLine(line); setPos(pos); } @Override public Object clone() { return new TBlank(getText(), getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTBlank(this); } } sablecc-3.7/src/org/sablecc/sablecc/node/TChar.java000066400000000000000000000011501265440641200221170ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TChar extends Token { public TChar(String text) { setText(text); } public TChar(String text, int line, int pos) { setText(text); setLine(line); setPos(pos); } @Override public Object clone() { return new TChar(getText(), getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTChar(this); } } sablecc-3.7/src/org/sablecc/sablecc/node/TColon.java000066400000000000000000000013621265440641200223210ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TColon extends Token { public TColon() { super.setText(":"); } public TColon(int line, int pos) { super.setText(":"); setLine(line); setPos(pos); } @Override public Object clone() { return new TColon(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTColon(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TColon text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TComma.java000066400000000000000000000013621265440641200223030ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TComma extends Token { public TComma() { super.setText(","); } public TComma(int line, int pos) { super.setText(","); setLine(line); setPos(pos); } @Override public Object clone() { return new TComma(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTComma(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TComma text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TComment.java000066400000000000000000000011671265440641200226540ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TComment extends Token { public TComment(String text) { setText(text); } public TComment(String text, int line, int pos) { setText(text); setLine(line); setPos(pos); } @Override public Object clone() { return new TComment(getText(), getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTComment(this); } } sablecc-3.7/src/org/sablecc/sablecc/node/TDDot.java000066400000000000000000000013561265440641200221040ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TDDot extends Token { public TDDot() { super.setText(".."); } public TDDot(int line, int pos) { super.setText(".."); setLine(line); setPos(pos); } @Override public Object clone() { return new TDDot(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTDDot(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TDDot text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TDecChar.java000066400000000000000000000011671265440641200225430ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TDecChar extends Token { public TDecChar(String text) { setText(text); } public TDecChar(String text, int line, int pos) { setText(text); setLine(line); setPos(pos); } @Override public Object clone() { return new TDecChar(getText(), getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTDecChar(this); } } sablecc-3.7/src/org/sablecc/sablecc/node/TDot.java000066400000000000000000000013461265440641200217770ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TDot extends Token { public TDot() { super.setText("."); } public TDot(int line, int pos) { super.setText("."); setLine(line); setPos(pos); } @Override public Object clone() { return new TDot(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTDot(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TDot text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TEqual.java000066400000000000000000000013621265440641200223160ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TEqual extends Token { public TEqual() { super.setText("="); } public TEqual(int line, int pos) { super.setText("="); setLine(line); setPos(pos); } @Override public Object clone() { return new TEqual(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTEqual(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TEqual text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/THelpers.java000066400000000000000000000014121265440641200226450ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class THelpers extends Token { public THelpers() { super.setText("Helpers"); } public THelpers(int line, int pos) { super.setText("Helpers"); setLine(line); setPos(pos); } @Override public Object clone() { return new THelpers(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTHelpers(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change THelpers text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/THexChar.java000066400000000000000000000011671265440641200225740ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class THexChar extends Token { public THexChar(String text) { setText(text); } public THexChar(String text, int line, int pos) { setText(text); setLine(line); setPos(pos); } @Override public Object clone() { return new THexChar(getText(), getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTHexChar(this); } } sablecc-3.7/src/org/sablecc/sablecc/node/TId.java000066400000000000000000000011361265440641200216020ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TId extends Token { public TId(String text) { setText(text); } public TId(String text, int line, int pos) { setText(text); setLine(line); setPos(pos); } @Override public Object clone() { return new TId(getText(), getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTId(this); } } sablecc-3.7/src/org/sablecc/sablecc/node/TIgnored.java000066400000000000000000000014121265440641200226320ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TIgnored extends Token { public TIgnored() { super.setText("Ignored"); } public TIgnored(int line, int pos) { super.setText("Ignored"); setLine(line); setPos(pos); } @Override public Object clone() { return new TIgnored(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTIgnored(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TIgnored text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TLBkt.java000066400000000000000000000013541265440641200221040ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TLBkt extends Token { public TLBkt() { super.setText("["); } public TLBkt(int line, int pos) { super.setText("["); setLine(line); setPos(pos); } @Override public Object clone() { return new TLBkt(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTLBkt(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TLBkt text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TLBrace.java000066400000000000000000000013701265440641200223760ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TLBrace extends Token { public TLBrace() { super.setText("{"); } public TLBrace(int line, int pos) { super.setText("{"); setLine(line); setPos(pos); } @Override public Object clone() { return new TLBrace(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTLBrace(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TLBrace text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TLPar.java000066400000000000000000000013541265440641200221060ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TLPar extends Token { public TLPar() { super.setText("("); } public TLPar(int line, int pos) { super.setText("("); setLine(line); setPos(pos); } @Override public Object clone() { return new TLPar(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTLPar(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TLPar text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TMinus.java000066400000000000000000000013621265440641200223420ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TMinus extends Token { public TMinus() { super.setText("-"); } public TMinus(int line, int pos) { super.setText("-"); setLine(line); setPos(pos); } @Override public Object clone() { return new TMinus(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTMinus(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TMinus text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TNew.java000066400000000000000000000013521265440641200217770ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TNew extends Token { public TNew() { super.setText("New"); } public TNew(int line, int pos) { super.setText("New"); setLine(line); setPos(pos); } @Override public Object clone() { return new TNew(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTNew(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TNew text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TNull.java000066400000000000000000000013621265440641200221610ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TNull extends Token { public TNull() { super.setText("Null"); } public TNull(int line, int pos) { super.setText("Null"); setLine(line); setPos(pos); } @Override public Object clone() { return new TNull(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTNull(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TNull text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TPackage.java000066400000000000000000000014121265440641200225760ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TPackage extends Token { public TPackage() { super.setText("Package"); } public TPackage(int line, int pos) { super.setText("Package"); setLine(line); setPos(pos); } @Override public Object clone() { return new TPackage(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTPackage(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TPackage text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TPkgId.java000066400000000000000000000011551265440641200222450ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TPkgId extends Token { public TPkgId(String text) { setText(text); } public TPkgId(String text, int line, int pos) { setText(text); setLine(line); setPos(pos); } @Override public Object clone() { return new TPkgId(getText(), getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTPkgId(this); } } sablecc-3.7/src/org/sablecc/sablecc/node/TPlus.java000066400000000000000000000013541265440641200221730ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TPlus extends Token { public TPlus() { super.setText("+"); } public TPlus(int line, int pos) { super.setText("+"); setLine(line); setPos(pos); } @Override public Object clone() { return new TPlus(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTPlus(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TPlus text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TProductionSpecifier.java000066400000000000000000000015061265440641200252270ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TProductionSpecifier extends Token { public TProductionSpecifier() { super.setText("P"); } public TProductionSpecifier(int line, int pos) { super.setText("P"); setLine(line); setPos(pos); } @Override public Object clone() { return new TProductionSpecifier(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTProductionSpecifier(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TProductionSpecifier text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TProductions.java000066400000000000000000000014521265440641200235600ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TProductions extends Token { public TProductions() { super.setText("Productions"); } public TProductions(int line, int pos) { super.setText("Productions"); setLine(line); setPos(pos); } @Override public Object clone() { return new TProductions(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTProductions(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TProductions text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TQMark.java000066400000000000000000000013621265440641200222620ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TQMark extends Token { public TQMark() { super.setText("?"); } public TQMark(int line, int pos) { super.setText("?"); setLine(line); setPos(pos); } @Override public Object clone() { return new TQMark(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTQMark(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TQMark text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TRBkt.java000066400000000000000000000013541265440641200221120ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TRBkt extends Token { public TRBkt() { super.setText("]"); } public TRBkt(int line, int pos) { super.setText("]"); setLine(line); setPos(pos); } @Override public Object clone() { return new TRBkt(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTRBkt(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TRBkt text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TRBrace.java000066400000000000000000000013701265440641200224040ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TRBrace extends Token { public TRBrace() { super.setText("}"); } public TRBrace(int line, int pos) { super.setText("}"); setLine(line); setPos(pos); } @Override public Object clone() { return new TRBrace(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTRBrace(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TRBrace text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TRPar.java000066400000000000000000000013541265440641200221140ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TRPar extends Token { public TRPar() { super.setText(")"); } public TRPar(int line, int pos) { super.setText(")"); setLine(line); setPos(pos); } @Override public Object clone() { return new TRPar(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTRPar(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TRPar text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TSemicolon.java000066400000000000000000000014121265440641200231730ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TSemicolon extends Token { public TSemicolon() { super.setText(";"); } public TSemicolon(int line, int pos) { super.setText(";"); setLine(line); setPos(pos); } @Override public Object clone() { return new TSemicolon(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTSemicolon(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TSemicolon text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TSlash.java000066400000000000000000000013621265440641200223210ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TSlash extends Token { public TSlash() { super.setText("/"); } public TSlash(int line, int pos) { super.setText("/"); setLine(line); setPos(pos); } @Override public Object clone() { return new TSlash(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTSlash(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TSlash text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TStar.java000066400000000000000000000013541265440641200221610ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TStar extends Token { public TStar() { super.setText("*"); } public TStar(int line, int pos) { super.setText("*"); setLine(line); setPos(pos); } @Override public Object clone() { return new TStar(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTStar(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TStar text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TStates.java000066400000000000000000000014021265440641200225050ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TStates extends Token { public TStates() { super.setText("States"); } public TStates(int line, int pos) { super.setText("States"); setLine(line); setPos(pos); } @Override public Object clone() { return new TStates(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTStates(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TStates text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TString.java000066400000000000000000000011621265440641200225130ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TString extends Token { public TString(String text) { setText(text); } public TString(String text, int line, int pos) { setText(text); setLine(line); setPos(pos); } @Override public Object clone() { return new TString(getText(), getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTString(this); } } sablecc-3.7/src/org/sablecc/sablecc/node/TSyntax.java000066400000000000000000000014021265440641200225300ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TSyntax extends Token { public TSyntax() { super.setText("Syntax"); } public TSyntax(int line, int pos) { super.setText("Syntax"); setLine(line); setPos(pos); } @Override public Object clone() { return new TSyntax(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTSyntax(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TSyntax text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TTokenSpecifier.java000066400000000000000000000014501265440641200241570ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TTokenSpecifier extends Token { public TTokenSpecifier() { super.setText("T"); } public TTokenSpecifier(int line, int pos) { super.setText("T"); setLine(line); setPos(pos); } @Override public Object clone() { return new TTokenSpecifier(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTTokenSpecifier(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TTokenSpecifier text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TTokens.java000066400000000000000000000014021265440641200225050ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TTokens extends Token { public TTokens() { super.setText("Tokens"); } public TTokens(int line, int pos) { super.setText("Tokens"); setLine(line); setPos(pos); } @Override public Object clone() { return new TTokens(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTTokens(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TTokens text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/TTree.java000066400000000000000000000013621265440641200221460ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; import org.sablecc.sablecc.analysis.*; @SuppressWarnings("nls") public final class TTree extends Token { public TTree() { super.setText("Tree"); } public TTree(int line, int pos) { super.setText("Tree"); setLine(line); setPos(pos); } @Override public Object clone() { return new TTree(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseTTree(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change TTree text."); } } sablecc-3.7/src/org/sablecc/sablecc/node/Token.java000066400000000000000000000022001265440641200221730ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.node; @SuppressWarnings("nls") public abstract class Token extends Node { private String text; private int line; private int pos; public String getText() { return this.text; } public void setText(@SuppressWarnings("hiding") String text) { this.text = text; } public int getLine() { return this.line; } public void setLine(@SuppressWarnings("hiding") int line) { this.line = line; } public int getPos() { return this.pos; } public void setPos(@SuppressWarnings("hiding") int pos) { this.pos = pos; } @Override public String toString() { return this.text + " "; } @Override void removeChild(@SuppressWarnings("unused") Node child) { throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { throw new RuntimeException("Not a child."); } } sablecc-3.7/src/org/sablecc/sablecc/parser.txt000066400000000000000000000277501265440641200214010ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ Macro:ParserHeader /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import $1$.*; import $2$.*; import $3$.*; import java.util.*; import java.io.DataInputStream; import java.io.BufferedInputStream; import java.io.IOException; @SuppressWarnings("nls") public class Parser { public final Analysis ignoredTokens = new AnalysisAdapter(); protected ArrayList nodeList; private final Lexer lexer; private final ListIterator stack = new LinkedList().listIterator(); private int last_pos; private int last_line; private Token last_token; private final TokenIndex converter = new TokenIndex(); private final int[] action = new int[2]; private final static int SHIFT = 0; private final static int REDUCE = 1; private final static int ACCEPT = 2; private final static int ERROR = 3; public Parser(@SuppressWarnings("hiding") Lexer lexer) { this.lexer = lexer; } $ Macro:ParserInliningPushHeader @SuppressWarnings({"unchecked","unused"}) private void push(int numstate, ArrayList listNode) throws ParserException, LexerException, IOException { this.nodeList = listNode; $ Macro:ParserNoInliningPushHeader protected void filter() throws ParserException, LexerException, IOException { // Empty body } private void push(int numstate, ArrayList listNode, boolean hidden) throws ParserException, LexerException, IOException { this.nodeList = listNode; if(!hidden) { filter(); } $ Macro:ParserCommon if(!this.stack.hasNext()) { this.stack.add(new State(numstate, this.nodeList)); return; } State s = (State) this.stack.next(); s.state = numstate; s.nodes = this.nodeList; } private int goTo(int index) { int state = state(); int low = 1; int high = gotoTable[index].length - 1; int value = gotoTable[index][0][1]; while(low <= high) { // int middle = (low + high) / 2; int middle = (low + high) >>> 1; if(state < gotoTable[index][middle][0]) { high = middle - 1; } else if(state > gotoTable[index][middle][0]) { low = middle + 1; } else { value = gotoTable[index][middle][1]; break; } } return value; } private int state() { State s = (State) this.stack.previous(); this.stack.next(); return s.state; } private ArrayList pop() { return ((State) this.stack.previous()).nodes; } private int index(Switchable token) { this.converter.index = -1; token.apply(this.converter); return this.converter.index; } @SuppressWarnings("unchecked") public Start parse() throws ParserException, LexerException, IOException { push(0, null$0$); List ign = null; while(true) { while(index(this.lexer.peek()) == -1) { if(ign == null) { ign = new LinkedList(); } ign.add(this.lexer.next()); } if(ign != null) { this.ignoredTokens.setIn(this.lexer.peek(), ign); ign = null; } this.last_pos = this.lexer.peek().getPos(); this.last_line = this.lexer.peek().getLine(); this.last_token = this.lexer.peek(); int index = index(this.lexer.peek()); this.action[0] = Parser.actionTable[state()][0][1]; this.action[1] = Parser.actionTable[state()][0][2]; int low = 1; int high = Parser.actionTable[state()].length - 1; while(low <= high) { int middle = (low + high) / 2; if(index < Parser.actionTable[state()][middle][0]) { high = middle - 1; } else if(index > Parser.actionTable[state()][middle][0]) { low = middle + 1; } else { this.action[0] = Parser.actionTable[state()][middle][1]; this.action[1] = Parser.actionTable[state()][middle][2]; break; } } switch(this.action[0]) { case SHIFT: { ArrayList list = new ArrayList(); list.add(this.lexer.next()); push(this.action[1], list$1$); } break; case REDUCE: { int reduction = this.action[1]; if(reduction < 500) reduce_0(reduction); $ Macro:ParseReduceElseIf else if(reduction < $0$) reduce_$1$(reduction); $ Macro:ParserParseTail } break; case ACCEPT: { EOF node2 = (EOF) this.lexer.next(); $0$ node1 = ($0$) pop().get(0); Start node = new Start(node1, node2); return node; } case ERROR: throw new ParserException(this.last_token, "[" + this.last_line + "," + this.last_pos + "] " + Parser.errorMessages[Parser.errors[this.action[1]]]); } } } $ Macro:ParserReduceHead private void reduce_$0$(int reduction) throws IOException, LexerException, ParserException { switch(reduction) { $ Macro:ParserInliningReduce case $0$: /* reduce $2$ */ { ArrayList list = new$0$(); push(goTo($1$), list); } break; $ Macro:ParserNoInliningReduce case $0$: /* reduce $3$ */ { ArrayList list = new$0$(); push(goTo($1$), list, $2$); } break; $ Macro:ParserReduceTail } } $ Macro:ParserNewHeader @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new$0$() /* reduce $1$ */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); $ Macro:ParserNewBodyDecl @SuppressWarnings("unused") ArrayList nodeArrayList$0$ = pop(); $ Macro:ParserNewBodyDeclNull ArrayList nodeArrayList$0$ = null; $ Macro:ParserBraceOpening { // Block $ Macro:ParserBraceClosing } $ Macro:ParserSimpleVariableDeclaration $0$ $1$Node$2$; $ Macro:ParserListVariableDeclaration LinkedList listNode$0$ = new LinkedList(); $ Macro:ParserNullVariableDeclaration @SuppressWarnings("unused") Object nullNode$0$ = null; $ Macro:ParserSimpleTerm $0$Node$1$ = ($2$)nodeArrayList$3$.get($4$); $ Macro:ParserNewBodyNew $0$Node$1$ = new $2$( $ Macro:ParserNew&ListBodyParams $0$Node$1$ $ Macro:ParserNew&ListBodyParamsNull $0$ $ Macro:ParserNewBodyNewTail ); $ Macro:ParserTypedLinkedListAdd if($2$Node$3$ != null) { $0$Node$1$.add($2$Node$3$); } $ Macro:ParserTypedLinkedListAddAll if($2$Node$3$ != null) { $0$Node$1$.addAll($2$Node$3$); } $ Macro:ParserTypedLinkedListAddAll2 if($2$ != null) { $0$Node$1$.addAll($2$); } $ Macro:ParserNewBodyListAdd nodeList.add($0$Node$1$); $ Macro:ParserNewTail return nodeList; } $ Macro:ParserActionHeader private static int[][][] actionTable; /* { $ Macro:ParserActionTail };*/ $ Macro:ParserGotoHeader private static int[][][] gotoTable; /* { $ Macro:ParserGotoTail };*/ $ Macro:ParserErrorsHeader private static String[] errorMessages; /* { $ Macro:ParserErrorsTail };*/ $ Macro:ParserErrorIndexHeader private static int[] errors; /* { $ Macro:ParserErrorIndexTail };*/ $ Macro:ParserTail static { try { DataInputStream s = new DataInputStream( new BufferedInputStream( Parser.class.getResourceAsStream("parser.dat"))); // read actionTable int length = s.readInt(); Parser.actionTable = new int[length][][]; for(int i = 0; i < Parser.actionTable.length; i++) { length = s.readInt(); Parser.actionTable[i] = new int[length][3]; for(int j = 0; j < Parser.actionTable[i].length; j++) { for(int k = 0; k < 3; k++) { Parser.actionTable[i][j][k] = s.readInt(); } } } // read gotoTable length = s.readInt(); gotoTable = new int[length][][]; for(int i = 0; i < gotoTable.length; i++) { length = s.readInt(); gotoTable[i] = new int[length][2]; for(int j = 0; j < gotoTable[i].length; j++) { for(int k = 0; k < 2; k++) { gotoTable[i][j][k] = s.readInt(); } } } // read errorMessages length = s.readInt(); errorMessages = new String[length]; for(int i = 0; i < errorMessages.length; i++) { length = s.readInt(); StringBuffer buffer = new StringBuffer(); for(int j = 0; j < length; j++) { buffer.append(s.readChar()); } errorMessages[i] = buffer.toString(); } // read errors length = s.readInt(); errors = new int[length]; for(int i = 0; i < errors.length; i++) { errors[i] = s.readInt(); } s.close(); } catch(Exception e) { throw new RuntimeException("The file \"parser.dat\" is either missing or corrupted."); } } } $ Macro:TokenIndexHeader /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import $1$.*; import $2$.*; class TokenIndex extends AnalysisAdapter { int index; $ Macro:TokenIndexBody @Override public void case$0$(@SuppressWarnings("unused") $0$ node) { this.index = $1$; } $ Macro:TokenIndexTail @Override public void caseEOF(@SuppressWarnings("unused") EOF node) { this.index = $0$; } } $ Macro:ParserException /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import $1$.*; @SuppressWarnings("serial") public class ParserException extends Exception { private Token token; public ParserException(@SuppressWarnings("hiding") Token token, String message) { super(message); this.token = token; } public Token getToken() { return this.token; } } $ Macro:State /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import java.util.ArrayList; final class State { int state; ArrayList nodes; State(@SuppressWarnings("hiding") int state, @SuppressWarnings("hiding") ArrayList nodes) { this.state = state; this.nodes = nodes; } } $ sablecc-3.7/src/org/sablecc/sablecc/parser/000077500000000000000000000000001265440641200206255ustar00rootroot00000000000000sablecc-3.7/src/org/sablecc/sablecc/parser/Parser.java000066400000000000000000013200041265440641200227240ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.parser; import org.sablecc.sablecc.lexer.*; import org.sablecc.sablecc.node.*; import org.sablecc.sablecc.analysis.*; import java.util.*; import java.io.DataInputStream; import java.io.BufferedInputStream; import java.io.IOException; @SuppressWarnings("nls") public class Parser { public final Analysis ignoredTokens = new AnalysisAdapter(); protected ArrayList nodeList; private final Lexer lexer; private final ListIterator stack = new LinkedList().listIterator(); private int last_pos; private int last_line; private Token last_token; private final TokenIndex converter = new TokenIndex(); private final int[] action = new int[2]; private final static int SHIFT = 0; private final static int REDUCE = 1; private final static int ACCEPT = 2; private final static int ERROR = 3; public Parser(@SuppressWarnings("hiding") Lexer lexer) { this.lexer = lexer; } @SuppressWarnings({"unchecked","unused"}) private void push(int numstate, ArrayList listNode) throws ParserException, LexerException, IOException { this.nodeList = listNode; if(!this.stack.hasNext()) { this.stack.add(new State(numstate, this.nodeList)); return; } State s = (State) this.stack.next(); s.state = numstate; s.nodes = this.nodeList; } private int goTo(int index) { int state = state(); int low = 1; int high = gotoTable[index].length - 1; int value = gotoTable[index][0][1]; while(low <= high) { // int middle = (low + high) / 2; int middle = (low + high) >>> 1; if(state < gotoTable[index][middle][0]) { high = middle - 1; } else if(state > gotoTable[index][middle][0]) { low = middle + 1; } else { value = gotoTable[index][middle][1]; break; } } return value; } private int state() { State s = (State) this.stack.previous(); this.stack.next(); return s.state; } private ArrayList pop() { return ((State) this.stack.previous()).nodes; } private int index(Switchable token) { this.converter.index = -1; token.apply(this.converter); return this.converter.index; } @SuppressWarnings("unchecked") public Start parse() throws ParserException, LexerException, IOException { push(0, null); List ign = null; while(true) { while(index(this.lexer.peek()) == -1) { if(ign == null) { ign = new LinkedList(); } ign.add(this.lexer.next()); } if(ign != null) { this.ignoredTokens.setIn(this.lexer.peek(), ign); ign = null; } this.last_pos = this.lexer.peek().getPos(); this.last_line = this.lexer.peek().getLine(); this.last_token = this.lexer.peek(); int index = index(this.lexer.peek()); this.action[0] = Parser.actionTable[state()][0][1]; this.action[1] = Parser.actionTable[state()][0][2]; int low = 1; int high = Parser.actionTable[state()].length - 1; while(low <= high) { int middle = (low + high) / 2; if(index < Parser.actionTable[state()][middle][0]) { high = middle - 1; } else if(index > Parser.actionTable[state()][middle][0]) { low = middle + 1; } else { this.action[0] = Parser.actionTable[state()][middle][1]; this.action[1] = Parser.actionTable[state()][middle][2]; break; } } switch(this.action[0]) { case SHIFT: { ArrayList list = new ArrayList(); list.add(this.lexer.next()); push(this.action[1], list); } break; case REDUCE: { int reduction = this.action[1]; if(reduction < 500) reduce_0(reduction); } break; case ACCEPT: { EOF node2 = (EOF) this.lexer.next(); PGrammar node1 = (PGrammar) pop().get(0); Start node = new Start(node1, node2); return node; } case ERROR: throw new ParserException(this.last_token, "[" + this.last_line + "," + this.last_pos + "] " + Parser.errorMessages[Parser.errors[this.action[1]]]); } } } private void reduce_0(int reduction) throws IOException, LexerException, ParserException { switch(reduction) { case 0: /* reduce AAgrammar1Grammar */ { ArrayList list = new0(); push(goTo(0), list); } break; case 1: /* reduce AAgrammar2Grammar */ { ArrayList list = new1(); push(goTo(0), list); } break; case 2: /* reduce AAgrammar3Grammar */ { ArrayList list = new2(); push(goTo(0), list); } break; case 3: /* reduce AAgrammar4Grammar */ { ArrayList list = new3(); push(goTo(0), list); } break; case 4: /* reduce AAgrammar5Grammar */ { ArrayList list = new4(); push(goTo(0), list); } break; case 5: /* reduce AAgrammar6Grammar */ { ArrayList list = new5(); push(goTo(0), list); } break; case 6: /* reduce AAgrammar7Grammar */ { ArrayList list = new6(); push(goTo(0), list); } break; case 7: /* reduce AAgrammar8Grammar */ { ArrayList list = new7(); push(goTo(0), list); } break; case 8: /* reduce AAgrammar9Grammar */ { ArrayList list = new8(); push(goTo(0), list); } break; case 9: /* reduce AAgrammar10Grammar */ { ArrayList list = new9(); push(goTo(0), list); } break; case 10: /* reduce AAgrammar11Grammar */ { ArrayList list = new10(); push(goTo(0), list); } break; case 11: /* reduce AAgrammar12Grammar */ { ArrayList list = new11(); push(goTo(0), list); } break; case 12: /* reduce AAgrammar13Grammar */ { ArrayList list = new12(); push(goTo(0), list); } break; case 13: /* reduce AAgrammar14Grammar */ { ArrayList list = new13(); push(goTo(0), list); } break; case 14: /* reduce AAgrammar15Grammar */ { ArrayList list = new14(); push(goTo(0), list); } break; case 15: /* reduce AAgrammar16Grammar */ { ArrayList list = new15(); push(goTo(0), list); } break; case 16: /* reduce AAgrammar17Grammar */ { ArrayList list = new16(); push(goTo(0), list); } break; case 17: /* reduce AAgrammar18Grammar */ { ArrayList list = new17(); push(goTo(0), list); } break; case 18: /* reduce AAgrammar19Grammar */ { ArrayList list = new18(); push(goTo(0), list); } break; case 19: /* reduce AAgrammar20Grammar */ { ArrayList list = new19(); push(goTo(0), list); } break; case 20: /* reduce AAgrammar21Grammar */ { ArrayList list = new20(); push(goTo(0), list); } break; case 21: /* reduce AAgrammar22Grammar */ { ArrayList list = new21(); push(goTo(0), list); } break; case 22: /* reduce AAgrammar23Grammar */ { ArrayList list = new22(); push(goTo(0), list); } break; case 23: /* reduce AAgrammar24Grammar */ { ArrayList list = new23(); push(goTo(0), list); } break; case 24: /* reduce AAgrammar25Grammar */ { ArrayList list = new24(); push(goTo(0), list); } break; case 25: /* reduce AAgrammar26Grammar */ { ArrayList list = new25(); push(goTo(0), list); } break; case 26: /* reduce AAgrammar27Grammar */ { ArrayList list = new26(); push(goTo(0), list); } break; case 27: /* reduce AAgrammar28Grammar */ { ArrayList list = new27(); push(goTo(0), list); } break; case 28: /* reduce AAgrammar29Grammar */ { ArrayList list = new28(); push(goTo(0), list); } break; case 29: /* reduce AAgrammar30Grammar */ { ArrayList list = new29(); push(goTo(0), list); } break; case 30: /* reduce AAgrammar31Grammar */ { ArrayList list = new30(); push(goTo(0), list); } break; case 31: /* reduce AAgrammar32Grammar */ { ArrayList list = new31(); push(goTo(0), list); } break; case 32: /* reduce AAgrammar33Grammar */ { ArrayList list = new32(); push(goTo(0), list); } break; case 33: /* reduce AAgrammar34Grammar */ { ArrayList list = new33(); push(goTo(0), list); } break; case 34: /* reduce AAgrammar35Grammar */ { ArrayList list = new34(); push(goTo(0), list); } break; case 35: /* reduce AAgrammar36Grammar */ { ArrayList list = new35(); push(goTo(0), list); } break; case 36: /* reduce AAgrammar37Grammar */ { ArrayList list = new36(); push(goTo(0), list); } break; case 37: /* reduce AAgrammar38Grammar */ { ArrayList list = new37(); push(goTo(0), list); } break; case 38: /* reduce AAgrammar39Grammar */ { ArrayList list = new38(); push(goTo(0), list); } break; case 39: /* reduce AAgrammar40Grammar */ { ArrayList list = new39(); push(goTo(0), list); } break; case 40: /* reduce AAgrammar41Grammar */ { ArrayList list = new40(); push(goTo(0), list); } break; case 41: /* reduce AAgrammar42Grammar */ { ArrayList list = new41(); push(goTo(0), list); } break; case 42: /* reduce AAgrammar43Grammar */ { ArrayList list = new42(); push(goTo(0), list); } break; case 43: /* reduce AAgrammar44Grammar */ { ArrayList list = new43(); push(goTo(0), list); } break; case 44: /* reduce AAgrammar45Grammar */ { ArrayList list = new44(); push(goTo(0), list); } break; case 45: /* reduce AAgrammar46Grammar */ { ArrayList list = new45(); push(goTo(0), list); } break; case 46: /* reduce AAgrammar47Grammar */ { ArrayList list = new46(); push(goTo(0), list); } break; case 47: /* reduce AAgrammar48Grammar */ { ArrayList list = new47(); push(goTo(0), list); } break; case 48: /* reduce AAgrammar49Grammar */ { ArrayList list = new48(); push(goTo(0), list); } break; case 49: /* reduce AAgrammar50Grammar */ { ArrayList list = new49(); push(goTo(0), list); } break; case 50: /* reduce AAgrammar51Grammar */ { ArrayList list = new50(); push(goTo(0), list); } break; case 51: /* reduce AAgrammar52Grammar */ { ArrayList list = new51(); push(goTo(0), list); } break; case 52: /* reduce AAgrammar53Grammar */ { ArrayList list = new52(); push(goTo(0), list); } break; case 53: /* reduce AAgrammar54Grammar */ { ArrayList list = new53(); push(goTo(0), list); } break; case 54: /* reduce AAgrammar55Grammar */ { ArrayList list = new54(); push(goTo(0), list); } break; case 55: /* reduce AAgrammar56Grammar */ { ArrayList list = new55(); push(goTo(0), list); } break; case 56: /* reduce AAgrammar57Grammar */ { ArrayList list = new56(); push(goTo(0), list); } break; case 57: /* reduce AAgrammar58Grammar */ { ArrayList list = new57(); push(goTo(0), list); } break; case 58: /* reduce AAgrammar59Grammar */ { ArrayList list = new58(); push(goTo(0), list); } break; case 59: /* reduce AAgrammar60Grammar */ { ArrayList list = new59(); push(goTo(0), list); } break; case 60: /* reduce AAgrammar61Grammar */ { ArrayList list = new60(); push(goTo(0), list); } break; case 61: /* reduce AAgrammar62Grammar */ { ArrayList list = new61(); push(goTo(0), list); } break; case 62: /* reduce AAgrammar63Grammar */ { ArrayList list = new62(); push(goTo(0), list); } break; case 63: /* reduce AAgrammar64Grammar */ { ArrayList list = new63(); push(goTo(0), list); } break; case 64: /* reduce AAgrammar65Grammar */ { ArrayList list = new64(); push(goTo(0), list); } break; case 65: /* reduce AAgrammar66Grammar */ { ArrayList list = new65(); push(goTo(0), list); } break; case 66: /* reduce AAgrammar67Grammar */ { ArrayList list = new66(); push(goTo(0), list); } break; case 67: /* reduce AAgrammar68Grammar */ { ArrayList list = new67(); push(goTo(0), list); } break; case 68: /* reduce AAgrammar69Grammar */ { ArrayList list = new68(); push(goTo(0), list); } break; case 69: /* reduce AAgrammar70Grammar */ { ArrayList list = new69(); push(goTo(0), list); } break; case 70: /* reduce AAgrammar71Grammar */ { ArrayList list = new70(); push(goTo(0), list); } break; case 71: /* reduce AAgrammar72Grammar */ { ArrayList list = new71(); push(goTo(0), list); } break; case 72: /* reduce AAgrammar73Grammar */ { ArrayList list = new72(); push(goTo(0), list); } break; case 73: /* reduce AAgrammar74Grammar */ { ArrayList list = new73(); push(goTo(0), list); } break; case 74: /* reduce AAgrammar75Grammar */ { ArrayList list = new74(); push(goTo(0), list); } break; case 75: /* reduce AAgrammar76Grammar */ { ArrayList list = new75(); push(goTo(0), list); } break; case 76: /* reduce AAgrammar77Grammar */ { ArrayList list = new76(); push(goTo(0), list); } break; case 77: /* reduce AAgrammar78Grammar */ { ArrayList list = new77(); push(goTo(0), list); } break; case 78: /* reduce AAgrammar79Grammar */ { ArrayList list = new78(); push(goTo(0), list); } break; case 79: /* reduce AAgrammar80Grammar */ { ArrayList list = new79(); push(goTo(0), list); } break; case 80: /* reduce AAgrammar81Grammar */ { ArrayList list = new80(); push(goTo(0), list); } break; case 81: /* reduce AAgrammar82Grammar */ { ArrayList list = new81(); push(goTo(0), list); } break; case 82: /* reduce AAgrammar83Grammar */ { ArrayList list = new82(); push(goTo(0), list); } break; case 83: /* reduce AAgrammar84Grammar */ { ArrayList list = new83(); push(goTo(0), list); } break; case 84: /* reduce AAgrammar85Grammar */ { ArrayList list = new84(); push(goTo(0), list); } break; case 85: /* reduce AAgrammar86Grammar */ { ArrayList list = new85(); push(goTo(0), list); } break; case 86: /* reduce AAgrammar87Grammar */ { ArrayList list = new86(); push(goTo(0), list); } break; case 87: /* reduce AAgrammar88Grammar */ { ArrayList list = new87(); push(goTo(0), list); } break; case 88: /* reduce AAgrammar89Grammar */ { ArrayList list = new88(); push(goTo(0), list); } break; case 89: /* reduce AAgrammar90Grammar */ { ArrayList list = new89(); push(goTo(0), list); } break; case 90: /* reduce AAgrammar91Grammar */ { ArrayList list = new90(); push(goTo(0), list); } break; case 91: /* reduce AAgrammar92Grammar */ { ArrayList list = new91(); push(goTo(0), list); } break; case 92: /* reduce AAgrammar93Grammar */ { ArrayList list = new92(); push(goTo(0), list); } break; case 93: /* reduce AAgrammar94Grammar */ { ArrayList list = new93(); push(goTo(0), list); } break; case 94: /* reduce AAgrammar95Grammar */ { ArrayList list = new94(); push(goTo(0), list); } break; case 95: /* reduce AAgrammar96Grammar */ { ArrayList list = new95(); push(goTo(0), list); } break; case 96: /* reduce AAgrammar97Grammar */ { ArrayList list = new96(); push(goTo(0), list); } break; case 97: /* reduce AAgrammar98Grammar */ { ArrayList list = new97(); push(goTo(0), list); } break; case 98: /* reduce AAgrammar99Grammar */ { ArrayList list = new98(); push(goTo(0), list); } break; case 99: /* reduce AAgrammar100Grammar */ { ArrayList list = new99(); push(goTo(0), list); } break; case 100: /* reduce AAgrammar101Grammar */ { ArrayList list = new100(); push(goTo(0), list); } break; case 101: /* reduce AAgrammar102Grammar */ { ArrayList list = new101(); push(goTo(0), list); } break; case 102: /* reduce AAgrammar103Grammar */ { ArrayList list = new102(); push(goTo(0), list); } break; case 103: /* reduce AAgrammar104Grammar */ { ArrayList list = new103(); push(goTo(0), list); } break; case 104: /* reduce AAgrammar105Grammar */ { ArrayList list = new104(); push(goTo(0), list); } break; case 105: /* reduce AAgrammar106Grammar */ { ArrayList list = new105(); push(goTo(0), list); } break; case 106: /* reduce AAgrammar107Grammar */ { ArrayList list = new106(); push(goTo(0), list); } break; case 107: /* reduce AAgrammar108Grammar */ { ArrayList list = new107(); push(goTo(0), list); } break; case 108: /* reduce AAgrammar109Grammar */ { ArrayList list = new108(); push(goTo(0), list); } break; case 109: /* reduce AAgrammar110Grammar */ { ArrayList list = new109(); push(goTo(0), list); } break; case 110: /* reduce AAgrammar111Grammar */ { ArrayList list = new110(); push(goTo(0), list); } break; case 111: /* reduce AAgrammar112Grammar */ { ArrayList list = new111(); push(goTo(0), list); } break; case 112: /* reduce AAgrammar113Grammar */ { ArrayList list = new112(); push(goTo(0), list); } break; case 113: /* reduce AAgrammar114Grammar */ { ArrayList list = new113(); push(goTo(0), list); } break; case 114: /* reduce AAgrammar115Grammar */ { ArrayList list = new114(); push(goTo(0), list); } break; case 115: /* reduce AAgrammar116Grammar */ { ArrayList list = new115(); push(goTo(0), list); } break; case 116: /* reduce AAgrammar117Grammar */ { ArrayList list = new116(); push(goTo(0), list); } break; case 117: /* reduce AAgrammar118Grammar */ { ArrayList list = new117(); push(goTo(0), list); } break; case 118: /* reduce AAgrammar119Grammar */ { ArrayList list = new118(); push(goTo(0), list); } break; case 119: /* reduce AAgrammar120Grammar */ { ArrayList list = new119(); push(goTo(0), list); } break; case 120: /* reduce AAgrammar121Grammar */ { ArrayList list = new120(); push(goTo(0), list); } break; case 121: /* reduce AAgrammar122Grammar */ { ArrayList list = new121(); push(goTo(0), list); } break; case 122: /* reduce AAgrammar123Grammar */ { ArrayList list = new122(); push(goTo(0), list); } break; case 123: /* reduce AAgrammar124Grammar */ { ArrayList list = new123(); push(goTo(0), list); } break; case 124: /* reduce AAgrammar125Grammar */ { ArrayList list = new124(); push(goTo(0), list); } break; case 125: /* reduce AAgrammar126Grammar */ { ArrayList list = new125(); push(goTo(0), list); } break; case 126: /* reduce AAgrammar127Grammar */ { ArrayList list = new126(); push(goTo(0), list); } break; case 127: /* reduce AAgrammar128Grammar */ { ArrayList list = new127(); push(goTo(0), list); } break; case 128: /* reduce APackage */ { ArrayList list = new128(); push(goTo(1), list); } break; case 129: /* reduce AApkgname1PkgName */ { ArrayList list = new129(); push(goTo(2), list); } break; case 130: /* reduce AApkgname2PkgName */ { ArrayList list = new130(); push(goTo(2), list); } break; case 131: /* reduce APkgNameTail */ { ArrayList list = new131(); push(goTo(3), list); } break; case 132: /* reduce AHelpers */ { ArrayList list = new132(); push(goTo(4), list); } break; case 133: /* reduce AHelperDef */ { ArrayList list = new133(); push(goTo(5), list); } break; case 134: /* reduce AStates */ { ArrayList list = new134(); push(goTo(6), list); } break; case 135: /* reduce AAidlist1IdList */ { ArrayList list = new135(); push(goTo(7), list); } break; case 136: /* reduce AAidlist2IdList */ { ArrayList list = new136(); push(goTo(7), list); } break; case 137: /* reduce AIdListTail */ { ArrayList list = new137(); push(goTo(8), list); } break; case 138: /* reduce ATokens */ { ArrayList list = new138(); push(goTo(9), list); } break; case 139: /* reduce AAtokendef1TokenDef */ { ArrayList list = new139(); push(goTo(10), list); } break; case 140: /* reduce AAtokendef2TokenDef */ { ArrayList list = new140(); push(goTo(10), list); } break; case 141: /* reduce AAtokendef3TokenDef */ { ArrayList list = new141(); push(goTo(10), list); } break; case 142: /* reduce AAtokendef4TokenDef */ { ArrayList list = new142(); push(goTo(10), list); } break; case 143: /* reduce AAstatelist1StateList */ { ArrayList list = new143(); push(goTo(11), list); } break; case 144: /* reduce AAstatelist2StateList */ { ArrayList list = new144(); push(goTo(11), list); } break; case 145: /* reduce AAstatelist3StateList */ { ArrayList list = new145(); push(goTo(11), list); } break; case 146: /* reduce AAstatelist4StateList */ { ArrayList list = new146(); push(goTo(11), list); } break; case 147: /* reduce AAstatelisttail1StateListTail */ { ArrayList list = new147(); push(goTo(12), list); } break; case 148: /* reduce AAstatelisttail2StateListTail */ { ArrayList list = new148(); push(goTo(12), list); } break; case 149: /* reduce ATransition */ { ArrayList list = new149(); push(goTo(13), list); } break; case 150: /* reduce AAigntokens1IgnTokens */ { ArrayList list = new150(); push(goTo(14), list); } break; case 151: /* reduce AAigntokens2IgnTokens */ { ArrayList list = new151(); push(goTo(14), list); } break; case 152: /* reduce ALookAhead */ { ArrayList list = new152(); push(goTo(15), list); } break; case 153: /* reduce AAregexp1RegExp */ { ArrayList list = new153(); push(goTo(16), list); } break; case 154: /* reduce AAregexp2RegExp */ { ArrayList list = new154(); push(goTo(16), list); } break; case 155: /* reduce ARegExpTail */ { ArrayList list = new155(); push(goTo(17), list); } break; case 156: /* reduce AAconcat1Concat */ { ArrayList list = new156(); push(goTo(18), list); } break; case 157: /* reduce AAconcat2Concat */ { ArrayList list = new157(); push(goTo(18), list); } break; case 158: /* reduce AAunexp1UnExp */ { ArrayList list = new158(); push(goTo(19), list); } break; case 159: /* reduce AAunexp2UnExp */ { ArrayList list = new159(); push(goTo(19), list); } break; case 160: /* reduce ACharBasic */ { ArrayList list = new160(); push(goTo(20), list); } break; case 161: /* reduce ASetBasic */ { ArrayList list = new161(); push(goTo(20), list); } break; case 162: /* reduce AStringBasic */ { ArrayList list = new162(); push(goTo(20), list); } break; case 163: /* reduce AIdBasic */ { ArrayList list = new163(); push(goTo(20), list); } break; case 164: /* reduce ARegExpBasic */ { ArrayList list = new164(); push(goTo(20), list); } break; case 165: /* reduce ACharChar */ { ArrayList list = new165(); push(goTo(21), list); } break; case 166: /* reduce ADecChar */ { ArrayList list = new166(); push(goTo(21), list); } break; case 167: /* reduce AHexChar */ { ArrayList list = new167(); push(goTo(21), list); } break; case 168: /* reduce AOperationSet */ { ArrayList list = new168(); push(goTo(22), list); } break; case 169: /* reduce AIntervalSet */ { ArrayList list = new169(); push(goTo(22), list); } break; case 170: /* reduce AStarUnOp */ { ArrayList list = new170(); push(goTo(23), list); } break; case 171: /* reduce AQMarkUnOp */ { ArrayList list = new171(); push(goTo(23), list); } break; case 172: /* reduce APlusUnOp */ { ArrayList list = new172(); push(goTo(23), list); } break; case 173: /* reduce APlusBinOp */ { ArrayList list = new173(); push(goTo(24), list); } break; case 174: /* reduce AMinusBinOp */ { ArrayList list = new174(); push(goTo(24), list); } break; case 175: /* reduce AProductions */ { ArrayList list = new175(); push(goTo(25), list); } break; case 176: /* reduce AAprod1Prod */ { ArrayList list = new176(); push(goTo(26), list); } break; case 177: /* reduce AAprod2Prod */ { ArrayList list = new177(); push(goTo(26), list); } break; case 178: /* reduce AAprodtransform1ProdTransform */ { ArrayList list = new178(); push(goTo(27), list); } break; case 179: /* reduce AAprodtransform2ProdTransform */ { ArrayList list = new179(); push(goTo(27), list); } break; case 180: /* reduce AAalts1Alts */ { ArrayList list = new180(); push(goTo(28), list); } break; case 181: /* reduce AAalts2Alts */ { ArrayList list = new181(); push(goTo(28), list); } break; case 182: /* reduce AAltsTail */ { ArrayList list = new182(); push(goTo(29), list); } break; case 183: /* reduce AAalt1Alt */ { ArrayList list = new183(); push(goTo(30), list); } break; case 184: /* reduce AAalt2Alt */ { ArrayList list = new184(); push(goTo(30), list); } break; case 185: /* reduce AAalt3Alt */ { ArrayList list = new185(); push(goTo(30), list); } break; case 186: /* reduce AAalt4Alt */ { ArrayList list = new186(); push(goTo(30), list); } break; case 187: /* reduce AAalt5Alt */ { ArrayList list = new187(); push(goTo(30), list); } break; case 188: /* reduce AAalt6Alt */ { ArrayList list = new188(); push(goTo(30), list); } break; case 189: /* reduce AAalt7Alt */ { ArrayList list = new189(); push(goTo(30), list); } break; case 190: /* reduce AAalt8Alt */ { ArrayList list = new190(); push(goTo(30), list); } break; case 191: /* reduce AAalttransform1AltTransform */ { ArrayList list = new191(); push(goTo(31), list); } break; case 192: /* reduce AAalttransform2AltTransform */ { ArrayList list = new192(); push(goTo(31), list); } break; case 193: /* reduce AAnewterm1Term */ { ArrayList list = new193(); push(goTo(32), list); } break; case 194: /* reduce AAnewterm2Term */ { ArrayList list = new194(); push(goTo(32), list); } break; case 195: /* reduce AAlistterm1Term */ { ArrayList list = new195(); push(goTo(32), list); } break; case 196: /* reduce AAlistterm2Term */ { ArrayList list = new196(); push(goTo(32), list); } break; case 197: /* reduce AAsimpleterm1Term */ { ArrayList list = new197(); push(goTo(32), list); } break; case 198: /* reduce AAsimpleterm2Term */ { ArrayList list = new198(); push(goTo(32), list); } break; case 199: /* reduce AAsimpleterm3Term */ { ArrayList list = new199(); push(goTo(32), list); } break; case 200: /* reduce AAsimpleterm4Term */ { ArrayList list = new200(); push(goTo(32), list); } break; case 201: /* reduce ANullTerm */ { ArrayList list = new201(); push(goTo(32), list); } break; case 202: /* reduce AAlistoflistterm1ListOfListTerm */ { ArrayList list = new202(); push(goTo(33), list); } break; case 203: /* reduce AAlistoflistterm2ListOfListTerm */ { ArrayList list = new203(); push(goTo(33), list); } break; case 204: /* reduce AAnewlistterm1ListTerm */ { ArrayList list = new204(); push(goTo(34), list); } break; case 205: /* reduce AAnewlistterm2ListTerm */ { ArrayList list = new205(); push(goTo(34), list); } break; case 206: /* reduce AAsimplelistterm1ListTerm */ { ArrayList list = new206(); push(goTo(34), list); } break; case 207: /* reduce AAsimplelistterm2ListTerm */ { ArrayList list = new207(); push(goTo(34), list); } break; case 208: /* reduce AAsimplelistterm3ListTerm */ { ArrayList list = new208(); push(goTo(34), list); } break; case 209: /* reduce AAsimplelistterm4ListTerm */ { ArrayList list = new209(); push(goTo(34), list); } break; case 210: /* reduce AListTermTail */ { ArrayList list = new210(); push(goTo(35), list); } break; case 211: /* reduce ASimpleTermTail */ { ArrayList list = new211(); push(goTo(36), list); } break; case 212: /* reduce AAprodname1ProdName */ { ArrayList list = new212(); push(goTo(37), list); } break; case 213: /* reduce AAprodname2ProdName */ { ArrayList list = new213(); push(goTo(37), list); } break; case 214: /* reduce AProdNameTail */ { ArrayList list = new214(); push(goTo(38), list); } break; case 215: /* reduce AAparams1Params */ { ArrayList list = new215(); push(goTo(39), list); } break; case 216: /* reduce AAparams2Params */ { ArrayList list = new216(); push(goTo(39), list); } break; case 217: /* reduce AParamsTail */ { ArrayList list = new217(); push(goTo(40), list); } break; case 218: /* reduce AAltName */ { ArrayList list = new218(); push(goTo(41), list); } break; case 219: /* reduce AAelem1Elem */ { ArrayList list = new219(); push(goTo(42), list); } break; case 220: /* reduce AAelem2Elem */ { ArrayList list = new220(); push(goTo(42), list); } break; case 221: /* reduce AAelem3Elem */ { ArrayList list = new221(); push(goTo(42), list); } break; case 222: /* reduce AAelem4Elem */ { ArrayList list = new222(); push(goTo(42), list); } break; case 223: /* reduce AAelem5Elem */ { ArrayList list = new223(); push(goTo(42), list); } break; case 224: /* reduce AAelem6Elem */ { ArrayList list = new224(); push(goTo(42), list); } break; case 225: /* reduce AAelem7Elem */ { ArrayList list = new225(); push(goTo(42), list); } break; case 226: /* reduce AAelem8Elem */ { ArrayList list = new226(); push(goTo(42), list); } break; case 227: /* reduce AElemName */ { ArrayList list = new227(); push(goTo(43), list); } break; case 228: /* reduce ATokenSpecifier */ { ArrayList list = new228(); push(goTo(44), list); } break; case 229: /* reduce AProductionSpecifier */ { ArrayList list = new229(); push(goTo(44), list); } break; case 230: /* reduce AAst */ { ArrayList list = new230(); push(goTo(45), list); } break; case 231: /* reduce AAstProd */ { ArrayList list = new231(); push(goTo(46), list); } break; case 232: /* reduce AAastalts1AstAlts */ { ArrayList list = new232(); push(goTo(47), list); } break; case 233: /* reduce AAastalts2AstAlts */ { ArrayList list = new233(); push(goTo(47), list); } break; case 234: /* reduce AAstAltsTail */ { ArrayList list = new234(); push(goTo(48), list); } break; case 235: /* reduce AAastalt1AstAlt */ { ArrayList list = new235(); push(goTo(49), list); } break; case 236: /* reduce AAastalt2AstAlt */ { ArrayList list = new236(); push(goTo(49), list); } break; case 237: /* reduce AAastalt3AstAlt */ { ArrayList list = new237(); push(goTo(49), list); } break; case 238: /* reduce AAastalt4AstAlt */ { ArrayList list = new238(); push(goTo(49), list); } break; case 239: /* reduce ATerminal$PkgNameTail */ { ArrayList list = new239(); push(goTo(50), list); } break; case 240: /* reduce ANonTerminal$PkgNameTail */ { ArrayList list = new240(); push(goTo(50), list); } break; case 241: /* reduce ATerminal$HelperDef */ { ArrayList list = new241(); push(goTo(51), list); } break; case 242: /* reduce ANonTerminal$HelperDef */ { ArrayList list = new242(); push(goTo(51), list); } break; case 243: /* reduce ATerminal$IdListTail */ { ArrayList list = new243(); push(goTo(52), list); } break; case 244: /* reduce ANonTerminal$IdListTail */ { ArrayList list = new244(); push(goTo(52), list); } break; case 245: /* reduce ATerminal$TokenDef */ { ArrayList list = new245(); push(goTo(53), list); } break; case 246: /* reduce ANonTerminal$TokenDef */ { ArrayList list = new246(); push(goTo(53), list); } break; case 247: /* reduce ATerminal$StateListTail */ { ArrayList list = new247(); push(goTo(54), list); } break; case 248: /* reduce ANonTerminal$StateListTail */ { ArrayList list = new248(); push(goTo(54), list); } break; case 249: /* reduce ATerminal$RegExpTail */ { ArrayList list = new249(); push(goTo(55), list); } break; case 250: /* reduce ANonTerminal$RegExpTail */ { ArrayList list = new250(); push(goTo(55), list); } break; case 251: /* reduce ATerminal$UnExp */ { ArrayList list = new251(); push(goTo(56), list); } break; case 252: /* reduce ANonTerminal$UnExp */ { ArrayList list = new252(); push(goTo(56), list); } break; case 253: /* reduce ATerminal$Prod */ { ArrayList list = new253(); push(goTo(57), list); } break; case 254: /* reduce ANonTerminal$Prod */ { ArrayList list = new254(); push(goTo(57), list); } break; case 255: /* reduce ATerminal$Elem */ { ArrayList list = new255(); push(goTo(58), list); } break; case 256: /* reduce ANonTerminal$Elem */ { ArrayList list = new256(); push(goTo(58), list); } break; case 257: /* reduce ATerminal$AltsTail */ { ArrayList list = new257(); push(goTo(59), list); } break; case 258: /* reduce ANonTerminal$AltsTail */ { ArrayList list = new258(); push(goTo(59), list); } break; case 259: /* reduce ATerminal$Term */ { ArrayList list = new259(); push(goTo(60), list); } break; case 260: /* reduce ANonTerminal$Term */ { ArrayList list = new260(); push(goTo(60), list); } break; case 261: /* reduce ATerminal$ListTermTail */ { ArrayList list = new261(); push(goTo(61), list); } break; case 262: /* reduce ANonTerminal$ListTermTail */ { ArrayList list = new262(); push(goTo(61), list); } break; case 263: /* reduce ATerminal$ParamsTail */ { ArrayList list = new263(); push(goTo(62), list); } break; case 264: /* reduce ANonTerminal$ParamsTail */ { ArrayList list = new264(); push(goTo(62), list); } break; case 265: /* reduce ATerminal$AstProd */ { ArrayList list = new265(); push(goTo(63), list); } break; case 266: /* reduce ANonTerminal$AstProd */ { ArrayList list = new266(); push(goTo(63), list); } break; case 267: /* reduce ATerminal$AstAltsTail */ { ArrayList list = new267(); push(goTo(64), list); } break; case 268: /* reduce ANonTerminal$AstAltsTail */ { ArrayList list = new268(); push(goTo(64), list); } break; } } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new0() /* reduce AAgrammar1Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } pgrammarNode1 = new AGrammar(listNode2, null, null, null, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new1() /* reduce AAgrammar2Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pgrammarNode1 = new AGrammar(listNode3, null, null, null, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new2() /* reduce AAgrammar3Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, null, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new3() /* reduce AAgrammar4Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, null, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new4() /* reduce AAgrammar5Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, null, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new5() /* reduce AAgrammar6Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, null, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new6() /* reduce AAgrammar7Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, null, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new7() /* reduce AAgrammar8Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, null, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new8() /* reduce AAgrammar9Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } ptokensNode5 = (PTokens)nodeArrayList1.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, ptokensNode5, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new9() /* reduce AAgrammar10Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } ptokensNode6 = (PTokens)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, ptokensNode6, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new10() /* reduce AAgrammar11Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, ptokensNode5, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new11() /* reduce AAgrammar12Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, ptokensNode6, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new12() /* reduce AAgrammar13Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, ptokensNode5, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new13() /* reduce AAgrammar14Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, ptokensNode6, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new14() /* reduce AAgrammar15Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); ptokensNode5 = (PTokens)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, ptokensNode5, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new15() /* reduce AAgrammar16Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); ptokensNode6 = (PTokens)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, ptokensNode6, null, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new16() /* reduce AAgrammar17Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } pigntokensNode6 = (PIgnTokens)nodeArrayList1.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, null, pigntokensNode6, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new17() /* reduce AAgrammar18Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pigntokensNode7 = (PIgnTokens)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, null, pigntokensNode7, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new18() /* reduce AAgrammar19Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, null, pigntokensNode6, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new19() /* reduce AAgrammar20Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, null, pigntokensNode7, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new20() /* reduce AAgrammar21Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, null, pigntokensNode6, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new21() /* reduce AAgrammar22Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, null, pigntokensNode7, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new22() /* reduce AAgrammar23Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, null, pigntokensNode6, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new23() /* reduce AAgrammar24Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, null, pigntokensNode7, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new24() /* reduce AAgrammar25Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } ptokensNode5 = (PTokens)nodeArrayList1.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, ptokensNode5, pigntokensNode6, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new25() /* reduce AAgrammar26Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } ptokensNode6 = (PTokens)nodeArrayList2.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, ptokensNode6, pigntokensNode7, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new26() /* reduce AAgrammar27Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, ptokensNode5, pigntokensNode6, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new27() /* reduce AAgrammar28Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, ptokensNode6, pigntokensNode7, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new28() /* reduce AAgrammar29Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; PTokens ptokensNode5; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, ptokensNode5, pigntokensNode6, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new29() /* reduce AAgrammar30Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; PTokens ptokensNode6; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, ptokensNode6, pigntokensNode7, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new30() /* reduce AAgrammar31Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; PTokens ptokensNode5; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); ptokensNode5 = (PTokens)nodeArrayList3.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, ptokensNode5, pigntokensNode6, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new31() /* reduce AAgrammar32Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; PTokens ptokensNode6; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); ptokensNode6 = (PTokens)nodeArrayList4.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, ptokensNode6, pigntokensNode7, null, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new32() /* reduce AAgrammar33Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } pproductionsNode7 = (PProductions)nodeArrayList1.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, null, null, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new33() /* reduce AAgrammar34Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pproductionsNode8 = (PProductions)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, null, null, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new34() /* reduce AAgrammar35Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pproductionsNode7 = (PProductions)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, null, null, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new35() /* reduce AAgrammar36Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pproductionsNode8 = (PProductions)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, null, null, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new36() /* reduce AAgrammar37Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); pproductionsNode7 = (PProductions)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, null, null, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new37() /* reduce AAgrammar38Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); pproductionsNode8 = (PProductions)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, null, null, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new38() /* reduce AAgrammar39Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); pproductionsNode7 = (PProductions)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, null, null, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new39() /* reduce AAgrammar40Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); pproductionsNode8 = (PProductions)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, null, null, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new40() /* reduce AAgrammar41Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } ptokensNode5 = (PTokens)nodeArrayList1.get(0); pproductionsNode7 = (PProductions)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, ptokensNode5, null, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new41() /* reduce AAgrammar42Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } ptokensNode6 = (PTokens)nodeArrayList2.get(0); pproductionsNode8 = (PProductions)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, ptokensNode6, null, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new42() /* reduce AAgrammar43Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pproductionsNode7 = (PProductions)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, ptokensNode5, null, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new43() /* reduce AAgrammar44Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pproductionsNode8 = (PProductions)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, ptokensNode6, null, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new44() /* reduce AAgrammar45Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pproductionsNode7 = (PProductions)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, ptokensNode5, null, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new45() /* reduce AAgrammar46Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pproductionsNode8 = (PProductions)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, ptokensNode6, null, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new46() /* reduce AAgrammar47Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); ptokensNode5 = (PTokens)nodeArrayList3.get(0); pproductionsNode7 = (PProductions)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, ptokensNode5, null, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new47() /* reduce AAgrammar48Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); ptokensNode6 = (PTokens)nodeArrayList4.get(0); pproductionsNode8 = (PProductions)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, ptokensNode6, null, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new48() /* reduce AAgrammar49Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } pigntokensNode6 = (PIgnTokens)nodeArrayList1.get(0); pproductionsNode7 = (PProductions)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, null, pigntokensNode6, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new49() /* reduce AAgrammar50Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pigntokensNode7 = (PIgnTokens)nodeArrayList2.get(0); pproductionsNode8 = (PProductions)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, null, pigntokensNode7, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new50() /* reduce AAgrammar51Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList2.get(0); pproductionsNode7 = (PProductions)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, null, pigntokensNode6, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new51() /* reduce AAgrammar52Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList3.get(0); pproductionsNode8 = (PProductions)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, null, pigntokensNode7, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new52() /* reduce AAgrammar53Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList2.get(0); pproductionsNode7 = (PProductions)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, null, pigntokensNode6, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new53() /* reduce AAgrammar54Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList3.get(0); pproductionsNode8 = (PProductions)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, null, pigntokensNode7, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new54() /* reduce AAgrammar55Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList3.get(0); pproductionsNode7 = (PProductions)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, null, pigntokensNode6, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new55() /* reduce AAgrammar56Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList4.get(0); pproductionsNode8 = (PProductions)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, null, pigntokensNode7, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new56() /* reduce AAgrammar57Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } ptokensNode5 = (PTokens)nodeArrayList1.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList2.get(0); pproductionsNode7 = (PProductions)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, ptokensNode5, pigntokensNode6, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new57() /* reduce AAgrammar58Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } ptokensNode6 = (PTokens)nodeArrayList2.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList3.get(0); pproductionsNode8 = (PProductions)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, ptokensNode6, pigntokensNode7, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new58() /* reduce AAgrammar59Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList3.get(0); pproductionsNode7 = (PProductions)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, ptokensNode5, pigntokensNode6, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new59() /* reduce AAgrammar60Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList4.get(0); pproductionsNode8 = (PProductions)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, ptokensNode6, pigntokensNode7, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new60() /* reduce AAgrammar61Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; PTokens ptokensNode5; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList3.get(0); pproductionsNode7 = (PProductions)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, ptokensNode5, pigntokensNode6, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new61() /* reduce AAgrammar62Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; PTokens ptokensNode6; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList4.get(0); pproductionsNode8 = (PProductions)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, ptokensNode6, pigntokensNode7, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new62() /* reduce AAgrammar63Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; PTokens ptokensNode5; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; @SuppressWarnings("unused") Object nullNode8 = null; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); ptokensNode5 = (PTokens)nodeArrayList3.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList4.get(0); pproductionsNode7 = (PProductions)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, ptokensNode5, pigntokensNode6, pproductionsNode7, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new63() /* reduce AAgrammar64Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList6 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; PTokens ptokensNode6; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; @SuppressWarnings("unused") Object nullNode9 = null; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); ptokensNode6 = (PTokens)nodeArrayList4.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList5.get(0); pproductionsNode8 = (PProductions)nodeArrayList6.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, ptokensNode6, pigntokensNode7, pproductionsNode8, null); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new64() /* reduce AAgrammar65Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } pastNode8 = (PAst)nodeArrayList1.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, null, null, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new65() /* reduce AAgrammar66Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pastNode9 = (PAst)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, null, null, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new66() /* reduce AAgrammar67Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pastNode8 = (PAst)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, null, null, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new67() /* reduce AAgrammar68Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pastNode9 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, null, null, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new68() /* reduce AAgrammar69Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); pastNode8 = (PAst)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, null, null, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new69() /* reduce AAgrammar70Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); pastNode9 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, null, null, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new70() /* reduce AAgrammar71Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); pastNode8 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, null, null, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new71() /* reduce AAgrammar72Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); pastNode9 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, null, null, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new72() /* reduce AAgrammar73Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } ptokensNode5 = (PTokens)nodeArrayList1.get(0); pastNode8 = (PAst)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, ptokensNode5, null, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new73() /* reduce AAgrammar74Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } ptokensNode6 = (PTokens)nodeArrayList2.get(0); pastNode9 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, ptokensNode6, null, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new74() /* reduce AAgrammar75Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pastNode8 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, ptokensNode5, null, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new75() /* reduce AAgrammar76Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pastNode9 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, ptokensNode6, null, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new76() /* reduce AAgrammar77Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pastNode8 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, ptokensNode5, null, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new77() /* reduce AAgrammar78Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pastNode9 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, ptokensNode6, null, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new78() /* reduce AAgrammar79Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); ptokensNode5 = (PTokens)nodeArrayList3.get(0); pastNode8 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, ptokensNode5, null, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new79() /* reduce AAgrammar80Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); ptokensNode6 = (PTokens)nodeArrayList4.get(0); pastNode9 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, ptokensNode6, null, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new80() /* reduce AAgrammar81Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } pigntokensNode6 = (PIgnTokens)nodeArrayList1.get(0); pastNode8 = (PAst)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, null, pigntokensNode6, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new81() /* reduce AAgrammar82Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pigntokensNode7 = (PIgnTokens)nodeArrayList2.get(0); pastNode9 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, null, pigntokensNode7, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new82() /* reduce AAgrammar83Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList2.get(0); pastNode8 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, null, pigntokensNode6, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new83() /* reduce AAgrammar84Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList3.get(0); pastNode9 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, null, pigntokensNode7, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new84() /* reduce AAgrammar85Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList2.get(0); pastNode8 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, null, pigntokensNode6, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new85() /* reduce AAgrammar86Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList3.get(0); pastNode9 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, null, pigntokensNode7, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new86() /* reduce AAgrammar87Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList3.get(0); pastNode8 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, null, pigntokensNode6, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new87() /* reduce AAgrammar88Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList4.get(0); pastNode9 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, null, pigntokensNode7, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new88() /* reduce AAgrammar89Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } ptokensNode5 = (PTokens)nodeArrayList1.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList2.get(0); pastNode8 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, ptokensNode5, pigntokensNode6, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new89() /* reduce AAgrammar90Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } ptokensNode6 = (PTokens)nodeArrayList2.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList3.get(0); pastNode9 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, ptokensNode6, pigntokensNode7, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new90() /* reduce AAgrammar91Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList3.get(0); pastNode8 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, ptokensNode5, pigntokensNode6, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new91() /* reduce AAgrammar92Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList4.get(0); pastNode9 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, ptokensNode6, pigntokensNode7, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new92() /* reduce AAgrammar93Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; PTokens ptokensNode5; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList3.get(0); pastNode8 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, ptokensNode5, pigntokensNode6, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new93() /* reduce AAgrammar94Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; PTokens ptokensNode6; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList4.get(0); pastNode9 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, ptokensNode6, pigntokensNode7, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new94() /* reduce AAgrammar95Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; PTokens ptokensNode5; PIgnTokens pigntokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); ptokensNode5 = (PTokens)nodeArrayList3.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList4.get(0); pastNode8 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, ptokensNode5, pigntokensNode6, null, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new95() /* reduce AAgrammar96Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList6 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; PTokens ptokensNode6; PIgnTokens pigntokensNode7; @SuppressWarnings("unused") Object nullNode8 = null; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); ptokensNode6 = (PTokens)nodeArrayList4.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList5.get(0); pastNode9 = (PAst)nodeArrayList6.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, ptokensNode6, pigntokensNode7, null, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new96() /* reduce AAgrammar97Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; PAst pastNode8; { // Block } pproductionsNode7 = (PProductions)nodeArrayList1.get(0); pastNode8 = (PAst)nodeArrayList2.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, null, null, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new97() /* reduce AAgrammar98Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pproductionsNode8 = (PProductions)nodeArrayList2.get(0); pastNode9 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, null, null, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new98() /* reduce AAgrammar99Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pproductionsNode7 = (PProductions)nodeArrayList2.get(0); pastNode8 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, null, null, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new99() /* reduce AAgrammar100Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pproductionsNode8 = (PProductions)nodeArrayList3.get(0); pastNode9 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, null, null, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new100() /* reduce AAgrammar101Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; PAst pastNode8; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); pproductionsNode7 = (PProductions)nodeArrayList2.get(0); pastNode8 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, null, null, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new101() /* reduce AAgrammar102Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); pproductionsNode8 = (PProductions)nodeArrayList3.get(0); pastNode9 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, null, null, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new102() /* reduce AAgrammar103Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); pproductionsNode7 = (PProductions)nodeArrayList3.get(0); pastNode8 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, null, null, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new103() /* reduce AAgrammar104Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); pproductionsNode8 = (PProductions)nodeArrayList4.get(0); pastNode9 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, null, null, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new104() /* reduce AAgrammar105Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; PAst pastNode8; { // Block } ptokensNode5 = (PTokens)nodeArrayList1.get(0); pproductionsNode7 = (PProductions)nodeArrayList2.get(0); pastNode8 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, ptokensNode5, null, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new105() /* reduce AAgrammar106Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } ptokensNode6 = (PTokens)nodeArrayList2.get(0); pproductionsNode8 = (PProductions)nodeArrayList3.get(0); pastNode9 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, ptokensNode6, null, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new106() /* reduce AAgrammar107Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pproductionsNode7 = (PProductions)nodeArrayList3.get(0); pastNode8 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, ptokensNode5, null, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new107() /* reduce AAgrammar108Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pproductionsNode8 = (PProductions)nodeArrayList4.get(0); pastNode9 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, ptokensNode6, null, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new108() /* reduce AAgrammar109Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; PAst pastNode8; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pproductionsNode7 = (PProductions)nodeArrayList3.get(0); pastNode8 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, ptokensNode5, null, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new109() /* reduce AAgrammar110Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pproductionsNode8 = (PProductions)nodeArrayList4.get(0); pastNode9 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, ptokensNode6, null, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new110() /* reduce AAgrammar111Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; PTokens ptokensNode5; @SuppressWarnings("unused") Object nullNode6 = null; PProductions pproductionsNode7; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); ptokensNode5 = (PTokens)nodeArrayList3.get(0); pproductionsNode7 = (PProductions)nodeArrayList4.get(0); pastNode8 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, ptokensNode5, null, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new111() /* reduce AAgrammar112Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList6 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; PTokens ptokensNode6; @SuppressWarnings("unused") Object nullNode7 = null; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); ptokensNode6 = (PTokens)nodeArrayList4.get(0); pproductionsNode8 = (PProductions)nodeArrayList5.get(0); pastNode9 = (PAst)nodeArrayList6.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, ptokensNode6, null, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new112() /* reduce AAgrammar113Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; PAst pastNode8; { // Block } pigntokensNode6 = (PIgnTokens)nodeArrayList1.get(0); pproductionsNode7 = (PProductions)nodeArrayList2.get(0); pastNode8 = (PAst)nodeArrayList3.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, null, pigntokensNode6, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new113() /* reduce AAgrammar114Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pigntokensNode7 = (PIgnTokens)nodeArrayList2.get(0); pproductionsNode8 = (PProductions)nodeArrayList3.get(0); pastNode9 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, null, pigntokensNode7, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new114() /* reduce AAgrammar115Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList2.get(0); pproductionsNode7 = (PProductions)nodeArrayList3.get(0); pastNode8 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, null, pigntokensNode6, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new115() /* reduce AAgrammar116Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList3.get(0); pproductionsNode8 = (PProductions)nodeArrayList4.get(0); pastNode9 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, null, pigntokensNode7, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new116() /* reduce AAgrammar117Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; PAst pastNode8; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList2.get(0); pproductionsNode7 = (PProductions)nodeArrayList3.get(0); pastNode8 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, null, pigntokensNode6, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new117() /* reduce AAgrammar118Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList3.get(0); pproductionsNode8 = (PProductions)nodeArrayList4.get(0); pastNode9 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, null, pigntokensNode7, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new118() /* reduce AAgrammar119Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; @SuppressWarnings("unused") Object nullNode5 = null; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList3.get(0); pproductionsNode7 = (PProductions)nodeArrayList4.get(0); pastNode8 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, null, pigntokensNode6, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new119() /* reduce AAgrammar120Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList6 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; @SuppressWarnings("unused") Object nullNode6 = null; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList4.get(0); pproductionsNode8 = (PProductions)nodeArrayList5.get(0); pastNode9 = (PAst)nodeArrayList6.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, null, pigntokensNode7, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new120() /* reduce AAgrammar121Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; PAst pastNode8; { // Block } ptokensNode5 = (PTokens)nodeArrayList1.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList2.get(0); pproductionsNode7 = (PProductions)nodeArrayList3.get(0); pastNode8 = (PAst)nodeArrayList4.get(0); pgrammarNode1 = new AGrammar(listNode2, null, null, ptokensNode5, pigntokensNode6, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new121() /* reduce AAgrammar122Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } ptokensNode6 = (PTokens)nodeArrayList2.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList3.get(0); pproductionsNode8 = (PProductions)nodeArrayList4.get(0); pastNode9 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode3, null, null, ptokensNode6, pigntokensNode7, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new122() /* reduce AAgrammar123Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; @SuppressWarnings("unused") Object nullNode4 = null; PTokens ptokensNode5; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList3.get(0); pproductionsNode7 = (PProductions)nodeArrayList4.get(0); pastNode8 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, null, ptokensNode5, pigntokensNode6, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new123() /* reduce AAgrammar124Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList6 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; @SuppressWarnings("unused") Object nullNode5 = null; PTokens ptokensNode6; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList4.get(0); pproductionsNode8 = (PProductions)nodeArrayList5.get(0); pastNode9 = (PAst)nodeArrayList6.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, null, ptokensNode6, pigntokensNode7, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new124() /* reduce AAgrammar125Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); @SuppressWarnings("unused") Object nullNode3 = null; PStates pstatesNode4; PTokens ptokensNode5; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; PAst pastNode8; { // Block } pstatesNode4 = (PStates)nodeArrayList1.get(0); ptokensNode5 = (PTokens)nodeArrayList2.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList3.get(0); pproductionsNode7 = (PProductions)nodeArrayList4.get(0); pastNode8 = (PAst)nodeArrayList5.get(0); pgrammarNode1 = new AGrammar(listNode2, null, pstatesNode4, ptokensNode5, pigntokensNode6, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new125() /* reduce AAgrammar126Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList6 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; PStates pstatesNode5; PTokens ptokensNode6; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode5 = (PStates)nodeArrayList2.get(0); ptokensNode6 = (PTokens)nodeArrayList3.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList4.get(0); pproductionsNode8 = (PProductions)nodeArrayList5.get(0); pastNode9 = (PAst)nodeArrayList6.get(0); pgrammarNode1 = new AGrammar(listNode3, null, pstatesNode5, ptokensNode6, pigntokensNode7, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new126() /* reduce AAgrammar127Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList6 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode2 = new LinkedList(); PHelpers phelpersNode3; PStates pstatesNode4; PTokens ptokensNode5; PIgnTokens pigntokensNode6; PProductions pproductionsNode7; PAst pastNode8; { // Block } phelpersNode3 = (PHelpers)nodeArrayList1.get(0); pstatesNode4 = (PStates)nodeArrayList2.get(0); ptokensNode5 = (PTokens)nodeArrayList3.get(0); pigntokensNode6 = (PIgnTokens)nodeArrayList4.get(0); pproductionsNode7 = (PProductions)nodeArrayList5.get(0); pastNode8 = (PAst)nodeArrayList6.get(0); pgrammarNode1 = new AGrammar(listNode2, phelpersNode3, pstatesNode4, ptokensNode5, pigntokensNode6, pproductionsNode7, pastNode8); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new127() /* reduce AAgrammar128Grammar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList7 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList6 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PGrammar pgrammarNode1; { // Block LinkedList listNode3 = new LinkedList(); PHelpers phelpersNode4; PStates pstatesNode5; PTokens ptokensNode6; PIgnTokens pigntokensNode7; PProductions pproductionsNode8; PAst pastNode9; { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode4 = (PHelpers)nodeArrayList2.get(0); pstatesNode5 = (PStates)nodeArrayList3.get(0); ptokensNode6 = (PTokens)nodeArrayList4.get(0); pigntokensNode7 = (PIgnTokens)nodeArrayList5.get(0); pproductionsNode8 = (PProductions)nodeArrayList6.get(0); pastNode9 = (PAst)nodeArrayList7.get(0); pgrammarNode1 = new AGrammar(listNode3, phelpersNode4, pstatesNode5, ptokensNode6, pigntokensNode7, pproductionsNode8, pastNode9); } nodeList.add(pgrammarNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new128() /* reduce APackage */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); listNode1 = (LinkedList)nodeArrayList2.get(0); if(listNode1 != null) { listNode2.addAll(listNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new129() /* reduce AApkgname1PkgName */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block TPkgId tpkgidNode1; tpkgidNode1 = (TPkgId)nodeArrayList1.get(0); if(tpkgidNode1 != null) { listNode2.add(tpkgidNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new130() /* reduce AApkgname2PkgName */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block TPkgId tpkgidNode1; LinkedList listNode2 = new LinkedList(); tpkgidNode1 = (TPkgId)nodeArrayList1.get(0); listNode2 = (LinkedList)nodeArrayList2.get(0); if(tpkgidNode1 != null) { listNode3.add(tpkgidNode1); } if(listNode2 != null) { listNode3.addAll(listNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new131() /* reduce APkgNameTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); TPkgId tpkgidNode1; tpkgidNode1 = (TPkgId)nodeArrayList2.get(0); nodeList.add(tpkgidNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new132() /* reduce AHelpers */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PHelpers phelpersNode1; { // Block LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList2.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } phelpersNode1 = new AHelpers(listNode3); } nodeList.add(phelpersNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new133() /* reduce AHelperDef */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PHelperDef phelperdefNode1; { // Block TId tidNode2; PRegExp pregexpNode3; tidNode2 = (TId)nodeArrayList1.get(0); pregexpNode3 = (PRegExp)nodeArrayList3.get(0); phelperdefNode1 = new AHelperDef(tidNode2, pregexpNode3); } nodeList.add(phelperdefNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new134() /* reduce AStates */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PStates pstatesNode1; { // Block LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList2.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pstatesNode1 = new AStates(listNode3); } nodeList.add(pstatesNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new135() /* reduce AAidlist1IdList */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block TId tidNode1; tidNode1 = (TId)nodeArrayList1.get(0); if(tidNode1 != null) { listNode2.add(tidNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new136() /* reduce AAidlist2IdList */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block TId tidNode1; LinkedList listNode2 = new LinkedList(); tidNode1 = (TId)nodeArrayList1.get(0); listNode2 = (LinkedList)nodeArrayList2.get(0); if(tidNode1 != null) { listNode3.add(tidNode1); } if(listNode2 != null) { listNode3.addAll(listNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new137() /* reduce AIdListTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); TId tidNode1; tidNode1 = (TId)nodeArrayList2.get(0); nodeList.add(tidNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new138() /* reduce ATokens */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTokens ptokensNode1; { // Block LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList2.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } ptokensNode1 = new ATokens(listNode3); } nodeList.add(ptokensNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new139() /* reduce AAtokendef1TokenDef */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTokenDef ptokendefNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; TId tidNode3; PRegExp pregexpNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; tidNode3 = (TId)nodeArrayList1.get(0); pregexpNode4 = (PRegExp)nodeArrayList3.get(0); ptokendefNode1 = new ATokenDef(null, tidNode3, pregexpNode4, null, null); } nodeList.add(ptokendefNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new140() /* reduce AAtokendef2TokenDef */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTokenDef ptokendefNode1; { // Block PStateList pstatelistNode2; TId tidNode3; PRegExp pregexpNode4; @SuppressWarnings("unused") Object nullNode5 = null; @SuppressWarnings("unused") Object nullNode6 = null; pstatelistNode2 = (PStateList)nodeArrayList1.get(0); tidNode3 = (TId)nodeArrayList2.get(0); pregexpNode4 = (PRegExp)nodeArrayList4.get(0); ptokendefNode1 = new ATokenDef(pstatelistNode2, tidNode3, pregexpNode4, null, null); } nodeList.add(ptokendefNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new141() /* reduce AAtokendef3TokenDef */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTokenDef ptokendefNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; TId tidNode3; PRegExp pregexpNode4; TSlash tslashNode5; PRegExp pregexpNode6; tidNode3 = (TId)nodeArrayList1.get(0); pregexpNode4 = (PRegExp)nodeArrayList3.get(0); tslashNode5 = (TSlash)nodeArrayList4.get(0); pregexpNode6 = (PRegExp)nodeArrayList4.get(1); ptokendefNode1 = new ATokenDef(null, tidNode3, pregexpNode4, tslashNode5, pregexpNode6); } nodeList.add(ptokendefNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new142() /* reduce AAtokendef4TokenDef */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList6 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTokenDef ptokendefNode1; { // Block PStateList pstatelistNode2; TId tidNode3; PRegExp pregexpNode4; TSlash tslashNode5; PRegExp pregexpNode6; pstatelistNode2 = (PStateList)nodeArrayList1.get(0); tidNode3 = (TId)nodeArrayList2.get(0); pregexpNode4 = (PRegExp)nodeArrayList4.get(0); tslashNode5 = (TSlash)nodeArrayList5.get(0); pregexpNode6 = (PRegExp)nodeArrayList5.get(1); ptokendefNode1 = new ATokenDef(pstatelistNode2, tidNode3, pregexpNode4, tslashNode5, pregexpNode6); } nodeList.add(ptokendefNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new143() /* reduce AAstatelist1StateList */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PStateList pstatelistNode1; { // Block TId tidNode2; @SuppressWarnings("unused") Object nullNode3 = null; LinkedList listNode4 = new LinkedList(); tidNode2 = (TId)nodeArrayList2.get(0); { // Block } pstatelistNode1 = new AStateList(tidNode2, null, listNode4); } nodeList.add(pstatelistNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new144() /* reduce AAstatelist2StateList */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PStateList pstatelistNode1; { // Block TId tidNode2; PTransition ptransitionNode3; LinkedList listNode4 = new LinkedList(); tidNode2 = (TId)nodeArrayList2.get(0); ptransitionNode3 = (PTransition)nodeArrayList3.get(0); { // Block } pstatelistNode1 = new AStateList(tidNode2, ptransitionNode3, listNode4); } nodeList.add(pstatelistNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new145() /* reduce AAstatelist3StateList */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PStateList pstatelistNode1; { // Block TId tidNode2; @SuppressWarnings("unused") Object nullNode3 = null; LinkedList listNode5 = new LinkedList(); tidNode2 = (TId)nodeArrayList2.get(0); { // Block LinkedList listNode4 = new LinkedList(); listNode4 = (LinkedList)nodeArrayList3.get(0); if(listNode4 != null) { listNode5.addAll(listNode4); } } pstatelistNode1 = new AStateList(tidNode2, null, listNode5); } nodeList.add(pstatelistNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new146() /* reduce AAstatelist4StateList */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PStateList pstatelistNode1; { // Block TId tidNode2; PTransition ptransitionNode3; LinkedList listNode5 = new LinkedList(); tidNode2 = (TId)nodeArrayList2.get(0); ptransitionNode3 = (PTransition)nodeArrayList3.get(0); { // Block LinkedList listNode4 = new LinkedList(); listNode4 = (LinkedList)nodeArrayList4.get(0); if(listNode4 != null) { listNode5.addAll(listNode4); } } pstatelistNode1 = new AStateList(tidNode2, ptransitionNode3, listNode5); } nodeList.add(pstatelistNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new147() /* reduce AAstatelisttail1StateListTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PStateListTail pstatelisttailNode1; { // Block TId tidNode2; @SuppressWarnings("unused") Object nullNode3 = null; tidNode2 = (TId)nodeArrayList2.get(0); pstatelisttailNode1 = new AStateListTail(tidNode2, null); } nodeList.add(pstatelisttailNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new148() /* reduce AAstatelisttail2StateListTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PStateListTail pstatelisttailNode1; { // Block TId tidNode2; PTransition ptransitionNode3; tidNode2 = (TId)nodeArrayList2.get(0); ptransitionNode3 = (PTransition)nodeArrayList3.get(0); pstatelisttailNode1 = new AStateListTail(tidNode2, ptransitionNode3); } nodeList.add(pstatelisttailNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new149() /* reduce ATransition */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTransition ptransitionNode1; { // Block TId tidNode2; tidNode2 = (TId)nodeArrayList2.get(0); ptransitionNode1 = new ATransition(tidNode2); } nodeList.add(ptransitionNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new150() /* reduce AAigntokens1IgnTokens */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PIgnTokens pigntokensNode1; { // Block LinkedList listNode2 = new LinkedList(); { // Block } pigntokensNode1 = new AIgnTokens(listNode2); } nodeList.add(pigntokensNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new151() /* reduce AAigntokens2IgnTokens */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PIgnTokens pigntokensNode1; { // Block LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList3.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pigntokensNode1 = new AIgnTokens(listNode3); } nodeList.add(pigntokensNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new152() /* reduce ALookAhead */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); TSlash tslashNode1; PRegExp pregexpNode2; tslashNode1 = (TSlash)nodeArrayList1.get(0); pregexpNode2 = (PRegExp)nodeArrayList2.get(0); nodeList.add(tslashNode1); nodeList.add(pregexpNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new153() /* reduce AAregexp1RegExp */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PRegExp pregexpNode1; { // Block LinkedList listNode3 = new LinkedList(); { // Block PConcat pconcatNode2; pconcatNode2 = (PConcat)nodeArrayList1.get(0); if(pconcatNode2 != null) { listNode3.add(pconcatNode2); } } pregexpNode1 = new ARegExp(listNode3); } nodeList.add(pregexpNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new154() /* reduce AAregexp2RegExp */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PRegExp pregexpNode1; { // Block LinkedList listNode4 = new LinkedList(); { // Block PConcat pconcatNode2; LinkedList listNode3 = new LinkedList(); pconcatNode2 = (PConcat)nodeArrayList1.get(0); listNode3 = (LinkedList)nodeArrayList2.get(0); if(pconcatNode2 != null) { listNode4.add(pconcatNode2); } if(listNode3 != null) { listNode4.addAll(listNode3); } } pregexpNode1 = new ARegExp(listNode4); } nodeList.add(pregexpNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new155() /* reduce ARegExpTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PConcat pconcatNode1; pconcatNode1 = (PConcat)nodeArrayList2.get(0); nodeList.add(pconcatNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new156() /* reduce AAconcat1Concat */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); PConcat pconcatNode1; { // Block LinkedList listNode2 = new LinkedList(); { // Block } pconcatNode1 = new AConcat(listNode2); } nodeList.add(pconcatNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new157() /* reduce AAconcat2Concat */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PConcat pconcatNode1; { // Block LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList1.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pconcatNode1 = new AConcat(listNode3); } nodeList.add(pconcatNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new158() /* reduce AAunexp1UnExp */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PUnExp punexpNode1; { // Block PBasic pbasicNode2; @SuppressWarnings("unused") Object nullNode3 = null; pbasicNode2 = (PBasic)nodeArrayList1.get(0); punexpNode1 = new AUnExp(pbasicNode2, null); } nodeList.add(punexpNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new159() /* reduce AAunexp2UnExp */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PUnExp punexpNode1; { // Block PBasic pbasicNode2; PUnOp punopNode3; pbasicNode2 = (PBasic)nodeArrayList1.get(0); punopNode3 = (PUnOp)nodeArrayList2.get(0); punexpNode1 = new AUnExp(pbasicNode2, punopNode3); } nodeList.add(punexpNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new160() /* reduce ACharBasic */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PBasic pbasicNode1; { // Block PChar pcharNode2; pcharNode2 = (PChar)nodeArrayList1.get(0); pbasicNode1 = new ACharBasic(pcharNode2); } nodeList.add(pbasicNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new161() /* reduce ASetBasic */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PBasic pbasicNode1; { // Block PSet psetNode2; psetNode2 = (PSet)nodeArrayList1.get(0); pbasicNode1 = new ASetBasic(psetNode2); } nodeList.add(pbasicNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new162() /* reduce AStringBasic */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PBasic pbasicNode1; { // Block TString tstringNode2; tstringNode2 = (TString)nodeArrayList1.get(0); pbasicNode1 = new AStringBasic(tstringNode2); } nodeList.add(pbasicNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new163() /* reduce AIdBasic */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PBasic pbasicNode1; { // Block TId tidNode2; tidNode2 = (TId)nodeArrayList1.get(0); pbasicNode1 = new AIdBasic(tidNode2); } nodeList.add(pbasicNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new164() /* reduce ARegExpBasic */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PBasic pbasicNode1; { // Block PRegExp pregexpNode2; pregexpNode2 = (PRegExp)nodeArrayList2.get(0); pbasicNode1 = new ARegExpBasic(pregexpNode2); } nodeList.add(pbasicNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new165() /* reduce ACharChar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PChar pcharNode1; { // Block TChar tcharNode2; tcharNode2 = (TChar)nodeArrayList1.get(0); pcharNode1 = new ACharChar(tcharNode2); } nodeList.add(pcharNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new166() /* reduce ADecChar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PChar pcharNode1; { // Block TDecChar tdeccharNode2; tdeccharNode2 = (TDecChar)nodeArrayList1.get(0); pcharNode1 = new ADecChar(tdeccharNode2); } nodeList.add(pcharNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new167() /* reduce AHexChar */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PChar pcharNode1; { // Block THexChar thexcharNode2; thexcharNode2 = (THexChar)nodeArrayList1.get(0); pcharNode1 = new AHexChar(thexcharNode2); } nodeList.add(pcharNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new168() /* reduce AOperationSet */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PSet psetNode1; { // Block PBasic pbasicNode2; PBinOp pbinopNode3; PBasic pbasicNode4; pbasicNode2 = (PBasic)nodeArrayList2.get(0); pbinopNode3 = (PBinOp)nodeArrayList3.get(0); pbasicNode4 = (PBasic)nodeArrayList4.get(0); psetNode1 = new AOperationSet(pbasicNode2, pbinopNode3, pbasicNode4); } nodeList.add(psetNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new169() /* reduce AIntervalSet */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PSet psetNode1; { // Block PChar pcharNode2; PChar pcharNode3; pcharNode2 = (PChar)nodeArrayList2.get(0); pcharNode3 = (PChar)nodeArrayList4.get(0); psetNode1 = new AIntervalSet(pcharNode2, pcharNode3); } nodeList.add(psetNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new170() /* reduce AStarUnOp */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PUnOp punopNode1; { // Block TStar tstarNode2; tstarNode2 = (TStar)nodeArrayList1.get(0); punopNode1 = new AStarUnOp(tstarNode2); } nodeList.add(punopNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new171() /* reduce AQMarkUnOp */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PUnOp punopNode1; { // Block TQMark tqmarkNode2; tqmarkNode2 = (TQMark)nodeArrayList1.get(0); punopNode1 = new AQMarkUnOp(tqmarkNode2); } nodeList.add(punopNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new172() /* reduce APlusUnOp */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PUnOp punopNode1; { // Block TPlus tplusNode2; tplusNode2 = (TPlus)nodeArrayList1.get(0); punopNode1 = new APlusUnOp(tplusNode2); } nodeList.add(punopNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new173() /* reduce APlusBinOp */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PBinOp pbinopNode1; { // Block pbinopNode1 = new APlusBinOp(); } nodeList.add(pbinopNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new174() /* reduce AMinusBinOp */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PBinOp pbinopNode1; { // Block pbinopNode1 = new AMinusBinOp(); } nodeList.add(pbinopNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new175() /* reduce AProductions */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PProductions pproductionsNode1; { // Block LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList2.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pproductionsNode1 = new AProductions(listNode3); } nodeList.add(pproductionsNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new176() /* reduce AAprod1Prod */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PProd pprodNode1; { // Block TId tidNode2; @SuppressWarnings("unused") Object nullNode3 = null; LinkedList listNode4 = new LinkedList(); LinkedList listNode6 = new LinkedList(); tidNode2 = (TId)nodeArrayList1.get(0); { // Block } { // Block LinkedList listNode5 = new LinkedList(); listNode5 = (LinkedList)nodeArrayList3.get(0); if(listNode5 != null) { listNode6.addAll(listNode5); } } pprodNode1 = new AProd(tidNode2, null, listNode4, listNode6); } nodeList.add(pprodNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new177() /* reduce AAprod2Prod */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PProd pprodNode1; { // Block TId tidNode2; TArrow tarrowNode3; LinkedList listNode5 = new LinkedList(); LinkedList listNode7 = new LinkedList(); tidNode2 = (TId)nodeArrayList1.get(0); tarrowNode3 = (TArrow)nodeArrayList2.get(0); { // Block LinkedList listNode4 = new LinkedList(); listNode4 = (LinkedList)nodeArrayList2.get(1); if(listNode4 != null) { listNode5.addAll(listNode4); } } { // Block LinkedList listNode6 = new LinkedList(); listNode6 = (LinkedList)nodeArrayList4.get(0); if(listNode6 != null) { listNode7.addAll(listNode6); } } pprodNode1 = new AProd(tidNode2, tarrowNode3, listNode5, listNode7); } nodeList.add(pprodNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new178() /* reduce AAprodtransform1ProdTransform */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); TArrow tarrowNode1; LinkedList listNode2 = new LinkedList(); tarrowNode1 = (TArrow)nodeArrayList2.get(0); { // Block } nodeList.add(tarrowNode1); nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new179() /* reduce AAprodtransform2ProdTransform */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); TArrow tarrowNode1; LinkedList listNode3 = new LinkedList(); tarrowNode1 = (TArrow)nodeArrayList2.get(0); { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList3.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } nodeList.add(tarrowNode1); nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new180() /* reduce AAalts1Alts */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PAlt paltNode1; paltNode1 = (PAlt)nodeArrayList1.get(0); if(paltNode1 != null) { listNode2.add(paltNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new181() /* reduce AAalts2Alts */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block PAlt paltNode1; LinkedList listNode2 = new LinkedList(); paltNode1 = (PAlt)nodeArrayList1.get(0); listNode2 = (LinkedList)nodeArrayList2.get(0); if(paltNode1 != null) { listNode3.add(paltNode1); } if(listNode2 != null) { listNode3.addAll(listNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new182() /* reduce AAltsTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAlt paltNode1; paltNode1 = (PAlt)nodeArrayList2.get(0); nodeList.add(paltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new183() /* reduce AAalt1Alt */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); PAlt paltNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; { // Block } paltNode1 = new AAlt(null, listNode3, null); } nodeList.add(paltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new184() /* reduce AAalt2Alt */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAlt paltNode1; { // Block TId tidNode2; LinkedList listNode3 = new LinkedList(); @SuppressWarnings("unused") Object nullNode4 = null; tidNode2 = (TId)nodeArrayList1.get(0); { // Block } paltNode1 = new AAlt(tidNode2, listNode3, null); } nodeList.add(paltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new185() /* reduce AAalt3Alt */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAlt paltNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; LinkedList listNode4 = new LinkedList(); @SuppressWarnings("unused") Object nullNode5 = null; { // Block LinkedList listNode3 = new LinkedList(); listNode3 = (LinkedList)nodeArrayList1.get(0); if(listNode3 != null) { listNode4.addAll(listNode3); } } paltNode1 = new AAlt(null, listNode4, null); } nodeList.add(paltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new186() /* reduce AAalt4Alt */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAlt paltNode1; { // Block TId tidNode2; LinkedList listNode4 = new LinkedList(); @SuppressWarnings("unused") Object nullNode5 = null; tidNode2 = (TId)nodeArrayList1.get(0); { // Block LinkedList listNode3 = new LinkedList(); listNode3 = (LinkedList)nodeArrayList2.get(0); if(listNode3 != null) { listNode4.addAll(listNode3); } } paltNode1 = new AAlt(tidNode2, listNode4, null); } nodeList.add(paltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new187() /* reduce AAalt5Alt */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAlt paltNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; LinkedList listNode3 = new LinkedList(); PAltTransform palttransformNode4; { // Block } palttransformNode4 = (PAltTransform)nodeArrayList1.get(0); paltNode1 = new AAlt(null, listNode3, palttransformNode4); } nodeList.add(paltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new188() /* reduce AAalt6Alt */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAlt paltNode1; { // Block TId tidNode2; LinkedList listNode3 = new LinkedList(); PAltTransform palttransformNode4; tidNode2 = (TId)nodeArrayList1.get(0); { // Block } palttransformNode4 = (PAltTransform)nodeArrayList2.get(0); paltNode1 = new AAlt(tidNode2, listNode3, palttransformNode4); } nodeList.add(paltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new189() /* reduce AAalt7Alt */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAlt paltNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; LinkedList listNode4 = new LinkedList(); PAltTransform palttransformNode5; { // Block LinkedList listNode3 = new LinkedList(); listNode3 = (LinkedList)nodeArrayList1.get(0); if(listNode3 != null) { listNode4.addAll(listNode3); } } palttransformNode5 = (PAltTransform)nodeArrayList2.get(0); paltNode1 = new AAlt(null, listNode4, palttransformNode5); } nodeList.add(paltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new190() /* reduce AAalt8Alt */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAlt paltNode1; { // Block TId tidNode2; LinkedList listNode4 = new LinkedList(); PAltTransform palttransformNode5; tidNode2 = (TId)nodeArrayList1.get(0); { // Block LinkedList listNode3 = new LinkedList(); listNode3 = (LinkedList)nodeArrayList2.get(0); if(listNode3 != null) { listNode4.addAll(listNode3); } } palttransformNode5 = (PAltTransform)nodeArrayList3.get(0); paltNode1 = new AAlt(tidNode2, listNode4, palttransformNode5); } nodeList.add(paltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new191() /* reduce AAalttransform1AltTransform */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAltTransform palttransformNode1; { // Block TLBrace tlbraceNode2; LinkedList listNode3 = new LinkedList(); TRBrace trbraceNode4; tlbraceNode2 = (TLBrace)nodeArrayList1.get(0); { // Block } trbraceNode4 = (TRBrace)nodeArrayList3.get(0); palttransformNode1 = new AAltTransform(tlbraceNode2, listNode3, trbraceNode4); } nodeList.add(palttransformNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new192() /* reduce AAalttransform2AltTransform */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAltTransform palttransformNode1; { // Block TLBrace tlbraceNode2; LinkedList listNode4 = new LinkedList(); TRBrace trbraceNode5; tlbraceNode2 = (TLBrace)nodeArrayList1.get(0); { // Block LinkedList listNode3 = new LinkedList(); listNode3 = (LinkedList)nodeArrayList3.get(0); if(listNode3 != null) { listNode4.addAll(listNode3); } } trbraceNode5 = (TRBrace)nodeArrayList4.get(0); palttransformNode1 = new AAltTransform(tlbraceNode2, listNode4, trbraceNode5); } nodeList.add(palttransformNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new193() /* reduce AAnewterm1Term */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTerm ptermNode1; { // Block PProdName pprodnameNode2; TLPar tlparNode3; LinkedList listNode4 = new LinkedList(); pprodnameNode2 = (PProdName)nodeArrayList2.get(0); tlparNode3 = (TLPar)nodeArrayList3.get(0); { // Block } ptermNode1 = new ANewTerm(pprodnameNode2, tlparNode3, listNode4); } nodeList.add(ptermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new194() /* reduce AAnewterm2Term */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTerm ptermNode1; { // Block PProdName pprodnameNode2; TLPar tlparNode3; LinkedList listNode5 = new LinkedList(); pprodnameNode2 = (PProdName)nodeArrayList2.get(0); tlparNode3 = (TLPar)nodeArrayList3.get(0); { // Block LinkedList listNode4 = new LinkedList(); listNode4 = (LinkedList)nodeArrayList4.get(0); if(listNode4 != null) { listNode5.addAll(listNode4); } } ptermNode1 = new ANewTerm(pprodnameNode2, tlparNode3, listNode5); } nodeList.add(ptermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new195() /* reduce AAlistterm1Term */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTerm ptermNode1; { // Block TLBkt tlbktNode2; LinkedList listNode3 = new LinkedList(); tlbktNode2 = (TLBkt)nodeArrayList1.get(0); { // Block } ptermNode1 = new AListTerm(tlbktNode2, listNode3); } nodeList.add(ptermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new196() /* reduce AAlistterm2Term */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTerm ptermNode1; { // Block TLBkt tlbktNode2; LinkedList listNode4 = new LinkedList(); tlbktNode2 = (TLBkt)nodeArrayList1.get(0); { // Block LinkedList listNode3 = new LinkedList(); listNode3 = (LinkedList)nodeArrayList2.get(0); if(listNode3 != null) { listNode4.addAll(listNode3); } } ptermNode1 = new AListTerm(tlbktNode2, listNode4); } nodeList.add(ptermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new197() /* reduce AAsimpleterm1Term */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTerm ptermNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; TId tidNode3; @SuppressWarnings("unused") Object nullNode4 = null; tidNode3 = (TId)nodeArrayList1.get(0); ptermNode1 = new ASimpleTerm(null, tidNode3, null); } nodeList.add(ptermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new198() /* reduce AAsimpleterm2Term */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTerm ptermNode1; { // Block PSpecifier pspecifierNode2; TId tidNode3; @SuppressWarnings("unused") Object nullNode4 = null; pspecifierNode2 = (PSpecifier)nodeArrayList1.get(0); tidNode3 = (TId)nodeArrayList2.get(0); ptermNode1 = new ASimpleTerm(pspecifierNode2, tidNode3, null); } nodeList.add(ptermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new199() /* reduce AAsimpleterm3Term */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTerm ptermNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; TId tidNode3; TId tidNode4; tidNode3 = (TId)nodeArrayList1.get(0); tidNode4 = (TId)nodeArrayList2.get(0); ptermNode1 = new ASimpleTerm(null, tidNode3, tidNode4); } nodeList.add(ptermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new200() /* reduce AAsimpleterm4Term */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTerm ptermNode1; { // Block PSpecifier pspecifierNode2; TId tidNode3; TId tidNode4; pspecifierNode2 = (PSpecifier)nodeArrayList1.get(0); tidNode3 = (TId)nodeArrayList2.get(0); tidNode4 = (TId)nodeArrayList3.get(0); ptermNode1 = new ASimpleTerm(pspecifierNode2, tidNode3, tidNode4); } nodeList.add(ptermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new201() /* reduce ANullTerm */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTerm ptermNode1; { // Block ptermNode1 = new ANullTerm(); } nodeList.add(ptermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new202() /* reduce AAlistoflistterm1ListOfListTerm */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PListTerm plisttermNode1; plisttermNode1 = (PListTerm)nodeArrayList1.get(0); if(plisttermNode1 != null) { listNode2.add(plisttermNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new203() /* reduce AAlistoflistterm2ListOfListTerm */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block PListTerm plisttermNode1; LinkedList listNode2 = new LinkedList(); plisttermNode1 = (PListTerm)nodeArrayList1.get(0); listNode2 = (LinkedList)nodeArrayList2.get(0); if(plisttermNode1 != null) { listNode3.add(plisttermNode1); } if(listNode2 != null) { listNode3.addAll(listNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new204() /* reduce AAnewlistterm1ListTerm */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PListTerm plisttermNode1; { // Block PProdName pprodnameNode2; TLPar tlparNode3; LinkedList listNode4 = new LinkedList(); pprodnameNode2 = (PProdName)nodeArrayList2.get(0); tlparNode3 = (TLPar)nodeArrayList3.get(0); { // Block } plisttermNode1 = new ANewListTerm(pprodnameNode2, tlparNode3, listNode4); } nodeList.add(plisttermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new205() /* reduce AAnewlistterm2ListTerm */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList5 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PListTerm plisttermNode1; { // Block PProdName pprodnameNode2; TLPar tlparNode3; LinkedList listNode5 = new LinkedList(); pprodnameNode2 = (PProdName)nodeArrayList2.get(0); tlparNode3 = (TLPar)nodeArrayList3.get(0); { // Block LinkedList listNode4 = new LinkedList(); listNode4 = (LinkedList)nodeArrayList4.get(0); if(listNode4 != null) { listNode5.addAll(listNode4); } } plisttermNode1 = new ANewListTerm(pprodnameNode2, tlparNode3, listNode5); } nodeList.add(plisttermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new206() /* reduce AAsimplelistterm1ListTerm */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PListTerm plisttermNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; TId tidNode3; @SuppressWarnings("unused") Object nullNode4 = null; tidNode3 = (TId)nodeArrayList1.get(0); plisttermNode1 = new ASimpleListTerm(null, tidNode3, null); } nodeList.add(plisttermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new207() /* reduce AAsimplelistterm2ListTerm */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PListTerm plisttermNode1; { // Block PSpecifier pspecifierNode2; TId tidNode3; @SuppressWarnings("unused") Object nullNode4 = null; pspecifierNode2 = (PSpecifier)nodeArrayList1.get(0); tidNode3 = (TId)nodeArrayList2.get(0); plisttermNode1 = new ASimpleListTerm(pspecifierNode2, tidNode3, null); } nodeList.add(plisttermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new208() /* reduce AAsimplelistterm3ListTerm */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PListTerm plisttermNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; TId tidNode3; TId tidNode4; tidNode3 = (TId)nodeArrayList1.get(0); tidNode4 = (TId)nodeArrayList2.get(0); plisttermNode1 = new ASimpleListTerm(null, tidNode3, tidNode4); } nodeList.add(plisttermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new209() /* reduce AAsimplelistterm4ListTerm */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PListTerm plisttermNode1; { // Block PSpecifier pspecifierNode2; TId tidNode3; TId tidNode4; pspecifierNode2 = (PSpecifier)nodeArrayList1.get(0); tidNode3 = (TId)nodeArrayList2.get(0); tidNode4 = (TId)nodeArrayList3.get(0); plisttermNode1 = new ASimpleListTerm(pspecifierNode2, tidNode3, tidNode4); } nodeList.add(plisttermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new210() /* reduce AListTermTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PListTerm plisttermNode1; plisttermNode1 = (PListTerm)nodeArrayList2.get(0); nodeList.add(plisttermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new211() /* reduce ASimpleTermTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); TId tidNode1; tidNode1 = (TId)nodeArrayList2.get(0); nodeList.add(tidNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new212() /* reduce AAprodname1ProdName */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PProdName pprodnameNode1; { // Block TId tidNode2; @SuppressWarnings("unused") Object nullNode3 = null; tidNode2 = (TId)nodeArrayList1.get(0); pprodnameNode1 = new AProdName(tidNode2, null); } nodeList.add(pprodnameNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new213() /* reduce AAprodname2ProdName */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PProdName pprodnameNode1; { // Block TId tidNode2; TId tidNode3; tidNode2 = (TId)nodeArrayList1.get(0); tidNode3 = (TId)nodeArrayList2.get(0); pprodnameNode1 = new AProdName(tidNode2, tidNode3); } nodeList.add(pprodnameNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new214() /* reduce AProdNameTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); TId tidNode1; tidNode1 = (TId)nodeArrayList2.get(0); nodeList.add(tidNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new215() /* reduce AAparams1Params */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PTerm ptermNode1; ptermNode1 = (PTerm)nodeArrayList1.get(0); if(ptermNode1 != null) { listNode2.add(ptermNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new216() /* reduce AAparams2Params */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block PTerm ptermNode1; LinkedList listNode2 = new LinkedList(); ptermNode1 = (PTerm)nodeArrayList1.get(0); listNode2 = (LinkedList)nodeArrayList2.get(0); if(ptermNode1 != null) { listNode3.add(ptermNode1); } if(listNode2 != null) { listNode3.addAll(listNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new217() /* reduce AParamsTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PTerm ptermNode1; ptermNode1 = (PTerm)nodeArrayList2.get(0); nodeList.add(ptermNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new218() /* reduce AAltName */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); TId tidNode1; tidNode1 = (TId)nodeArrayList2.get(0); nodeList.add(tidNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new219() /* reduce AAelem1Elem */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PElem pelemNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; @SuppressWarnings("unused") Object nullNode3 = null; TId tidNode4; @SuppressWarnings("unused") Object nullNode5 = null; tidNode4 = (TId)nodeArrayList1.get(0); pelemNode1 = new AElem(null, null, tidNode4, null); } nodeList.add(pelemNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new220() /* reduce AAelem2Elem */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PElem pelemNode1; { // Block TId tidNode2; @SuppressWarnings("unused") Object nullNode3 = null; TId tidNode4; @SuppressWarnings("unused") Object nullNode5 = null; tidNode2 = (TId)nodeArrayList1.get(0); tidNode4 = (TId)nodeArrayList2.get(0); pelemNode1 = new AElem(tidNode2, null, tidNode4, null); } nodeList.add(pelemNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new221() /* reduce AAelem3Elem */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PElem pelemNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; PSpecifier pspecifierNode3; TId tidNode4; @SuppressWarnings("unused") Object nullNode5 = null; pspecifierNode3 = (PSpecifier)nodeArrayList1.get(0); tidNode4 = (TId)nodeArrayList2.get(0); pelemNode1 = new AElem(null, pspecifierNode3, tidNode4, null); } nodeList.add(pelemNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new222() /* reduce AAelem4Elem */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PElem pelemNode1; { // Block TId tidNode2; PSpecifier pspecifierNode3; TId tidNode4; @SuppressWarnings("unused") Object nullNode5 = null; tidNode2 = (TId)nodeArrayList1.get(0); pspecifierNode3 = (PSpecifier)nodeArrayList2.get(0); tidNode4 = (TId)nodeArrayList3.get(0); pelemNode1 = new AElem(tidNode2, pspecifierNode3, tidNode4, null); } nodeList.add(pelemNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new223() /* reduce AAelem5Elem */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PElem pelemNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; @SuppressWarnings("unused") Object nullNode3 = null; TId tidNode4; PUnOp punopNode5; tidNode4 = (TId)nodeArrayList1.get(0); punopNode5 = (PUnOp)nodeArrayList2.get(0); pelemNode1 = new AElem(null, null, tidNode4, punopNode5); } nodeList.add(pelemNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new224() /* reduce AAelem6Elem */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PElem pelemNode1; { // Block TId tidNode2; @SuppressWarnings("unused") Object nullNode3 = null; TId tidNode4; PUnOp punopNode5; tidNode2 = (TId)nodeArrayList1.get(0); tidNode4 = (TId)nodeArrayList2.get(0); punopNode5 = (PUnOp)nodeArrayList3.get(0); pelemNode1 = new AElem(tidNode2, null, tidNode4, punopNode5); } nodeList.add(pelemNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new225() /* reduce AAelem7Elem */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PElem pelemNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; PSpecifier pspecifierNode3; TId tidNode4; PUnOp punopNode5; pspecifierNode3 = (PSpecifier)nodeArrayList1.get(0); tidNode4 = (TId)nodeArrayList2.get(0); punopNode5 = (PUnOp)nodeArrayList3.get(0); pelemNode1 = new AElem(null, pspecifierNode3, tidNode4, punopNode5); } nodeList.add(pelemNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new226() /* reduce AAelem8Elem */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PElem pelemNode1; { // Block TId tidNode2; PSpecifier pspecifierNode3; TId tidNode4; PUnOp punopNode5; tidNode2 = (TId)nodeArrayList1.get(0); pspecifierNode3 = (PSpecifier)nodeArrayList2.get(0); tidNode4 = (TId)nodeArrayList3.get(0); punopNode5 = (PUnOp)nodeArrayList4.get(0); pelemNode1 = new AElem(tidNode2, pspecifierNode3, tidNode4, punopNode5); } nodeList.add(pelemNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new227() /* reduce AElemName */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); TId tidNode1; tidNode1 = (TId)nodeArrayList2.get(0); nodeList.add(tidNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new228() /* reduce ATokenSpecifier */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PSpecifier pspecifierNode1; { // Block pspecifierNode1 = new ATokenSpecifier(); } nodeList.add(pspecifierNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new229() /* reduce AProductionSpecifier */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PSpecifier pspecifierNode1; { // Block pspecifierNode1 = new AProductionSpecifier(); } nodeList.add(pspecifierNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new230() /* reduce AAst */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAst pastNode1; { // Block LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode2 = new LinkedList(); listNode2 = (LinkedList)nodeArrayList4.get(0); if(listNode2 != null) { listNode3.addAll(listNode2); } } pastNode1 = new AAst(listNode3); } nodeList.add(pastNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new231() /* reduce AAstProd */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList4 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList3 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAstProd pastprodNode1; { // Block TId tidNode2; LinkedList listNode4 = new LinkedList(); tidNode2 = (TId)nodeArrayList1.get(0); { // Block LinkedList listNode3 = new LinkedList(); listNode3 = (LinkedList)nodeArrayList3.get(0); if(listNode3 != null) { listNode4.addAll(listNode3); } } pastprodNode1 = new AAstProd(tidNode2, listNode4); } nodeList.add(pastprodNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new232() /* reduce AAastalts1AstAlts */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PAstAlt pastaltNode1; pastaltNode1 = (PAstAlt)nodeArrayList1.get(0); if(pastaltNode1 != null) { listNode2.add(pastaltNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new233() /* reduce AAastalts2AstAlts */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block PAstAlt pastaltNode1; LinkedList listNode2 = new LinkedList(); pastaltNode1 = (PAstAlt)nodeArrayList1.get(0); listNode2 = (LinkedList)nodeArrayList2.get(0); if(pastaltNode1 != null) { listNode3.add(pastaltNode1); } if(listNode2 != null) { listNode3.addAll(listNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new234() /* reduce AAstAltsTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAstAlt pastaltNode1; pastaltNode1 = (PAstAlt)nodeArrayList2.get(0); nodeList.add(pastaltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new235() /* reduce AAastalt1AstAlt */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); PAstAlt pastaltNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; LinkedList listNode3 = new LinkedList(); { // Block } pastaltNode1 = new AAstAlt(null, listNode3); } nodeList.add(pastaltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new236() /* reduce AAastalt2AstAlt */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAstAlt pastaltNode1; { // Block TId tidNode2; LinkedList listNode3 = new LinkedList(); tidNode2 = (TId)nodeArrayList1.get(0); { // Block } pastaltNode1 = new AAstAlt(tidNode2, listNode3); } nodeList.add(pastaltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new237() /* reduce AAastalt3AstAlt */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAstAlt pastaltNode1; { // Block @SuppressWarnings("unused") Object nullNode2 = null; LinkedList listNode4 = new LinkedList(); { // Block LinkedList listNode3 = new LinkedList(); listNode3 = (LinkedList)nodeArrayList1.get(0); if(listNode3 != null) { listNode4.addAll(listNode3); } } pastaltNode1 = new AAstAlt(null, listNode4); } nodeList.add(pastaltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new238() /* reduce AAastalt4AstAlt */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); PAstAlt pastaltNode1; { // Block TId tidNode2; LinkedList listNode4 = new LinkedList(); tidNode2 = (TId)nodeArrayList1.get(0); { // Block LinkedList listNode3 = new LinkedList(); listNode3 = (LinkedList)nodeArrayList2.get(0); if(listNode3 != null) { listNode4.addAll(listNode3); } } pastaltNode1 = new AAstAlt(tidNode2, listNode4); } nodeList.add(pastaltNode1); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new239() /* reduce ATerminal$PkgNameTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block TPkgId tpkgidNode1; tpkgidNode1 = (TPkgId)nodeArrayList1.get(0); if(tpkgidNode1 != null) { listNode2.add(tpkgidNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new240() /* reduce ANonTerminal$PkgNameTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); TPkgId tpkgidNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); tpkgidNode2 = (TPkgId)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(tpkgidNode2 != null) { listNode3.add(tpkgidNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new241() /* reduce ATerminal$HelperDef */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PHelperDef phelperdefNode1; phelperdefNode1 = (PHelperDef)nodeArrayList1.get(0); if(phelperdefNode1 != null) { listNode2.add(phelperdefNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new242() /* reduce ANonTerminal$HelperDef */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); PHelperDef phelperdefNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); phelperdefNode2 = (PHelperDef)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(phelperdefNode2 != null) { listNode3.add(phelperdefNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new243() /* reduce ATerminal$IdListTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block TId tidNode1; tidNode1 = (TId)nodeArrayList1.get(0); if(tidNode1 != null) { listNode2.add(tidNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new244() /* reduce ANonTerminal$IdListTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); TId tidNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); tidNode2 = (TId)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(tidNode2 != null) { listNode3.add(tidNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new245() /* reduce ATerminal$TokenDef */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PTokenDef ptokendefNode1; ptokendefNode1 = (PTokenDef)nodeArrayList1.get(0); if(ptokendefNode1 != null) { listNode2.add(ptokendefNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new246() /* reduce ANonTerminal$TokenDef */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); PTokenDef ptokendefNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); ptokendefNode2 = (PTokenDef)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(ptokendefNode2 != null) { listNode3.add(ptokendefNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new247() /* reduce ATerminal$StateListTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PStateListTail pstatelisttailNode1; pstatelisttailNode1 = (PStateListTail)nodeArrayList1.get(0); if(pstatelisttailNode1 != null) { listNode2.add(pstatelisttailNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new248() /* reduce ANonTerminal$StateListTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); PStateListTail pstatelisttailNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); pstatelisttailNode2 = (PStateListTail)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(pstatelisttailNode2 != null) { listNode3.add(pstatelisttailNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new249() /* reduce ATerminal$RegExpTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PConcat pconcatNode1; pconcatNode1 = (PConcat)nodeArrayList1.get(0); if(pconcatNode1 != null) { listNode2.add(pconcatNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new250() /* reduce ANonTerminal$RegExpTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); PConcat pconcatNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); pconcatNode2 = (PConcat)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(pconcatNode2 != null) { listNode3.add(pconcatNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new251() /* reduce ATerminal$UnExp */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PUnExp punexpNode1; punexpNode1 = (PUnExp)nodeArrayList1.get(0); if(punexpNode1 != null) { listNode2.add(punexpNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new252() /* reduce ANonTerminal$UnExp */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); PUnExp punexpNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); punexpNode2 = (PUnExp)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(punexpNode2 != null) { listNode3.add(punexpNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new253() /* reduce ATerminal$Prod */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PProd pprodNode1; pprodNode1 = (PProd)nodeArrayList1.get(0); if(pprodNode1 != null) { listNode2.add(pprodNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new254() /* reduce ANonTerminal$Prod */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); PProd pprodNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); pprodNode2 = (PProd)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(pprodNode2 != null) { listNode3.add(pprodNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new255() /* reduce ATerminal$Elem */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PElem pelemNode1; pelemNode1 = (PElem)nodeArrayList1.get(0); if(pelemNode1 != null) { listNode2.add(pelemNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new256() /* reduce ANonTerminal$Elem */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); PElem pelemNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); pelemNode2 = (PElem)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(pelemNode2 != null) { listNode3.add(pelemNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new257() /* reduce ATerminal$AltsTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PAlt paltNode1; paltNode1 = (PAlt)nodeArrayList1.get(0); if(paltNode1 != null) { listNode2.add(paltNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new258() /* reduce ANonTerminal$AltsTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); PAlt paltNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); paltNode2 = (PAlt)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(paltNode2 != null) { listNode3.add(paltNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new259() /* reduce ATerminal$Term */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PTerm ptermNode1; ptermNode1 = (PTerm)nodeArrayList1.get(0); if(ptermNode1 != null) { listNode2.add(ptermNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new260() /* reduce ANonTerminal$Term */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); PTerm ptermNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); ptermNode2 = (PTerm)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(ptermNode2 != null) { listNode3.add(ptermNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new261() /* reduce ATerminal$ListTermTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PListTerm plisttermNode1; plisttermNode1 = (PListTerm)nodeArrayList1.get(0); if(plisttermNode1 != null) { listNode2.add(plisttermNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new262() /* reduce ANonTerminal$ListTermTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); PListTerm plisttermNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); plisttermNode2 = (PListTerm)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(plisttermNode2 != null) { listNode3.add(plisttermNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new263() /* reduce ATerminal$ParamsTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PTerm ptermNode1; ptermNode1 = (PTerm)nodeArrayList1.get(0); if(ptermNode1 != null) { listNode2.add(ptermNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new264() /* reduce ANonTerminal$ParamsTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); PTerm ptermNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); ptermNode2 = (PTerm)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(ptermNode2 != null) { listNode3.add(ptermNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new265() /* reduce ATerminal$AstProd */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PAstProd pastprodNode1; pastprodNode1 = (PAstProd)nodeArrayList1.get(0); if(pastprodNode1 != null) { listNode2.add(pastprodNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new266() /* reduce ANonTerminal$AstProd */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); PAstProd pastprodNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); pastprodNode2 = (PAstProd)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(pastprodNode2 != null) { listNode3.add(pastprodNode2); } } nodeList.add(listNode3); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new267() /* reduce ATerminal$AstAltsTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode2 = new LinkedList(); { // Block PAstAlt pastaltNode1; pastaltNode1 = (PAstAlt)nodeArrayList1.get(0); if(pastaltNode1 != null) { listNode2.add(pastaltNode1); } } nodeList.add(listNode2); return nodeList; } @SuppressWarnings({ "unchecked", "rawtypes" }) ArrayList new268() /* reduce ANonTerminal$AstAltsTail */ { @SuppressWarnings("hiding") ArrayList nodeList = new ArrayList(); @SuppressWarnings("unused") ArrayList nodeArrayList2 = pop(); @SuppressWarnings("unused") ArrayList nodeArrayList1 = pop(); LinkedList listNode3 = new LinkedList(); { // Block LinkedList listNode1 = new LinkedList(); PAstAlt pastaltNode2; listNode1 = (LinkedList)nodeArrayList1.get(0); pastaltNode2 = (PAstAlt)nodeArrayList2.get(0); if(listNode1 != null) { listNode3.addAll(listNode1); } if(pastaltNode2 != null) { listNode3.add(pastaltNode2); } } nodeList.add(listNode3); return nodeList; } private static int[][][] actionTable; /* { {{-1, REDUCE, 0}, {1, SHIFT, 1}, {2, SHIFT, 2}, {3, SHIFT, 3}, {4, SHIFT, 4}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, ERROR, 1}, {0, SHIFT, 16}, }, {{-1, ERROR, 2}, {33, SHIFT, 18}, }, {{-1, ERROR, 3}, {33, SHIFT, 20}, }, {{-1, ERROR, 4}, {22, SHIFT, 23}, {33, SHIFT, 24}, }, {{-1, ERROR, 5}, {4, SHIFT, 28}, }, {{-1, ERROR, 6}, {33, SHIFT, 29}, }, {{-1, ERROR, 7}, {8, SHIFT, 32}, }, {{-1, ERROR, 8}, {38, ACCEPT, -1}, }, {{-1, REDUCE, 1}, {2, SHIFT, 2}, {3, SHIFT, 3}, {4, SHIFT, 4}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 2}, {2, SHIFT, 2}, {4, SHIFT, 4}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 4}, {4, SHIFT, 4}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 8}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 16}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 32}, {7, SHIFT, 7}, }, {{-1, REDUCE, 64}, }, {{-1, ERROR, 16}, {14, SHIFT, 54}, {16, SHIFT, 55}, }, {{-1, REDUCE, 128}, }, {{-1, REDUCE, 135}, {29, SHIFT, 58}, }, {{-1, ERROR, 19}, {16, SHIFT, 61}, }, {{-1, ERROR, 20}, {17, SHIFT, 62}, }, {{-1, REDUCE, 241}, }, {{-1, REDUCE, 132}, {33, SHIFT, 20}, }, {{-1, ERROR, 23}, {33, SHIFT, 64}, }, {{-1, ERROR, 24}, {17, SHIFT, 65}, }, {{-1, REDUCE, 245}, }, {{-1, ERROR, 26}, {33, SHIFT, 66}, }, {{-1, REDUCE, 138}, {22, SHIFT, 23}, {33, SHIFT, 24}, }, {{-1, ERROR, 28}, {16, SHIFT, 68}, {33, SHIFT, 18}, }, {{-1, ERROR, 29}, {17, SHIFT, 70}, {22, SHIFT, 71}, }, {{-1, REDUCE, 253}, }, {{-1, REDUCE, 175}, {33, SHIFT, 29}, }, {{-1, ERROR, 32}, {9, SHIFT, 74}, }, {{-1, REDUCE, 3}, {2, SHIFT, 2}, {4, SHIFT, 4}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 5}, {4, SHIFT, 4}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 9}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 17}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 33}, {7, SHIFT, 7}, }, {{-1, REDUCE, 65}, }, {{-1, REDUCE, 6}, {4, SHIFT, 4}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 10}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 18}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 34}, {7, SHIFT, 7}, }, {{-1, REDUCE, 66}, }, {{-1, REDUCE, 12}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 20}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 36}, {7, SHIFT, 7}, }, {{-1, REDUCE, 68}, }, {{-1, REDUCE, 24}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 40}, {7, SHIFT, 7}, }, {{-1, REDUCE, 72}, }, {{-1, REDUCE, 48}, {7, SHIFT, 7}, }, {{-1, REDUCE, 80}, }, {{-1, REDUCE, 96}, }, {{-1, ERROR, 54}, {0, SHIFT, 110}, }, {{-1, REDUCE, 129}, }, {{-1, REDUCE, 239}, }, {{-1, ERROR, 57}, {14, SHIFT, 54}, {16, SHIFT, 111}, }, {{-1, ERROR, 58}, {33, SHIFT, 113}, }, {{-1, REDUCE, 243}, }, {{-1, REDUCE, 136}, {29, SHIFT, 58}, }, {{-1, REDUCE, 134}, }, {{-1, REDUCE, 156}, {18, SHIFT, 115}, {20, SHIFT, 116}, {33, SHIFT, 117}, {34, SHIFT, 118}, {35, SHIFT, 119}, {36, SHIFT, 120}, {37, SHIFT, 121}, }, {{-1, REDUCE, 242}, }, {{-1, ERROR, 64}, {23, SHIFT, 129}, {29, SHIFT, 130}, {31, SHIFT, 131}, }, {{-1, REDUCE, 156}, {18, SHIFT, 115}, {20, SHIFT, 116}, {33, SHIFT, 117}, {34, SHIFT, 118}, {35, SHIFT, 119}, {36, SHIFT, 120}, {37, SHIFT, 121}, }, {{-1, ERROR, 66}, {17, SHIFT, 136}, }, {{-1, REDUCE, 246}, }, {{-1, REDUCE, 150}, }, {{-1, ERROR, 69}, {16, SHIFT, 137}, }, {{-1, REDUCE, 183}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 140}, {22, SHIFT, 141}, {33, SHIFT, 142}, }, {{-1, ERROR, 71}, {31, SHIFT, 151}, }, {{-1, ERROR, 72}, {17, SHIFT, 152}, }, {{-1, REDUCE, 254}, }, {{-1, ERROR, 74}, {33, SHIFT, 153}, }, {{-1, REDUCE, 7}, {4, SHIFT, 4}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 11}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 19}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 35}, {7, SHIFT, 7}, }, {{-1, REDUCE, 67}, }, {{-1, REDUCE, 13}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 21}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 37}, {7, SHIFT, 7}, }, {{-1, REDUCE, 69}, }, {{-1, REDUCE, 25}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 41}, {7, SHIFT, 7}, }, {{-1, REDUCE, 73}, }, {{-1, REDUCE, 49}, {7, SHIFT, 7}, }, {{-1, REDUCE, 81}, }, {{-1, REDUCE, 97}, }, {{-1, REDUCE, 14}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 22}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 38}, {7, SHIFT, 7}, }, {{-1, REDUCE, 70}, }, {{-1, REDUCE, 26}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 42}, {7, SHIFT, 7}, }, {{-1, REDUCE, 74}, }, {{-1, REDUCE, 50}, {7, SHIFT, 7}, }, {{-1, REDUCE, 82}, }, {{-1, REDUCE, 98}, }, {{-1, REDUCE, 28}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 44}, {7, SHIFT, 7}, }, {{-1, REDUCE, 76}, }, {{-1, REDUCE, 52}, {7, SHIFT, 7}, }, {{-1, REDUCE, 84}, }, {{-1, REDUCE, 100}, }, {{-1, REDUCE, 56}, {7, SHIFT, 7}, }, {{-1, REDUCE, 88}, }, {{-1, REDUCE, 104}, }, {{-1, REDUCE, 112}, }, {{-1, REDUCE, 131}, }, {{-1, REDUCE, 130}, }, {{-1, REDUCE, 240}, }, {{-1, REDUCE, 137}, }, {{-1, REDUCE, 244}, }, {{-1, ERROR, 115}, {18, SHIFT, 115}, {20, SHIFT, 116}, {33, SHIFT, 117}, {34, SHIFT, 118}, {35, SHIFT, 119}, {36, SHIFT, 120}, {37, SHIFT, 121}, }, {{-1, REDUCE, 156}, {18, SHIFT, 115}, {20, SHIFT, 116}, {33, SHIFT, 117}, {34, SHIFT, 118}, {35, SHIFT, 119}, {36, SHIFT, 120}, {37, SHIFT, 121}, }, {{-1, REDUCE, 163}, }, {{-1, REDUCE, 165}, }, {{-1, REDUCE, 166}, }, {{-1, REDUCE, 167}, }, {{-1, REDUCE, 162}, }, {{-1, ERROR, 122}, {16, SHIFT, 194}, }, {{-1, REDUCE, 153}, {28, SHIFT, 195}, }, {{-1, REDUCE, 251}, }, {{-1, REDUCE, 158}, {24, SHIFT, 198}, {26, SHIFT, 199}, {27, SHIFT, 200}, }, {{-1, REDUCE, 160}, }, {{-1, REDUCE, 161}, }, {{-1, REDUCE, 157}, {18, SHIFT, 115}, {20, SHIFT, 116}, {33, SHIFT, 117}, {34, SHIFT, 118}, {35, SHIFT, 119}, {36, SHIFT, 120}, {37, SHIFT, 121}, }, {{-1, REDUCE, 143}, }, {{-1, ERROR, 130}, {33, SHIFT, 203}, }, {{-1, ERROR, 131}, {33, SHIFT, 204}, }, {{-1, REDUCE, 247}, }, {{-1, ERROR, 133}, {23, SHIFT, 205}, {29, SHIFT, 130}, }, {{-1, ERROR, 134}, {23, SHIFT, 207}, {29, SHIFT, 130}, }, {{-1, ERROR, 135}, {16, SHIFT, 209}, {30, SHIFT, 210}, }, {{-1, REDUCE, 156}, {18, SHIFT, 115}, {20, SHIFT, 116}, {33, SHIFT, 117}, {34, SHIFT, 118}, {35, SHIFT, 119}, {36, SHIFT, 120}, {37, SHIFT, 121}, }, {{-1, REDUCE, 151}, }, {{-1, ERROR, 138}, {14, SHIFT, 213}, }, {{-1, ERROR, 139}, {14, SHIFT, 214}, }, {{-1, ERROR, 140}, {33, SHIFT, 215}, }, {{-1, ERROR, 141}, {31, SHIFT, 216}, {33, SHIFT, 217}, }, {{-1, REDUCE, 219}, {24, SHIFT, 198}, {26, SHIFT, 199}, {27, SHIFT, 200}, }, {{-1, ERROR, 143}, {16, SHIFT, 219}, }, {{-1, REDUCE, 180}, {28, SHIFT, 220}, }, {{-1, REDUCE, 187}, }, {{-1, REDUCE, 184}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 140}, {22, SHIFT, 223}, {33, SHIFT, 142}, }, {{-1, REDUCE, 255}, }, {{-1, ERROR, 148}, {12, SHIFT, 138}, {13, SHIFT, 139}, {33, SHIFT, 226}, }, {{-1, ERROR, 149}, {33, SHIFT, 228}, }, {{-1, REDUCE, 185}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 140}, {22, SHIFT, 223}, {33, SHIFT, 142}, }, {{-1, ERROR, 151}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 140}, {23, SHIFT, 231}, {33, SHIFT, 142}, }, {{-1, REDUCE, 183}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 140}, {22, SHIFT, 141}, {33, SHIFT, 142}, }, {{-1, ERROR, 153}, {17, SHIFT, 234}, }, {{-1, REDUCE, 265}, }, {{-1, REDUCE, 230}, {33, SHIFT, 153}, }, {{-1, REDUCE, 15}, {5, SHIFT, 5}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 23}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 39}, {7, SHIFT, 7}, }, {{-1, REDUCE, 71}, }, {{-1, REDUCE, 27}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 43}, {7, SHIFT, 7}, }, {{-1, REDUCE, 75}, }, {{-1, REDUCE, 51}, {7, SHIFT, 7}, }, {{-1, REDUCE, 83}, }, {{-1, REDUCE, 99}, }, {{-1, REDUCE, 29}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 45}, {7, SHIFT, 7}, }, {{-1, REDUCE, 77}, }, {{-1, REDUCE, 53}, {7, SHIFT, 7}, }, {{-1, REDUCE, 85}, }, {{-1, REDUCE, 101}, }, {{-1, REDUCE, 57}, {7, SHIFT, 7}, }, {{-1, REDUCE, 89}, }, {{-1, REDUCE, 105}, }, {{-1, REDUCE, 113}, }, {{-1, REDUCE, 30}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 46}, {7, SHIFT, 7}, }, {{-1, REDUCE, 78}, }, {{-1, REDUCE, 54}, {7, SHIFT, 7}, }, {{-1, REDUCE, 86}, }, {{-1, REDUCE, 102}, }, {{-1, REDUCE, 58}, {7, SHIFT, 7}, }, {{-1, REDUCE, 90}, }, {{-1, REDUCE, 106}, }, {{-1, REDUCE, 114}, }, {{-1, REDUCE, 60}, {7, SHIFT, 7}, }, {{-1, REDUCE, 92}, }, {{-1, REDUCE, 108}, }, {{-1, REDUCE, 116}, }, {{-1, REDUCE, 120}, }, {{-1, ERROR, 191}, {24, SHIFT, 257}, {25, SHIFT, 258}, }, {{-1, REDUCE, 160}, {15, SHIFT, 260}, }, {{-1, ERROR, 193}, {21, SHIFT, 261}, }, {{-1, REDUCE, 133}, }, {{-1, REDUCE, 156}, {18, SHIFT, 115}, {20, SHIFT, 116}, {33, SHIFT, 117}, {34, SHIFT, 118}, {35, SHIFT, 119}, {36, SHIFT, 120}, {37, SHIFT, 121}, }, {{-1, REDUCE, 249}, }, {{-1, REDUCE, 154}, {28, SHIFT, 195}, }, {{-1, REDUCE, 172}, }, {{-1, REDUCE, 171}, }, {{-1, REDUCE, 170}, }, {{-1, REDUCE, 159}, }, {{-1, REDUCE, 252}, }, {{-1, REDUCE, 147}, {31, SHIFT, 131}, }, {{-1, REDUCE, 149}, }, {{-1, REDUCE, 144}, }, {{-1, ERROR, 206}, {23, SHIFT, 265}, {29, SHIFT, 130}, }, {{-1, REDUCE, 145}, }, {{-1, REDUCE, 248}, }, {{-1, REDUCE, 139}, }, {{-1, REDUCE, 156}, {18, SHIFT, 115}, {20, SHIFT, 116}, {33, SHIFT, 117}, {34, SHIFT, 118}, {35, SHIFT, 119}, {36, SHIFT, 120}, {37, SHIFT, 121}, }, {{-1, ERROR, 211}, {16, SHIFT, 267}, }, {{-1, ERROR, 212}, {16, SHIFT, 268}, {30, SHIFT, 210}, }, {{-1, REDUCE, 228}, }, {{-1, REDUCE, 229}, }, {{-1, ERROR, 215}, {19, SHIFT, 270}, }, {{-1, ERROR, 216}, {10, SHIFT, 271}, {11, SHIFT, 272}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 273}, {23, SHIFT, 274}, {33, SHIFT, 275}, }, {{-1, ERROR, 217}, {23, SHIFT, 279}, }, {{-1, REDUCE, 223}, }, {{-1, REDUCE, 176}, }, {{-1, REDUCE, 183}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 140}, {22, SHIFT, 141}, {33, SHIFT, 142}, }, {{-1, REDUCE, 257}, }, {{-1, REDUCE, 181}, {28, SHIFT, 220}, }, {{-1, ERROR, 223}, {31, SHIFT, 216}, }, {{-1, REDUCE, 188}, }, {{-1, REDUCE, 186}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 140}, {22, SHIFT, 223}, {33, SHIFT, 142}, }, {{-1, REDUCE, 220}, {24, SHIFT, 198}, {26, SHIFT, 199}, {27, SHIFT, 200}, }, {{-1, ERROR, 227}, {33, SHIFT, 284}, }, {{-1, REDUCE, 221}, {24, SHIFT, 198}, {26, SHIFT, 199}, {27, SHIFT, 200}, }, {{-1, REDUCE, 189}, }, {{-1, REDUCE, 256}, }, {{-1, REDUCE, 178}, }, {{-1, ERROR, 232}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 140}, {23, SHIFT, 286}, {33, SHIFT, 142}, }, {{-1, ERROR, 233}, {16, SHIFT, 287}, }, {{-1, REDUCE, 235}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 140}, {22, SHIFT, 288}, {33, SHIFT, 142}, }, {{-1, REDUCE, 266}, }, {{-1, REDUCE, 31}, {6, SHIFT, 6}, {7, SHIFT, 7}, }, {{-1, REDUCE, 47}, {7, SHIFT, 7}, }, {{-1, REDUCE, 79}, }, {{-1, REDUCE, 55}, {7, SHIFT, 7}, }, {{-1, REDUCE, 87}, }, {{-1, REDUCE, 103}, }, {{-1, REDUCE, 59}, {7, SHIFT, 7}, }, {{-1, REDUCE, 91}, }, {{-1, REDUCE, 107}, }, {{-1, REDUCE, 115}, }, {{-1, REDUCE, 61}, {7, SHIFT, 7}, }, {{-1, REDUCE, 93}, }, {{-1, REDUCE, 109}, }, {{-1, REDUCE, 117}, }, {{-1, REDUCE, 121}, }, {{-1, REDUCE, 62}, {7, SHIFT, 7}, }, {{-1, REDUCE, 94}, }, {{-1, REDUCE, 110}, }, {{-1, REDUCE, 118}, }, {{-1, REDUCE, 122}, }, {{-1, REDUCE, 124}, }, {{-1, REDUCE, 173}, }, {{-1, REDUCE, 174}, }, {{-1, ERROR, 259}, {18, SHIFT, 115}, {20, SHIFT, 116}, {33, SHIFT, 117}, {34, SHIFT, 118}, {35, SHIFT, 119}, {36, SHIFT, 120}, {37, SHIFT, 121}, }, {{-1, ERROR, 260}, {34, SHIFT, 118}, {35, SHIFT, 119}, {36, SHIFT, 120}, }, {{-1, REDUCE, 164}, }, {{-1, REDUCE, 155}, }, {{-1, REDUCE, 250}, }, {{-1, REDUCE, 148}, }, {{-1, REDUCE, 146}, }, {{-1, REDUCE, 152}, }, {{-1, REDUCE, 141}, }, {{-1, REDUCE, 140}, }, {{-1, ERROR, 269}, {16, SHIFT, 302}, }, {{-1, ERROR, 270}, {32, SHIFT, 303}, }, {{-1, ERROR, 271}, {33, SHIFT, 304}, }, {{-1, REDUCE, 201}, }, {{-1, ERROR, 273}, {10, SHIFT, 306}, {12, SHIFT, 138}, {13, SHIFT, 139}, {19, SHIFT, 307}, {33, SHIFT, 308}, }, {{-1, REDUCE, 191}, }, {{-1, REDUCE, 197}, {14, SHIFT, 312}, }, {{-1, REDUCE, 259}, }, {{-1, ERROR, 277}, {33, SHIFT, 314}, }, {{-1, ERROR, 278}, {10, SHIFT, 271}, {11, SHIFT, 272}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 273}, {23, SHIFT, 315}, {33, SHIFT, 275}, }, {{-1, REDUCE, 218}, }, {{-1, REDUCE, 182}, }, {{-1, REDUCE, 258}, }, {{-1, REDUCE, 190}, }, {{-1, REDUCE, 224}, }, {{-1, REDUCE, 222}, {24, SHIFT, 198}, {26, SHIFT, 199}, {27, SHIFT, 200}, }, {{-1, REDUCE, 225}, }, {{-1, REDUCE, 179}, }, {{-1, REDUCE, 177}, }, {{-1, ERROR, 288}, {33, SHIFT, 217}, }, {{-1, REDUCE, 236}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 140}, {33, SHIFT, 142}, }, {{-1, ERROR, 290}, {16, SHIFT, 319}, }, {{-1, REDUCE, 232}, {28, SHIFT, 320}, }, {{-1, REDUCE, 237}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 140}, {33, SHIFT, 142}, }, {{-1, REDUCE, 63}, {7, SHIFT, 7}, }, {{-1, REDUCE, 95}, }, {{-1, REDUCE, 111}, }, {{-1, REDUCE, 119}, }, {{-1, REDUCE, 123}, }, {{-1, REDUCE, 125}, }, {{-1, REDUCE, 126}, }, {{-1, ERROR, 300}, {19, SHIFT, 324}, }, {{-1, ERROR, 301}, {19, SHIFT, 325}, }, {{-1, REDUCE, 142}, }, {{-1, REDUCE, 227}, }, {{-1, REDUCE, 212}, {14, SHIFT, 326}, }, {{-1, ERROR, 305}, {20, SHIFT, 328}, }, {{-1, ERROR, 306}, {33, SHIFT, 304}, }, {{-1, REDUCE, 195}, }, {{-1, REDUCE, 206}, {14, SHIFT, 312}, }, {{-1, ERROR, 309}, {19, SHIFT, 331}, }, {{-1, REDUCE, 202}, {29, SHIFT, 332}, }, {{-1, ERROR, 311}, {33, SHIFT, 335}, }, {{-1, ERROR, 312}, {33, SHIFT, 336}, }, {{-1, REDUCE, 199}, }, {{-1, REDUCE, 198}, {14, SHIFT, 312}, }, {{-1, REDUCE, 192}, }, {{-1, REDUCE, 260}, }, {{-1, REDUCE, 226}, }, {{-1, REDUCE, 238}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 140}, {33, SHIFT, 142}, }, {{-1, REDUCE, 231}, }, {{-1, REDUCE, 235}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 140}, {22, SHIFT, 288}, {33, SHIFT, 142}, }, {{-1, REDUCE, 267}, }, {{-1, REDUCE, 233}, {28, SHIFT, 320}, }, {{-1, REDUCE, 127}, }, {{-1, REDUCE, 168}, }, {{-1, REDUCE, 169}, }, {{-1, ERROR, 326}, {33, SHIFT, 340}, }, {{-1, REDUCE, 213}, }, {{-1, ERROR, 328}, {10, SHIFT, 271}, {11, SHIFT, 272}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 273}, {21, SHIFT, 341}, {33, SHIFT, 275}, }, {{-1, ERROR, 329}, {20, SHIFT, 344}, }, {{-1, REDUCE, 208}, }, {{-1, REDUCE, 196}, }, {{-1, ERROR, 332}, {10, SHIFT, 306}, {12, SHIFT, 138}, {13, SHIFT, 139}, {33, SHIFT, 308}, }, {{-1, REDUCE, 261}, }, {{-1, REDUCE, 203}, {29, SHIFT, 332}, }, {{-1, REDUCE, 207}, {14, SHIFT, 312}, }, {{-1, REDUCE, 211}, }, {{-1, REDUCE, 200}, }, {{-1, REDUCE, 234}, }, {{-1, REDUCE, 268}, }, {{-1, REDUCE, 214}, }, {{-1, REDUCE, 193}, }, {{-1, REDUCE, 215}, {29, SHIFT, 348}, }, {{-1, ERROR, 343}, {21, SHIFT, 351}, }, {{-1, ERROR, 344}, {10, SHIFT, 271}, {11, SHIFT, 272}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 273}, {21, SHIFT, 352}, {33, SHIFT, 275}, }, {{-1, REDUCE, 210}, }, {{-1, REDUCE, 262}, }, {{-1, REDUCE, 209}, }, {{-1, ERROR, 348}, {10, SHIFT, 271}, {11, SHIFT, 272}, {12, SHIFT, 138}, {13, SHIFT, 139}, {18, SHIFT, 273}, {33, SHIFT, 275}, }, {{-1, REDUCE, 263}, }, {{-1, REDUCE, 216}, {29, SHIFT, 348}, }, {{-1, REDUCE, 194}, }, {{-1, REDUCE, 204}, }, {{-1, ERROR, 353}, {21, SHIFT, 356}, }, {{-1, REDUCE, 217}, }, {{-1, REDUCE, 264}, }, {{-1, REDUCE, 205}, }, };*/ private static int[][][] gotoTable; /* { {{-1, 8}, }, {{-1, 9}, }, {{-1, 17}, }, {{-1, 56}, {57, 112}, }, {{-1, 10}, {9, 33}, }, {{-1, 21}, {22, 63}, }, {{-1, 11}, {9, 34}, {10, 39}, {33, 75}, }, {{-1, 19}, {28, 69}, }, {{-1, 59}, {60, 114}, }, {{-1, 12}, {9, 35}, {10, 40}, {11, 44}, {33, 76}, {34, 80}, {39, 90}, {75, 156}, }, {{-1, 25}, {27, 67}, }, {{-1, 26}, }, {{-1, 132}, {134, 208}, {206, 208}, }, {{-1, 133}, {203, 264}, }, {{-1, 13}, {9, 36}, {10, 41}, {11, 45}, {12, 48}, {33, 77}, {34, 81}, {35, 84}, {39, 91}, {40, 94}, {44, 100}, {75, 157}, {76, 160}, {80, 166}, {90, 176}, {156, 236}, }, {{-1, 211}, {212, 269}, }, {{-1, 122}, {65, 135}, {116, 193}, {136, 212}, {210, 266}, }, {{-1, 196}, {197, 263}, }, {{-1, 123}, {195, 262}, }, {{-1, 124}, {128, 202}, }, {{-1, 125}, {115, 191}, {259, 300}, }, {{-1, 126}, {115, 192}, {260, 301}, }, {{-1, 127}, }, {{-1, 201}, {142, 218}, {226, 283}, {228, 285}, {284, 317}, }, {{-1, 259}, }, {{-1, 14}, {9, 37}, {10, 42}, {11, 46}, {12, 49}, {13, 51}, {33, 78}, {34, 82}, {35, 85}, {36, 87}, {39, 92}, {40, 95}, {41, 97}, {44, 101}, {45, 103}, {48, 106}, {75, 158}, {76, 161}, {77, 163}, {80, 167}, {81, 169}, {84, 172}, {90, 177}, {91, 179}, {94, 182}, {100, 186}, {156, 237}, {157, 239}, {160, 242}, {166, 246}, {176, 251}, {236, 293}, }, {{-1, 30}, {31, 73}, }, {{-1, 72}, }, {{-1, 143}, {152, 233}, }, {{-1, 221}, {222, 281}, }, {{-1, 144}, {220, 280}, }, {{-1, 145}, {146, 224}, {150, 229}, {225, 282}, }, {{-1, 342}, {216, 276}, {278, 316}, {348, 354}, }, {{-1, 309}, }, {{-1, 310}, {332, 345}, }, {{-1, 333}, {334, 346}, }, {{-1, 313}, {308, 330}, {314, 337}, {335, 347}, }, {{-1, 305}, {306, 329}, }, {{-1, 327}, }, {{-1, 343}, {344, 353}, }, {{-1, 349}, {350, 355}, }, {{-1, 146}, {234, 289}, {320, 289}, }, {{-1, 147}, {150, 230}, {225, 230}, {232, 230}, {292, 230}, {318, 230}, }, {{-1, 148}, }, {{-1, 149}, {148, 227}, {216, 277}, {273, 311}, {278, 277}, {328, 277}, {332, 311}, {344, 277}, {348, 277}, }, {{-1, 15}, {9, 38}, {10, 43}, {11, 47}, {12, 50}, {13, 52}, {14, 53}, {33, 79}, {34, 83}, {35, 86}, {36, 88}, {37, 89}, {39, 93}, {40, 96}, {41, 98}, {42, 99}, {44, 102}, {45, 104}, {46, 105}, {48, 107}, {49, 108}, {51, 109}, {75, 159}, {76, 162}, {77, 164}, {78, 165}, {80, 168}, {81, 170}, {82, 171}, {84, 173}, {85, 174}, {87, 175}, {90, 178}, {91, 180}, {92, 181}, {94, 183}, {95, 184}, {97, 185}, {100, 187}, {101, 188}, {103, 189}, {106, 190}, {156, 238}, {157, 240}, {158, 241}, {160, 243}, {161, 244}, {163, 245}, {166, 247}, {167, 248}, {169, 249}, {172, 250}, {176, 252}, {177, 253}, {179, 254}, {182, 255}, {186, 256}, {236, 294}, {237, 295}, {239, 296}, {242, 297}, {246, 298}, {251, 299}, {293, 323}, }, {{-1, 154}, {155, 235}, }, {{-1, 290}, }, {{-1, 321}, {322, 339}, }, {{-1, 291}, {320, 338}, }, {{-1, 57}, }, {{-1, 22}, }, {{-1, 60}, }, {{-1, 27}, }, {{-1, 134}, {133, 206}, }, {{-1, 197}, }, {{-1, 128}, }, {{-1, 31}, }, {{-1, 150}, {146, 225}, {151, 232}, {234, 292}, {289, 318}, {320, 292}, }, {{-1, 222}, }, {{-1, 278}, }, {{-1, 334}, }, {{-1, 350}, }, {{-1, 155}, }, {{-1, 322}, }, };*/ private static String[] errorMessages; /* { "expecting: 'Package', 'States', 'Helpers', 'Tokens', 'Ignored', 'Productions', 'Abstract', EOF", "expecting: pkg id", "expecting: id", "expecting: '{', id", "expecting: 'Tokens'", "expecting: 'Syntax'", "expecting: EOF", "expecting: 'States', 'Helpers', 'Tokens', 'Ignored', 'Productions', 'Abstract', EOF", "expecting: 'States', 'Tokens', 'Ignored', 'Productions', 'Abstract', EOF", "expecting: 'Tokens', 'Ignored', 'Productions', 'Abstract', EOF", "expecting: 'Ignored', 'Productions', 'Abstract', EOF", "expecting: 'Productions', 'Abstract', EOF", "expecting: 'Abstract', EOF", "expecting: '.', ';'", "expecting: ';', ','", "expecting: ';'", "expecting: '='", "expecting: 'States', 'Tokens', 'Ignored', 'Productions', 'Abstract', id, EOF", "expecting: 'Ignored', 'Productions', 'Abstract', '{', id, EOF", "expecting: ';', id", "expecting: '=', '{'", "expecting: 'Abstract', id, EOF", "expecting: 'Tree'", "expecting: ';', '[', '(', '|', id, char, dec char, hex char, string", "expecting: '}', ',', '->'", "expecting: ';', '[', '(', '|', '/', id, char, dec char, hex char, string", "expecting: 'T', 'P', ';', '[', '{', '|', id", "expecting: '->'", "expecting: '[', '(', id, char, dec char, hex char, string", "expecting: '[', '(', ')', '|', id, char, dec char, hex char, string", "expecting: ';', '[', ']', '(', ')', '+', '-', '?', '*', '|', '/', id, char, dec char, hex char, string", "expecting: '..', ';', '[', ']', '(', ')', '+', '-', '?', '*', '|', '/', id, char, dec char, hex char, string", "expecting: ';', ')', '|', '/'", "expecting: ';', '[', '(', ')', '|', '/', id, char, dec char, hex char, string", "expecting: ';', '[', '(', ')', '+', '?', '*', '|', '/', id, char, dec char, hex char, string", "expecting: ';', '[', ']', '(', ')', '+', '?', '*', '|', '/', id, char, dec char, hex char, string", "expecting: '}', ','", "expecting: ';', '/'", "expecting: '.'", "expecting: '->', id", "expecting: 'T', 'P', ';', '[', '{', '}', '+', '?', '*', '|', id", "expecting: ';', '|'", "expecting: 'T', 'P', ';', '[', '{', '}', '|', id", "expecting: 'T', 'P', id", "expecting: 'T', 'P', '[', '}', id", "expecting: id, EOF", "expecting: '+', '-'", "expecting: '..', '+', '-'", "expecting: ')'", "expecting: 'T', 'P', ';', '[', '(', ')', '{', '}', '|', '/', id, char, dec char, hex char, string", "expecting: ']'", "expecting: 'New', 'Null', 'T', 'P', '[', '}', id", "expecting: '}'", "expecting: char, dec char, hex char", "expecting: ':'", "expecting: 'New', 'Null', 'T', 'P', '[', ')', '}', ',', id", "expecting: 'New', 'T', 'P', ']', id", "expecting: 'New', 'Null', 'T', 'P', '.', '[', ')', '}', ',', id", "expecting: 'T', 'P', ';', '[', '|', id", "expecting: '.', '('", "expecting: '('", "expecting: '.', ']', ','", "expecting: ']', ','", "expecting: 'New', 'Null', 'T', 'P', '[', ')', id", "expecting: 'New', 'T', 'P', id", "expecting: 'New', 'Null', 'T', 'P', '[', ']', ')', '}', ',', id", "expecting: ')', ','", "expecting: 'New', 'Null', 'T', 'P', '[', id", };*/ private static int[] errors; /* { 0, 1, 2, 2, 3, 4, 2, 5, 6, 7, 8, 9, 10, 11, 12, 6, 13, 7, 14, 15, 16, 17, 17, 2, 16, 18, 2, 18, 19, 20, 21, 21, 22, 8, 9, 10, 11, 12, 6, 9, 10, 11, 12, 6, 10, 11, 12, 6, 11, 12, 6, 12, 6, 6, 1, 7, 13, 13, 2, 14, 14, 9, 23, 17, 24, 25, 16, 18, 11, 15, 26, 27, 16, 21, 2, 9, 10, 11, 12, 6, 10, 11, 12, 6, 11, 12, 6, 12, 6, 6, 10, 11, 12, 6, 11, 12, 6, 12, 6, 6, 11, 12, 6, 12, 6, 6, 12, 6, 6, 6, 13, 7, 13, 14, 14, 28, 29, 30, 31, 31, 31, 30, 15, 32, 33, 34, 35, 30, 33, 2, 2, 2, 36, 36, 36, 37, 25, 11, 38, 38, 2, 39, 40, 15, 41, 41, 26, 42, 43, 2, 26, 44, 26, 16, 45, 45, 10, 11, 12, 6, 11, 12, 6, 12, 6, 6, 11, 12, 6, 12, 6, 6, 12, 6, 6, 6, 11, 12, 6, 12, 6, 6, 12, 6, 6, 6, 12, 6, 6, 6, 6, 46, 47, 48, 17, 33, 32, 32, 49, 49, 49, 33, 33, 24, 36, 2, 36, 2, 36, 18, 23, 15, 37, 2, 2, 50, 51, 52, 42, 21, 26, 41, 41, 27, 41, 26, 40, 2, 40, 41, 42, 16, 44, 15, 26, 45, 11, 12, 6, 12, 6, 6, 12, 6, 6, 6, 12, 6, 6, 6, 6, 12, 6, 6, 6, 6, 6, 28, 28, 28, 53, 30, 32, 32, 36, 2, 15, 18, 18, 15, 54, 2, 55, 56, 41, 57, 51, 2, 51, 26, 41, 41, 41, 42, 40, 42, 16, 21, 2, 58, 15, 41, 58, 12, 6, 6, 6, 6, 6, 6, 50, 50, 18, 43, 59, 60, 2, 55, 61, 50, 62, 2, 2, 55, 57, 41, 51, 42, 58, 45, 26, 41, 41, 6, 30, 30, 2, 60, 63, 60, 62, 55, 64, 62, 62, 61, 65, 55, 41, 41, 60, 55, 66, 48, 63, 62, 62, 62, 67, 66, 66, 55, 62, 48, 66, 66, 62, };*/ static { try { DataInputStream s = new DataInputStream( new BufferedInputStream( Parser.class.getResourceAsStream("parser.dat"))); // read actionTable int length = s.readInt(); Parser.actionTable = new int[length][][]; for(int i = 0; i < Parser.actionTable.length; i++) { length = s.readInt(); Parser.actionTable[i] = new int[length][3]; for(int j = 0; j < Parser.actionTable[i].length; j++) { for(int k = 0; k < 3; k++) { Parser.actionTable[i][j][k] = s.readInt(); } } } // read gotoTable length = s.readInt(); gotoTable = new int[length][][]; for(int i = 0; i < gotoTable.length; i++) { length = s.readInt(); gotoTable[i] = new int[length][2]; for(int j = 0; j < gotoTable[i].length; j++) { for(int k = 0; k < 2; k++) { gotoTable[i][j][k] = s.readInt(); } } } // read errorMessages length = s.readInt(); errorMessages = new String[length]; for(int i = 0; i < errorMessages.length; i++) { length = s.readInt(); StringBuffer buffer = new StringBuffer(); for(int j = 0; j < length; j++) { buffer.append(s.readChar()); } errorMessages[i] = buffer.toString(); } // read errors length = s.readInt(); errors = new int[length]; for(int i = 0; i < errors.length; i++) { errors[i] = s.readInt(); } s.close(); } catch(Exception e) { throw new RuntimeException("The file \"parser.dat\" is either missing or corrupted."); } } } sablecc-3.7/src/org/sablecc/sablecc/parser/ParserException.java000066400000000000000000000007201265440641200246020ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.parser; import org.sablecc.sablecc.node.*; @SuppressWarnings("serial") public class ParserException extends Exception { private Token token; public ParserException(@SuppressWarnings("hiding") Token token, String message) { super(message); this.token = token; } public Token getToken() { return this.token; } } sablecc-3.7/src/org/sablecc/sablecc/parser/State.java000066400000000000000000000005641265440641200225550ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.parser; import java.util.ArrayList; final class State { int state; ArrayList nodes; State(@SuppressWarnings("hiding") int state, @SuppressWarnings("hiding") ArrayList nodes) { this.state = state; this.nodes = nodes; } } sablecc-3.7/src/org/sablecc/sablecc/parser/TokenIndex.java000066400000000000000000000115531265440641200235450ustar00rootroot00000000000000/* This file was generated by SableCC (http://www.sablecc.org/). */ package org.sablecc.sablecc.parser; import org.sablecc.sablecc.node.*; import org.sablecc.sablecc.analysis.*; class TokenIndex extends AnalysisAdapter { int index; @Override public void caseTPkgId(@SuppressWarnings("unused") TPkgId node) { this.index = 0; } @Override public void caseTPackage(@SuppressWarnings("unused") TPackage node) { this.index = 1; } @Override public void caseTStates(@SuppressWarnings("unused") TStates node) { this.index = 2; } @Override public void caseTHelpers(@SuppressWarnings("unused") THelpers node) { this.index = 3; } @Override public void caseTTokens(@SuppressWarnings("unused") TTokens node) { this.index = 4; } @Override public void caseTIgnored(@SuppressWarnings("unused") TIgnored node) { this.index = 5; } @Override public void caseTProductions(@SuppressWarnings("unused") TProductions node) { this.index = 6; } @Override public void caseTAbstract(@SuppressWarnings("unused") TAbstract node) { this.index = 7; } @Override public void caseTSyntax(@SuppressWarnings("unused") TSyntax node) { this.index = 8; } @Override public void caseTTree(@SuppressWarnings("unused") TTree node) { this.index = 9; } @Override public void caseTNew(@SuppressWarnings("unused") TNew node) { this.index = 10; } @Override public void caseTNull(@SuppressWarnings("unused") TNull node) { this.index = 11; } @Override public void caseTTokenSpecifier(@SuppressWarnings("unused") TTokenSpecifier node) { this.index = 12; } @Override public void caseTProductionSpecifier(@SuppressWarnings("unused") TProductionSpecifier node) { this.index = 13; } @Override public void caseTDot(@SuppressWarnings("unused") TDot node) { this.index = 14; } @Override public void caseTDDot(@SuppressWarnings("unused") TDDot node) { this.index = 15; } @Override public void caseTSemicolon(@SuppressWarnings("unused") TSemicolon node) { this.index = 16; } @Override public void caseTEqual(@SuppressWarnings("unused") TEqual node) { this.index = 17; } @Override public void caseTLBkt(@SuppressWarnings("unused") TLBkt node) { this.index = 18; } @Override public void caseTRBkt(@SuppressWarnings("unused") TRBkt node) { this.index = 19; } @Override public void caseTLPar(@SuppressWarnings("unused") TLPar node) { this.index = 20; } @Override public void caseTRPar(@SuppressWarnings("unused") TRPar node) { this.index = 21; } @Override public void caseTLBrace(@SuppressWarnings("unused") TLBrace node) { this.index = 22; } @Override public void caseTRBrace(@SuppressWarnings("unused") TRBrace node) { this.index = 23; } @Override public void caseTPlus(@SuppressWarnings("unused") TPlus node) { this.index = 24; } @Override public void caseTMinus(@SuppressWarnings("unused") TMinus node) { this.index = 25; } @Override public void caseTQMark(@SuppressWarnings("unused") TQMark node) { this.index = 26; } @Override public void caseTStar(@SuppressWarnings("unused") TStar node) { this.index = 27; } @Override public void caseTBar(@SuppressWarnings("unused") TBar node) { this.index = 28; } @Override public void caseTComma(@SuppressWarnings("unused") TComma node) { this.index = 29; } @Override public void caseTSlash(@SuppressWarnings("unused") TSlash node) { this.index = 30; } @Override public void caseTArrow(@SuppressWarnings("unused") TArrow node) { this.index = 31; } @Override public void caseTColon(@SuppressWarnings("unused") TColon node) { this.index = 32; } @Override public void caseTId(@SuppressWarnings("unused") TId node) { this.index = 33; } @Override public void caseTChar(@SuppressWarnings("unused") TChar node) { this.index = 34; } @Override public void caseTDecChar(@SuppressWarnings("unused") TDecChar node) { this.index = 35; } @Override public void caseTHexChar(@SuppressWarnings("unused") THexChar node) { this.index = 36; } @Override public void caseTString(@SuppressWarnings("unused") TString node) { this.index = 37; } @Override public void caseEOF(@SuppressWarnings("unused") EOF node) { this.index = 38; } } sablecc-3.7/src/org/sablecc/sablecc/parser/parser.dat000066400000000000000000000472401265440641200226220ustar00rootroot00000000000000e!!!! & @67:=>!!@A!B!D!FG! J !A "B $D(H0P`6n96o:!q:st!u"v#w$x%y@st!u"v#w$x%yBE !GHJ! #C %E)I1Qa&F*J2Rb,L4Td8Xhpsst!u"v#w$x%yst!u"v#w$x%yzst!u"v#w$x%y!!st!u"v#w$x%y!! ! !! ! ! ! !'G+K3Sc-M5Ue9Yiq.N6Vf:Zjr<\ltxst!u"v#w$x%y st!u"v#w$x%y     ! ! !! !  ! /O7Wg;[ks=]muy>^nvz|st!u"v#w$x%y"v#w$x . /!0 2 3!48!:   ;! ! !"?@ !?_ow{}~,D-EF1H2!085KL7!O8!P8 !  ! @F!TH   U!IXL 2 !4L8 \W_X   `!\   !\adA 89p !? " '!KE;<r # ( ,!L"P'ZKC $ ) - 0!M"Q#T'[(^,dKLPZ zAt {|}s,~s-=  % * . 1 3!N"R#U$W'\(_)a,e-g0jKLMPQTZ[^d%IHV<\b56LYMNZ94J:QO[12IGWXa]^c!@!$> 7HL7X\@ & + / 2 45!O"S#V$X%Y'](`)b*c,f-h.i0k1l3mKLMNPQRTUWZ[\^_adegj&'()*+%C"ABS#@R9<$!>@$N^BD^expecting: 'Package', 'States', 'Helpers', 'Tokens', 'Ignored', 'Productions', 'Abstract', EOFexpecting: pkg id expecting: idexpecting: '{', idexpecting: 'Tokens'expecting: 'Syntax'expecting: EOFSexpecting: 'States', 'Helpers', 'Tokens', 'Ignored', 'Productions', 'Abstract', EOFHexpecting: 'States', 'Tokens', 'Ignored', 'Productions', 'Abstract', EOF>expecting: 'Tokens', 'Ignored', 'Productions', 'Abstract', EOF4expecting: 'Ignored', 'Productions', 'Abstract', EOF)expecting: 'Productions', 'Abstract', EOFexpecting: 'Abstract', EOFexpecting: '.', ';'expecting: ';', ','expecting: ';'expecting: '='Lexpecting: 'States', 'Tokens', 'Ignored', 'Productions', 'Abstract', id, EOF=expecting: 'Ignored', 'Productions', 'Abstract', '{', id, EOFexpecting: ';', idexpecting: '=', '{'expecting: 'Abstract', id, EOFexpecting: 'Tree'Cexpecting: ';', '[', '(', '|', id, char, dec char, hex char, stringexpecting: '}', ',', '->'Hexpecting: ';', '[', '(', '|', '/', id, char, dec char, hex char, string+expecting: 'T', 'P', ';', '[', '{', '|', idexpecting: '->'9expecting: '[', '(', id, char, dec char, hex char, stringCexpecting: '[', '(', ')', '|', id, char, dec char, hex char, stringfexpecting: ';', '[', ']', '(', ')', '+', '-', '?', '*', '|', '/', id, char, dec char, hex char, stringlexpecting: '..', ';', '[', ']', '(', ')', '+', '-', '?', '*', '|', '/', id, char, dec char, hex char, stringexpecting: ';', ')', '|', '/'Mexpecting: ';', '[', '(', ')', '|', '/', id, char, dec char, hex char, string\expecting: ';', '[', '(', ')', '+', '?', '*', '|', '/', id, char, dec char, hex char, stringaexpecting: ';', '[', ']', '(', ')', '+', '?', '*', '|', '/', id, char, dec char, hex char, stringexpecting: '}', ','expecting: ';', '/'expecting: '.'expecting: '->', id?expecting: 'T', 'P', ';', '[', '{', '}', '+', '?', '*', '|', idexpecting: ';', '|'0expecting: 'T', 'P', ';', '[', '{', '}', '|', idexpecting: 'T', 'P', id!expecting: 'T', 'P', '[', '}', idexpecting: id, EOFexpecting: '+', '-'expecting: '..', '+', '-'expecting: ')'aexpecting: 'T', 'P', ';', '[', '(', ')', '{', '}', '|', '/', id, char, dec char, hex char, stringexpecting: ']'0expecting: 'New', 'Null', 'T', 'P', '[', '}', idexpecting: '}'#expecting: char, dec char, hex charexpecting: ':':expecting: 'New', 'Null', 'T', 'P', '[', ')', '}', ',', id#expecting: 'New', 'T', 'P', ']', id?expecting: 'New', 'Null', 'T', 'P', '.', '[', ')', '}', ',', id&expecting: 'T', 'P', ';', '[', '|', idexpecting: '.', '('expecting: '('expecting: '.', ']', ','expecting: ']', ','0expecting: 'New', 'Null', 'T', 'P', '[', ')', idexpecting: 'New', 'T', 'P', id?expecting: 'New', 'Null', 'T', 'P', '[', ']', ')', '}', ',', idexpecting: ')', ','+expecting: 'New', 'Null', 'T', 'P', '[', ide                       !"#!$$$% &&'())*+,--          ./0! 111!!$$$%234*)))(()*,-     5 $678)933)))*(*:): 22+;<7=2>79)3*:-))<?<>7@>>=A7))<7B0?>>>CBB7>0BB>sablecc-3.7/src/org/sablecc/sablecc/productions.txt000066400000000000000000000010401265440641200224360ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ Macro:Production /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; public abstract class $1$ extends Node { // Empty body } $ sablecc-3.7/src/org/sablecc/sablecc/tokens.txt000066400000000000000000000034011265440641200213730ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ // 0 : xxx.node // 1 : xxx.analysis // 2 : Txxx Macro:VariableTextToken /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import $1$.*; @SuppressWarnings("nls") public final class $2$ extends Token { public $2$(String text) { setText(text); } public $2$(String text, int line, int pos) { setText(text); setLine(line); setPos(pos); } @Override public Object clone() { return new $2$(getText(), getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).case$2$(this); } } $ // 0 : xxx.node // 1 : xxx.analysis // 2 : Txxx // 3 : xxx Macro:FixedTextToken /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import $1$.*; @SuppressWarnings("nls") public final class $2$ extends Token { public $2$() { super.setText("$3$"); } public $2$(int line, int pos) { super.setText("$3$"); setLine(line); setPos(pos); } @Override public Object clone() { return new $2$(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).case$2$(this); } @Override public void setText(@SuppressWarnings("unused") String text) { throw new RuntimeException("Cannot change $2$ text."); } } $ sablecc-3.7/src/org/sablecc/sablecc/utils.txt000066400000000000000000000153431265440641200212400ustar00rootroot00000000000000/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This file is part of SableCC. * * See the file "LICENSE" for copyright information and the * * terms and conditions for copying, distribution and * * modification of SableCC. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ Macro:Start /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import $1$.*; @SuppressWarnings("nls") public final class Start extends Node { private $2$ _$3$_; private EOF _eof_; public Start() { // Empty body } public Start( @SuppressWarnings("hiding") $2$ _$3$_, @SuppressWarnings("hiding") EOF _eof_) { set$2$(_$3$_); setEOF(_eof_); } @Override public Object clone() { return new Start( cloneNode(this._$3$_), cloneNode(this._eof_)); } @Override public void apply(Switch sw) { ((Analysis) sw).caseStart(this); } public $2$ get$2$() { return this._$3$_; } public void set$2$($2$ node) { if(this._$3$_ != null) { this._$3$_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._$3$_ = node; } public EOF getEOF() { return this._eof_; } public void setEOF(EOF node) { if(this._eof_ != null) { this._eof_.parent(null); } if(node != null) { if(node.parent() != null) { node.parent().removeChild(node); } node.parent(this); } this._eof_ = node; } @Override void removeChild(Node child) { if(this._$3$_ == child) { this._$3$_ = null; return; } if(this._eof_ == child) { this._eof_ = null; return; } throw new RuntimeException("Not a child."); } @Override void replaceChild(Node oldChild, Node newChild) { if(this._$3$_ == oldChild) { set$2$(($2$) newChild); return; } if(this._eof_ == oldChild) { setEOF((EOF) newChild); return; } throw new RuntimeException("Not a child."); } @Override public String toString() { return "" + toString(this._$3$_) + toString(this._eof_); } } $ Macro:EOF /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import $1$.*; @SuppressWarnings("nls") public final class EOF extends Token { public EOF() { setText(""); } public EOF(int line, int pos) { setText(""); setLine(line); setPos(pos); } @Override public Object clone() { return new EOF(getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseEOF(this); } } $ Macro:InvalidToken /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import $1$.*; @SuppressWarnings("nls") public final class InvalidToken extends Token { public InvalidToken(String text) { setText(text); } public InvalidToken(String text, int line, int pos) { setText(text); setLine(line); setPos(pos); } @Override public Object clone() { return new InvalidToken(getText(), getLine(), getPos()); } @Override public void apply(Switch sw) { ((Analysis) sw).caseInvalidToken(this); } } $ Macro:Token /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; @SuppressWarnings("nls") public abstract class Token extends Node { private String text; private int line; private int pos; public String getText() { return this.text; } public void setText(@SuppressWarnings("hiding") String text) { this.text = text; } public int getLine() { return this.line; } public void setLine(@SuppressWarnings("hiding") int line) { this.line = line; } public int getPos() { return this.pos; } public void setPos(@SuppressWarnings("hiding") int pos) { this.pos = pos; } @Override public String toString() { return this.text + " "; } @Override void removeChild(@SuppressWarnings("unused") Node child) { throw new RuntimeException("Not a child."); } @Override void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild) { throw new RuntimeException("Not a child."); } } $ Macro:Node /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; import java.util.*; @SuppressWarnings("nls") public abstract class Node implements Switchable, Cloneable { private Node parent; @Override public abstract Object clone(); public Node parent() { return this.parent; } void parent(@SuppressWarnings("hiding") Node parent) { this.parent = parent; } abstract void removeChild(Node child); abstract void replaceChild(Node oldChild, Node newChild); public void replaceBy(Node node) { this.parent.replaceChild(this, node); } protected String toString(Node node) { if(node != null) { return node.toString(); } return ""; } protected String toString(List list) { StringBuffer s = new StringBuffer(); for(Iterator i = list.iterator(); i.hasNext();) { s.append(i.next()); } return s.toString(); } @SuppressWarnings("unchecked") protected T cloneNode(T node) { if(node != null) { return (T) node.clone(); } return null; } @SuppressWarnings("unchecked") protected List cloneList(List list) { List clone = new LinkedList(); for(T n : list) { clone.add((T) n.clone()); } return clone; } } $ Macro:Switch /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; public interface Switch { // Empty body } $ Macro:Switchable /* This file was generated by SableCC (http://www.sablecc.org/). */ package $0$; public interface Switchable { void apply(Switch sw); } $