Future/bison
1
0
Fork 0
mirror of https://git.savannah.gnu.org/git/bison.git synced 2026-03-09 04:13:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

doc: fix spello

Browse Source 
* doc/bison.texi (Multiple start-symbols): here.
This commit is contained in:
Akim Demaille
2021-08-03 12:22:15 +02:00
parent 952479fca7
commit b293d4fbca
1 changed files with 7 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
doc/bison.texi
View File

@@ -15418,15 +15418,14 @@ invited to consult the dedicated literature.
@quotation
I have several closely related grammars, and I would like to share their
implementations. In fact, I could use a single grammar but with
multiple entry points.
implementations. In fact, I could use a single grammar but with multiple
entry points.
@end quotation
Bison does not support multiple start-symbols, but there is a very
simple means to simulate them. If @code{foo} and @code{bar} are the two
pseudo start-symbols, then introduce two new tokens, say
@code{START_FOO} and @code{START_BAR}, and use them as switches from the
real start-symbol:
Bison does not support multiple start-symbols, but there is a very simple
means to simulate them. If @code{foo} and @code{bar} are the two pseudo
start-symbols, then introduce two new tokens, say @code{START_FOO} and
@code{START_BAR}, and use them as switches from the real start-symbol:
@example
%token START_FOO START_BAR;
@@ -15436,7 +15435,7 @@ start:
| START_BAR bar;
@end example
These tokens prevents the introduction of new conflicts. As far as the
These tokens prevent the introduction of new conflicts. As far as the
parser goes, that is all that is needed.
Now the difficult part is ensuring that the scanner will send these tokens