
/*  A Bison parser, made from sesh.y  */

#define YYBISON 1  /* Identify Bison output.  */

#define	TEXTE	258
#define	DEBUTHIEROGS	259
#define	FINHIEROGS	260
#define	HIEROGLYPHE	261
#define	LIGATURE	262
#define	POINT	263
#define	POINTPOINT	264
#define	KERNING	265
#define	DEBUTCONSTRUCTION	266
#define	CARTF	267
#define	DIEZE0	268
#define	DIEZE1	269
#define	ROMAIN	270
#define	GAUCHEDROITE	271
#define	DROITEGAUCHE	272
#define	LEFTRIGHT	273
#define	RIGHTLEFT	274
#define	INTERNALSPACE	275
#define	HACHUREGA	276
#define	HACHUREVA	277
#define	HACHUREHA	278
#define	HACHURETA	279
#define	HACHUREG	280
#define	HACHUREV	281
#define	HACHUREH	282
#define	HACHURET	283
#define	OVERWRITE	284
#define	SIZE	285
#define	ROTATION	286
#define	REVERT	287
#define	TEXTESUPER	288
#define	POINTROUGE	289
#define	POINTNOIR	290
#define	COULEUR0	291
#define	COULEUR1	292
#define	HAPLOGRAPHIE	293
#define	LACUNE	294
#define	LIGNELACUNE	295
#define	DSTSUPERFETATOIRE	296
#define	FSTSUPERFETATOIRE	297
#define	DSTEFFACE	298
#define	FSTEFFACE	299
#define	DSTDISPARU	300
#define	FSTDISPARU	301
#define	DSTRAJOUTSCRIBE	302
#define	FSTRAJOUTSCRIBE	303
#define	DSTRAJOUTAUTEUR	304
#define	FSTRAJOUTAUTEUR	305
#define	SEPARATEUR	306

#line 8 "sesh.y"

#include <malloc.h>
#include "quadra.h"
#include "fonctions.h"

extern void affiche_hiero();
extern void initialise_lex();

#include <stdio.h>
#ifndef NULL
#define NULL 0
#endif

#ifndef TRUE
#define TRUE 1
#define FALSE 0
#endif


#line 28 "sesh.y"
typedef union {
	Quadra * un_quadra;
	Horliste* une_horliste;
	union _Donnees une_donnee;
	Signe un_signe;
	int un_entier;
	Typehachure une_hachure;
	Typegroupe un_typegroupe;
	Typeseparateur un_separateur;
} 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 __STDC__
#define const
#endif



#define	YYFINAL		91
#define	YYFLAG		-32768
#define	YYNTBASE	56

#define YYTRANSLATE(x) ((unsigned)(x) <= 306 ? yytranslate[x] : 72)

static const char yytranslate[] = {     0,
     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,    54,
    55,    53,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,    52,     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,     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
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     3,     6,     7,    12,    16,    19,    24,    25,    27,
    29,    31,    33,    35,    37,    39,    41,    43,    45,    47,
    49,    54,    59,    61,    63,    65,    67,    69,    71,    73,
    77,    81,    83,    87,    91,    93,    97,    98,   101,   103,
   107,   109,   111,   115,   116,   119,   121,   123,   125,   126,
   128,   130,   132,   134,   138,   142,   146,   150
};

#endif

