bisonc++-4.13.01/CLASSES 0000644 0001750 0001750 00000001324 12633316117 013272 0 ustar frank frank atdollar
block atdollar
element
firstset element
symbol firstset
terminal symbol
production block terminal
nonterminal production
symtab nonterminal
rules nonterminal
grammar rules
lookaheadset grammar
item lookaheadset
rrdata lookaheadset
rmreduction
rmshift
stateitem item rrdata rmshift rmreduction
rrconflict stateitem
enumsolution
statetype
next enumsolution statetype stateitem
srconflict next
state srconflict rrconflict
writer state
options
scanner block options
generator writer options
parser scanner rules symtab
bisonc++-4.13.01/CLASSES.bobcat 0000644 0001750 0001750 00000000132 12633316117 014517 0 ustar frank frank align
arg
datetime
exception
indent
mstream
pattern
ranger
stat
string
table
tablesupport
bisonc++-4.13.01/INSTALL 0000644 0001750 0001750 00000012227 12633316117 013307 0 ustar frank frank To Install bisonc++ by hand instead of using the binary distribution perform
the following steps:
0. Bisonc++ and its construction depends, in addition to the normally
standard available system software on specific software and versions
which is documented in the file `required', in particular the Bobcat
library.
(If you compile the bobcat library yourself, note that bisonc++ does
not use the SSL, Milter and Xpointer classes; they may --as far as
bisonc++ is concerned-- be left out of the library)
1. To install bobcat icmake should be used, for which a top-level script
(build) and support scripts in the ./icmake/ directory are
available. Icmake is available on many architectures.
2. Inspect the values of the variables in the file INSTALL.im, in
particular the #defines below COMPONENTS TO INSTALL. Modify
these #defines when necessary.
3. Inspect the path to icmake at the top of the `build' script. By default
it is /usr/bin/icmake, but some installations use
/usr/local/bin/icmake Adapt when necessary.
4. Run
./build program [strip]
to compile bisonc++. The argument `strip' is optional and strips
symbolic information from the final executable.
5. If you installed Yodl then you can create the documentation:
./build man
builds the man-pages, and
./build manual
builds the manual.
6. Run (probably as root)
./build install 'LOG:path' 'what' 'base'
to install components of Bisonc++.
Here,
'LOG:path' is an optional item specifying the absolute or relative
path of a log file to contain a log of all installed files (see
also the next item). Using LOG:~/.bisoncpp usually works
well. Do not put any blanks between LOG: and the path
specification, or protect the LOG: specification by quotes.
'what' specifies what you want to install.
Specify:
x, to install all components,
or specify a combination of:
a (additional documentation),
b (binary program),
d (standard documentation),
m (man-pages)
s (skeleton files)
u (user guide)
E.g., use
./build install bs 'base'
if you only want to be able to run bisonc++, and want it to be
installed below 'base'.
When requesting non-existing elements (e.g., ./build install x
was requested, but the man-pages weren't constructed) then
these non-existing elements are silently ignored by the
installation process.
'base' is optional and specifies the base directory below which
the requested files are installed. This base directory is
prepended to the paths #defined in the INSTALL.im file. If
'base' is not specified, then INSTALL.im's #defined paths are
used as-is.
7. Uninstalling previously installed components of Bisonc++ is easy if a
log path (LOG:...) was specified at the `./build install ...'
command. In that case, run the command
./build uninstall logpath
where 'logpath' specifies the location of the logfile that was
written by ./build install. Modified files and non-empty directories
are not removed, but the logfile itself is removed following the
uninstallation.
8. Following the installation nothing in the directory tree which contains
this file (i.e., INSTALL) is required for the proper functioning of
bisonc++, so consider removing it. If you only want to remove
left-over files from the build-process, just run
./build distclean
-----------------------------------------------------------------------------
NOTE: the parser-class header file generated by bisonc++ before version
4.02.00 should have the prototypes of some of their private members
modified.
Simply replacing the `support functions for parse()' section shown at the
end of the header file by the following lines should make your header
file up-to-date again. Bisonc++ will not by itself rewrite the
parser class headers to prevent undoing any modifications you may have
implemented in parser-class header files:
// support functions for parse():
void executeAction(int ruleNr);
void errorRecovery();
int lookup(bool recovery);
void nextToken();
void print__();
void exceptionHandler__(std::exception const &exc);
The function print__) is defined by bisonc++, the default implementation
of exceptionHandler__() can be added to the parser's internal header
file:
inline void Parser::exceptionHandler__(std::exception const &exc)
{
throw; // optionally re-implement to handle exceptions thrown
// by actions
}
bisonc++-4.13.01/INSTALL.im 0000644 0001750 0001750 00000004407 12634610065 013714 0 ustar frank frank // The name of the program and the support directories as installed by
// the 'build install' command. Normally there is no reason for changing
// this #define
#define PROGRAM "bisonc++"
// The following /bin/cp option is used to keep, rather than follow
// symbolic references. If your installation doesn't support these flags,
// then change them into available ones.
// -P, --no-dereference
// never follow symbolic links in SOURCE
// --preserve[=ATTR_LIST]
// preserve the specified attributes (default:
// mode,ownership,timestamps), if possible additional
// attributes: context, links, all
// -d same as --no-dereference --preserve=links
#define CPOPTS "-d"
// The CXX, CXXFLAGS, and LDFLAGS #defines are overruled by identically
// named environment variables:
// the compiler to use.
#define CXX "g++"
// the compiler options to use.
#define CXXFLAGS "--std=c++14 -Wall -O2 -fdiagnostics-color=never"
#define LDFLAGS ""
// flags passed to the linker
// COMPONENTS TO INSTALL
// =====================
// For an operational non-Debian installation, you probably must be
// `root'.
// If necessary, adapt the #defines below to your situation.
// The provided locations are used by Debian Linux.
// With 'build install' you can dynamically specify a location to prepend
// to the locations configured here, and select which components you want
// to install
// ONLY USE ABSOLUTE DIRECTORY NAMES:
// the directory where additional documentation is stored
#define ADD "/usr/share/doc/"${PROGRAM}"-doc"
// the full pathname of the final program
#define BINARY "/usr/bin/"${PROGRAM}
// the directory where the standard documentation is stored
#define DOC "/usr/share/doc/"${PROGRAM}
// the directory whre the manual page is stored
#define MAN "/usr/share/man/man1"
// the directory whre the user-guide is stored
#define UGUIDE "/usr/share/doc/"${PROGRAM}"-doc/manual"
// the directory where the skeleton files are installed
// Recompile options/data.cc if the skeleton location changes
#define SKEL "/usr/share/bisonc++"
bisonc++-4.13.01/LICENSE 0000644 0001750 0001750 00000104513 12635000474 013261 0 ustar frank frank GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc.
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
Copyright (C)
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
Copyright (C)
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
.
bisonc++-4.13.01/README-0.98 0000644 0001750 0001750 00000002377 12633316117 013537 0 ustar frank frank Bisonc++ 0.98 is a complete rewrite of the well-known bison(++) parser
generator. See the manual page for details.
Several demo programs are found below the bisonc++/documentation/examples
directory. In that directory there's a README file describing the purposes of
the various examples.
The (original) bison documentation is provided in html format in the directory
bisonc++/documentation/html. The Debian package (bisonc++*.deb) installs that
documentation below /usr/share/doc/bisonc++.
Note that bisonc++'s specifications differs from bison's specifications, in
particular with respect to the declaration section. The production rule
specification section is, however, practically identical to the one defined
for bison. There are some differences, though. Consult bisonc++'s manpage
(installed by the Debian package, otherwise available in the directory
bisonc++/documentation/man) for the differences.
Since it is a complete rewrite it is quite likely that bugs will be
encountered. Bison itself offers an extensive input grammar, and I may easily
have overlooked various subtleties.
Do not hesitate to contact me when you encounter a bug. A (small) grammar
illustrating your point is then always extremely useful.
Frank.
May 2005-April 2006
(f.b.brokken@rug.nl)
bisonc++-4.13.01/README.class-setup 0000644 0001750 0001750 00000005046 12633316117 015401 0 ustar frank frank This hierarchy defines the header and the implementation dependencies among
the classes. The topmost class is not dependent on any class. Lines should be
read down-to-up to find the the lowest class in the hierarchy on which a
given class depends (e.g., LookaheadSet depends on Grammar, and possibly uses
the classes used by Grammar; RmReduction does not depend on any other class).
AtDollar Element
| |
Block FirstSet
| |
+-------+ Symbol
| | |
| | Terminal
| | |
| +---------------+
| |
| Production
| |
| NonTerminal
| |
| +---------------+
| | |
| Symtab Rules
| | |
| +--------+------+
| | |
| | Grammar
| | |
| | LookaheadSet
| | |
| | +-----------+
| | | |
| | Item RRData RmShift RmReduction
| | | | | |
| | +-----------+-----------+-----------+
| | |
| | EnumSolution StateType StateItem
| | | | |
| | | | +--+
| | | | | |
| | +---------------+---------------+ |
| | | |
| | Next |
| | | |
| Options | SrConflict RRConflict
| | | | |
| | | +------------------+
| | | |
| +----------- | --------+ State
| | | | |
+---+ | | Writer
| | | |
Scanner | +----------------+
| | |
+----------------+ |
| |
Parser Generator
| |
+--------------------------+
|
bisonc++
bisonc++-4.13.01/README.flex 0000644 0001750 0001750 00000001105 12633316117 014064 0 ustar frank frank About the lexical scanner
=========================
Bisonc++ uses a lexical scanner generated by flex.
The file bisonc++/scanner/yylex.cc depends on a file FlexLexer.h having
different contents over different `flex' versions.
Bisonc++ therefore also depends on flex being installed, callable as the
program `flex'.
Starting with Bisonc++ version 2.4.2 the build process will create
scanner/yylex.cc from the file scanner/lexer and scanner/yylex.cc is no longer
included in Bisonc++'s distribution.
Frank.
bisonc++-4.13.01/README.insertions 0000644 0001750 0001750 00000001044 12633316117 015325 0 ustar frank frank Classes Item, Next, NonTerminal, StateItem and Terminal use a static
inserter() function to define the way the object is inserted into a
stream. These functions expect addresses of member functions defining a
particular insertion as their arguments.
In the class header files the members that define an insertion type are listed
immediately following the inserter() prototype.
Currently only the Terminal class supports a manipulator functionality for
these member functions, allowing a insertion mode-switch within a single
insertion statement.
bisonc++-4.13.01/README.lookaheads 0000644 0001750 0001750 00000000535 12633316117 015246 0 ustar frank frank The algorithm that is used to compute the look-ahead sets of all items of all
states of a grammar is described in chapter 7 (The Bisonc++ Parser Algorithm)
of Bisonc++'s user mannual, as well as in the state/determinelasets.cc source
file. Please refer to these documentation sources for further information
about the LA sets computation algorithm.
bisonc++-4.13.01/README.output 0000644 0001750 0001750 00000000634 12633316117 014474 0 ustar frank frank Output to the xxx.output file by the --verbose or --construction flags are
mostly handled from the State::allStates() function. This function calls
State's operator<<, which is initialized by a pointer pointing to either
insertStd,
insertExt
or
skipInsertion.
Inspect state/insertstd.cc for the standard insertion method and
state/insertext.cc for the extensive insertion method.
bisonc++-4.13.01/README.parser 0000644 0001750 0001750 00000004132 12633316117 014425 0 ustar frank frank Bisonc++ 2.0.0 uses a grammar specification file (parser/grammar) defining the
input language that it will recognize. The grammar specification file was
initially written to be used with Bisonc++ 1.6.1, but once Bisonc++ 2.0.0 was
available it was split into various subfiles, each having a well defined
function. As a result, the individual grammar specification files are fairly
small, which facilitates understanding of the grammar.
The main grammar specification file is the file parser/grammar, the
subdirectory parser/spec contains the grammar specification subfiles:
parser/spec/messages
parser/spec/precedence
parser/spec/optrules
parser/spec/directives
parser/spec/symbols
parser/spec/rules
parser/spec/productionlist
parser/spec/auxiliary
parser/grammar:
A short file, defining tokens, the semantic value union, the grammar's
start rule and one support rule used by the start rule.
parser/spec/messages:
Defines all rules that expect a token and assign an appropriate text
to the syntactic error message variable `d_msg'. All these rules end in
_t. Another set of rules (ending in _m) merely set the `d_msg' data
member.
parser/spec/precedence:
Defines support rules when recognizing the precedence (LEFT, RIGHT,
NONASSOC) and TOKEN terminals directives. These rules end in _p.
parser/spec/optrules
Defines rules for all tokens that may optionally be given. These rules
all start with the phrase `opt'.
parser/spec/directives
Defines the syntax for each of Bisonc++'s directives.
parser/spec/symbols
All precedence directives, the %token directive and the %type
directive all expect one or more symbols. The `symbols' rule is defined in
this file.
parser/spec/rules
Defines the grammar recognizing Bisonc++'s rules
parser/spec/productionlist
Defines the grammar recognizing the production rules recognized by
Bisonc++.
parser/spec/auxiliary
Defines rules that are used in at least two specification files. These
rules all end in _a.
bisonc++-4.13.01/README.polymorphic 0000644 0001750 0001750 00000000311 12633316117 015471 0 ustar frank frank A short demo program is found in documentation/manual/grammar/poly/;
A demo illustrating the way polymorphic semantic type assignment works is
provided in documentation/manual/grammar/essence/demo.cc.
bisonc++-4.13.01/README.states 0000644 0001750 0001750 00000022156 12633316117 014442 0 ustar frank frank This file contains a short description about the way states and look-aheads
(LA's) are constructed. The example does not cover new information. In fact,
it follows the construction of the states of the grammar given in example 4.42
in Aho et al.
A more extensive description is found in documentation/manual/algorithm.yo
The grammar has the following production rules (numbered 1-3):
1 S' -> S
2 S -> CC
3 C -> cC
4 C -> d
Production rule 1 is added to the grammar, representing the so-called
augmented grammar. When this rule is recognized at end-of-input (represented
by $) then the input is grammatically correct, and the parser will flag
`success'.
$ is called a `look ahead' (LA) token. LA's may be in sets, which are used to
determine whether a rule (when potentially recognized) will be reduced or
not. So, when recognizing S, it is only reduced to S' (by rule S' -> S) if $
is indeed the next input token (i.e., if the end-of-input has been reached.
With the starting rule an `item' is associated. An items consists of a rule,
having a `dot' and a LA-set. The dot (.) represents the point to where input
has been recognized. So, initially we have, starting from rule 1 and using []
to contain the LA token(s):
S' -> . S [$]
This is the starting point, state 0, and this point of departure defines the
`kernel' of a state. To the kernel additional (production) rules and new
LA-sets may be added as follows:
New rules: If a . is followed by a non-terminal all production rules of
that non-terminal are added to the item as new items having dots in postion
0. This process is followed for the newly added production rules as well until
no more rules are added.
LA-sets: Here is where it gets a bit complicated. To find LA-sets the
FIRST function must be defined first.
The FIRST function defines the set of terminal tokens that can be
encountered at the start of a (series of) grammatical tokens. This FIRST-set
is determined as follows:
- if X is a terminal token x, FIRST(X) is [x].
- if X is empty FIRST(X) is [e] (the empty set)
- if X is a production rule X1 X2 ... Xn then:
FIRST(X) is FIRST(X1), except [e].
If [e] was removed, FIRST(X2) is added to the set,
again removing [e], if it was now added to the set.
This process is repeated until an Xi was without [e], or
until FIRST(Xn) was added to the set. In this final case,
if FIRST(Xn) contains [e] it is kept
For our little grammar, we have the following FIRST sets:
S' -> S FIRST(S') = FIRST(S)
S -> CC FIRST(S) = FIRST(C)
C -> cC FIRST(cC) = [c]
C -> d FIRST(d) = [d]
so, FIRST(S') = FIRST(S) = FIRST(C) = FIRST(S) = [cd]
Back to the LA-sets: In a state having an item:
A -> x . B y, [a]
with A, B non-terminals, x, y possibly empty series of terminal symbols
and [a] the LA-set belonging to this item (so, x . B y is a production rule of
A with a dot), all B's production rules are added to the state having
FIRST(ya) as its LA-set.
Having constructed a state, the dots are moved one symbol to the
right. Every unique grammar symbol thus shifted represents a `shift' in the
parsing process to another state. A shift may result in a shift to an earlier
state. This earlier state may thus see its LA-set expanded, which expansion
must then propagate to all states derived from that state. When no shift is
possible, a reduction takes place. If a state has only a single reduction,
then this becomes the default reduction (on any symbol not resulting in a
shift). If a state has multiple reductions, then this is ok if their LA-sets
are different. Otherwise the grammar contains a reduce-reduce
conflict. Analogously, if a reduction on a certain LA-set is indicated, but
there's also a shift required for (one or more) terminal tokens in the LA-set,
then the grammar contains a shift-reduce conflict.
At each rule in each state actions/gotos are specified: `goto' a state if
the symbol following a dot is a nonterminal, `shift' to a state if the symbol
following a dot is a terminal, or reduce according to a production rule if the
dot is at the end of a production rule. This indicates that a rule has been
recognized, and if an action block has been defined for such a production
rule, it is executed at that point (i.e., at the point where the reduction
takes place).
Now it's time to start constructing states, called S0, S1, S2,
etc. Production rules are numbered by their original number.
S0:
1 S' -> . S [$] On S goto S1
for S' -> . S [$]
compute, matching A -> x . B y, [a],
FIRST(y a)
as FIRST( $), which is: [$], LA for the next S rule:
add S-rule:
2 S -> . C C [$] On C goto S2
for S -> . C C [$]
compute, matching A -> x . B y, [a],
FIRST(y a)
as FIRST(C $), which is: [cd], LA for the next C rules:
add C-rules:
3 C -> . c C [cd] On c shift S3
4 C -> . d [cd] On d shift S4
having (of course) the same LA set. `Of course',
since the LA set does not depend on this production
rule, but on the rule causing this addition. So, once
a nonterminal is added, the LA-set of its production
rules is determined once.
Continuing this way, each of the previous state's items is processed in turn:
S1:
1 S' -> S . [$] Reduce to S' by rule 1.
This is the ACCEPT state
S2:
2 S -> C . C [$] On C goto S5
for S -> C . C [$]
compute, matching A -> x . B y, [a]
FIRST(y a)
as FIRST( $), which is: [$], LA for the next C rules:
3 C -> . c C [$] On c shift S3
(Adding [$] to S3's LA-set)
4 C -> . d [$] On d shift S4
(Adding [$] to S4's LA-set)
S3:
3 C -> c . C [cd]+[$] from S2 On C goto S6
(Adding [cd] to S5's LA-set)
for C -> c . C [cd]+[$]
compute, matching A -> x . B y, [a]
FIRST(y a )
as FIRST( [cd]), which is: [cd]+[$]
3 C -> . c C [cd]+[$] On c shift S3
4 C -> . d [cd]+[$] On d shift S4
S4:
4 C -> d . [cd]+[$] from S2 Reduce to C by rule 4
S5:
2 S -> C C . [$] Reduce to S by rule 2
S6:
3 C -> c C . [cd]+[$] Reduce to C by rule 3
Now, the action/goto table can be summarized:
------------------------------------
action goto
------------------------------------
State c d $ S C
------------------------------------
0 s3 s4 s1 s2
1 acc
2 s3 s4 s5
3 s3 s4 s6
4 r4 r4 r4
5 r2 [d]
6 r3 r3 r3
------------------------------------
[d]: use this by default for every
next token
If a grammatical rule has an empty production the same procedure is followed.
Consider:
1 S' -> S
2 S -> S E
3 S ->
4 E -> n
5 E -> i
(representing a grammar accepting possibly empty series of numbers and
identifiers). The grammar is constructed as follows:
FIRST(E) = [in], FIRST(S') = FIRST(S) = [in$]
S0:
S' -> . S [$] On S: goto S1
Obtaining [$] from the above rule:
S -> . S E [$] On S: goto S1
S -> . [$] Default: reduce to S
S1:
S' -> S . [$] On $: ACCEPT
S -> S . E [$] On E: goto S2
Add E-rules: match A -> b . B y [a]
with: S -> S . E [$]
E -> . n [$] On n shift S3
E -> . i [$] On i shift S4
S2:
S -> S E . [$] REDUCE
S3:
E -> n . [$] REDUCE
S4:
E -> i . [$] REDUCE
Action/Goto table:
------------------------------------
action goto
------------------------------------
State i n $ S E
------------------------------------
0 r3[d] s1
1 s3 s4 acc s2
2 r2[d]
3 r4[d]
4 r5[d]
------------------------------------
bisonc++-4.13.01/README.states-and-conflicts 0000644 0001750 0001750 00000017303 12633316117 017162 0 ustar frank frank The information in this file is closely related to what's happening in
state/define.cc. Refer to define.cc for the implementation of the process
described below. All functions mentioned below are defined by the class State.
Defining states proceeds as follows:
0. The initial state is constructed. It contains the augmented grammar's
production rule. This part is realized by the static member
initialState();
Following this, states are constructed via State::construct, initially
called for the initial state (state 0)
State construction (i.e., State::construct) consists of two steps:
1. All items are defined in State::setItems as either reducible items
(no transitions) or non-reducible items (when the dot is not beyond
the last item's symbol). Whenever there are non-reducible items
2.
1. From the state's kernel item(s) all implied rules are added as
additional state items. This results in a vector of (kernel/non-kernel)
items,
>>!! as well as per item the numbers of the items that are affected
by this item. This information is used later on to propagate the
LA's. This part is realized by the member
setItems()
This fills the StateItem::Vector vector. A StateItem contains
1. an item (containing a production rule, dot position, and LA set)
2. a size_t vector of indices of `dependent' items, indicating which
items have LA sets that depend on the current item
(StateItem::d_child).
3. The size_t field `d_nextIdx' holds the index in d_nextVector,
allowing quick access of the d_nextVector element defining the
state having the current item as its kernel. A next value 'npos'
indicates that the item does not belong to a next-kernel.
E.g.,
StateItem:
-------------------------------------
item LA-set dependent next
stateitems state
-------------------------------------
S* -> . S, EOF, (1, 2) 0
...
-------------------------------------
Also, State::d_nextVector vector is filled.
A Next element contains
0. The symbol on which the transition takes place
1. The number of the next state
2. The indices of the StateItem::Vector defining the next
state's kernel
E.g.,
Next:
-------------------------------
On next next kernel
Symbol state from items
-------------------------------
S ? (0, 1)
...
-------------------------------
Empty production rules don't require special handling as they won't appear
in the Next table, since there's no transition on them.
Next, from these facilities all states are constructed. LA propagation is
performed after the state construction State construction takes place (in
the while loop in State::define.cc following the initial state
construction).
2. After the state construction the LA sets of the items are computed. State
0's single kernel item is S_$: . S, and represents the augmented grammar's
start rule, just before observing the grammar's start symbol. The LA sets
are computed by State::determineLAsets. The file state/determinelasets.cc
contains a description of the implemented algorithm, as does chapter 7
(The Bisonc++ Parser Algorithm) of Bisonc++'s User Guide. The reader is
referred to these documentation sources for further information about the
LA set computation algorithm.
3. Once all states have been constructed, conflicts are located and
solved. If a state contains conflict, they are resolved and
information about these conflicts is stored in an SRConflict::Vector
and/or RRConflict::Vector. Conflicts are identified and resolved by the
member:
State::checkConflicts();
4. S/R conflicts are handled by the d_srConflict object. This object received
at construction time a context consisting of the state's d_itemVector and
d_nextVector as well as d_reducible containing all indices of reducible
items. Each of these indices is the index of a reducible item which is,
together with a context consisting of the state's d_itemVector and
d_nextVector, passed to Next::checkShiftReduceConflict(), which solves the
observed shift-reduce conflicts.
Here is how this is done:
Assume a state's itemVector holds the following StateItems:
0: [P11 3] expression -> expression '-' expression .
{ EOLN '+' '-' '*' '/' ')' } 0, 1, () -1
1: [P10 1] expression -> expression . '+' expression
{ EOLN '+' '-' '*' '/' ')' } 0, 0, () 0
2: [P11 1] expression -> expression . '-' expression
{ EOLN '+' '-' '*' '/' ')' } 0, 0, () 1
3: [P12 1] expression -> expression . '*' expression
{ EOLN '+' '-' '*' '/' ')' } 0, 0, () 2
4: [P13 1] expression -> expression . '/' expression
{ EOLN '+' '-' '*' '/' ')' } 0, 0, () 3
and the associated nextVector is:
0: On '+' to state 15 with (1 )
1: On '-' to state 16 with (2 )
2: On '*' to state 17 with (3 )
3: On '/' to state 18 with (4 )
Conflicts are inspected for all reducible items. Here the reducible item
is the item having index 0.
Inspection involves (but see below for an extension of this process when
the LHS of a reducible item differs from the LHS of a non-reducible item):
1. The nextVector's symbols are searched for in the LA set of the
reduction item (so, subsequently '+', '-', '*' and '/' are searched
for in the LA set of itemVector[0]).
2. In this case, all are found and depending on the token's priority
and the rule's priority either a shift or a reduce is selected.
Production rules received their priority setting either explicitly (using
%prec) or from their first terminal token. See also
rules/updateprecedences.cc
What happens if neither occurs? In a rule like 'expr: term' there is no
first terminal token and there is no %prec being used.
In these cases the rule is removed, by default using a shift instead of a
reduce (until 4.00.00 this was handled incorrectly by giving the reduction
rule the highest precedence, using a reduce rather than a shift)
The problem with rules without precedence was originally brought to my
attention by Ramanand Mandayam.
Different LHS elements of items:
As pointed out by Ramanand Mandayam, S/R conflicts may be observed when
reducible rules merely consist of non-terminals. Here is an example:
%left '*'
%token ID
%%
expr:
term
;
term:
term '*' primary
|
ID
;
primary:
'-' expr
|
ID
;
This grammar contains the following state
State 2:
0: [P1 1] expr -> term . { } 1, () -1
1: [P2 1] term -> term . '*' primary { '*' } 0, () 0
0: On '*' to state 4 with (1 )
Reduce item(s): 0
Here, item 0 reduces to N 'expr' and item 1 requires a shift in a
production rule of the N 'term'.
In these cases the rule 'expr -> term .' has no precedence that can be
derived from either %prec or an initial terminal. Such reductions
automatically receive the highest possible precedence and 'reduce' is
used, rather than 'shift'. Since there is no explicit basis for this
choice the choice between shift and reduce is flagged as a conflict.
bisonc++-4.13.01/TODO 0000644 0001750 0001750 00000000136 12633316117 012742 0 ustar frank frank - %nonassoc should probably produce an error when %nonassoc operators are used
repeatedly.
bisonc++-4.13.01/VERSION 0000644 0001750 0001750 00000000066 12634777177 013346 0 ustar frank frank #define VERSION "4.13.01"
#define YEARS "2005-2015"
bisonc++-4.13.01/VERSION.h 0000644 0001750 0001750 00000000104 12633316117 013543 0 ustar frank frank #include "VERSION"
SUBST(_CurVers_)(VERSION)
SUBST(_CurYrs_)(YEARS)
bisonc++-4.13.01/atdollar/ 0000755 0001750 0001750 00000000000 12633316117 014054 5 ustar frank frank bisonc++-4.13.01/atdollar/operatorinsert.cc 0000644 0001750 0001750 00000001012 12633316117 017435 0 ustar frank frank #include "atdollar.ih"
std::ostream &operator<<(std::ostream &out, AtDollar const &atd)
{
out << "At line " << atd.d_lineNr << ", block pos. " << atd.d_pos <<
", length: " << atd.d_length << ": " <<
(atd.d_type == AtDollar::AT ? '@' : '$');
if (atd.d_id.length())
out << '<' << atd.d_id << '>';
if (atd.d_nr == numeric_limits::max())
out << '$';
else
out << atd.d_nr;
if (atd.d_member)
out << ". (member call)";
return out;
}
bisonc++-4.13.01/atdollar/atdollar1.cc 0000644 0001750 0001750 00000000571 12633316117 016251 0 ustar frank frank #include "atdollar.ih"
// ${NR}, ${NR}. or @{NR}
AtDollar::AtDollar(Type type,
size_t blockPos, size_t lineNr, std::string const &text,
int nr, bool member)
:
d_type(type),
d_lineNr(lineNr),
d_pos(blockPos),
d_length(text.length() - member),
d_text(text),
d_nr(nr),
d_member(member),
d_stype(false)
{}
bisonc++-4.13.01/atdollar/atdollar.h 0000644 0001750 0001750 00000004530 12633316117 016031 0 ustar frank frank #ifndef INCLUDED_ATDOLLAR_
#define INCLUDED_ATDOLLAR_
#include
#include
#include
class AtDollar
{
friend std::ostream &operator<<(std::ostream &out, AtDollar const &atd);
public:
enum Type
{
AT,
DOLLAR
};
enum Action
{
RETURN_VALUE,
NUMBERED_ELEMENT,
TYPED_RETURN_VALUE,
TYPED_NUMBERED_ELEMENT
};
private:
Type d_type;
size_t d_lineNr;
size_t d_pos;
size_t d_length;
std::string d_text;
std::string d_id;
int d_nr; // $$ if numeric_limits::max()
bool d_member;
bool d_stype;
public:
AtDollar() = default; // only used by std::vector in Block
// 1 $$, $$., $NR, $NR., @@ or @NR
AtDollar(Type type, size_t blockPos, size_t lineNr,
std::string const &text, int nr, bool member);
// 3 $$ or $-?NR
AtDollar(Type type, size_t blockPos, size_t lineNr,
std::string const &text, std::string const &id, int nr);
Type type() const;
int nr() const;
std::string const &text() const;
std::string const &id() const;
size_t pos() const;
size_t length() const;
size_t lineNr() const;
Action action() const;
bool callsMember() const;
bool returnValue() const; // $$ is being referred to
bool stype() const; // id == STYPE__
};
inline AtDollar::Type AtDollar::type() const
{
return d_type;
}
inline int AtDollar::nr() const
{
return d_nr;
}
inline bool AtDollar::callsMember() const
{
return d_member;
}
inline bool AtDollar::returnValue() const
{
return d_nr == std::numeric_limits::max();
}
inline bool AtDollar::stype() const
{
return d_stype;
}
inline size_t AtDollar::pos() const
{
return d_pos;
}
inline size_t AtDollar::length() const
{
return d_length;
}
inline size_t AtDollar::lineNr() const
{
return d_lineNr;
}
inline std::string const &AtDollar::text() const
{
return d_text;
}
inline std::string const &AtDollar::id() const
{
return d_id;
}
#endif
bisonc++-4.13.01/atdollar/atdollar2.cc 0000644 0001750 0001750 00000000617 12633316117 016253 0 ustar frank frank #include "atdollar.ih"
// $$ or $-?NR
AtDollar::AtDollar(Type type, size_t blockPos, size_t lineNr,
string const &text, string const &id, int nr)
:
d_type(type),
d_lineNr(lineNr),
d_pos(blockPos),
d_length(text.length()),
d_text(text),
d_id(id.empty() ? "STYPE__" : id),
d_nr(nr),
d_member(false),
d_stype(d_id == "STYPE__")
{}
bisonc++-4.13.01/atdollar/frame 0000644 0001750 0001750 00000000047 12633316117 015072 0 ustar frank frank #include "atdollar.ih"
AtDollar::
{
}
bisonc++-4.13.01/atdollar/action.cc 0000644 0001750 0001750 00000000403 12633316117 015635 0 ustar frank frank #include "atdollar.ih"
AtDollar::Action AtDollar::action() const
{
if (d_nr == numeric_limits::max())
return d_id.length() ? TYPED_RETURN_VALUE : RETURN_VALUE;
return d_id.length() ? TYPED_NUMBERED_ELEMENT : NUMBERED_ELEMENT;
}
bisonc++-4.13.01/atdollar/atdollar.ih 0000644 0001750 0001750 00000000101 12633316117 016170 0 ustar frank frank #include "atdollar.h"
#include
using namespace std;
bisonc++-4.13.01/bisonc++.cc 0000644 0001750 0001750 00000010331 12633316117 014162 0 ustar frank frank /*
bisonc++.cc
*/
#include "bisonc++.ih"
using namespace std;
using namespace FBB;
namespace
{
Arg::LongOption longOptions[] =
{
{"analyze-only", 'A'}, // option only
{"baseclass-header", 'b'},
{"baseclass-preinclude", 'H'},
{"baseclass-skeleton", 'B'}, // options only
{"polymorphic-skeleton", 'M'},
{"polymorphic-inline-skeleton", 'm'},
{"class-header", 'c'},
{"class-name", Arg::Required},
{"class-skeleton", 'C'}, // option only
Arg::LongOption("construction"), // option only
// implies verbose, but also shows FIRST and FOLLOW sets as
// well as the full set of states, including the non-kernel
// items
Arg::LongOption("debug"),
Arg::LongOption("error-verbose"),
{"filenames", 'f'},
Arg::LongOption("flex"),
{"help", 'h'}, // option only
{"implementation-header", 'i'},
{"implementation-skeleton", 'I'}, // option only
Arg::LongOption("insert-stype"), // option only
{"max-inclusion-depth", Arg::Required}, // option only
{"namespace", 'n'},
// option only
Arg::LongOption("no-baseclass-header"),
Arg::LongOption("no-lines"),
Arg::LongOption("no-parse-member"), // options only
{"no-decoration", 'D'},
{"no-default-action-return", 'N'},
{"own-debug", Arg::None},
{"own-tokens", 'T'},
{"parsefun-skeleton", 'P'},
{"parsefun-source", 'p'},
{"print-tokens", 't'},
{"required-tokens", Arg::Required},
{"scanner", 's'},
Arg::LongOption("scanner-debug"),
{"scanner-matched-text-function", Arg::Required},
{"scanner-token-function", Arg::Required},
{"scanner-class-name", Arg::Required},
Arg::LongOption("show-filenames"), // option only
{"skeleton-directory", 'S'}, // option only
{"target-directory", Arg::Required},
Arg::LongOption("thread-safe"), // options only
{"usage", 'h'},
{"verbose", 'V'},
// shows rules, tokens, final states and kernel items,
// and describes conflicts when found
{"version", 'v'},
};
auto longEnd = longOptions +
sizeof(longOptions) / sizeof(Arg::LongOption);
}
int main(int argc, char **argv)
try
{
Arg &arg = Arg::initialize("AB:b:C:c:Df:H:hI:i:M:m:n:Np:P:s:S:tTVv",
longOptions, longEnd, argc, argv);
arg.versionHelp(usage, version, 1);
Rules rules;
Parser parser(rules); // Prepare parsing. If `include-only' was
// specified, processing stops here.
parser.parse(); // parses the input, fills the data in the Rules
// read the grammar file, build required data
// structures.
parser.cleanup(); // do cleanup actions following parse()
// (terminate if parsing produced errors)
rules.updatePrecedences(); // update production rule precedences
rules.showRules();
rules.showTerminals();
rules.determineFirst();
rules.showFirst();
// define the startproduction
Production::setStart(rules.startProduction());
State::define(rules); // define all states
rules.assignNonTerminalNumbers();
rules.showUnusedTerminals();
rules.showUnusedNonTerminals();
rules.showUnusedRules();
State::allStates();
Grammar grammar;
grammar.deriveSentence();
if (emsg.count())
return 1;
if (arg.option('A')) // Analyze only
return 0;
Generator generator(rules, parser.polymorphic());
if (generator.conflicts())
return 1;
generator.baseClassHeader();
generator.classHeader();
generator.implementationHeader();
generator.parseFunction();
}
catch(exception const &err)
{
cerr << err.what() << '\n';
return 1;
}
catch(int x)
{
return Arg::instance().option("hv") ? 0 : x;
}
bisonc++-4.13.01/bisonc++.ih 0000644 0001750 0001750 00000000756 12633316117 014207 0 ustar frank frank #ifndef _INCLUDED_BISONCPP_H_
#define _INCLUDED_BISONCPP_H_
#include
#include
#include
#include
#include "rules/rules.h"
#include "parser/parser.h"
#include "state/state.h"
#include "srconflict/srconflict.h"
#include "rrconflict/rrconflict.h"
#include "grammar/grammar.h"
#include "generator/generator.h"
using namespace std;
using namespace FBB;
extern char version[];
extern char year[];
void usage(string const &program_name);
#endif
bisonc++-4.13.01/bisonc++.xref 0000644 0001750 0001750 00000276725 12633316117 014566 0 ustar frank frank oxref by Frank B. Brokken (f.b.brokken@rug.nl)
oxref V1.00.03 2012-2015
CREATED Sun, 13 Dec 2015 15:34:33 +0000
CROSS REFERENCE FOR: -fxs tmp/libmodules.a
----------------------------------------------------------------------
actionCases(std::ostream&) const
Full name: Generator::actionCases(std::ostream&) const
Source: actioncases.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
addElement(Symbol*)
Full name: Rules::addElement(Symbol*)
Source: addelement.cc
Used By:
augmentgrammar.cc: Rules::augmentGrammar(Symbol*)
handleproductionelement.cc: Parser::handleProductionElement(Meta__::SType&)
handleproductionelements.cc: Parser::handleProductionElements(Meta__::SType&, Meta__::SType const&)
nestedblock.cc: Parser::nestedBlock(Block&)
addIncludeQuotes(std::__cxx11::basic_string, std::allocator >&)
Full name: Options::addIncludeQuotes(std::__cxx11::basic_string, std::allocator >&)
Source: addincludequotes.cc
Used By:
setquotedstrings.cc: Options::setQuotedStrings()
addKernelItem(StateItem const&)
Full name: State::addKernelItem(StateItem const&)
Source: addkernelitem.cc
Used By:
addstate.cc: State::addState(std::vector > const&)
initialstate.cc: State::initialState()
addNext(Symbol const*, unsigned int)
Full name: State::addNext(Symbol const*, unsigned int)
Source: addnext.cc
Used By:
notreducible.cc: State::notReducible(unsigned int)
addPolymorphic(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&)
Full name: Parser::addPolymorphic(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&)
Source: addpolymorphic.cc
Used By:
parse.cc: Parser::executeAction(int)
addProduction(unsigned int)
Full name: Rules::addProduction(unsigned int)
Source: addproduction.cc
Used By:
augmentgrammar.cc: Rules::augmentGrammar(Symbol*)
openrule.cc: Parser::openRule(std::__cxx11::basic_string, std::allocator > const&)
parse.cc: Parser::executeAction(int)
addProductions(Symbol const*, unsigned int)
Full name: State::addProductions(Symbol const*, unsigned int)
Source: addproductions.cc
Used By:
addnext.cc: State::addNext(Symbol const*, unsigned int)
addState(std::vector > const&)
Full name: State::addState(std::vector > const&)
Source: addstate.cc
Used By:
nextstate.cc: State::nextState(Next&)
addToKernel(std::vector >&, Symbol const*, unsigned int)
Full name: Next::addToKernel(std::vector >&, Symbol const*, unsigned int)
Source: addtokernel.cc
Used By:
notreducible.cc: State::notReducible(unsigned int)
assign(std::__cxx11::basic_string, std::allocator >*, Options::PathType, char const*)
Full name: Options::assign(std::__cxx11::basic_string, std::allocator >*, Options::PathType, char const*)
Source: assign.cc
Used By:
parse.cc: Parser::executeAction(int)
AtDollar(AtDollar::Type, unsigned int, unsigned int, std::__cxx11::basic_string, std::allocator > const&, int, bool)
Full name: AtDollar::AtDollar(AtDollar::Type, unsigned int, unsigned int, std::__cxx11::basic_string, std::allocator > const&, int, bool)
Source: atdollar1.cc
Used By:
atindex.cc: Block::atIndex(unsigned int, std::__cxx11::basic_string, std::allocator > const&)
dollar.cc: Block::dollar(unsigned int, std::__cxx11::basic_string, std::allocator > const&, bool)
dollarindex.cc: Block::dollarIndex(unsigned int, std::__cxx11::basic_string, std::allocator > const&, bool)
AtDollar(AtDollar::Type, unsigned int, unsigned int, std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&, int)
Full name: AtDollar::AtDollar(AtDollar::Type, unsigned int, unsigned int, std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&, int)
Source: atdollar2.cc
Used By:
iddollar.cc: Block::IDdollar(unsigned int, std::__cxx11::basic_string, std::allocator > const&)
idindex.cc: Block::IDindex(unsigned int, std::__cxx11::basic_string, std::allocator > const&)
atElse(bool&) const
Full name: Generator::atElse(bool&) const
Source: atelse.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
atEnd(bool&) const
Full name: Generator::atEnd(bool&) const
Source: atend.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
atIndex(unsigned int, std::__cxx11::basic_string, std::allocator > const&)
Full name: Block::atIndex(unsigned int, std::__cxx11::basic_string, std::allocator > const&)
Source: atindex.cc
Used By:
lex.cc: Scanner::executeAction__(unsigned int)
augmentGrammar(Symbol*)
Full name: Rules::augmentGrammar(Symbol*)
Source: augmentgrammar.cc
Used By:
cleanup.cc: Parser::cleanup()
baseClass(std::ostream&) const
Full name: Generator::baseClass(std::ostream&) const
Source: baseclass.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
becomesDerivable(Production const*)
Full name: Grammar::becomesDerivable(Production const*)
Source: becomesderivable.cc
Used By:
derivable.cc: Grammar::derivable(Symbol const*)
beyondDotIsNonTerminal() const
Full name: Item::beyondDotIsNonTerminal() const
Source: beyonddotisnonterminal.cc
Used By:
distributelasetof.cc: State::distributeLAsetOf(StateItem&)
bolAt(std::ostream&, std::__cxx11::basic_string, std::allocator >&, std::istream&, bool&) const
Full name: Generator::bolAt(std::ostream&, std::__cxx11::basic_string, std::allocator >&, std::istream&, bool&) const
Source: bolat.cc
Used By:
insert2.cc: Generator::insert(std::ostream&, unsigned int, char const*) const
buildKernel(std::vector >*, std::vector > const&)
Full name: Next::buildKernel(std::vector >*, std::vector > const&)
Source: buildkernel.cc
Used By:
nextstate.cc: State::nextState(Next&)
checkConflicts()
Full name: State::checkConflicts()
Source: checkconflicts.cc
Used By:
define.cc: State::define(Rules const&)
checkEmptyBlocktype()
Full name: Parser::checkEmptyBlocktype()
Source: checkemptyblocktype.cc
Used By:
parse.cc: Parser::executeAction(int)
checkEndOfRawString()
Full name: Scanner::checkEndOfRawString()
Source: checkendofrawstring.cc
Used By:
lex.cc: Scanner::executeAction__(unsigned int)
checkFirstType()
Full name: Parser::checkFirstType()
Source: checkfirsttype.cc
Used By:
handleproductionelement.cc: Parser::handleProductionElement(Meta__::SType&)
installaction.cc: Parser::installAction(Block&)
checkRemoved(std::ostream&) const
Full name: Next::checkRemoved(std::ostream&) const
Source: checkremoved.cc
Used By:
transition.cc: Next::transition(std::ostream&) const
transitionkernel.cc: Next::transitionKernel(std::ostream&) const
checkZeroNumber()
Full name: Scanner::checkZeroNumber()
Source: checkzeronumber.cc
Used By:
hexadecimal.cc: Scanner::hexadecimal()
octal.cc: Scanner::octal()
classH(std::ostream&) const
Full name: Generator::classH(std::ostream&) const
Source: classh.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
classIH(std::ostream&) const
Full name: Generator::classIH(std::ostream&) const
Source: classih.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
cleanDir(std::__cxx11::basic_string, std::allocator >&, bool)
Full name: Options::cleanDir(std::__cxx11::basic_string, std::allocator >&, bool)
Source: cleandir.cc
Used By:
setbasicstrings.cc: Options::setBasicStrings()
clear()
Full name: Block::clear()
Source: clear.cc
Used By:
expectrules.cc: Parser::expectRules()
open.cc: Block::open(unsigned int, std::__cxx11::basic_string, std::allocator > const&)
close()
Full name: Block::close()
Source: close.cc
Used By:
lex.cc: Scanner::executeAction__(unsigned int)
comparePrecedence(Symbol const*, Symbol const*)
Full name: Terminal::comparePrecedence(Symbol const*, Symbol const*)
Source: compareprecedence.cc
Used By:
comparereductions.cc: RRConflict::compareReductions(unsigned int)
solvebyprecedence.cc: Next::solveByPrecedence(Symbol const*) const
compareReductions(unsigned int)
Full name: RRConflict::compareReductions(unsigned int)
Source: comparereductions.cc
Used By:
visitreduction.cc: RRConflict::visitReduction(unsigned int)
computeLAsets()
Full name: State::computeLAsets()
Source: computelasets.cc
Used By:
determinelasets.cc: State::determineLAsets()
construct()
Full name: State::construct()
Source: construct.cc
Used By:
define.cc: State::define(Rules const&)
containsKernelItem(Item const&, unsigned int, std::vector > const&)
Full name: StateItem::containsKernelItem(Item const&, unsigned int, std::vector > const&)
Source: containskernelitem.cc
Used By:
haskernel.cc: State::hasKernel(std::vector > const&) const
cxx11]
Full name: ScannerBase::s_out__[abi:cxx11]
Source: lex.cc
Used By:
checkendofrawstring.cc: Scanner::checkEndOfRawString()
eoln.cc: Scanner::eoln()
handlerawstring.cc: Scanner::rawString()
handlexstring.cc: Scanner::handleXstring(unsigned int)
returnquoted.cc: Scanner::returnQuoted(void (Scanner::*)())
returntypespec.cc: Scanner::returnTypeSpec()
parse.cc: Parser::executeAction(int)
cxx11]
Full name: Parser::s_hiddenName[abi:cxx11]
Source: data.cc
Used By:
nexthiddenname.cc: Parser::nextHiddenName[abi:cxx11]()
cxx11]
Full name: Production::s_fileName[abi:cxx11]
Source: data.cc
Used By:
showconflicts.cc: RRConflict::showConflicts(Rules const&) const
showconflicts.cc: SRConflict::showConflicts(Rules const&) const
production1.cc: Production::Production(Symbol const*, unsigned int)
storeFilename.cc: Production::storeFilename(std::__cxx11::basic_string, std::allocator > const&)
cxx11]
Full name: Generator::s_insert[abi:cxx11]
Source: data.cc
Used By:
insert.cc: Generator::insert(std::ostream&) const
cxx11]()
Full name: Scanner::canonicalQuote[abi:cxx11]()
Source: canonicalquote.cc
Used By:
parse.cc: Parser::executeAction(int)
setprecedence.cc: Parser::setPrecedence(int)
useterminal.cc: Parser::useTerminal()
cxx11]()
Full name: Parser::nextHiddenName[abi:cxx11]()
Source: nexthiddenname.cc
Used By:
nestedblock.cc: Parser::nestedBlock(Block&)
cxx11]() const
Full name: Options::baseclassHeaderName[abi:cxx11]() const
Source: baseclassheadername.cc
Used By:
conflicts.cc: Generator::conflicts() const
cxx11]() const
Full name: Generator::atTokenFunction[abi:cxx11]() const
Source: attokenfunction.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
cxx11]() const
Full name: Generator::atNameSpacedClassname[abi:cxx11]() const
Source: atnamespacedclassname.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
cxx11]() const
Full name: Generator::atClassname[abi:cxx11]() const
Source: atclassname.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
cxx11]() const
Full name: Generator::atMatchedTextFunction[abi:cxx11]() const
Source: atmatchedtextfunction.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
cxx11]() const
Full name: Generator::atLtype[abi:cxx11]() const
Source: atltype.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
cxx11](AtDollar const&) const
Full name: Parser::returnPolymorphic[abi:cxx11](AtDollar const&) const
Source: returnpolymorphic.cc
Used By:
handledollar.cc: Parser::handleDollar(Block&, AtDollar const&, int)
cxx11](AtDollar const&) const
Full name: Parser::returnUnion[abi:cxx11](AtDollar const&) const
Source: returnunion.cc
Used By:
handledollar.cc: Parser::handleDollar(Block&, AtDollar const&, int)
cxx11](Options::PathType, char const*)
Full name: Options::accept[abi:cxx11](Options::PathType, char const*)
Source: accept.cc
Used By:
assign.cc: Options::assign(std::__cxx11::basic_string, std::allocator >*, Options::PathType, char const*)
cxx11](unsigned int) const
Full name: Rules::sType[abi:cxx11](unsigned int) const
Source: stype.cc
Used By:
checkfirsttype.cc: Parser::checkFirstType()
returnpolymorphic.cc: Parser::returnPolymorphic[abi:cxx11](AtDollar const&) const
returnunion.cc: Parser::returnUnion[abi:cxx11](AtDollar const&) const
semtag.cc: Parser::semTag(char const*, AtDollar const&, bool (Parser::*)(std::__cxx11::basic_string, std::allocator > const&) const) const
debug(std::ostream&) const
Full name: Generator::debug(std::ostream&) const
Source: debug.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
debugDecl(std::ostream&) const
Full name: Generator::debugDecl(std::ostream&) const
Source: debugdecl.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
debugFunctions(std::ostream&) const
Full name: Generator::debugFunctions(std::ostream&) const
Source: debugfunctions.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
debugIncludes(std::ostream&) const
Full name: Generator::debugIncludes(std::ostream&) const
Source: debugincludes.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
debugInit(std::ostream&) const
Full name: Generator::debugInit(std::ostream&) const
Source: debuginit.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
debugLookup(std::ostream&) const
Full name: Generator::debugLookup(std::ostream&) const
Source: debuglookup.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
defaultActionReturn(std::ostream&) const
Full name: Generator::defaultActionReturn(std::ostream&) const
Source: defaultactionreturn.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
defineNonTerminal(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&)
Full name: Parser::defineNonTerminal(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&)
Source: definenonterminal.cc
Used By:
nestedblock.cc: Parser::nestedBlock(Block&)
defineTerminal(std::__cxx11::basic_string, std::allocator > const&, Symbol::Type)
Full name: Parser::defineTerminal(std::__cxx11::basic_string, std::allocator > const&, Symbol::Type)
Source: defineterminal.cc
Used By:
definetokenname.cc: Parser::defineTokenName(std::__cxx11::basic_string, std::allocator > const&, bool)
parse.cc: Parser::executeAction(int)
defineTokenName(std::__cxx11::basic_string, std::allocator > const&, bool)
Full name: Parser::defineTokenName(std::__cxx11::basic_string, std::allocator > const&, bool)
Source: definetokenname.cc
Used By:
parse.cc: Parser::executeAction(int)
derivable(Symbol const*)
Full name: Grammar::derivable(Symbol const*)
Source: derivable.cc
Used By:
becomesderivable.cc: Grammar::becomesDerivable(Production const*)
derivesentence.cc: Grammar::deriveSentence()
determineLAsets()
Full name: State::determineLAsets()
Source: determinelasets.cc
Used By:
define.cc: State::define(Rules const&)
dflush__(std::ostream&)
Full name: ScannerBase::dflush__(std::ostream&)
Source: lex.cc
Used By:
checkendofrawstring.cc: Scanner::checkEndOfRawString()
eoln.cc: Scanner::eoln()
handlerawstring.cc: Scanner::rawString()
handlexstring.cc: Scanner::handleXstring(unsigned int)
returnquoted.cc: Scanner::returnQuoted(void (Scanner::*)())
returntypespec.cc: Scanner::returnTypeSpec()
parse.cc: Parser::executeAction(int)
distributeLAsetOf(StateItem&)
Full name: State::distributeLAsetOf(StateItem&)
Source: distributelasetof.cc
Used By:
computelasets.cc: State::computeLAsets()
dollar(unsigned int, std::__cxx11::basic_string, std::allocator > const&, bool)
Full name: Block::dollar(unsigned int, std::__cxx11::basic_string, std::allocator > const&, bool)
Source: dollar.cc
Used By:
lex.cc: Scanner::executeAction__(unsigned int)
dollarIndex(unsigned int, std::__cxx11::basic_string, std::allocator > const&, bool)
Full name: Block::dollarIndex(unsigned int, std::__cxx11::basic_string, std::allocator > const&, bool)
Source: dollarindex.cc
Used By:
lex.cc: Scanner::executeAction__(unsigned int)
enlargeLA(LookaheadSet const&)
Full name: StateItem::enlargeLA(LookaheadSet const&)
Source: enlargela.cc
Used By:
distributelasetof.cc: State::distributeLAsetOf(StateItem&)
inspecttransitions.cc: State::inspectTransitions(std::set, std::allocator >&)
eoln()
Full name: Scanner::eoln()
Source: eoln.cc
Used By:
lex.cc: Scanner::executeAction__(unsigned int)
errExisting(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&) const
Full name: Generator::errExisting(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&) const
Source: errexisting.cc
Used By:
conflicts.cc: Generator::conflicts() const
errIndexTooLarge(AtDollar const&, int) const
Full name: Parser::errIndexTooLarge(AtDollar const&, int) const
Source: errindextoolarge.cc
Used By:
handleatsign.cc: Parser::handleAtSign(Block&, AtDollar const&, int)
handledollar.cc: Parser::handleDollar(Block&, AtDollar const&, int)
errNoSemantic(char const*, AtDollar const&, std::__cxx11::basic_string, std::allocator > const&) const
Full name: Parser::errNoSemantic(char const*, AtDollar const&, std::__cxx11::basic_string, std::allocator > const&) const
Source: errnosemantic.cc
Used By:
semtag.cc: Parser::semTag(char const*, AtDollar const&, bool (Parser::*)(std::__cxx11::basic_string, std::allocator > const&) const) const
error(char const*)
Full name: Parser::error(char const*)
Source: error.cc
Used By:
parse.cc: Parser::errorRecovery()
errorVerbose(std::ostream&) const
Full name: Generator::errorVerbose(std::ostream&) const
Source: errorverbose.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
escape()
Full name: Scanner::escape()
Source: escape.cc
Used By:
lex.cc: Scanner::executeAction__(unsigned int)
expectRules()
Full name: Parser::expectRules()
Source: expectrules.cc
Used By:
parse.cc: Parser::executeAction(int)
filename(std::__cxx11::basic_string, std::allocator > const&)
Full name: Generator::filename(std::__cxx11::basic_string, std::allocator > const&)
Source: filename.cc
Used By:
baseclass.cc: Generator::baseClass(std::ostream&) const
classh.cc: Generator::classH(std::ostream&) const
classih.cc: Generator::classIH(std::ostream&) const
filter(std::istream&, std::ostream&, bool) const
Full name: Generator::filter(std::istream&, std::ostream&, bool) const
Source: filter.cc
Used By:
baseclassheader.cc: Generator::baseClassHeader() const
classheader.cc: Generator::classHeader() const
implementationheader.cc: Generator::implementationHeader() const
parsefunction.cc: Generator::parseFunction() const
polymorphic.cc: Generator::polymorphic(std::ostream&) const
polymorphicinline.cc: Generator::polymorphicInline(std::ostream&) const
findKernel(std::vector > const&) const
Full name: State::findKernel(std::vector > const&) const
Source: findkernel.cc
Used By:
nextstate.cc: State::nextState(Next&)
firstBeyondDot(FirstSet*) const
Full name: Item::firstBeyondDot(FirstSet*) const
Source: firstbeyonddot.cc
Used By:
distributelasetof.cc: State::distributeLAsetOf(StateItem&)
FirstSet(Element const*)
Full name: FirstSet::FirstSet(Element const*)
Source: firstset1.cc
Used By:
terminal1.cc: Terminal::Terminal(std::__cxx11::basic_string, std::allocator > const&, Symbol::Type, unsigned int, Terminal::Association, std::__cxx11::basic_string, std::allocator > const&)
terminal2.cc: Terminal::Terminal(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&, Symbol::Type)
grep(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&) const
Full name: Generator::grep(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&) const
Source: grep.cc
Used By:
errexisting.cc: Generator::errExisting(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&) const
handleAtSign(Block&, AtDollar const&, int)
Full name: Parser::handleAtSign(Block&, AtDollar const&, int)
Source: handleatsign.cc
Used By:
substituteblock.cc: Parser::substituteBlock(int, Block&)
handleDollar(Block&, AtDollar const&, int)
Full name: Parser::handleDollar(Block&, AtDollar const&, int)
Source: handledollar.cc
Used By:
substituteblock.cc: Parser::substituteBlock(int, Block&)
handleProductionElement(Meta__::SType&)
Full name: Parser::handleProductionElement(Meta__::SType&)
Source: handleproductionelement.cc
Used By:
parse.cc: Parser::executeAction(int)
handleProductionElements(Meta__::SType&, Meta__::SType const&)
Full name: Parser::handleProductionElements(Meta__::SType&, Meta__::SType const&)
Source: handleproductionelements.cc
Used By:
parse.cc: Parser::executeAction(int)
handleSRconflict(unsigned int, __gnu_cxx::__normal_iterator > > const&, unsigned int)
Full name: SRConflict::handleSRconflict(unsigned int, __gnu_cxx::__normal_iterator > > const&, unsigned int)
Source: handlesrconflict.cc
Used By:
processshiftreduceconflict.cc: SRConflict::processShiftReduceConflict(__gnu_cxx::__normal_iterator > > const&, unsigned int)
handleXstring(unsigned int)
Full name: Scanner::handleXstring(unsigned int)
Source: handlexstring.cc
Used By:
lex.cc: Scanner::executeAction__(unsigned int)
hasKernel(std::vector > const&) const
Full name: State::hasKernel(std::vector > const&) const
Source: haskernel.cc
Used By:
findkernel.cc: State::findKernel(std::vector > const&) const
hexadecimal()
Full name: Scanner::hexadecimal()
Source: hexadecimal.cc
Used By:
lex.cc: Scanner::executeAction__(unsigned int)
IDdollar(unsigned int, std::__cxx11::basic_string, std::allocator > const&)
Full name: Block::IDdollar(unsigned int, std::__cxx11::basic_string, std::allocator > const&)
Source: iddollar.cc
Used By:
lex.cc: Scanner::executeAction__(unsigned int)
IDindex(unsigned int, std::__cxx11::basic_string, std::allocator > const&)
Full name: Block::IDindex(unsigned int, std::__cxx11::basic_string, std::allocator > const&)
Source: idindex.cc
Used By:
lex.cc: Scanner::executeAction__(unsigned int)
ifInsertStype(bool&) const
Full name: Generator::ifInsertStype(bool&) const
Source: ifinsertstype.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
ifLtype(bool&) const
Full name: Generator::ifLtype(bool&) const
Source: ifltype.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
ifPrintTokens(bool&) const
Full name: Generator::ifPrintTokens(bool&) const
Source: ifprinttokens.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
ifThreadSafe(bool&) const
Full name: Generator::ifThreadSafe(bool&) const
Source: ifthreadsafe.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
indexToOffset(int, int) const
Full name: Parser::indexToOffset(int, int) const
Source: indextooffset.cc
Used By:
handleatsign.cc: Parser::handleAtSign(Block&, AtDollar const&, int)
handledollar.cc: Parser::handleDollar(Block&, AtDollar const&, int)
substituteblock.cc: Parser::substituteBlock(int, Block&)
initialState()
Full name: State::initialState()
Source: initialstate.cc
Used By:
define.cc: State::define(Rules const&)
insert(NonTerminal*)
Full name: Rules::insert(NonTerminal*)
Source: insert2.cc
Used By:
augmentgrammar.cc: Rules::augmentGrammar(Symbol*)
definenonterminal.cc: Parser::defineNonTerminal(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&)
requirenonterminal.cc: Parser::requireNonTerminal(std::__cxx11::basic_string, std::allocator > const&)
usesymbol.cc: Parser::useSymbol()
insert(std::ostream&) const
Full name: SRConflict::insert(std::ostream&) const
Source: insert.cc
Used By:
insertext.cc: State::insertExt(std::ostream&) const
insertstd.cc: State::insertStd(std::ostream&) const
insert(std::ostream&) const
Full name: LookaheadSet::insert(std::ostream&) const
Source: insert.cc
Used By:
operatorinsert.cc: operator<<(std::ostream&, LookaheadSet const&)
insert(std::ostream&) const
Full name: FirstSet::insert(std::ostream&) const
Source: oinsert.cc
Used By:
showfirst.cc: GLOBALS showfirst.cc 12showfirst.o
insertext.cc: GLOBALS insertext.cc 25insertext.o
insert(std::ostream&) const
Full name: RRConflict::insert(std::ostream&) const
Source: insert.cc
Used By:
insertext.cc: State::insertExt(std::ostream&) const
insertstd.cc: State::insertStd(std::ostream&) const
insert(std::ostream&) const
Full name: Generator::insert(std::ostream&) const
Source: insert.cc
Used By:
filter.cc: Generator::filter(std::istream&, std::ostream&, bool) const
insert(std::ostream&) const
Full name: NonTerminal::insert(std::ostream&) const
Source: v.cc
Used By:
destructor.cc: NonTerminal::~NonTerminal()
insert(std::ostream&, Production const*) const
Full name: Item::insert(std::ostream&, Production const*) const
Source: insert.cc
Used By:
plainitem.cc: Item::plainItem(std::ostream&) const
pnrdotitem.cc: Item::pNrDotItem(std::ostream&) const
insert(std::ostream&, unsigned int, char const*) const
Full name: Generator::insert(std::ostream&, unsigned int, char const*) const
Source: insert2.cc
Used By:
debugdecl.cc: Generator::debugDecl(std::ostream&) const
debugfunctions.cc: Generator::debugFunctions(std::ostream&) const
debugincludes.cc: Generator::debugIncludes(std::ostream&) const
debuglookup.cc: Generator::debugLookup(std::ostream&) const
lex.cc: Generator::lex(std::ostream&) const
ltype.cc: Generator::ltype(std::ostream&) const
ltypedata.cc: Generator::ltypeData(std::ostream&) const
print.cc: Generator::print(std::ostream&) const
threading.cc: Generator::threading(std::ostream&) const
insert(std::vector > const&) const
Full name: Writer::insert(std::vector > const&) const
Source: insert.cc
Used By:
tokens.cc: Generator::tokens(std::ostream&) const
insert(Terminal*, std::__cxx11::basic_string, std::allocator > const&)
Full name: Rules::insert(Terminal*, std::__cxx11::basic_string, std::allocator > const&)
Source: insert1.cc
Used By:
defineterminal.cc: Parser::defineTerminal(std::__cxx11::basic_string, std::allocator > const&, Symbol::Type)
predefine.cc: Parser::predefine(Terminal const*)
useterminal.cc: Parser::useTerminal()
insertAction(Production const*, std::ostream&, bool, unsigned int)
Full name: Production::insertAction(Production const*, std::ostream&, bool, unsigned int)
Source: insertaction.cc
Used By:
actioncases.cc: Generator::actionCases(std::ostream&) const
insertExt(std::ostream&) const
Full name: State::insertExt(std::ostream&) const
Source: insertext.cc
Used By:
allstates.cc: State::allStates()
define.cc: State::define(Rules const&)
insertStd(std::ostream&) const
Full name: State::insertStd(std::ostream&) const
Source: insertstd.cc
Used By:
define.cc: State::define(Rules const&)
insertToken(Terminal const*, unsigned int&, std::ostream&)
Full name: Writer::insertToken(Terminal const*, unsigned int&, std::ostream&)
Source: inserttoken.cc
Used By:
insert.cc: Writer::insert(std::vector > const&) const
insName(std::ostream&) const
Full name: NonTerminal::insName(std::ostream&) const
Source: insname.cc
Used By:
showfirst.cc: GLOBALS showfirst.cc 12showfirst.o
insertext.cc: GLOBALS insertext.cc 25insertext.o
inspect()
Full name: RRConflict::inspect()
Source: inspect.cc
Used By:
checkconflicts.cc: State::checkConflicts()
inspect()
Full name: SRConflict::inspect()
Source: inspect.cc
Used By:
checkconflicts.cc: State::checkConflicts()
inspectTransitions(std::set, std::allocator >&)
Full name: State::inspectTransitions(std::set, std::allocator >&)
Source: inspecttransitions.cc
Used By:
determinelasets.cc: State::determineLAsets()
installAction(Block&)
Full name: Parser::installAction(Block&)
Source: installaction.cc
Used By:
handleproductionelement.cc: Parser::handleProductionElement(Meta__::SType&)
instance()
Full name: Options::instance()
Source: instance.cc
Used By:
generator1.cc: Generator::Generator(Rules const&, std::unordered_map, std::allocator >, std::__cxx11::basic_string, std::allocator >, std::hash, std::allocator > >, std::equal_to, std::allocator > >, std::allocator, std::allocator > const, std::__cxx11::basic_string, std::allocator > > > > const&)
parser1.cc: Parser::Parser(Rules&)
intersection(LookaheadSet const&) const
Full name: LookaheadSet::intersection(LookaheadSet const&) const
Source: intersection.cc
Used By:
comparereductions.cc: RRConflict::compareReductions(unsigned int)
isDerivable(Production const*)
Full name: Grammar::isDerivable(Production const*)
Source: isderivable.cc
Used By:
derivable.cc: Grammar::derivable(Symbol const*)
isFirstStypeDefinition() const
Full name: Options::isFirstStypeDefinition() const
Source: isfirststypedef.cc
Used By:
setpolymorphicdecl.cc: Options::setPolymorphicDecl()
setstype.cc: Options::setStype()
setuniondecl.cc: Options::setUnionDecl(std::__cxx11::basic_string, std::allocator > const&)
Item()
Full name: Item::Item()
Source: item0.cc
Used By:
stateitem1.cc: StateItem::StateItem()
Item(Item const*, unsigned int)
Full name: Item::Item(Item const*, unsigned int)
Source: item2.cc
Used By:
buildkernel.cc: Next::buildKernel(std::vector >*, std::vector > const&)
Item(Production const*)
Full name: Item::Item(Production const*)
Source: item1.cc
Used By:
addproductions.cc: State::addProductions(Symbol const*, unsigned int)
initialstate.cc: State::initialState()
itemContext(std::ostream&) const
Full name: StateItem::itemContext(std::ostream&) const
Source: itemcontext.cc
Used By:
insertext.cc: State::insertExt(std::ostream&) const
key(std::ostream&) const
Full name: Generator::key(std::ostream&) const
Source: key.cc
Used By:
actioncases.cc: Generator::actionCases(std::ostream&) const
baseclass.cc: Generator::baseClass(std::ostream&) const
classh.cc: Generator::classH(std::ostream&) const
classih.cc: Generator::classIH(std::ostream&) const
debug.cc: Generator::debug(std::ostream&) const
debugdecl.cc: Generator::debugDecl(std::ostream&) const
debugfunctions.cc: Generator::debugFunctions(std::ostream&) const
debugincludes.cc: Generator::debugIncludes(std::ostream&) const
debuginit.cc: Generator::debugInit(std::ostream&) const
debuglookup.cc: Generator::debugLookup(std::ostream&) const
defaultactionreturn.cc: Generator::defaultActionReturn(std::ostream&) const
errorverbose.cc: Generator::errorVerbose(std::ostream&) const
lex.cc: Generator::lex(std::ostream&) const
ltype.cc: Generator::ltype(std::ostream&) const
ltypedata.cc: Generator::ltypeData(std::ostream&) const
ltypepop.cc: Generator::ltypePop(std::ostream&) const
ltypepush.cc: Generator::ltypePush(std::ostream&) const
ltyperesize.cc: Generator::ltypeResize(std::ostream&) const
ltypestack.cc: Generator::ltypeStack(std::ostream&) const
namespaceclose.cc: Generator::namespaceClose(std::ostream&) const
namespaceopen.cc: Generator::namespaceOpen(std::ostream&) const
namespaceuse.cc: Generator::namespaceUse(std::ostream&) const
polymorphic.cc: Generator::polymorphic(std::ostream&) const
polymorphicinline.cc: Generator::polymorphicInline(std::ostream&) const
polymorphicspecializations.cc: Generator::polymorphicSpecializations(std::ostream&) const
preincludes.cc: Generator::preIncludes(std::ostream&) const
print.cc: Generator::print(std::ostream&) const
requiredtokens.cc: Generator::requiredTokens(std::ostream&) const
scannerh.cc: Generator::scannerH(std::ostream&) const
scannerobject.cc: Generator::scannerObject(std::ostream&) const
staticdata.cc: Generator::staticData(std::ostream&) const
stype.cc: Generator::stype(std::ostream&) const
threading.cc: Generator::threading(std::ostream&) const
tokens.cc: Generator::tokens(std::ostream&) const
lex(std::ostream&) const
Full name: Generator::lex(std::ostream&) const
Source: lex.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
lex__()
Full name: Scanner::lex__()
Source: lex.cc
Used By:
parse.cc: Parser::nextToken()
LookaheadSet(LookaheadSet const&)
Full name: LookaheadSet::LookaheadSet(LookaheadSet const&)
Source: lookaheadset3.cc
Used By:
rrdata1.cc: RRData::RRData(LookaheadSet)
comparereductions.cc: GLOBALS comparereductions.cc 20comparereductions.o
visitreduction.cc: SRConflict::visitReduction(unsigned int)
addkernelitem.cc: GLOBALS addkernelitem.cc 25addkernelitem.o
addproductions.cc: GLOBALS addproductions.cc 25addproductions.o
LookaheadSet(LookaheadSet::EndStatus)
Full name: LookaheadSet::LookaheadSet(LookaheadSet::EndStatus)
Source: lookaheadset1.cc
Used By:
stateitem1.cc: StateItem::StateItem()
stateitem2.cc: StateItem::StateItem(Item const&)
distributelasetof.cc: State::distributeLAsetOf(StateItem&)
initialstate.cc: State::initialState()
lookup(std::__cxx11::basic_string, std::allocator > const&)
Full name: Symtab::lookup(std::__cxx11::basic_string, std::allocator > const&)
Source: lookup.cc
Used By:
cleanup.cc: Parser::cleanup()
definenonterminal.cc: Parser::defineNonTerminal(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&)
defineterminal.cc: Parser::defineTerminal(std::__cxx11::basic_string, std::allocator > const&, Symbol::Type)
requirenonterminal.cc: Parser::requireNonTerminal(std::__cxx11::basic_string, std::allocator > const&)
setprecedence.cc: Parser::setPrecedence(int)
usesymbol.cc: Parser::useSymbol()
useterminal.cc: Parser::useTerminal()
ltype(std::ostream&) const
Full name: Generator::ltype(std::ostream&) const
Source: ltype.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
ltypeData(std::ostream&) const
Full name: Generator::ltypeData(std::ostream&) const
Source: ltypedata.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
ltypePop(std::ostream&) const
Full name: Generator::ltypePop(std::ostream&) const
Source: ltypepop.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
ltypePush(std::ostream&) const
Full name: Generator::ltypePush(std::ostream&) const
Source: ltypepush.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
ltypeResize(std::ostream&) const
Full name: Generator::ltypeResize(std::ostream&) const
Source: ltyperesize.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
ltypeStack(std::ostream&) const
Full name: Generator::ltypeStack(std::ostream&) const
Source: ltypestack.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
multiCharQuote()
Full name: Scanner::multiCharQuote()
Source: multicharquote.cc
Used By:
lex.cc: Scanner::executeAction__(unsigned int)
multiplyDefined(Symbol const*)
Full name: Parser::multiplyDefined(Symbol const*)
Source: multiplydefined.cc
Used By:
definenonterminal.cc: Parser::defineNonTerminal(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&)
defineterminal.cc: Parser::defineTerminal(std::__cxx11::basic_string, std::allocator > const&, Symbol::Type)
requirenonterminal.cc: Parser::requireNonTerminal(std::__cxx11::basic_string, std::allocator > const&)
useterminal.cc: Parser::useTerminal()
nameOrValue(std::ostream&) const
Full name: Terminal::nameOrValue(std::ostream&) const
Source: nameorvalue.cc
Used By:
reductionsymbol.cc: Writer::reductionSymbol(Element const*, unsigned int, FBB::Table&)
transition.cc: Writer::transition(Next const&, FBB::Table&)
namespaceClose(std::ostream&) const
Full name: Generator::namespaceClose(std::ostream&) const
Source: namespaceclose.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
namespaceOpen(std::ostream&) const
Full name: Generator::namespaceOpen(std::ostream&) const
Source: namespaceopen.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
namespaceUse(std::ostream&) const
Full name: Generator::namespaceUse(std::ostream&) const
Source: namespaceuse.cc
Used By:
data.cc: GLOBALS data.cc 28data.o
negativeIndex(AtDollar const&) const
Full name: Parser::negativeIndex(AtDollar const&) const
Source: negativeindex.cc
Used By:
semtag.cc: Parser::semTag(char const*, AtDollar const&, bool (Parser::*)(std::__cxx11::basic_string, std::allocator > const&) const) const
warnautoignored.cc: Parser::warnAutoIgnored(char const*, AtDollar const&) const
nestedBlock(Block&)
Full name: Parser::nestedBlock(Block&)
Source: nestedblock.cc
Used By:
handleproductionelements.cc: Parser::handleProductionElements(Meta__::SType&, Meta__::SType const&)
newRule(NonTerminal*, std::__cxx11::basic_string, std::allocator > const&, unsigned int)
Full name: Rules::newRule(NonTerminal*, std::__cxx11::basic_string, std::allocator > const&, unsigned int)
Source: newrule.cc
Used By:
augmentgrammar.cc: Rules::augmentGrammar(Symbol*)
openrule.cc: Parser::openRule(std::__cxx11::basic_string, std::allocator > const&)
newState()
Full name: State::newState()
Source: newstate.cc
Used By:
addstate.cc: State::addState(std::vector > const&)
initialstate.cc: State::initialState()
Next(Symbol const*, unsigned int)
Full name: Next::Next(Symbol const*, unsigned int)
Source: next2.cc
Used By:
addnext.cc: State::addNext(Symbol const*, unsigned int)
nextFind(Symbol const*) const
Full name: State::nextFind(Symbol const*) const
Source: nextfindfrom.cc
Used By:
nexton.cc: State::nextOn(Symbol const*) const
notreducible.cc: State::notReducible(unsigned int)
nextState(Next&)
Full name: State::nextState(Next&)
Source: nextstate.cc
Used By:
construct.cc: State::construct()
NonTerminal(std::__cxx11::basic_string, std::allocator > const&, std::__cxx11::basic_string, std::allocator > const&, Symbol::Type)
Full name: NonTerminal::NonTerminal(std::__cxx11::basic_string