/*  A Bison parser, made from html2tex.y with Bison version GNU Bison version 1.24
  */

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

#define	html	258
#define	fhtml	259
#define	head	260
#define	fhead	261
#define	title	262
#define	ftitle	263
#define	body	264
#define	fbody	265
#define	font	266
#define	ffont	267
#define	pre	268
#define	fpre	269
#define	h1	270
#define	fh1	271
#define	h2	272
#define	fh2	273
#define	h3	274
#define	fh3	275
#define	h4	276
#define	fh4	277
#define	h5	278
#define	fh5	279
#define	h6	280
#define	fh6	281
#define	center	282
#define	fcenter	283
#define	b	284
#define	fb	285
#define	i	286
#define	fi	287
#define	ol	288
#define	fol	289
#define	ul	290
#define	ful	291
#define	hr	292
#define	img	293
#define	br	294
#define	li	295
#define	arp	296
#define	generic	297
#define	string	298

#line 1 "html2tex.y"

   #include <stdio.h>
   #include <stdlib.h>
   #include <string.h>
   #include <ctype.h>

   #define MAXCHAR 4096
   #define YYSTYPE char *

   /* Varibili globali */

   FILE *ffd,*ffd2;
   int spazi=0; /* conta gli spazi prima della prossima stringa */
   int invio=0; /* conta i ritorno a capo prima della prossima stringa */
   int dfont=4; /* dimensione font per il tag <font> */
   int riga=1; /* riga di lavoro attuale */
   int lflag=0; /* flag per il comportamento di <li> */
   int iflag=0; /* flag per le stringhe dentro ol e ul */
   int liflag=0; /* li attivato in ol o ul */
   char str[MAXCHAR]; /* array per le stringhe */
   char str2[MAXCHAR]; /* array per i tag */
   char *file_grf;  /* puntatore al nome dei file da convertire */
   /* Prototipi delle funzioni */

   int tag_composto(char * tag);
   int riconosci_tag(char * tag);
   int yyparse(void);
   int yylex(void);
   void gestione_li(void);
   void setfont(void);
        
#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

#ifndef YYSTYPE
#define YYSTYPE int
#endif
#include <stdio.h>

#ifndef __cplusplus
#ifndef __STDC__
#define const
#endif
#endif



#define	YYFINAL		103
#define	YYFLAG		-32768
#define	YYNTBASE	44

#define YYTRANSLATE(x) ((unsigned)(x) <= 298 ? 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,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     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
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     1,     2,     7,     8,    11,    15,    18,    20,    24,
    27,    29,    30,    37,    38,    45,    50,    53,    54,    59,
    63,    66,    68,    70,    73,    74,    75,    80,    81,    86,
    87,    92,    93,    98,    99,   104,   105,   110,   111,   116,
   117,   122,   123,   128,   129,   134,   135,   140,   141,   146,
   147,   152,   154,   156,   158,   160,   162,   164,   166,   169,
   171,   174
};

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

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    61,    64,    65,    67,    70,    73,    74,    75,    76,    77,
    78,    81,    81,    82,    82,    83,    84,    87,    87,    90,
    91,    92,    95,    96,    97,   100,   100,   101,   101,   102,
   102,   103,   103,   104,   104,   105,   105,   106,   106,   107,
   107,   108,   108,   109,   109,   110,   110,   111,   111,   112,
   112,   113,   114,   115,   116,   117,   118,   119,   122,   138,
   157,   160
};

static const char * const yytname[] = {   "$","error","$undefined.","html","fhtml",
"head","fhead","title","ftitle","body","fbody","font","ffont","pre","fpre","h1",
"fh1","h2","fh2","h3","fh3","h4","fh4","h5","fh5","h6","fh6","center","fcenter",
"b","fb","i","fi","ol","fol","ul","ful","hr","img","br","li","arp","generic",
"string","doc","@1","@2","@3","htm","testa","@4","@5","titolo","@6","corpo",
"scritte","scritte1","@7","@8","@9","@10","@11","@12","@13","@14","@15","@16",
"@17","@18","@19","stringhe","stringhe1",""
};
#endif

static const short yyr1[] = {     0,
    45,    46,    44,    47,    44,    48,    48,    48,    48,    48,
    48,    50,    49,    51,    49,    49,    49,    53,    52,    54,
    54,    54,    55,    55,    55,    57,    56,    58,    56,    59,
    56,    60,    56,    61,    56,    62,    56,    63,    56,    64,
    56,    65,    56,    66,    56,    67,    56,    68,    56,    69,
    56,    56,    56,    56,    56,    56,    56,    56,    70,    70,
    71,    71
};

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

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