static const short yyrhs[] = {    56,
     3,     0,    56,    57,     0,     0,     4,    58,    59,     5,
     0,     4,    59,     5,     0,    64,    60,     0,    58,    59,
    64,    60,     0,     0,    51,     0,    61,     0,    15,     0,
    38,     0,    16,     0,    17,     0,    39,     0,    40,     0,
    33,     0,    34,     0,    35,     0,    62,     0,    61,    52,
    64,    62,     0,    62,    53,    64,    63,     0,    63,     0,
    65,     0,     8,     0,    25,     0,    27,     0,    26,     0,
    28,     0,    11,    58,    12,     0,    19,    58,    18,     0,
    71,     0,    13,    58,    14,     0,    36,    58,    37,     0,
     9,     0,    54,    58,    55,     0,     0,    64,    10,     0,
    67,     0,    67,    29,    67,     0,     6,     0,     7,     0,
    66,    68,    70,     0,     0,    69,    68,     0,    30,     0,
    31,     0,    32,     0,     0,    21,     0,    23,     0,    22,
     0,    24,     0,    41,    58,    42,     0,    43,    58,    44,
     0,    45,    58,    46,     0,    47,    58,    48,     0,    49,
    58,    50,     0
};

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    81,    82,    83,    86,    89,    92,    97,   108,   110,   113,
   119,   125,   130,   135,   140,   145,   150,   156,   161,   168,
   173,   184,   193,   199,   200,   206,   212,   218,   224,   230,
   236,   242,   243,   249,   255,   261,   268,   272,   278,   279,
   288,   298,   309,   316,   317,   319,   321,   322,   326,   330,
   334,   338,   342,   348,   355,   361,   367,   373
};

static const char * const yytname[] = {   "$","error","$illegal.","TEXTE","DEBUTHIEROGS",
"FINHIEROGS","HIEROGLYPHE","LIGATURE","POINT","POINTPOINT","KERNING","DEBUTCONSTRUCTION",
"CARTF","DIEZE0","DIEZE1","ROMAIN","GAUCHEDROITE","DROITEGAUCHE","LEFTRIGHT",
"RIGHTLEFT","INTERNALSPACE","HACHUREGA","HACHUREVA","HACHUREHA","HACHURETA",
"HACHUREG","HACHUREV","HACHUREH","HACHURET","OVERWRITE","SIZE","ROTATION","REVERT",
"TEXTESUPER","POINTROUGE","POINTNOIR","COULEUR0","COULEUR1","HAPLOGRAPHIE","LACUNE",
"LIGNELACUNE","DSTSUPERFETATOIRE","FSTSUPERFETATOIRE","DSTEFFACE","FSTEFFACE",
"DSTDISPARU","FSTDISPARU","DSTRAJOUTSCRIBE","FSTRAJOUTSCRIBE","DSTRAJOUTAUTEUR",
"FSTRAJOUTAUTEUR","SEPARATEUR","':'","'*'","'('","')'","tout","hierogs","quadras",
"separateur","quadra","sousquadras","sousquadra","inhierliste","kerning","hieroglyphes",
"signe","hieroglyphe","modificateurs","modificateur","hachure","construction_parenthesee",
""
};
#endif

static const short yyr1[] = {     0,
    56,    56,    56,    57,    57,    58,    58,    59,    59,    60,
    60,    60,    60,    60,    60,    60,    60,    60,    60,    61,
    61,    62,    62,    63,    63,    63,    63,    63,    63,    63,
    63,    63,    63,    63,    63,    63,    64,    64,    65,    65,
    66,    66,    67,    68,    68,    69,    69,    69,    70,    70,
    70,    70,    70,    71,    71,    71,    71,    71
};

static const short yyr2[] = {     0,
     2,     2,     0,     4,     3,     2,     4,     0,     1,     1,
     1,     1,     1,     1,     1,     1,     1,     1,     1,     1,
     4,     4,     1,     1,     1,     1,     1,     1,     1,     3,
     3,     1,     3,     3,     1,     3,     0,     2,     1,     3,
     1,     1,     3,     0,     2,     1,     1,     1,     0,     1,
     1,     1,     1,     3,     3,     3,     3,     3
};

