home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Frozen Fish 1: Amiga
/
FrozenFish-Apr94.iso
/
bbs
/
gnu
/
groff-1.09-src.lha
/
src
/
amiga
/
groff-1.09
/
eqn
/
eqn.cc
< prev
next >
Wrap
C/C++ Source or Header
|
1994-02-21
|
42KB
|
1,343 lines
/* A Bison parser, made from /ISO/groff/groff-1.09-amiga/eqn/eqn.y with Bison version GNU Bison version 1.22
*/
#define YYBISON 1 /* Identify Bison output. */
#define OVER 258
#define SMALLOVER 259
#define SQRT 260
#define SUB 261
#define SUP 262
#define LPILE 263
#define RPILE 264
#define CPILE 265
#define PILE 266
#define LEFT 267
#define RIGHT 268
#define TO 269
#define FROM 270
#define SIZE 271
#define FONT 272
#define ROMAN 273
#define BOLD 274
#define ITALIC 275
#define FAT 276
#define ACCENT 277
#define BAR 278
#define UNDER 279
#define ABOVE 280
#define TEXT 281
#define QUOTED_TEXT 282
#define FWD 283
#define BACK 284
#define DOWN 285
#define UP 286
#define MATRIX 287
#define COL 288
#define LCOL 289
#define RCOL 290
#define CCOL 291
#define MARK 292
#define LINEUP 293
#define TYPE 294
#define VCENTER 295
#define PRIME 296
#define SPLIT 297
#define NOSPLIT 298
#define UACCENT 299
#define SPECIAL 300
#define SPACE 301
#define GFONT 302
#define GSIZE 303
#define DEFINE 304
#define NDEFINE 305
#define TDEFINE 306
#define SDEFINE 307
#define UNDEF 308
#define IFDEF 309
#define INCLUDE 310
#define DELIM 311
#define CHARTYPE 312
#define SET 313
#define GRFONT 314
#define GBFONT 315
#line 19 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
#include <stdio.h>
#include </gnu/include/string.h>
#include <stdlib.h>
#include "lib.h"
#include "box.h"
extern int non_empty_flag;
char *strsave(const char *);
int yylex();
void yyerror(const char *);
#line 32 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
typedef union {
char *str;
box *b;
pile_box *pb;
matrix_box *mb;
int n;
column *col;
} YYSTYPE;
#ifndef YYLTYPE
typedef
struct yyltype
{
int timestamp;
int first_line;
int first_column;
int last_line;
int last_column;
char *text;
}
yyltype;
#define YYLTYPE yyltype
#endif
#include <stdio.h>
#ifndef __cplusplus
#ifndef __STDC__
#define const
#endif
#endif
#define YYFINAL 142
#define YYFLAG -32768
#define YYNTBASE 66
#define YYTRANSLATE(x) ((unsigned)(x) <= 315 ? yytranslate[x] : 83)
static const char yytranslate[] = { 0,
2, 2, 2, 2, 2, 2, 2, 2, 63, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 61, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 64, 2, 65, 62, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 1, 2, 3, 4, 5,
6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
16, 17, 18, 19, 20, 21, 22, 23, 24, 25,
26, 27, 28, 29, 30, 31, 32, 33, 34, 35,
36, 37, 38, 39, 40, 41, 42, 43, 44, 45,
46, 47, 48, 49, 50, 51, 52, 53, 54, 55,
56, 57, 58, 59, 60
};
#if YYDEBUG != 0
static const short yyprhs[] = { 0,
0, 1, 3, 5, 8, 10, 13, 16, 18, 22,
26, 32, 38, 40, 43, 47, 51, 53, 57, 59,
63, 69, 71, 73, 76, 79, 81, 83, 85, 89,
92, 95, 98, 101, 106, 112, 116, 119, 122, 125,
129, 133, 136, 139, 142, 145, 149, 153, 157, 161,
165, 169, 173, 176, 180, 182, 184, 188, 192, 197,
199, 202, 204, 208, 212, 217, 220, 223, 226, 229,
231, 233, 235, 237
};
static const short yyrhs[] = { -1,
67, 0, 68, 0, 67, 68, 0, 69, 0, 37,
68, 0, 38, 68, 0, 70, 0, 70, 14, 69,
0, 70, 15, 70, 0, 70, 15, 70, 14, 69,
0, 70, 15, 70, 15, 69, 0, 71, 0, 5,
70, 0, 70, 3, 70, 0, 70, 4, 70, 0,
72, 0, 73, 7, 71, 0, 73, 0, 73, 6,
72, 0, 73, 6, 73, 7, 71, 0, 26, 0,
27, 0, 42, 27, 0, 43, 26, 0, 61, 0,
62, 0, 63, 0, 64, 67, 65, 0, 11, 76,
0, 8, 76, 0, 9, 76, 0, 10, 76, 0,
32, 64, 77, 65, 0, 12, 82, 67, 13, 82,
0, 12, 82, 67, 0, 73, 23, 0, 73, 24,
0, 73, 41, 0, 73, 22, 73, 0, 73, 44,
73, 0, 18, 73, 0, 19, 73, 0, 20, 73,
0, 21, 73, 0, 17, 81, 73, 0, 16, 81,
73, 0, 28, 74, 73, 0, 29, 74, 73, 0,
31, 74, 73, 0, 30, 74, 73, 0, 39, 81,
73, 0, 40, 73, 0, 45, 81, 73, 0, 81,
0, 67, 0, 75, 25, 67, 0, 64, 75, 65,
0, 74, 64, 75, 65, 0, 80, 0, 77, 80,
0, 67, 0, 78, 25, 67, 0, 64, 78, 65,
0, 74, 64, 78, 65, 0, 33, 79, 0, 34,
79, 0, 35, 79, 0, 36, 79, 0, 26, 0,
27, 0, 81, 0, 64, 0, 65, 0
};
#endif
#if YYDEBUG != 0
static const short yyrline[] = { 0,
123, 125, 129, 132, 142, 145, 147, 151, 154, 156,
158, 160, 164, 167, 169, 171, 175, 178, 182, 185,
187, 191, 194, 196, 198, 200, 202, 204, 206, 208,
210, 212, 214, 216, 218, 220, 222, 224, 226, 228,
230, 232, 234, 236, 238, 240, 242, 244, 246, 248,
250, 252, 254, 256, 260, 270, 273, 277, 280, 284,
287, 291, 294, 298, 301, 305, 308, 310, 312, 316,
318, 322, 325, 327
};
static const char * const yytname[] = { "$","error","$illegal.","OVER","SMALLOVER",
"SQRT","SUB","SUP","LPILE","RPILE","CPILE","PILE","LEFT","RIGHT","TO","FROM",
"SIZE","FONT","ROMAN","BOLD","ITALIC","FAT","ACCENT","BAR","UNDER","ABOVE","TEXT",
"QUOTED_TEXT","FWD","BACK","DOWN","UP","MATRIX","COL","LCOL","RCOL","CCOL","MARK",
"LINEUP","TYPE","VCENTER","PRIME","SPLIT","NOSPLIT","UACCENT","SPECIAL","SPACE",
"GFONT","GSIZE","DEFINE","NDEFINE","TDEFINE","SDEFINE","UNDEF","IFDEF","INCLUDE",
"DELIM","CHARTYPE","SET","GRFONT","GBFONT","'^'","'~'","'\\t'","'{'","'}'","top",
"equation","mark","from_to","sqrt_over","script","nonsup","simple","number",
"pile_element_list","pile_arg","column_list","column_element_list","column_arg",
"column","text","delim",""
};
#endif
static const short yyr1[] = { 0,
66, 66, 67, 67, 68, 68, 68, 69, 69, 69,
69, 69, 70, 70, 70, 70, 71, 71, 72, 72,
72, 73, 73, 73, 73, 73, 73, 73, 73, 73,
73, 73, 73, 73, 73, 73, 73, 73, 73, 73,
73, 73, 73, 73, 73, 73, 73, 73, 73, 73,
73, 73, 73, 73, 74, 75, 75, 76, 76, 77,
77, 78, 78, 79, 79, 80, 80, 80, 80, 81,
81, 82, 82, 82
};
static const short yyr2[] = { 0,
0, 1, 1, 2, 1, 2, 2, 1, 3, 3,
5, 5, 1, 2, 3, 3, 1, 3, 1, 3,
5, 1, 1, 2, 2, 1, 1, 1, 3, 2,
2, 2, 2, 4, 5, 3, 2, 2, 2, 3,
3, 2, 2, 2, 2, 3, 3, 3, 3, 3,
3, 3, 2, 3, 1, 1, 3, 3, 4, 1,
2, 1, 3, 3, 4, 2, 2, 2, 2, 1,
1, 1, 1, 1
};
static const short yydefact[] = { 1,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 22, 23, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 26, 27, 28, 0,
2, 3, 5, 8, 13, 17, 19, 14, 70, 71,
0, 0, 31, 55, 32, 33, 30, 73, 74, 72,
0, 0, 0, 42, 43, 44, 45, 0, 0, 0,
0, 0, 6, 7, 0, 53, 24, 25, 0, 0,
4, 0, 0, 0, 0, 0, 0, 0, 37, 38,
39, 0, 56, 0, 0, 36, 47, 46, 48, 49,
51, 50, 0, 0, 0, 0, 0, 60, 52, 54,
29, 15, 16, 9, 10, 20, 19, 18, 40, 41,
0, 58, 0, 0, 0, 0, 66, 67, 68, 69,
34, 61, 0, 0, 0, 57, 59, 35, 62, 0,
0, 11, 12, 21, 0, 64, 0, 63, 65, 0,
0, 0
};
static const short yydefgoto[] = { 140,
83, 32, 33, 34, 35, 36, 37, 42, 84, 43,
97, 130, 117, 98, 44, 51
};
static const short yypact[] = { 228,
267, 8, 8, 8, 8, 6, 68, 68, 306, 306,
306, 306,-32768,-32768, 68, 68, 68, 68, -51, 228,
228, 68, 306, -12, 5, 68,-32768,-32768,-32768, 228,
228,-32768,-32768, 25,-32768,-32768, 58,-32768,-32768,-32768,
228, -46,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
228, 306, 306, 81, 81, 81, 81, 306, 306, 306,
306, 83,-32768,-32768, 306, 81,-32768,-32768, 306, 128,
-32768, 267, 267, 267, 267, 306, 306, 306,-32768,-32768,
-32768, 306, 228, -9, 228, 189, 81, 81, 81, 81,
81, 81, 11, 11, 11, 11, 12,-32768, 81, 81,
-32768,-32768,-32768,-32768, 64,-32768, 333,-32768,-32768,-32768,
228,-32768, -8, 6, 228, -38,-32768,-32768,-32768,-32768,
-32768,-32768, 267, 267, 306, 228,-32768,-32768, 228, -6,
228,-32768,-32768,-32768, 228,-32768, -5, 228,-32768, 27,
36,-32768
};
static const short yypgoto[] = {-32768,
0, -17, -62, 1, -76, -26, 32, -7, -33, 19,
-32768, -77, 33, -39, -1, -31
};
#define YYLAST 377
static const short yytable[] = { 31,
108, 38, 63, 64, 50, 52, 53, 58, 59, 60,
61, 104, 62, 71, 67, 111, 111, 85, 135, 135,
65, 45, 46, 47, 69, 131, 141, 72, 73, 70,
68, 39, 40, 39, 40, 142, 39, 40, 74, 75,
54, 55, 56, 57, 93, 94, 95, 96, 134, 106,
86, 113, 71, 137, 66, 112, 127, 122, 136, 139,
132, 133, 0, 76, 77, 71, 72, 73, 71, 48,
49, 41, 102, 103, 115, 105, 121, 123, 124, 78,
79, 80, 128, 87, 88, 116, 116, 116, 116, 89,
90, 91, 92, 39, 40, 0, 99, 0, 81, 0,
100, 82, 78, 79, 80, 0, 0, 107, 71, 109,
126, 71, 50, 110, 129, 93, 94, 95, 96, 0,
71, 81, 0, 0, 82, 0, 118, 119, 120, 0,
129, 0, 1, 0, 138, 2, 3, 4, 5, 6,
0, 0, 0, 7, 8, 9, 10, 11, 12, 0,
0, 0, 0, 13, 14, 15, 16, 17, 18, 19,
0, 0, 0, 0, 20, 21, 22, 23, 0, 24,
25, 0, 26, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 27, 28,
29, 30, 101, 1, 0, 0, 2, 3, 4, 5,
6, 114, 0, 0, 7, 8, 9, 10, 11, 12,
0, 0, 0, 0, 13, 14, 15, 16, 17, 18,
19, 0, 0, 0, 0, 20, 21, 22, 23, 0,
24, 25, 1, 26, 0, 2, 3, 4, 5, 6,
0, 0, 0, 7, 8, 9, 10, 11, 12, 27,
28, 29, 30, 13, 14, 15, 16, 17, 18, 19,
0, 0, 0, 0, 20, 21, 22, 23, 0, 24,
25, 1, 26, 0, 2, 3, 4, 5, 6, 0,
0, 0, 7, 8, 9, 10, 11, 12, 27, 28,
29, 30, 13, 14, 15, 16, 17, 18, 19, 0,
0, 0, 0, 0, 0, 22, 23, 0, 24, 25,
0, 26, 0, 2, 3, 4, 5, 6, 0, 0,
0, 7, 8, 9, 10, 11, 12, 27, 28, 29,
30, 13, 14, 15, 16, 17, 18, 19, 76, 125,
0, 0, 0, 0, 22, 23, 0, 24, 25, 0,
26, 0, 0, 0, 78, 79, 80, 0, 0, 0,
0, 0, 0, 0, 0, 0, 27, 28, 29, 30,
0, 0, 0, 81, 0, 0, 82
};
static const short yycheck[] = { 0,
77, 1, 20, 21, 6, 7, 8, 15, 16, 17,
18, 74, 64, 31, 27, 25, 25, 64, 25, 25,
22, 3, 4, 5, 26, 64, 0, 3, 4, 30,
26, 26, 27, 26, 27, 0, 26, 27, 14, 15,
9, 10, 11, 12, 33, 34, 35, 36, 125, 76,
51, 85, 70, 131, 23, 65, 65, 97, 65, 65,
123, 124, -1, 6, 7, 83, 3, 4, 86, 64,
65, 64, 72, 73, 64, 75, 65, 14, 15, 22,
23, 24, 114, 52, 53, 93, 94, 95, 96, 58,
59, 60, 61, 26, 27, -1, 65, -1, 41, -1,
69, 44, 22, 23, 24, -1, -1, 76, 126, 78,
111, 129, 114, 82, 115, 33, 34, 35, 36, -1,
138, 41, -1, -1, 44, -1, 94, 95, 96, -1,
131, -1, 5, -1, 135, 8, 9, 10, 11, 12,
-1, -1, -1, 16, 17, 18, 19, 20, 21, -1,
-1, -1, -1, 26, 27, 28, 29, 30, 31, 32,
-1, -1, -1, -1, 37, 38, 39, 40, -1, 42,
43, -1, 45, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, 61, 62,
63, 64, 65, 5, -1, -1, 8, 9, 10, 11,
12, 13, -1, -1, 16, 17, 18, 19, 20, 21,
-1, -1, -1, -1, 26, 27, 28, 29, 30, 31,
32, -1, -1, -1, -1, 37, 38, 39, 40, -1,
42, 43, 5, 45, -1, 8, 9, 10, 11, 12,
-1, -1, -1, 16, 17, 18, 19, 20, 21, 61,
62, 63, 64, 26, 27, 28, 29, 30, 31, 32,
-1, -1, -1, -1, 37, 38, 39, 40, -1, 42,
43, 5, 45, -1, 8, 9, 10, 11, 12, -1,
-1, -1, 16, 17, 18, 19, 20, 21, 61, 62,
63, 64, 26, 27, 28, 29, 30, 31, 32, -1,
-1, -1, -1, -1, -1, 39, 40, -1, 42, 43,
-1, 45, -1, 8, 9, 10, 11, 12, -1, -1,
-1, 16, 17, 18, 19, 20, 21, 61, 62, 63,
64, 26, 27, 28, 29, 30, 31, 32, 6, 7,
-1, -1, -1, -1, 39, 40, -1, 42, 43, -1,
45, -1, -1, -1, 22, 23, 24, -1, -1, -1,
-1, -1, -1, -1, -1, -1, 61, 62, 63, 64,
-1, -1, -1, 41, -1, -1, 44
};
/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
#line 3 "/usr/lib/bison.simple"
/* Skeleton output parser for bison,
Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman
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 1, 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, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#ifndef alloca
#ifdef __GNUC__
#define alloca __builtin_alloca
#else /* not GNU C. */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi)
#include <alloca.h>
#else /* not sparc */
#if defined (MSDOS) && !defined (__TURBOC__)
#include <malloc.h>
#else /* not MSDOS, or __TURBOC__ */
#if defined(_AIX)
#include <malloc.h>
#pragma alloca
#else /* not MSDOS, __TURBOC__, or _AIX */
#ifdef __hpux
#ifdef __cplusplus
extern "C" {
void *alloca (unsigned int);
};
#else /* not __cplusplus */
void *alloca ();
#endif /* not __cplusplus */
#endif /* __hpux */
#endif /* not _AIX */
#endif /* not MSDOS, or __TURBOC__ */
#endif /* not sparc. */
#endif /* not GNU C. */
#endif /* alloca not defined. */
/* This is the parser code that is written into each bison parser
when the %semantic_parser declaration is not specified in the grammar.
It was written by Richard Stallman by simplifying the hairy parser
used when %semantic_parser is specified. */
/* Note: there must be only one dollar sign in this file.
It is replaced by the list of actions, each action
as one case of the switch. */
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY -2
#define YYEOF 0
#define YYACCEPT return(0)
#define YYABORT return(1)
#define YYERROR goto yyerrlab1
/* Like YYERROR except do call yyerror.
This remains here temporarily to ease the
transition to the new meaning of YYERROR, for GCC.
Once GCC version 2 has supplanted version 1, this can go. */
#define YYFAIL goto yyerrlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(token, value) \
do \
if (yychar == YYEMPTY && yylen == 1) \
{ yychar = (token), yylval = (value); \
yychar1 = YYTRANSLATE (yychar); \
YYPOPSTACK; \
goto yybackup; \
} \
else \
{ yyerror ("syntax error: cannot back up"); YYERROR; } \
while (0)
#define YYTERROR 1
#define YYERRCODE 256
#ifndef YYPURE
#define YYLEX yylex()
#endif
#ifdef YYPURE
#ifdef YYLSP_NEEDED
#define YYLEX yylex(&yylval, &yylloc)
#else
#define YYLEX yylex(&yylval)
#endif
#endif
/* If nonreentrant, generate the variables here */
#ifndef YYPURE
int yychar; /* the lookahead symbol */
YYSTYPE yylval; /* the semantic value of the */
/* lookahead symbol */
#ifdef YYLSP_NEEDED
YYLTYPE yylloc; /* location data for the lookahead */
/* symbol */
#endif
int yynerrs; /* number of parse errors so far */
#endif /* not YYPURE */
#if YYDEBUG != 0
int yydebug; /* nonzero means print parse trace */
/* Since this is uninitialized, it does not stop multiple parsers
from coexisting. */
#endif
/* YYINITDEPTH indicates the initial size of the parser's stacks */
#ifndef YYINITDEPTH
#define YYINITDEPTH 200
#endif
/* YYMAXDEPTH is the maximum size the stacks can grow to
(effective only if the built-in stack extension method is used). */
#if YYMAXDEPTH == 0
#undef YYMAXDEPTH
#endif
#ifndef YYMAXDEPTH
#define YYMAXDEPTH 10000
#endif
/* Prevent warning if -Wstrict-prototypes. */
#ifdef __GNUC__
int yyparse (void);
#endif
#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
#define __yy_bcopy(FROM,TO,COUNT) __builtin_memcpy(TO,FROM,COUNT)
#else /* not GNU C or C++ */
#ifndef __cplusplus
/* This is the most reliable way to avoid incompatibilities
in available built-in functions on various systems. */
static void
__yy_bcopy (from, to, count)
char *from;
char *to;
int count;
{
register char *f = from;
register char *t = to;
register int i = count;
while (i-- > 0)
*t++ = *f++;
}
#else /* __cplusplus */
/* This is the most reliable way to avoid incompatibilities
in available built-in functions on various systems. */
static void
__yy_bcopy (char *from, char *to, int count)
{
register char *f = from;
register char *t = to;
register int i = count;
while (i-- > 0)
*t++ = *f++;
}
#endif
#endif
#line 184 "/usr/lib/bison.simple"
int
yyparse()
{
register int yystate;
register int yyn;
register short *yyssp;
register YYSTYPE *yyvsp;
int yyerrstatus; /* number of tokens to shift before error messages enabled */
int yychar1 = 0; /* lookahead token as an internal (translated) token number */
short yyssa[YYINITDEPTH]; /* the state stack */
YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
short *yyss = yyssa; /* refer to the stacks thru separate pointers */
YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */
#ifdef YYLSP_NEEDED
YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
YYLTYPE *yyls = yylsa;
YYLTYPE *yylsp;
#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
#else
#define YYPOPSTACK (yyvsp--, yyssp--)
#endif
int yystacksize = YYINITDEPTH;
#ifdef YYPURE
int yychar;
YYSTYPE yylval;
int yynerrs;
#ifdef YYLSP_NEEDED
YYLTYPE yylloc;
#endif
#endif
YYSTYPE yyval; /* the variable used to return */
/* semantic values from the action */
/* routines */
int yylen;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Starting parse\n");
#endif
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
/* Initialize stack pointers.
Waste one element of value and location stack
so that they stay on the same level as the state stack.
The wasted elements are never initialized. */
yyssp = yyss - 1;
yyvsp = yyvs;
#ifdef YYLSP_NEEDED
yylsp = yyls;
#endif
/* Push a new state, which is found in yystate . */
/* In all cases, when you get here, the value and location stacks
have just been pushed. so pushing a state here evens the stacks. */
yynewstate:
*++yyssp = yystate;
if (yyssp >= yyss + yystacksize - 1)
{
/* Give user a chance to reallocate the stack */
/* Use copies of these so that the &'s don't force the real ones into memory. */
YYSTYPE *yyvs1 = yyvs;
short *yyss1 = yyss;
#ifdef YYLSP_NEEDED
YYLTYPE *yyls1 = yyls;
#endif
/* Get the current used size of the three stacks, in elements. */
int size = yyssp - yyss + 1;
#ifdef yyoverflow
/* Each stack pointer address is followed by the size of
the data in use in that stack, in bytes. */
#ifdef YYLSP_NEEDED
/* This used to be a conditional around just the two extra args,
but that might be undefined if yyoverflow is a macro. */
yyoverflow("parser stack overflow",
&yyss1, size * sizeof (*yyssp),
&yyvs1, size * sizeof (*yyvsp),
&yyls1, size * sizeof (*yylsp),
&yystacksize);
#else
yyoverflow("parser stack overflow",
&yyss1, size * sizeof (*yyssp),
&yyvs1, size * sizeof (*yyvsp),
&yystacksize);
#endif
yyss = yyss1; yyvs = yyvs1;
#ifdef YYLSP_NEEDED
yyls = yyls1;
#endif
#else /* no yyoverflow */
/* Extend the stack our own way. */
if (yystacksize >= YYMAXDEPTH)
{
yyerror("parser stack overflow");
return 2;
}
yystacksize *= 2;
if (yystacksize > YYMAXDEPTH)
yystacksize = YYMAXDEPTH;
yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
__yy_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
__yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
__yy_bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
#endif
#endif /* no yyoverflow */
yyssp = yyss + size - 1;
yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
yylsp = yyls + size - 1;
#endif
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif
if (yyssp >= yyss + yystacksize - 1)
YYABORT;
}
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Entering state %d\n", yystate);
#endif
goto yybackup;
yybackup:
/* Do appropriate processing given the current state. */
/* Read a lookahead token if we need one and don't already have one. */
/* yyresume: */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* yychar is either YYEMPTY or YYEOF
or a valid token in external form. */
if (yychar == YYEMPTY)
{
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Reading a token: ");
#endif
yychar = YYLEX;
}
/* Convert token to internal form (in yychar1) for indexing tables with */
if (yychar <= 0) /* This means end of input. */
{
yychar1 = 0;
yychar = YYEOF; /* Don't call YYLEX any more */
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Now at end of input.\n");
#endif
}
else
{
yychar1 = YYTRANSLATE(yychar);
#if YYDEBUG != 0
if (yydebug)
{
fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
/* Give the individual parser a way to print the precise meaning
of a token, for further debugging info. */
#ifdef YYPRINT
YYPRINT (stderr, yychar, yylval);
#endif
fprintf (stderr, ")\n");
}
#endif
}
yyn += yychar1;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
goto yydefault;
yyn = yytable[yyn];
/* yyn is what to do for this token type in this state.
Negative => reduce, -yyn is rule number.
Positive => shift, yyn is new state.
New state is final state => don't bother to shift,
just return success.
0, or most negative number => error. */
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrlab;
if (yyn == YYFINAL)
YYACCEPT;
/* Shift the lookahead token. */
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
#endif
/* Discard the token being shifted unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
/* count tokens shifted since error; after three, turn off error status. */
if (yyerrstatus) yyerrstatus--;
yystate = yyn;
goto yynewstate;
/* Do the default action for the current state. */
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
/* Do a reduction. yyn is the number of a rule to reduce with. */
yyreduce:
yylen = yyr2[yyn];
if (yylen > 0)
yyval = yyvsp[1-yylen]; /* implement default value of the action */
#if YYDEBUG != 0
if (yydebug)
{
int i;
fprintf (stderr, "Reducing via rule %d (line %d), ",
yyn, yyrline[yyn]);
/* Print the symbols being reduced, and their result. */
for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
fprintf (stderr, "%s ", yytname[yyrhs[i]]);
fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
}
#endif
switch (yyn) {
case 2:
#line 126 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[0].b->top_level(); non_empty_flag = 1; ;
break;}
case 3:
#line 131 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = yyvsp[0].b; ;
break;}
case 4:
#line 133 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{
list_box *lb = yyvsp[-1].b->to_list_box();
if (!lb)
lb = new list_box(yyvsp[-1].b);
lb->append(yyvsp[0].b);
yyval.b = lb;
;
break;}
case 5:
#line 144 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = yyvsp[0].b; ;
break;}
case 6:
#line 146 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_mark_box(yyvsp[0].b); ;
break;}
case 7:
#line 148 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_lineup_box(yyvsp[0].b); ;
break;}
case 8:
#line 153 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = yyvsp[0].b; ;
break;}
case 9:
#line 155 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_limit_box(yyvsp[-2].b, 0, yyvsp[0].b); ;
break;}
case 10:
#line 157 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_limit_box(yyvsp[-2].b, yyvsp[0].b, 0); ;
break;}
case 11:
#line 159 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_limit_box(yyvsp[-4].b, yyvsp[-2].b, yyvsp[0].b); ;
break;}
case 12:
#line 161 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_limit_box(yyvsp[-4].b, make_limit_box(yyvsp[-2].b, yyvsp[0].b, 0), 0); ;
break;}
case 13:
#line 166 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = yyvsp[0].b; ;
break;}
case 14:
#line 168 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_sqrt_box(yyvsp[0].b); ;
break;}
case 15:
#line 170 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_over_box(yyvsp[-2].b, yyvsp[0].b); ;
break;}
case 16:
#line 172 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_small_over_box(yyvsp[-2].b, yyvsp[0].b); ;
break;}
case 17:
#line 177 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = yyvsp[0].b; ;
break;}
case 18:
#line 179 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_script_box(yyvsp[-2].b, 0, yyvsp[0].b); ;
break;}
case 19:
#line 184 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = yyvsp[0].b; ;
break;}
case 20:
#line 186 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_script_box(yyvsp[-2].b, yyvsp[0].b, 0); ;
break;}
case 21:
#line 188 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_script_box(yyvsp[-4].b, yyvsp[-2].b, yyvsp[0].b); ;
break;}
case 22:
#line 193 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = split_text(yyvsp[0].str); ;
break;}
case 23:
#line 195 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new quoted_text_box(yyvsp[0].str); ;
break;}
case 24:
#line 197 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = split_text(yyvsp[0].str); ;
break;}
case 25:
#line 199 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new quoted_text_box(yyvsp[0].str); ;
break;}
case 26:
#line 201 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new half_space_box; ;
break;}
case 27:
#line 203 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new space_box; ;
break;}
case 28:
#line 205 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new tab_box; ;
break;}
case 29:
#line 207 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = yyvsp[-1].b; ;
break;}
case 30:
#line 209 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[0].pb->set_alignment(CENTER_ALIGN); yyval.b = yyvsp[0].pb; ;
break;}
case 31:
#line 211 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[0].pb->set_alignment(LEFT_ALIGN); yyval.b = yyvsp[0].pb; ;
break;}
case 32:
#line 213 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[0].pb->set_alignment(RIGHT_ALIGN); yyval.b = yyvsp[0].pb; ;
break;}
case 33:
#line 215 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[0].pb->set_alignment(CENTER_ALIGN); yyval.b = yyvsp[0].pb; ;
break;}
case 34:
#line 217 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = yyvsp[-1].mb; ;
break;}
case 35:
#line 219 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_delim_box(yyvsp[-3].str, yyvsp[-2].b, yyvsp[0].str); ;
break;}
case 36:
#line 221 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_delim_box(yyvsp[-1].str, yyvsp[0].b, 0); ;
break;}
case 37:
#line 223 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_overline_box(yyvsp[-1].b); ;
break;}
case 38:
#line 225 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_underline_box(yyvsp[-1].b); ;
break;}
case 39:
#line 227 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_prime_box(yyvsp[-1].b); ;
break;}
case 40:
#line 229 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_accent_box(yyvsp[-2].b, yyvsp[0].b); ;
break;}
case 41:
#line 231 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_uaccent_box(yyvsp[-2].b, yyvsp[0].b); ;
break;}
case 42:
#line 233 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new font_box(strsave(get_grfont()), yyvsp[0].b); ;
break;}
case 43:
#line 235 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new font_box(strsave(get_gbfont()), yyvsp[0].b); ;
break;}
case 44:
#line 237 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new font_box(strsave(get_gfont()), yyvsp[0].b); ;
break;}
case 45:
#line 239 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new fat_box(yyvsp[0].b); ;
break;}
case 46:
#line 241 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new font_box(yyvsp[-1].str, yyvsp[0].b); ;
break;}
case 47:
#line 243 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new size_box(yyvsp[-1].str, yyvsp[0].b); ;
break;}
case 48:
#line 245 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new hmotion_box(yyvsp[-1].n, yyvsp[0].b); ;
break;}
case 49:
#line 247 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new hmotion_box(-yyvsp[-1].n, yyvsp[0].b); ;
break;}
case 50:
#line 249 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new vmotion_box(yyvsp[-1].n, yyvsp[0].b); ;
break;}
case 51:
#line 251 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new vmotion_box(-yyvsp[-1].n, yyvsp[0].b); ;
break;}
case 52:
#line 253 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[0].b->set_spacing_type(yyvsp[-1].str); yyval.b = yyvsp[0].b; ;
break;}
case 53:
#line 255 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = new vcenter_box(yyvsp[0].b); ;
break;}
case 54:
#line 257 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.b = make_special_box(yyvsp[-1].str, yyvsp[0].b); ;
break;}
case 55:
#line 262 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{
int n;
if (sscanf(yyvsp[0].str, "%d", &n) == 1)
yyval.n = n;
a_delete yyvsp[0].str;
;
break;}
case 56:
#line 272 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.pb = new pile_box(yyvsp[0].b); ;
break;}
case 57:
#line 274 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[-2].pb->append(yyvsp[0].b); yyval.pb = yyvsp[-2].pb; ;
break;}
case 58:
#line 279 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.pb = yyvsp[-1].pb; ;
break;}
case 59:
#line 281 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[-1].pb->set_space(yyvsp[-3].n); yyval.pb = yyvsp[-1].pb; ;
break;}
case 60:
#line 286 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.mb = new matrix_box(yyvsp[0].col); ;
break;}
case 61:
#line 288 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[-1].mb->append(yyvsp[0].col); yyval.mb = yyvsp[-1].mb; ;
break;}
case 62:
#line 293 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.col = new column(yyvsp[0].b); ;
break;}
case 63:
#line 295 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[-2].col->append(yyvsp[0].b); yyval.col = yyvsp[-2].col; ;
break;}
case 64:
#line 300 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.col = yyvsp[-1].col; ;
break;}
case 65:
#line 302 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[-1].col->set_space(yyvsp[-3].n); yyval.col = yyvsp[-1].col; ;
break;}
case 66:
#line 307 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[0].col->set_alignment(CENTER_ALIGN); yyval.col = yyvsp[0].col; ;
break;}
case 67:
#line 309 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[0].col->set_alignment(LEFT_ALIGN); yyval.col = yyvsp[0].col; ;
break;}
case 68:
#line 311 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[0].col->set_alignment(RIGHT_ALIGN); yyval.col = yyvsp[0].col; ;
break;}
case 69:
#line 313 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyvsp[0].col->set_alignment(CENTER_ALIGN); yyval.col = yyvsp[0].col; ;
break;}
case 70:
#line 317 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.str = yyvsp[0].str; ;
break;}
case 71:
#line 319 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.str = yyvsp[0].str; ;
break;}
case 72:
#line 324 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.str = yyvsp[0].str; ;
break;}
case 73:
#line 326 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.str = strsave("{"); ;
break;}
case 74:
#line 328 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"
{ yyval.str = strsave("}"); ;
break;}
}
/* the action file gets copied in in place of this dollarsign */
#line 465 "/usr/lib/bison.simple"
yyvsp -= yylen;
yyssp -= yylen;
#ifdef YYLSP_NEEDED
yylsp -= yylen;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
*++yyvsp = yyval;
#ifdef YYLSP_NEEDED
yylsp++;
if (yylen == 0)
{
yylsp->first_line = yylloc.first_line;
yylsp->first_column = yylloc.first_column;
yylsp->last_line = (yylsp-1)->last_line;
yylsp->last_column = (yylsp-1)->last_column;
yylsp->text = 0;
}
else
{
yylsp->last_line = (yylsp+yylen-1)->last_line;
yylsp->last_column = (yylsp+yylen-1)->last_column;
}
#endif
/* Now "shift" the result of the reduction.
Determine what state that goes to,
based on the state we popped back to
and the rule number reduced by. */
yyn = yyr1[yyn];
yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTBASE];
goto yynewstate;
yyerrlab: /* here on detecting error */
if (! yyerrstatus)
/* If not already recovering from an error, report this error. */
{
++yynerrs;
#ifdef YYERROR_VERBOSE
yyn = yypact[yystate];
if (yyn > YYFLAG && yyn < YYLAST)
{
int size = 0;
char *msg;
int x, count;
count = 0;
/* Start X at -yyn if nec to avoid negative indexes in yycheck. */
for (x = (yyn < 0 ? -yyn : 0);
x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
size += strlen(yytname[x]) + 15, count++;
msg = (char *) malloc(size + 15);
if (msg != 0)
{
strcpy(msg, "parse error");
if (count < 5)
{
count = 0;
for (x = (yyn < 0 ? -yyn : 0);
x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
{
strcat(msg, count == 0 ? ", expecting `" : " or `");
strcat(msg, yytname[x]);
strcat(msg, "'");
count++;
}
}
yyerror(msg);
free(msg);
}
else
yyerror ("parse error; also virtual memory exceeded");
}
else
#endif /* YYERROR_VERBOSE */
yyerror("parse error");
}
goto yyerrlab1;
yyerrlab1: /* here on error raised explicitly by an action */
if (yyerrstatus == 3)
{
/* if just tried and failed to reuse lookahead token after an error, discard it. */
/* return failure if at end of input */
if (yychar == YYEOF)
YYABORT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif
yychar = YYEMPTY;
}
/* Else will try to reuse lookahead token
after shifting the error token. */
yyerrstatus = 3; /* Each real token shifted decrements this */
goto yyerrhandle;
yyerrdefault: /* current state does not do anything special for the error token. */
#if 0
/* This is wrong; only states that explicitly want error tokens
should shift them. */
yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
if (yyn) goto yydefault;
#endif
yyerrpop: /* pop the current state because it cannot handle the error token */
if (yyssp == yyss) YYABORT;
yyvsp--;
yystate = *--yyssp;
#ifdef YYLSP_NEEDED
yylsp--;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "Error: state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
yyerrhandle:
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yyerrdefault;
yyn += YYTERROR;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
goto yyerrdefault;
yyn = yytable[yyn];
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrpop;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrpop;
if (yyn == YYFINAL)
YYACCEPT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting error token, ");
#endif
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
yystate = yyn;
goto yynewstate;
}
#line 331 "/ISO/groff/groff-1.09-amiga/eqn/eqn.y"