static const short yydefgoto[] = {   101,
     1,    35,     2,    28,    29,    61,    81,    30,    40,    31,
    32,    33,    43,    50,    42,    44,    45,    46,    47,    48,
    49,    51,    52,    53,    54,    34,    64
};

static const short yypact[] = {   -40,
   -38,    92,-32768,   131,     8,-32768,    49,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,   166,
-32768,-32768,    49,   -37,    92,     1,     3,-32768,     7,-32768,
    -1,    49,    49,    49,    49,    49,    49,    49,    49,    49,
    49,    49,    49,    49,-32768,-32768,-32768,-32768,-32768,-32768,
     4,   166,-32768,     9,-32768,     0,     2,    -8,     5,   -10,
    -3,     6,   -12,    -7,    -5,   -14,    17,   -16,    16,-32768,
    18,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,   166,   166,-32768,-32768,
    28,    29,-32768
};

static const short yypgoto[] = {-32768,
-32768,-32768,-32768,    19,    27,-32768,-32768,    -2,-32768,    -4,
    -6,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768
};


#define	YYLAST		209


static const short yytable[] = {    37,
    41,    -1,    39,     3,    59,    57,    60,    86,    65,    88,
     6,    84,    62,    91,     6,    85,    82,    94,    89,    96,
    92,    97,    87,    98,    93,    55,    56,   102,   103,    90,
    36,     0,     0,     0,     0,    66,    67,    68,    69,    70,
    71,    72,    73,    74,    75,    76,    77,    78,    63,    38,
    95,    83,     0,    58,     0,     0,     0,    80,    79,     8,
     0,     9,     0,    10,     0,    11,     0,    12,     0,    13,
     0,    14,     0,    15,     0,    16,     0,    17,     0,    18,
     0,    19,     0,    20,     0,    21,    22,    23,    24,    25,
    26,    27,    99,   100,     4,     0,     5,     0,     6,     0,
     7,     0,     8,     0,     9,     0,    10,     0,    11,     0,
    12,     0,    13,     0,    14,     0,    15,     0,    16,     0,
    17,     0,    18,     0,    19,     0,    20,     0,    21,    22,
    23,    24,    25,    26,    27,     5,     0,     6,     0,     7,
     0,     8,     0,     9,     0,    10,     0,    11,     0,    12,
     0,    13,     0,    14,     0,    15,     0,    16,     0,    17,
     0,    18,     0,    19,     0,    20,     0,    21,    22,    23,
    24,    25,    26,    27,     7,     0,     8,     0,     9,     0,
    10,     0,    11,     0,    12,     0,    13,     0,    14,     0,
    15,     0,    16,     0,    17,     0,    18,     0,    19,     0,
    20,     0,    21,    22,    23,    24,    25,    26,    27
};