static const short yydefact[] = {     3,
     0,     1,    37,     2,     9,     8,     0,     0,    37,     5,
    41,    42,    25,    35,    38,    37,    37,    11,    13,    14,
    37,    26,    28,    27,    29,    17,    18,    19,    37,    12,
    15,    16,    37,    37,    37,    37,    37,    37,     6,    10,
    20,    23,    24,    44,    39,    32,     4,     0,     8,     8,
     8,     8,     8,     8,     8,     8,     8,     8,    37,    37,
    46,    47,    48,    49,    44,     0,     7,    30,    37,    33,
    31,    34,    54,    55,    56,    57,    58,    36,     0,     0,
    50,    52,    51,    53,    43,    45,    40,    21,    22,     0,
     0
};

static const short yydefgoto[] = {     1,
     4,     6,    69,    39,    40,    41,    42,     8,    43,    44,
    45,    64,    65,    85,    46
};

static const short yypact[] = {-32768,
    43,-32768,    10,-32768,-32768,   -25,    34,    -5,    59,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,   -20,
    24,-32768,-32768,    78,    54,-32768,-32768,    -5,    -3,    11,
    19,   -24,   -35,   -27,    12,    27,   -32,   -10,-32768,-32768,
-32768,-32768,-32768,    45,    78,    74,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,    46,    46,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,    24,-32768,    84,
-32768
};

static const short yypgoto[] = {-32768,
-32768,    69,    73,    40,-32768,    13,    14,    -9,-32768,-32768,
    30,    32,-32768,-32768,-32768
};


#define	YYLAST		110


static const short yytable[] = {    48,
    11,    12,    13,    14,    15,    16,    73,    17,    68,    18,
    19,    20,    72,    21,    -8,     5,    74,    77,     5,    22,
    23,    24,    25,     5,    70,     5,     5,    26,    27,    28,
    29,    59,    30,    31,    32,    33,    71,    34,    10,    35,
     5,    36,    90,    37,    78,     2,     3,     5,    38,    79,
    80,    11,    12,    13,    14,    15,    16,    75,    17,    48,
     5,     5,     5,    47,    21,    81,    82,    83,    84,     5,
    22,    23,    24,    25,    76,     7,    60,     5,     9,    11,
    12,    29,    66,    91,    49,    50,    33,    67,    34,    51,
    35,    88,    36,    89,    37,    87,    86,    52,     0,    38,
     0,    53,    54,    55,    56,    57,    58,    61,    62,    63
};

static const short yycheck[] = {     9,
     6,     7,     8,     9,    10,    11,    42,    13,    12,    15,
    16,    17,    37,    19,     5,    51,    44,    50,    51,    25,
    26,    27,    28,    51,    14,    51,    51,    33,    34,    35,
    36,    52,    38,    39,    40,    41,    18,    43,     5,    45,
    51,    47,     0,    49,    55,     3,     4,    51,    54,    59,
    60,     6,     7,     8,     9,    10,    11,    46,    13,    69,
    51,    51,    51,     5,    19,    21,    22,    23,    24,    51,
    25,    26,    27,    28,    48,     3,    53,    51,     6,     6,
     7,    36,    29,     0,    16,    17,    41,    48,    43,    21,
    45,    79,    47,    80,    49,    66,    65,    29,    -1,    54,
    -1,    33,    34,    35,    36,    37,    38,    30,    31,    32
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/local/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__)
#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
#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

#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 169 "/usr/local/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;		/*  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.  */

  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.  */
      yyoverflow("parser stack overflow",
		 &yyss1, size * sizeof (*yyssp),
		 &yyvs1, size * sizeof (*yyvsp),
#ifdef YYLSP_NEEDED
		 &yyls1, size * sizeof (*yylsp),
#endif
		 &yystacksize);

      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

 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];
  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 symboles 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 4:
#line 86 "sesh.y"
{
	affiche_quadras(yyvsp[-2].un_quadra);
;
    break;}
case 6:
#line 93 "sesh.y"
{
	yyval.un_quadra= yyvsp[0].un_quadra;
	yyval.un_quadra->kerning= yyvsp[-1].un_entier;								/* nombre de signes de kerning */
;
    break;}
case 7:
#line 98 "sesh.y"
{
	yyval.un_quadra=yyvsp[-3].un_quadra;
	yyval.un_quadra->last->next= yyvsp[0].un_quadra;
	yyvsp[0].un_quadra->previous= yyval.un_quadra->last;
	yyval.un_quadra->last->separateur= yyvsp[-2].un_separateur;
	yyval.un_quadra->last=yyvsp[0].un_quadra;
	yyvsp[0].un_quadra->kerning= yyvsp[-1].un_entier;
;
    break;}
case 8:
#line 109 "sesh.y"
{ yyval.un_separateur= S_intersignes; ;
    break;}
case 10:
#line 114 "sesh.y"
{
	yyval.un_quadra= new_quadra(S_quadra);
	yyval.un_quadra->kerning= 0;
	yyval.un_quadra->contenu.horizontal= yyvsp[0].une_horliste;
;
    break;}
case 11:
#line 120 "sesh.y"
{
	yyval.un_quadra= new_signe(S_romain);
	yyval.un_quadra->kerning= 0;
	yyval.un_quadra->contenu.un_signe.donnees= yyvsp[0].une_donnee;
;
    break;}
case 12:
#line 126 "sesh.y"
{
	yyval.un_quadra= new_signe(S_haplographie);
	yyval.un_quadra->kerning= 0;
;
    break;}
case 13:
#line 131 "sesh.y"
{
	yyval.un_quadra= new_signe(S_gauchedroite);
	yyval.un_quadra->kerning= 0;
;
    break;}
case 14:
#line 136 "sesh.y"
{
	yyval.un_quadra= new_signe(S_droitegauche);
	yyval.un_quadra->kerning= 0;
;
    break;}
case 15:
#line 141 "sesh.y"
{
	yyval.un_quadra= new_signe(S_lacune);
	yyval.un_quadra->kerning= 0;
;
    break;}
case 16:
#line 146 "sesh.y"
{
	 yyval.un_quadra= new_signe(S_lignelacune);
	 yyval.un_quadra->kerning= 0;
 ;
    break;}
case 17:
#line 151 "sesh.y"
{
	 yyval.un_quadra= new_signe(S_textesuper);
	 yyval.un_quadra->contenu.un_signe.donnees= yyvsp[0].une_donnee;
	 yyval.un_quadra->kerning= 0;
 ;
    break;}
case 18:
#line 157 "sesh.y"
{
	 yyval.un_quadra= new_signe(S_pointrouge);
	 yyval.un_quadra->kerning= 0;
 ;
    break;}
case 19:
#line 162 "sesh.y"
{
	 yyval.un_quadra= new_signe(S_pointnoir);
	 yyval.un_quadra->kerning= 0;
 ;
    break;}
case 20:
#line 169 "sesh.y"
{
	 yyval.une_horliste= new_hor();
	 yyval.une_horliste->un_quadra= yyvsp[0].un_quadra;
 ;
    break;}
case 21:
#line 174 "sesh.y"
{
	 yyval.une_horliste=yyvsp[-3].une_horliste;
	 yyval.une_horliste->last->next= new_hor();
	 yyval.une_horliste->last->next->previous= yyval.une_horliste->last;
	 yyval.une_horliste->last= yyval.une_horliste->last->next;
	 yyval.une_horliste->last->un_quadra= yyvsp[0].un_quadra;
	 yyval.une_horliste->last->kerning= yyvsp[-1].un_entier;
 ;
    break;}
case 22:
#line 185 "sesh.y"
{
	 yyval.un_quadra= yyvsp[-3].un_quadra;
	 yyval.un_quadra->last->next= yyvsp[0].un_quadra;
	 yyval.un_quadra->last->separateur= S_intersignes;
	 yyval.un_quadra->last->next->previous= yyval.un_quadra->last;
	 yyval.un_quadra->last= yyvsp[0].un_quadra;
	 yyval.un_quadra->last->kerning= yyvsp[-1].un_entier;
 ;
    break;}