static const short yycheck[] = {     4,
     7,    42,     5,    42,     4,    43,     4,    16,    10,    20,
     7,    12,     6,    26,     7,    14,     8,    32,    22,    36,
    28,     6,    18,     6,    30,    30,    33,     0,     0,    24,
     4,    -1,    -1,    -1,    -1,    42,    43,    44,    45,    46,
    47,    48,    49,    50,    51,    52,    53,    54,    42,    42,
    34,    43,    -1,    35,    -1,    -1,    -1,    62,    61,    11,
    -1,    13,    -1,    15,    -1,    17,    -1,    19,    -1,    21,
    -1,    23,    -1,    25,    -1,    27,    -1,    29,    -1,    31,
    -1,    33,    -1,    35,    -1,    37,    38,    39,    40,    41,
    42,    43,    97,    98,     3,    -1,     5,    -1,     7,    -1,
     9,    -1,    11,    -1,    13,    -1,    15,    -1,    17,    -1,
    19,    -1,    21,    -1,    23,    -1,    25,    -1,    27,    -1,
    29,    -1,    31,    -1,    33,    -1,    35,    -1,    37,    38,
    39,    40,    41,    42,    43,     5,    -1,     7,    -1,     9,
    -1,    11,    -1,    13,    -1,    15,    -1,    17,    -1,    19,
    -1,    21,    -1,    23,    -1,    25,    -1,    27,    -1,    29,
    -1,    31,    -1,    33,    -1,    35,    -1,    37,    38,    39,
    40,    41,    42,    43,     9,    -1,    11,    -1,    13,    -1,
    15,    -1,    17,    -1,    19,    -1,    21,    -1,    23,    -1,
    25,    -1,    27,    -1,    29,    -1,    31,    -1,    33,    -1,
    35,    -1,    37,    38,    39,    40,    41,    42,    43
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/local/share/bison.simple"

/* Skeleton output parser for bison,
   Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.

   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 2, 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.  */

/* As a special exception, when this file is copied by Bison into a
   Bison output file, you may use that output file without restriction.
   This special exception was added by the Free Software Foundation
   in version 1.24 of Bison.  */

#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
#ifdef YYLEX_PARAM
#define YYLEX		yylex(&yylval, &yylloc, YYLEX_PARAM)
#else
#define YYLEX		yylex(&yylval, &yylloc)
#endif
#else /* not YYLSP_NEEDED */
#ifdef YYLEX_PARAM
#define YYLEX		yylex(&yylval, YYLEX_PARAM)
#else
#define YYLEX		yylex(&yylval)
#endif
#endif /* not YYLSP_NEEDED */
#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_memcpy(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_memcpy (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_memcpy (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 192 "/usr/local/share/bison.simple"

/* The user can define YYPARSE_PARAM as the name of an argument to be passed
   into yyparse.  The argument should have type void *.
   It should actually point to an object.
   Grammar actions can access the variable by casting it
   to the proper pointer type.  */

#ifdef YYPARSE_PARAM
#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
#else
#define YYPARSE_PARAM
#define YYPARSE_PARAM_DECL
#endif

int
yyparse(YYPARSE_PARAM)
     YYPARSE_PARAM_DECL
{
  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_memcpy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
      yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
      __yy_memcpy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
      yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
      __yy_memcpy ((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 1:
#line 61 "html2tex.y"
{fprintf(ffd2,"\\documentclass{report}\n");
              fprintf(ffd2,"\\usepackage{epsfig}\n");
              fprintf(ffd2,"\\begin{document}\n");;
    break;}
case 2:
#line 64 "html2tex.y"
{printf("\nWarning : unknown tag %s at line %d.",str2,riga);;
    break;}
case 3:
#line 65 "html2tex.y"
{fprintf(ffd2,"\n\\end{document}\n");;
    break;}
case 4:
#line 67 "html2tex.y"
{fprintf(ffd2,"\\documentclass{report}\n");
              fprintf(ffd2,"\\usepackage{epsfig}\n");
              fprintf(ffd2,"\\begin{document}\n");;
    break;}
case 5:
#line 70 "html2tex.y"
{fprintf(ffd2,"\n\\end{document}\n");;
    break;}
case 12:
#line 81 "html2tex.y"
{printf("\nWarning : unknown tag %s at line %d.",str2,riga);;
    break;}
case 14:
#line 82 "html2tex.y"
{printf("\nWarning : unknown tag %s at line %d.",str2,riga);;
    break;}
case 18:
#line 87 "html2tex.y"
{fprintf(ffd2,"\\title{");;
    break;}
case 19:
#line 87 "html2tex.y"
{fprintf(ffd2,"}");;
    break;}
case 26:
#line 100 "html2tex.y"
{fprintf(ffd2,"\n\n");;
    break;}
case 27:
#line 100 "html2tex.y"
{fprintf(ffd2,"\n\n");;
    break;}
case 28:
#line 101 "html2tex.y"
{fprintf(ffd2,"\\begin{center}");;
    break;}
case 29:
#line 101 "html2tex.y"
{fprintf(ffd2,"\\end{center}");;
    break;}
case 30:
#line 102 "html2tex.y"
{setfont();;
    break;}
case 31:
#line 102 "html2tex.y"
{fprintf(ffd2,"\\normalsize ");;
    break;}
case 32:
#line 103 "html2tex.y"
{fprintf(ffd2,"\\Huge \\bfseries ");;
    break;}
case 33:
#line 103 "html2tex.y"
{fprintf(ffd2,"\\upshape \\normalsize ");;
    break;}
case 34:
#line 104 "html2tex.y"
{fprintf(ffd2,"\\LARGE \\bfseries ");;
    break;}
case 35:
#line 104 "html2tex.y"
{fprintf(ffd2,"\\upshape \\normalsize ");;
    break;}
case 36:
#line 105 "html2tex.y"
{fprintf(ffd2,"\\large \\bfseries ");;
    break;}
case 37:
#line 105 "html2tex.y"
{fprintf(ffd2,"\\upshape \\normalsize ");;
    break;}
case 38:
#line 106 "html2tex.y"
{fprintf(ffd2,"\\small \\bfseries ");;
    break;}
case 39:
#line 106 "html2tex.y"
{fprintf(ffd2,"\\upshape \\normalsize ");;
    break;}
case 40:
#line 107 "html2tex.y"
{fprintf(ffd2,"\\scriptsize \\bfseries ");;
    break;}
case 41:
#line 107 "html2tex.y"
{fprintf(ffd2,"\\upshape \\normalsize ");;
    break;}
case 42:
#line 108 "html2tex.y"
{fprintf(ffd2,"\\tiny \\bfseries ");;
    break;}
case 43:
#line 108 "html2tex.y"
{fprintf(ffd2,"\\upshape \\normalsize ");;
    break;}
case 44:
#line 109 "html2tex.y"
{fprintf(ffd2,"\\bfseries ");;
    break;}
case 45:
#line 109 "html2tex.y"
{fprintf(ffd2,"\\upshape ");;
    break;}
case 46:
#line 110 "html2tex.y"
{fprintf(ffd2,"\\itshape ");;
    break;}
case 47:
#line 110 "html2tex.y"
{fprintf(ffd2,"\\upshape ");;
    break;}
case 48:
#line 111 "html2tex.y"
{fprintf(ffd2,"\\begin{enumerate}\n"); lflag=1; iflag=1;;
    break;}
case 49:
#line 111 "html2tex.y"
{fprintf(ffd2,"\\end{enumerate}\n"); lflag=0; iflag=0;;
    break;}
case 50:
#line 112 "html2tex.y"
{fprintf(ffd2,"\\begin{enumerate}\n"); lflag=2; iflag=1;;
    break;}
case 51:
#line 112 "html2tex.y"
{fprintf(ffd2,"\\end{enumerate}\n"); lflag=0; iflag=0;;
    break;}
case 52:
#line 113 "html2tex.y"
{fprintf(ffd2,"\\includegraphics{%s.eps}",file_grf); printf("\nThe graphic file %s must be converted in EPS format by the user.", file_grf);;
    break;}
case 53:
#line 114 "html2tex.y"
{gestione_li();;
    break;}
case 54:
#line 115 "html2tex.y"
{fprintf(ffd2," \\\\ \\rule{15cm}{1mm} \n");;
    break;}
case 55:
#line 116 "html2tex.y"
{fprintf(ffd2," \\\\ ");;
    break;}
case 56:
#line 117 "html2tex.y"
{printf("\nWarning : unknown tag %s at line %d.",str2,riga);;
    break;}
case 57:
#line 118 "html2tex.y"
{fprintf(ffd2,"\n\n");;
    break;}
case 59:
#line 122 "html2tex.y"
{
                              if (invio > 0)
                               iflag=1;
                              for(invio;invio > 0; invio--)
                               fprintf(ffd2,"\n");
                              for(spazi;spazi > 0; spazi--)
                               fprintf(ffd2," ");
                              if (lflag>0 && iflag==1 && liflag==0 )
                               fprintf(ffd2,"\\item[ ]%s",yyvsp[0]);
                              else
                               {
                               fprintf(ffd2,"%s",yyvsp[0]);
                               liflag=0;
                               }
                              iflag=0;
                              ;
    break;}
case 60:
#line 138 "html2tex.y"
{
                              if (invio > 0)
                               iflag=1;
                              for(invio;invio > 0; invio--)
                               fprintf(ffd2,"\n");
                              for(spazi;spazi > 0; spazi--)
                               fprintf(ffd2," ");
                              if (lflag>0 && iflag==1 && liflag==0 )
                               fprintf(ffd2,"\\item[ ]%s",yyvsp[0]);
                              else
                               {
                               fprintf(ffd2,"%s",yyvsp[0]);
                               liflag=0;
                               }
                              iflag=0;

                      ;
    break;}
case 61:
#line 157 "html2tex.y"
{
                                fprintf(ffd2,"%s ",yyvsp[0]);
                                ;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 487 "/usr/local/share/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 163 "html2tex.y"


void gestione_li(void)
        {
        if (lflag==0)
         {
         fprintf(ffd2,"\\begin{math} \\bullet \\end{math} ");
         liflag=1;
          }
        else if (lflag==2)
         {
         fprintf(ffd2,"\\item[\\begin{math} \\bullet \\end{math}] ");
         liflag=1;
         }
        else if (lflag==1)
         {
         fprintf(ffd2,"\\item ");
         liflag=1;
          }
        }

void setfont(void)
        {
         switch(dfont) {
          case 0 :
           {fprintf(ffd2,"\\tiny ");}         
          break;
          case 1 :
           {fprintf(ffd2,"\\footnotesize ");}
          break;
          case 2 :
           {fprintf(ffd2,"\\small ");}
          break;
          case 3 :
           {fprintf(ffd2,"\\normalsize ");}
          break;
          case 4 :
           {fprintf(ffd2,"\\Large ");}
          break;
          case 5 :
           {fprintf(ffd2,"\\LARGE ");}
          break;
          case 6 :
           {fprintf(ffd2,"\\huge ");}
          break;
          default :
           {fprintf(ffd2,"\\normalsize ");}
         }
        }

void main(int argc, char *argv[])
{

 printf("\nHTML to (La)TeX Release 1.02\n");
 printf("(c)1997 Giovanni Andreani (Original code and MS-DOS version)\n");
 printf("        Antonio Sant (AMIGA version)\n\n");

 switch (argc){
  case 3:
          {
          if ((ffd=fopen(argv[1],"r"))==NULL)
                {
                   printf("Error opening %s !\n",argv[1]);
                   exit(1);
                   }
          if ((ffd2=fopen(argv[2],"w"))==NULL)
                {
                   printf("Error creating %s !\n",argv[2]);
                   exit(1);
                   }
          break;
           }

  default: printf("Use: html2tex HTML_file (La)TeX_file\n");
           exit(1);
           };

 yyparse();

 printf("\n\nTranslation ended.\n");

 fclose(ffd);
 fclose(ffd2);

      }

int yyerror(char *s)
       {
               if ((strstr(str2,"/"))!=NULL)
                {
                fprintf(stderr,"\nError : the tag %s at line %d has not a predecessor.\n",str2,riga);
                exit(1);
                 }
               else
               {
                fprintf(stderr,"\nError : the tag %s at line %d is misplaced.\n",str2,riga);             
                exit(1);
                }
       }

int yylex()
        {        
        int val=0; /* contatore per la posizione dei caratteri da mettere in str */
        char c;

              while (((c=fgetc(ffd)) == ' ') || (c == '\n')) /* eliminiamo gli spazi bianchi */
                {
                if (c=='\n')
                 {
                  riga++;
                  invio++;
                  }
                if (c==' ')
                 spazi++;
                }  

              if (c == EOF)
               return(0); /* il file di input e' finito, fermiamo anche il parser */

              if (c=='<') /* e' un tag HTML */
               {
                 do
                 {
                 if ((c==EOF) || (val >= MAXCHAR))/* controlliamo che il tag non sia incompleto (ossia senza '>') */
                  {
                   printf("Trovato tag incompleto.\nImpossibile proseguire dopo la riga %d.\n",riga);
                   return(0); 
                  }
                 str2[val++]=c;
                 }
                 while ((c=fgetc(ffd)) != '>'); /* leggiamo il TAG */
                 str2[val++]=c;   /* aggiungiamo '>' */
                 str2[val]='\0';  /* terminiamo correttamente il TAG */
                 val=(riconosci_tag(str2)); /* vediamo che tag abbiamo trovato e informiamo il parser */                 
                 return(val);
                }
              else
              {
                 do
                 {
                 if (c=='<') /* leggendo la stringa abbiamo trovato un tag (es. Questo<B>...)*/
                  {
                        ungetc(c,ffd);      /* rimettiamo < nello stream */
                        str[val]='\0';        /* terminiamo correttamente la stringa */                        
                        yylval=str;
                        return string;
                        }
                 if ( (c=='#') || (c=='\\') || (c=='_') || (c=='$') || (c=='&') || (c=='{') || (c=='}'))
                 {
                   str[val++]='\\';
                   str[val++]=c;
                   }
                 else
                  str[val++]=c;
                 c=fgetc(ffd);
                 }
                 while (!(c == EOF || c ==' ' || c =='\n' )); /* leggiamo la stringa */
                
                ungetc(c,ffd); /* rimettiamo sullo stream l'ultimo carattere */
                 
               /* la lettura della stringa e'finita */               
               str[val]='\0';        /* terminiamo correttamente la stringa */              
               yylval=str;
               return string;
              }
       }

int riconosci_tag(char * tag)
{
       int val;

       for (val=0 ; val<strlen(tag) ; val++) /* i caratteri del tag diventano */
        tag[val]=tolower(tag[val]);          /* minuscoli, se non lo sono gia' */

       /* vediamo se il tag non e' composto */

       if (strcmp(tag,"<html>")==0)
        return(html);
       else if (strcmp(tag,"</html>")==0)
        return(fhtml);

       else if (strcmp(tag,"<head>")==0)
        return(head);
       else if (strcmp(tag,"</head>")==0)
        return(fhead);

       else if (strcmp(tag,"<title>")==0)
        return(title);
       else if (strcmp(tag,"</title>")==0)
        return(ftitle);

       else if (strcmp(tag,"<body>")==0)
        return(body);
       else if (strcmp(tag,"</body>")==0)
        return(fbody);

       else if (strcmp(tag,"<font>")==0)
        return(font);
       else if (strcmp(tag,"</font>")==0)
        return(ffont);

       else if (strcmp(tag,"<h1>")==0)
        return(h1);
       else if (strcmp(tag,"</h1>")==0)
        return(fh1);

       else if (strcmp(tag,"<h2>")==0)
        return(h2);
       else if (strcmp(tag,"</h2>")==0)
        return(fh2);

       else if (strcmp(tag,"<h3>")==0)
        return(h3);
       else if (strcmp(tag,"</h3>")==0)
        return(fh3);

       else if (strcmp(tag,"<h4>")==0)
        return(h4);
       else if (strcmp(tag,"</h4>")==0)
        return(fh4);

       else if (strcmp(tag,"<h5>")==0)
        return(h5);
       else if (strcmp(tag,"</h5>")==0)
        return(fh5);

       else if (strcmp(tag,"<h6>")==0)
        return(h6);
       else if (strcmp(tag,"</h6>")==0)
        return(fh6);

       else if (strcmp(tag,"<center>")==0)
        return(center);
       else if (strcmp(tag,"</center>")==0)
        return(fcenter);

       else if (strcmp(tag,"<b>")==0)
        return(b);
       else if (strcmp(tag,"</b>")==0)
        return(fb);

      else if (strcmp(tag,"<pre>")==0)
        return(pre);
       else if (strcmp(tag,"</pre>")==0)
        return(fpre);
        
       else if (strcmp(tag,"<i>")==0)
        return(i);
       else if (strcmp(tag,"</i>")==0)
        return(fi);

       else if (strcmp(tag,"<ul>")==0)
        return(ul);
       else if (strcmp(tag,"</ul>")==0)
        return(ful);

       else if (strcmp(tag,"<ol>")==0)
        return(ol);
       else if (strcmp(tag,"</ol>")==0)
        return(fol);

       else if (strcmp(tag,"<li>")==0)
        return(li);

       else if (strcmp(tag,"<p>")==0)
        return(arp);

       else if (strcmp(tag,"<hr>")==0)
        return(hr);

       else if (strcmp(tag,"<br>")==0)
        return(br);

       /* vediamo se il tag e' composto (es. <img src=edit.gif>) */
       else
        return (tag_composto(tag));

        }

int tag_composto(char * tag)
{

        char * pt;
        int val=0;

        if ((strstr(tag,"<body "))!=NULL)
         return(body);
        
        if ((strstr(tag,"<p "))!=NULL)
         return(arp);

        else if ((strstr(tag,"<hr "))!=NULL)
         return(hr);
   

        else if ((strstr(tag,"<font "))!=NULL)
        {
         if ((pt=strstr(tag,"size="))!=NULL) /* dimensione font settata ? */
          {
            pt=pt+5;
            if (*pt=='+')            /* il font deve essere ingrandito */
             dfont=(dfont+atoi(pt+1))%7;
            else if (*pt=='-')       /* il font deve essere rimpicciolito */
             dfont=(dfont-atoi(pt+1))%7;
           else
             dfont=(atoi(pt))%7;         /* cambia dimensione font */
               }
         return(font);
         }

        else if ((strstr(tag,"<img "))!=NULL)
         {
          if ((pt=strstr(tag,"src=\""))!=NULL)
           pt=pt+5;

          while (*(pt+val)!='.')
           val++;
          *(pt+val)='\0';

          file_grf=pt;

          return(img);
          }

        /* il tag risulta sconosciuto */
        else
         return(generic);

        }