case 23:
#line 194 "sesh.y"
{
	 yyval.un_quadra= yyvsp[0].un_quadra;
 ;
    break;}
case 25:
#line 201 "sesh.y"
{
	 yyval.un_quadra= new_signe(S_signe);
	 yyval.un_quadra->contenu.un_signe.type= S_point;
	 yyval.un_quadra->kerning= 0;
 ;
    break;}
case 26:
#line 207 "sesh.y"
{
	 yyval.un_quadra= new_signe(S_signe);
	 yyval.un_quadra->contenu.un_signe.type= S_hachureg;
	 yyval.un_quadra->kerning= 0;
 ;
    break;}
case 27:
#line 213 "sesh.y"
{
	 yyval.un_quadra= new_signe(S_signe);
	 yyval.un_quadra->contenu.un_signe.type= S_hachureh;
	 yyval.un_quadra->kerning= 0;
;
    break;}
case 28:
#line 219 "sesh.y"
{
	yyval.un_quadra= new_signe(S_signe);
	yyval.un_quadra->contenu.un_signe.type= S_hachurev;
	yyval.un_quadra->kerning= 0;
;
    break;}
case 29:
#line 225 "sesh.y"
{
	yyval.un_quadra= new_signe(S_signe);
	yyval.un_quadra->contenu.un_signe.type= S_hachuret;
	yyval.un_quadra->kerning= 0;
;
    break;}
case 30:
#line 231 "sesh.y"
{	
	yyval.un_quadra= new_quadra(yyvsp[-2].un_typegroupe);
	yyval.un_quadra->contenu.des_quadras= yyvsp[-1].un_quadra;
	yyval.un_quadra->kerning= 0;	
;
    break;}
case 31:
#line 237 "sesh.y"
{	
	yyval.un_quadra= new_quadra(S_rightleft);
	yyval.un_quadra->contenu.des_quadras= yyvsp[-1].un_quadra;
	yyval.un_quadra->kerning= 0;	
;
    break;}
case 33:
#line 244 "sesh.y"
{
	yyval.un_quadra= new_quadra(S_hachure);
	yyval.un_quadra->contenu.des_quadras= yyvsp[-1].un_quadra;
	yyval.un_quadra->kerning= 0;
;
    break;}
case 34:
#line 250 "sesh.y"
{
	yyval.un_quadra= new_quadra(S_enrouge);
	yyval.un_quadra->contenu.des_quadras= yyvsp[-1].un_quadra;
	yyval.un_quadra->kerning= 0;
;
    break;}
case 35:
#line 256 "sesh.y"
{
	yyval.un_quadra= new_signe(S_signe);
	yyval.un_quadra->contenu.un_signe.type= S_pointpoint;
	yyval.un_quadra->kerning= 0;
;
    break;}
case 36:
#line 262 "sesh.y"
{
	yyval.un_quadra= yyvsp[-1].un_quadra;
;
    break;}
case 37:
#line 269 "sesh.y"
{
	yyval.un_entier =0;
;
    break;}
case 38:
#line 273 "sesh.y"
{
	yyval.un_entier= yyvsp[-1].un_entier + 1;
;
    break;}
case 40:
#line 280 "sesh.y"
{
	yyval.un_quadra= new_quadra(S_overwrite);
	yyval.un_quadra->contenu.des_quadras= yyvsp[-2].un_quadra;
	yyval.un_quadra->contenu.des_quadras->next= yyvsp[0].un_quadra;
	yyval.un_quadra->kerning= 0;	
;
    break;}
case 41:
#line 289 "sesh.y"
{
	yyval.un_quadra= new_quadra(S_signe);
	yyval.un_quadra->contenu.un_signe.type= S_hieroglyphe;
	yyval.un_quadra->contenu.un_signe.size= 0;
	yyval.un_quadra->contenu.un_signe.rotation= 0;
	yyval.un_quadra->contenu.un_signe.donnees= yyvsp[0].une_donnee;
	yyval.un_quadra->contenu.un_signe.typehachure= S_aucune;
	yyval.un_quadra->kerning= 0;
;
    break;}
case 42:
#line 299 "sesh.y"
{
	yyval.un_quadra= new_quadra(S_signe);
	yyval.un_quadra->contenu.un_signe.type= S_ligature;
	yyval.un_quadra->contenu.un_signe.rotation= 0;
	yyval.un_quadra->contenu.un_signe.donnees= yyvsp[0].une_donnee;
	yyval.un_quadra->contenu.un_signe.typehachure= S_aucune;
	yyval.un_quadra->kerning= 0;	
;
    break;}
case 43:
#line 310 "sesh.y"
{
	yyval.un_quadra= yyvsp[-2].un_quadra;
	yyval.un_quadra->contenu.un_signe.typehachure= yyvsp[0].une_hachure;
;
    break;}
case 44:
#line 316 "sesh.y"
{yyval.un_quadra = yyvsp[0].un_quadra;;
    break;}
case 45:
#line 317 "sesh.y"
{yyval.un_quadra = yyvsp[-2].un_quadra;;
    break;}
case 46:
#line 320 "sesh.y"
{yyval.un_quadra = yyvsp[-1].un_quadra; 	yyval.un_quadra->contenu.un_signe.size= yyvsp[0].un_entier;;
    break;}
case 47:
#line 321 "sesh.y"
{yyval.un_quadra = yyvsp[-1].un_quadra; yyval.un_quadra->contenu.un_signe.rotation= yyvsp[0].un_entier;;
    break;}
case 48:
#line 322 "sesh.y"
{yyval.un_quadra = yyvsp[-1].un_quadra; 
						yyval.un_quadra->contenu.un_signe.donnees.hieroglyphe.caractere+= 128;;
    break;}
case 49:
#line 327 "sesh.y"
{
	yyval.une_hachure= S_aucune
;
    break;}
case 50:
#line 331 "sesh.y"
{
	yyval.une_hachure= S_ga;
;
    break;}
case 51:
#line 335 "sesh.y"
{
	yyval.une_hachure= S_ha;
;
    break;}
case 52:
#line 339 "sesh.y"
{
	yyval.une_hachure= S_va;
;
    break;}
case 53:
#line 343 "sesh.y"
{
	yyval.une_hachure= S_ta;
;
    break;}
case 54:
#line 350 "sesh.y"
{
	yyval.un_quadra= new_quadra(S_superfetatoire);						
	yyval.un_quadra->contenu.des_quadras= yyvsp[-1].un_quadra;
	yyval.un_quadra->kerning= 0;	
;
    break;}
case 55:
#line 356 "sesh.y"
{
	yyval.un_quadra= new_quadra(S_efface);						
	yyval.un_quadra->contenu.des_quadras= yyvsp[-1].un_quadra;
	yyval.un_quadra->kerning= 0;
;
    break;}
case 56:
#line 362 "sesh.y"
{
	yyval.un_quadra= new_quadra(S_disparu);						
	yyval.un_quadra->contenu.des_quadras= yyvsp[-1].un_quadra;
	yyval.un_quadra->kerning= 0;
;
    break;}
case 57:
#line 368 "sesh.y"
{
	yyval.un_quadra= new_quadra(S_ajoutscribe);
	yyval.un_quadra->contenu.des_quadras= yyvsp[-1].un_quadra;
	yyval.un_quadra->kerning= 0;
;
    break;}
case 58:
#line 374 "sesh.y"
{
	yyval.un_quadra= new_quadra(S_ajoutauteur);						
	yyval.un_quadra->contenu.des_quadras= yyvsp[-1].un_quadra;
	yyval.un_quadra->kerning= 0;
;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 440 "/usr/local/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;
	  for (x = 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 = 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");
    }

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 381 "sesh.y"

