path: root/libical/src/libicalvcal/vcc.c

/*  A Bison parser, made from vcc.y
    by GNU Bison version 1.28  */

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

#define EQ  257
#define COLON   258
#define DOT 259
#define SEMICOLON   260
#define SPACE   261
#define HTAB    262
#define LINESEP 263
#define NEWLINE 264
#define BEGIN_VCARD 265
#define END_VCARD   266
#define BEGIN_VCAL  267
#define END_VCAL    268
#define BEGIN_VEVENT    269
#define END_VEVENT  270
#define BEGIN_VTODO 271
#define END_VTODO   272
#define ID  273
#define STRING  274

#line 1 "vcc.y"


/***************************************************************************
(C) Copyright 1996 Apple Computer, Inc., AT&T Corp., International
Business Machines Corporation and Siemens Rolm Communications Inc.

For purposes of this license notice, the term Licensors shall mean,
collectively, Apple Computer, Inc., AT&T Corp., International
Business Machines Corporation and Siemens Rolm Communications Inc.
The term Licensor shall mean any of the Licensors.

Subject to acceptance of the following conditions, permission is hereby
granted by Licensors without the need for written agreement and without
license or royalty fees, to use, copy, modify and distribute this
software for any purpose.

The above copyright notice and the following four paragraphs must be
reproduced in all copies of this software and any software including
this software.

THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS AND NO LICENSOR SHALL HAVE
ANY OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS OR
MODIFICATIONS.

IN NO EVENT SHALL ANY LICENSOR BE LIABLE TO ANY PARTY FOR DIRECT,
INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES OR LOST PROFITS ARISING OUT
OF THE USE OF THIS SOFTWARE EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.

EACH LICENSOR SPECIFICALLY DISCLAIMS ANY WARRANTIES, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO ANY WARRANTY OF NONINFRINGEMENT OR THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE.

The software is provided with RESTRICTED RIGHTS.  Use, duplication, or
disclosure by the government are subject to restrictions set forth in
DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable.

***************************************************************************/

/*
 * src: vcc.c
 * doc: Parser for vCard and vCalendar. Note that this code is
 * generated by a yacc parser generator. Generally it should not
 * be edited by hand. The real source is vcc.y. The #line directives
 * can be commented out here to make it easier to trace through
 * in a debugger. However, if a bug is found it should
 * be fixed in vcc.y and this file regenerated.
 */


/* debugging utilities */
#if __DEBUG
#define DBG_(x) printf x
#else
#define DBG_(x)
#endif

/****  External Functions  ****/

/* assign local name to parser variables and functions so that
   we can use more than one yacc based parser.
*/

#define yyparse mime_parse
#define yylex mime_lex
#define yyerror mime_error
#define yychar mime_char
/* #define p_yyval p_mime_val */
#undef yyval
#define yyval mime_yyval
/* #define p_yylval p_mime_lval */
#undef yylval
#define yylval mime_yylval
#define yydebug mime_debug
#define yynerrs mime_nerrs
#define yyerrflag mime_errflag
#define yyss mime_ss
#define yyssp mime_ssp
#define yyvs mime_vs
#define yyvsp mime_vsp
#define yylhs mime_lhs
#define yylen mime_len
#define yydefred mime_defred
#define yydgoto mime_dgoto
#define yysindex mime_sindex
#define yyrindex mime_rindex
#define yygindex mime_gindex
#define yytable mime_table
#define yycheck mime_check
#define yyname mime_name
#define yyrule mime_rule
#define YYPREFIX "mime_"


#ifndef _NO_LINE_FOLDING
#define _SUPPORT_LINE_FOLDING 1
#endif

/* undef below if compile with MFC */
/* #define INCLUDEMFC 1 */

#if defined(WIN32) || defined(_WIN32)
#ifdef INCLUDEMFC
#include <afx.h>
#endif
#endif

#include <string.h>
#ifndef __MWERKS__
#include <malloc.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include "vcc.h"

/****  Types, Constants  ****/

#define YYDEBUG     1   /* 1 to compile in some debugging code */
#define MAXTOKEN    256 /* maximum token (line) length */
#define YYSTACKSIZE     50  /* ~unref ? */
#define MAXLEVEL    10  /* max # of nested objects parseable */
                /* (includes outermost) */


/****  Global Variables  ****/
int mime_lineNum, mime_numErrors; /* yyerror() can use these */
static VObject* vObjList;
static VObject *curProp;
static VObject *curObj;
static VObject* ObjStack[MAXLEVEL];
static int ObjStackTop;


/* A helpful utility for the rest of the app. */
#if __CPLUSPLUS__
extern "C" {
#endif

    extern void Parse_Debug(const char *s);
    static void yyerror(char *s);

#if __CPLUSPLUS__
    };
#endif

int yyparse();

enum LexMode {
    L_NORMAL,
    L_VCARD,
    L_VCAL,
    L_VEVENT,
    L_VTODO,
    L_VALUES,
    L_BASE64,
    L_QUOTED_PRINTABLE
    };

/****  Private Forward Declarations  ****/
static int pushVObject(const char *prop);
static VObject* popVObject();
static void lexPopMode(int top);
static int lexWithinMode(enum LexMode mode);
static void lexPushMode(enum LexMode mode);
static void enterProps(const char *s);
static void enterAttr(const char *s1, const char *s2);
static void enterValues(const char *value);
static void mime_error_(char *s);


#line 178 "vcc.y"
typedef union {
    char *str;
    VObject *vobj;
    } YYSTYPE;
#include <stdio.h>

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



#define YYFINAL     62
#define YYFLAG      -32768
#define YYNTBASE    21

#define YYTRANSLATE(x) ((unsigned)(x) <= 274 ? yytranslate[x] : 51)

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,     3,     4,     5,     6,
     7,     8,     9,    10,    11,    12,    13,    14,    15,    16,
    17,    18,    19,    20
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     2,     3,     7,     9,    11,    13,    14,    19,    20,
    24,    27,    29,    30,    36,    38,    39,    43,    45,    48,
    50,    53,    55,    59,    61,    62,    67,    69,    71,    72,
    73,    78,    79,    83,    86,    88,    90,    92,    94,    95,
   100,   101,   105,   106,   111,   112
};

static const short yyrhs[] = {    22,
     0,     0,    24,    23,    22,     0,    24,     0,    25,     0,
    40,     0,     0,    11,    26,    28,    12,     0,     0,    11,
    27,    12,     0,    29,    28,     0,    29,     0,     0,    31,
     4,    30,    37,     9,     0,     1,     0,     0,    36,    32,
    33,     0,    36,     0,    34,    33,     0,    34,     0,     6,
    35,     0,    36,     0,    36,     3,    36,     0,    19,     0,
     0,    39,     6,    38,    37,     0,    39,     0,    20,     0,
     0,     0,    13,    41,    43,    14,     0,     0,    13,    42,
    14,     0,    44,    43,     0,    44,     0,    45,     0,    48,
     0,    28,     0,     0,    15,    46,    28,    16,     0,     0,
    15,    47,    16,     0,     0,    17,    49,    28,    18,     0,
     0,    17,    50,    18,     0
};

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
   206,   209,   212,   212,   216,   217,   220,   226,   231,   237,
   243,   244,   247,   251,   257,   260,   265,   265,   271,   272,
   275,   278,   282,   289,   292,   293,   293,   297,   298,   301,
   305,   307,   310,   313,   314,   317,   319,   320,   323,   330,
   335,   341,   347,   354,   359,   365
};
#endif


#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)

static const char * const yytname[] = {   "$","error","$undefined.","EQ","COLON",
"DOT","SEMICOLON","SPACE","HTAB","LINESEP","NEWLINE","BEGIN_VCARD","END_VCARD",
"BEGIN_VCAL","END_VCAL","BEGIN_VEVENT","END_VEVENT","BEGIN_VTODO","END_VTODO",
"ID","STRING","mime","vobjects","@1","vobject","vcard","@2","@3","items","item",
"@4","prop","@5","attr_params","attr_param","attr","name","values","@6","value",
"vcal","@7","@8","calitems","calitem","eventitem","@9","@10","todoitem","@11",
"@12", NULL
};
#endif

static const short yyr1[] = {     0,
    21,    23,    22,    22,    24,    24,    26,    25,    27,    25,
    28,    28,    30,    29,    29,    32,    31,    31,    33,    33,
    34,    35,    35,    36,    38,    37,    37,    39,    39,    41,
    40,    42,    40,    43,    43,    44,    44,    44,    46,    45,
    47,    45,    49,    48,    50,    48
};

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

static const short yydefact[] = {     0,
     7,    30,     1,     2,     5,     6,     0,     0,     0,     0,
     0,    15,    24,     0,     0,     0,    16,    10,    39,    43,
    38,     0,     0,    36,    37,    33,     3,     8,    11,    13,
     0,     0,     0,     0,     0,    31,    34,    29,     0,    17,
    20,     0,    42,     0,    46,    28,     0,    27,    21,    22,
    19,    40,    44,    14,    25,     0,    29,    23,    26,     0,
     0,     0
};

static const short yydefgoto[] = {    60,
     3,    11,     4,     5,     7,     8,    21,    15,    38,    16,
    31,    40,    41,    49,    17,    47,    57,    48,     6,     9,
    10,    22,    23,    24,    32,    33,    25,    34,    35
};

static const short yypact[] = {    -9,
    -6,    -5,-32768,     7,-32768,-32768,     2,    -1,    19,    15,
    -9,-32768,-32768,     1,     0,    26,    27,-32768,    16,    17,
-32768,    23,     9,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
    33,     2,    24,     2,    25,-32768,-32768,    13,    22,-32768,
    33,    28,-32768,    29,-32768,-32768,    36,    40,-32768,    39,
-32768,-32768,-32768,-32768,-32768,    22,    13,-32768,-32768,    48,
    49,-32768
};

static const short yypgoto[] = {-32768,
    41,-32768,-32768,-32768,-32768,-32768,    -7,-32768,-32768,-32768,
-32768,    10,-32768,-32768,   -34,    -4,-32768,-32768,-32768,-32768,
-32768,    31,-32768,-32768,-32768,-32768,-32768,-32768,-32768
};


#define YYLAST      54


static const short yytable[] = {    14,
    12,     1,    12,     2,    50,    -9,    -4,    29,   -32,    12,
    18,   -12,    28,   -12,   -12,   -12,   -12,   -12,    13,    12,
    13,    58,   -35,    19,    42,    20,    44,    13,    26,    30,
   -18,   -41,    46,    19,   -45,    20,    36,    13,    39,    43,
    13,    56,    45,    52,    54,    55,    53,    61,    62,     0,
    51,    27,    59,    37
};

static const short yycheck[] = {     7,
     1,    11,     1,    13,    39,    12,     0,    15,    14,     1,
    12,    12,    12,    14,    15,    16,    17,    18,    19,     1,
    19,    56,    14,    15,    32,    17,    34,    19,    14,     4,
     4,    16,    20,    15,    18,    17,    14,    19,     6,    16,
    19,     3,    18,    16,     9,     6,    18,     0,     0,    -1,
    41,    11,    57,    23
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/lib/bison.simple"
/* This file comes from bison-1.28.  */

/* 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., 59 Temple Place - Suite 330,
   Boston, MA 02111-1307, 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.  */

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

#ifndef YYSTACK_USE_ALLOCA
#ifdef alloca
#define YYSTACK_USE_ALLOCA
#else /* alloca not defined */
#ifdef __GNUC__
#define YYSTACK_USE_ALLOCA
#define alloca __builtin_alloca
#else /* not GNU C.  */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
#define YYSTACK_USE_ALLOCA
#include <alloca.h>
#else /* not sparc */
/* We think this test detects Watcom and Microsoft C.  */
/* This used to test MSDOS, but that is a bad idea
   since that symbol is in the user namespace.  */
#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
#if 0 /* No need for malloc.h, which pollutes the namespace;
     instead, just don't use alloca.  */
#include <malloc.h>
#endif
#else /* not MSDOS, or __TURBOC__ */
#if defined(_AIX)
/* I don't know what this was needed for, but it pollutes the namespace.
   So I turned it off.   rms, 2 May 1997.  */
/* #include <malloc.h>  */
 #pragma alloca
#define YYSTACK_USE_ALLOCA
#else /* not MSDOS, or __TURBOC__, or _AIX */
#if 0
#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
         and on HPUX 10.  Eventually we can turn this on.  */
#define YYSTACK_USE_ALLOCA
#define alloca __builtin_alloca
#endif /* __hpux */
#endif
#endif /* not _AIX */
#endif /* not MSDOS, or __TURBOC__ */
#endif /* not sparc */
#endif /* not GNU C */
#endif /* alloca not defined */
#endif /* YYSTACK_USE_ALLOCA not defined */

#ifdef YYSTACK_USE_ALLOCA
#define YYSTACK_ALLOC alloca
#else
#define YYSTACK_ALLOC malloc
#endif

/* 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    goto yyacceptlab
#define YYABORT     goto yyabortlab
#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

/* Define __yy_memcpy.  Note that the size argument
   should be passed with type unsigned int, because that is what the non-GCC
   definitions require.  With GCC, __builtin_memcpy takes an arg
   of type size_t, but it can handle unsigned int.  */

#if __GNUC__ > 1        /* GNU C and GNU C++ define this.  */
#define __yy_memcpy(TO,FROM,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 (to, from, count)
     char *to;
     char *from;
     unsigned 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 *to, char *from, unsigned int count)
{
  register char *t = to;
  register char *f = from;
  register int i = count;

  while (i-- > 0)
    *t++ = *f++;
}

#endif
#endif

#line 217 "/usr/lib/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
#ifdef __cplusplus
#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
#define YYPARSE_PARAM_DECL
#else /* not __cplusplus */
#define YYPARSE_PARAM_ARG YYPARSE_PARAM
#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
#endif /* not __cplusplus */
#else /* not YYPARSE_PARAM */
#define YYPARSE_PARAM_ARG
#define YYPARSE_PARAM_DECL
#endif /* not YYPARSE_PARAM */

/* Prevent warning if -Wstrict-prototypes.  */
#ifdef __GNUC__
#ifdef YYPARSE_PARAM
int yyparse (void *);
#else
int yyparse (void);
#endif
#endif

int
yyparse(YYPARSE_PARAM_ARG)
     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;
  int yyfree_stacks = 0;

#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");
      if (yyfree_stacks)
        {
          free (yyss);
          free (yyvs);
#ifdef YYLSP_NEEDED
          free (yyls);
#endif
        }
      return 2;
    }
      yystacksize *= 2;
      if (yystacksize > YYMAXDEPTH)
    yystacksize = YYMAXDEPTH;
#ifndef YYSTACK_USE_ALLOCA
      yyfree_stacks = 1;
#endif
      yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
      __yy_memcpy ((char *)yyss, (char *)yyss1,
           size * (unsigned int) sizeof (*yyssp));
      yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
      __yy_memcpy ((char *)yyvs, (char *)yyvs1,
           size * (unsigned int) sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
      yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
      __yy_memcpy ((char *)yyls, (char *)yyls1,
           size * (unsigned int) 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 210 "vcc.y"
{ addList(&vObjList, yyvsp[0].vobj); curObj = 0; ;
    break;}
case 4:
#line 213 "vcc.y"
{ addList(&vObjList, yyvsp[0].vobj); curObj = 0; ;
    break;}
case 7:
#line 222 "vcc.y"
{
    lexPushMode(L_VCARD);
    if (!pushVObject(VCCardProp)) YYERROR;
    ;
    break;}
case 8:
#line 227 "vcc.y"
{
    lexPopMode(0);
    yyval.vobj = popVObject();
    ;
    break;}
case 9:
#line 232 "vcc.y"
{
    lexPushMode(L_VCARD);
    if (!pushVObject(VCCardProp)) YYERROR;
    ;
    break;}
case 10:
#line 237 "vcc.y"
{
    lexPopMode(0);
    yyval.vobj = popVObject();
    ;
    break;}
case 13:
#line 248 "vcc.y"
{
    lexPushMode(L_VALUES);
    ;
    break;}
case 14:
#line 252 "vcc.y"
{
    if (lexWithinMode(L_BASE64) || lexWithinMode(L_QUOTED_PRINTABLE))
       lexPopMode(0);
    lexPopMode(0);
    ;
    break;}
case 16:
#line 261 "vcc.y"
{
    enterProps(yyvsp[0].str);
    ;
    break;}
case 18:
#line 266 "vcc.y"
{
    enterProps(yyvsp[0].str);
    ;
    break;}
case 22:
#line 279 "vcc.y"
{
    enterAttr(yyvsp[0].str,0);
    ;
    break;}
case 23:
#line 283 "vcc.y"
{
    enterAttr(yyvsp[-2].str,yyvsp[0].str);

    ;
    break;}
case 25:
#line 292 "vcc.y"
{ enterValues(yyvsp[-1].str); ;
    break;}
case 27:
#line 294 "vcc.y"
{ enterValues(yyvsp[0].str); ;
    break;}
case 29:
#line 298 "vcc.y"
{ yyval.str = 0; ;
    break;}
case 30:
#line 303 "vcc.y"
{ if (!pushVObject(VCCalProp)) YYERROR; ;
    break;}
case 31:
#line 306 "vcc.y"
{ yyval.vobj = popVObject(); ;
    break;}
case 32:
#line 308 "vcc.y"
{ if (!pushVObject(VCCalProp)) YYERROR; ;
    break;}
case 33:
#line 310 "vcc.y"
{ yyval.vobj = popVObject(); ;
    break;}
case 39:
#line 325 "vcc.y"
{
    lexPushMode(L_VEVENT);
    if (!pushVObject(VCEventProp)) YYERROR;
    ;
    break;}
case 40:
#line 331 "vcc.y"
{
    lexPopMode(0);
    popVObject();
    ;
    break;}
case 41:
#line 336 "vcc.y"
{
    lexPushMode(L_VEVENT);
    if (!pushVObject(VCEventProp)) YYERROR;
    ;
    break;}
case 42:
#line 341 "vcc.y"
{
    lexPopMode(0);
    popVObject();
    ;
    break;}
case 43:
#line 349 "vcc.y"
{
    lexPushMode(L_VTODO);
    if (!pushVObject(VCTodoProp)) YYERROR;
    ;
    break;}
case 44:
#line 355 "vcc.y"
{
    lexPopMode(0);
    popVObject();
    ;
    break;}
case 45:
#line 360 "vcc.y"
{
    lexPushMode(L_VTODO);
    if (!pushVObject(VCTodoProp)) YYERROR;
    ;
    break;}
case 46:
#line 365 "vcc.y"
{
    lexPopMode(0);
    popVObject();
    ;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 543 "/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;

 yyacceptlab:
  /* YYACCEPT comes here.  */
  if (yyfree_stacks)
    {
      free (yyss);
      free (yyvs);
#ifdef YYLSP_NEEDED
      free (yyls);
#endif
    }
  return 0;

 yyabortlab:
  /* YYABORT comes here.  */
  if (yyfree_stacks)
    {
      free (yyss);
      free (yyvs);
#ifdef YYLSP_NEEDED
      free (yyls);
#endif
    }
  return 1;
}
#line 371 "vcc.y"

static int pushVObject(const char *prop)
    {
    VObject *newObj;
    if (ObjStackTop == MAXLEVEL)
    return FALSE;

    ObjStack[++ObjStackTop] = curObj;

    if (curObj) {
        newObj = addProp(curObj,prop);
        curObj = newObj;
    }
    else
    curObj = newVObject(prop);

    return TRUE;
    }


/* This pops the recently built vCard off the stack and returns it. */
static VObject* popVObject()
    {
    VObject *oldObj;
    if (ObjStackTop < 0) {
    yyerror("pop on empty Object Stack\n");
    return 0;
    }
    oldObj = curObj;
    curObj = ObjStack[ObjStackTop--];

    return oldObj;
    }


static void enterValues(const char *value)
    {
    if (fieldedProp && *fieldedProp) {
    if (value) {
        addPropValue(curProp,*fieldedProp,value);
        }
    /* else this field is empty, advance to next field */
    fieldedProp++;
    }
    else {
    if (value) {
        setVObjectUStringZValue_(curProp,fakeUnicode(value,0));
        }
    }
    deleteStr(value);
    }

static void enterProps(const char *s)
    {
    curProp = addGroup(curObj,s);
    deleteStr(s);
    }

static void enterAttr(const char *s1, const char *s2)
    {
    const char *p1, *p2;
    p1 = lookupProp_(s1);
    if (s2) {
    VObject *a;
    p2 = lookupProp_(s2);
    a = addProp(curProp,p1);
    setVObjectStringZValue(a,p2);
    }
    else
    addProp(curProp,p1);
    if (stricmp(p1,VCBase64Prop) == 0 || (s2 && stricmp(p2,VCBase64Prop)==0))
    lexPushMode(L_BASE64);
    else if (stricmp(p1,VCQuotedPrintableProp) == 0
        || (s2 && stricmp(p2,VCQuotedPrintableProp)==0))
    lexPushMode(L_QUOTED_PRINTABLE);
    deleteStr(s1); deleteStr(s2);
    }


#define MAX_LEX_LOOKAHEAD_0 32
#define MAX_LEX_LOOKAHEAD 64
#define MAX_LEX_MODE_STACK_SIZE 10
#define LEXMODE() (lexBuf.lexModeStack[lexBuf.lexModeStackTop])

struct LexBuf {
    /* input */
#ifdef INCLUDEMFC
    CFile *inputFile;
#else
    FILE *inputFile;
#endif
    char *inputString;
    unsigned long curPos;
    unsigned long inputLen;
    /* lookahead buffer */
    /*   -- lookahead buffer is short instead of char so that EOF
     /      can be represented correctly.
    */
    unsigned long len;
    short buf[MAX_LEX_LOOKAHEAD];
    unsigned long getPtr;
    /* context stack */
    unsigned long lexModeStackTop;
    enum LexMode lexModeStack[MAX_LEX_MODE_STACK_SIZE];
    /* token buffer */
    unsigned long maxToken;
    char *strs;
    unsigned long strsLen;
    } lexBuf;

static void lexPushMode(enum LexMode mode)
    {
    if (lexBuf.lexModeStackTop == (MAX_LEX_MODE_STACK_SIZE-1))
    yyerror("lexical context stack overflow");
    else {
    lexBuf.lexModeStack[++lexBuf.lexModeStackTop] = mode;
    }
    }

static void lexPopMode(int top)
    {
    /* special case of pop for ease of error recovery -- this
    version will never underflow */
    if (top)
    lexBuf.lexModeStackTop = 0;
    else
    if (lexBuf.lexModeStackTop > 0) lexBuf.lexModeStackTop--;
    }

static int lexWithinMode(enum LexMode mode) {
    unsigned long i;
    for (i=0;i<lexBuf.lexModeStackTop;i++)
    if (mode == lexBuf.lexModeStack[i]) return 1;
    return 0;
    }

static char lexGetc_()
    {
    /* get next char from input, no buffering. */
    if (lexBuf.curPos == lexBuf.inputLen)
    return EOF;
    else if (lexBuf.inputString)
    return *(lexBuf.inputString + lexBuf.curPos++);
    else {
#ifdef INCLUDEMFC
    char result;
    return lexBuf.inputFile->Read(&result, 1) == 1 ? result : EOF;
#else
    return fgetc(lexBuf.inputFile);
#endif
    }
    }

static int lexGeta()
    {
    ++lexBuf.len;
    return (lexBuf.buf[lexBuf.getPtr] = lexGetc_());
    }

static int lexGeta_(int i)
    {
    ++lexBuf.len;
    return (lexBuf.buf[(lexBuf.getPtr+i)%MAX_LEX_LOOKAHEAD] = lexGetc_());
    }

static void lexSkipLookahead() {
    if (lexBuf.len > 0 && lexBuf.buf[lexBuf.getPtr]!=EOF) {
    /* don't skip EOF. */
        lexBuf.getPtr = (lexBuf.getPtr + 1) % MAX_LEX_LOOKAHEAD;
    lexBuf.len--;
        }
    }

static int lexLookahead() {
    int c = (lexBuf.len)?
    lexBuf.buf[lexBuf.getPtr]:
    lexGeta();
    /* do the \r\n -> \n or \r -> \n translation here */
    if (c == '\r') {
    int a = (lexBuf.len>1)?
        lexBuf.buf[(lexBuf.getPtr+1)%MAX_LEX_LOOKAHEAD]:
        lexGeta_(1);
    if (a == '\n') {
        lexSkipLookahead();
        }
    lexBuf.buf[lexBuf.getPtr] = c = '\n';
    }
    else if (c == '\n') {
    int a = (lexBuf.len>1)?
        lexBuf.buf[lexBuf.getPtr+1]:
        lexGeta_(1);
    if (a == '\r') {
        lexSkipLookahead();
        }
    lexBuf.buf[lexBuf.getPtr] = '\n';
    }
    return c;
    }

static int lexGetc() {
    int c = lexLookahead();
    if (lexBuf.len > 0 && lexBuf.buf[lexBuf.getPtr]!=EOF) {
    /* EOF will remain in lookahead buffer */
        lexBuf.getPtr = (lexBuf.getPtr + 1) % MAX_LEX_LOOKAHEAD;
    lexBuf.len--;
        }
    return c;
    }

static void lexSkipLookaheadWord() {
    if (lexBuf.strsLen <= lexBuf.len) {
    lexBuf.len -= lexBuf.strsLen;
    lexBuf.getPtr = (lexBuf.getPtr + lexBuf.strsLen) % MAX_LEX_LOOKAHEAD;
    }
    }

static void lexClearToken()
    {
    lexBuf.strsLen = 0;
    }

static void lexAppendc(int c)
    {
    lexBuf.strs[lexBuf.strsLen] = c;
    /* append up to zero termination */
    if (c == 0) return;
    lexBuf.strsLen++;
    if (lexBuf.strsLen > lexBuf.maxToken) {
    /* double the token string size */
    lexBuf.maxToken <<= 1;
    lexBuf.strs = (char*) realloc(lexBuf.strs,(size_t)lexBuf.maxToken);
    }
    }

static char* lexStr() {
    return dupStr(lexBuf.strs,(size_t)lexBuf.strsLen+1);
    }

static void lexSkipWhite() {
    int c = lexLookahead();
    while (c == ' ' || c == '\t') {
    lexSkipLookahead();
    c = lexLookahead();
    }
    }

static char* lexGetWord() {
    int c;
    lexSkipWhite();
    lexClearToken();
    c = lexLookahead();
    while (c != EOF && !strchr("\t\n ;:=",c)) {
    lexAppendc(c);
    lexSkipLookahead();
    c = lexLookahead();
    }
    lexAppendc(0);
    return lexStr();
    }

static void lexPushLookaheadc(int c) {
    int putptr;
    /* can't putback EOF, because it never leaves lookahead buffer */
    if (c == EOF) return;
    putptr = (int)lexBuf.getPtr - 1;
    if (putptr < 0) putptr += MAX_LEX_LOOKAHEAD;
    lexBuf.getPtr = putptr;
    lexBuf.buf[putptr] = c;
    lexBuf.len += 1;
    }

static char* lexLookaheadWord() {
    /* this function can lookahead word with max size of MAX_LEX_LOOKAHEAD_0
     /  and thing bigger than that will stop the lookahead and return 0;
     / leading white spaces are not recoverable.
     */
    int c;
    int len = 0;
    int curgetptr = 0;
    lexSkipWhite();
    lexClearToken();
    curgetptr = (int)lexBuf.getPtr; /* remember! */
    while (len < (MAX_LEX_LOOKAHEAD_0)) {
    c = lexGetc();
    len++;
    if (c == EOF || strchr("\t\n ;:=", c)) {
        lexAppendc(0);
        /* restore lookahead buf. */
        lexBuf.len += len;
        lexBuf.getPtr = curgetptr;
        return lexStr();
        }
        else
        lexAppendc(c);
    }
    lexBuf.len += len;  /* char that has been moved to lookahead buffer */
    lexBuf.getPtr = curgetptr;
    return 0;
    }

#ifdef _SUPPORT_LINE_FOLDING
static void handleMoreRFC822LineBreak(int c) {
    /* suport RFC 822 line break in cases like
     *  ADR: foo;
     *    morefoo;
     *    more foo;
     */
    if (c == ';') {
    int a;
    lexSkipLookahead();
    /* skip white spaces */
    a = lexLookahead();
    while (a == ' ' || a == '\t') {
        lexSkipLookahead();
        a = lexLookahead();
        }
    if (a == '\n') {
        lexSkipLookahead();
        a = lexLookahead();
        if (a == ' ' || a == '\t') {
        /* continuation, throw away all the \n and spaces read so
         * far
         */
        lexSkipWhite();
        lexPushLookaheadc(';');
        }
        else {
        lexPushLookaheadc('\n');
        lexPushLookaheadc(';');
        }
        }
    else {
        lexPushLookaheadc(';');
        }
    }
    }

static char* lexGet1Value() {
    int c;
    lexSkipWhite();
    c = lexLookahead();
    lexClearToken();
    while (c != EOF && c != ';') {
    if (c == '\n') {
        int a;
        lexSkipLookahead();
        a  = lexLookahead();
        if (a == ' ' || a == '\t') {
        lexAppendc(' ');
        lexSkipLookahead();
        }
        else {
        lexPushLookaheadc('\n');
        break;
        }
        }
    else {
        lexAppendc(c);
        lexSkipLookahead();
        }
    c = lexLookahead();
    }
    lexAppendc(0);
    handleMoreRFC822LineBreak(c);
    return c==EOF?0:lexStr();
    }
#endif


static int match_begin_name(int end) {
    char *n = lexLookaheadWord();
    int token = ID;
    if (n) {
    if (!stricmp(n,"vcard")) token = end?END_VCARD:BEGIN_VCARD;
    else if (!stricmp(n,"vcalendar")) token = end?END_VCAL:BEGIN_VCAL;
    else if (!stricmp(n,"vevent")) token = end?END_VEVENT:BEGIN_VEVENT;
    else if (!stricmp(n,"vtodo")) token = end?END_VTODO:BEGIN_VTODO;
    deleteStr(n);
    return token;
    }
    return 0;
    }


#ifdef INCLUDEMFC
void initLex(const char *inputstring, unsigned long inputlen, CFile *inputfile)
#else
void initLex(const char *inputstring, unsigned long inputlen, FILE *inputfile)
#endif
    {
    /* initialize lex mode stack */
    lexBuf.lexModeStack[lexBuf.lexModeStackTop=0] = L_NORMAL;

    /* iniatialize lex buffer. */
    lexBuf.inputString = (char*) inputstring;
    lexBuf.inputLen = inputlen;
    lexBuf.curPos = 0;
    lexBuf.inputFile = inputfile;

    lexBuf.len = 0;
    lexBuf.getPtr = 0;

    lexBuf.maxToken = MAXTOKEN;
    lexBuf.strs = (char*)malloc(MAXTOKEN);
    lexBuf.strsLen = 0;

    }

static void finiLex() {
    free(lexBuf.strs);
    }


/* This parses and converts the base64 format for binary encoding into
 * a decoded buffer (allocated with new).  See RFC 1521.
 */
static char * lexGetDataFromBase64()
    {
    unsigned long bytesLen = 0, bytesMax = 0;
    int quadIx = 0, pad = 0;
    unsigned long trip = 0;
    unsigned char b;
    int c;
    unsigned char *bytes = NULL;
    unsigned char *oldBytes = NULL;

    DBG_(("db: lexGetDataFromBase64\n"));
    while (1) {
    c = lexGetc();
    if (c == '\n') {
        ++mime_lineNum;
        if (lexLookahead() == '\n') {
        /* a '\n' character by itself means end of data */
        break;
        }
        else continue; /* ignore '\n' */
        }
    else {
        if ((c >= 'A') && (c <= 'Z'))
        b = (unsigned char)(c - 'A');
        else if ((c >= 'a') && (c <= 'z'))
        b = (unsigned char)(c - 'a') + 26;
        else if ((c >= '0') && (c <= '9'))
        b = (unsigned char)(c - '0') + 52;
        else if (c == '+')
        b = 62;
        else if (c == '/')
        b = 63;
        else if (c == '=') {
        b = 0;
        pad++;
        } else if ((c == ' ') || (c == '\t')) {
        continue;
        } else { /* error condition */
        if (bytes) free(bytes);
        else if (oldBytes) free(oldBytes);
        /* error recovery: skip until 2 adjacent newlines. */
        DBG_(("db: invalid character 0x%x '%c'\n", c,c));
        if (c != EOF)  {
            c = lexGetc();
            while (c != EOF) {
            if (c == '\n' && lexLookahead() == '\n') {
                ++mime_lineNum;
                break;
                }
            c = lexGetc();
            }
            }
        return NULL;
        }
        trip = (trip << 6) | b;
        if (++quadIx == 4) {
        unsigned char outBytes[3];
        int numOut;
        int i;
        for (i = 0; i < 3; i++) {
            outBytes[2-i] = (unsigned char)(trip & 0xFF);
            trip >>= 8;
            }
        numOut = 3 - pad;
        if (bytesLen + numOut > bytesMax) {
            if (!bytes) {
            bytesMax = 1024;
            bytes = (unsigned char*)malloc((size_t)bytesMax);
            }
            else {
            bytesMax <<= 2;
            oldBytes = bytes;
            bytes = (unsigned char*)realloc(bytes,(size_t)bytesMax);
            }
            if (bytes == 0) {
            mime_error("out of memory while processing BASE64 data\n");
            }
            }
        if (bytes) {
            memcpy(bytes + bytesLen, outBytes, numOut);
            bytesLen += numOut;
            }
        trip = 0;
        quadIx = 0;
        }
        }
    } /* while */
    DBG_(("db: bytesLen = %d\n",  bytesLen));
    /* kludge: all this won't be necessary if we have tree form
    representation */
    if (bytes) {
    setValueWithSize(curProp,bytes,(unsigned int)bytesLen);
    free(bytes);
    }
    else if (oldBytes) {
    setValueWithSize(curProp,oldBytes,(unsigned int)bytesLen);
    free(oldBytes);
    }
    return 0;
    }

static int match_begin_end_name(int end) {
    int token;
    lexSkipWhite();
    if (lexLookahead() != ':') return ID;
    lexSkipLookahead();
    lexSkipWhite();
    token = match_begin_name(end);
    if (token == ID) {
    lexPushLookaheadc(':');
    DBG_(("db: ID '%s'\n", yylval.str));
    return ID;
    }
    else if (token != 0) {
    lexSkipLookaheadWord();
    deleteStr(yylval.str);
    DBG_(("db: begin/end %d\n", token));
    return token;
    }
    return 0;
    }

static char* lexGetQuotedPrintable()
    {
    char cur;

    lexClearToken();
    do {
    cur = lexGetc();
    switch (cur) {
        case '=': {
        int c = 0;
        int next[2];
        int i;
        for (i = 0; i < 2; i++) {
            next[i] = lexGetc();
            if (next[i] >= '0' && next[i] <= '9')
            c = c * 16 + next[i] - '0';
            else if (next[i] >= 'A' && next[i] <= 'F')
            c = c * 16 + next[i] - 'A' + 10;
            else
            break;
            }
        if (i == 0) {
            /* single '=' follow by LINESEP is continuation sign? */
            if (next[0] == '\n') {
            ++mime_lineNum;
            }
            else {
            lexPushLookaheadc('=');
            goto EndString;
            }
            }
        else if (i == 1) {
            lexPushLookaheadc(next[1]);
            lexPushLookaheadc(next[0]);
            lexAppendc('=');
        } else {
            lexAppendc(c);
            }
        break;
        } /* '=' */
        case '\n': {
        lexPushLookaheadc('\n');
        goto EndString;
        }
        case (char)EOF:
        break;
        default:
        lexAppendc(cur);
        break;
        } /* switch */
    } while (cur != (char)EOF);

EndString:
    lexAppendc(0);
    return lexStr();
    } /* LexQuotedPrintable */

int yylex() {

    int lexmode = LEXMODE();
    if (lexmode == L_VALUES) {
    int c = lexGetc();
    if (c == ';') {
        DBG_(("db: SEMICOLON\n"));
        lexPushLookaheadc(c);
#ifdef _SUPPORT_LINE_FOLDING
        handleMoreRFC822LineBreak(c);
#endif
        lexSkipLookahead();
        return SEMICOLON;
        }
    else if (strchr("\n",c)) {
        ++mime_lineNum;
        /* consume all line separator(s) adjacent to each other */
        c = lexLookahead();
        while (strchr("\n",c)) {
        lexSkipLookahead();
        c = lexLookahead();
        ++mime_lineNum;
        }
        DBG_(("db: LINESEP\n"));
        return LINESEP;
        }
    else {
        char *p = 0;
        lexPushLookaheadc(c);
        if (lexWithinMode(L_BASE64)) {
        /* get each char and convert to bin on the fly... */
        p = lexGetDataFromBase64();
        yylval.str = p;
        return STRING;
        }
        else if (lexWithinMode(L_QUOTED_PRINTABLE)) {
        p = lexGetQuotedPrintable();
        }
        else {
#ifdef _SUPPORT_LINE_FOLDING
        p = lexGet1Value();
#else
        p = lexGetStrUntil(";\n");
#endif
        }
        if (p) {
        DBG_(("db: STRING: '%s'\n", p));
        yylval.str = p;
        return STRING;
        }
        else return 0;
        }
    }
    else {
    /* normal mode */
    while (1) {
        int c = lexGetc();
        switch(c) {
        case ':': {
            /* consume all line separator(s) adjacent to each other */
            /* ignoring linesep immediately after colon. */
/*          c = lexLookahead();
            while (strchr("\n",c)) {
            lexSkipLookahead();
            c = lexLookahead();
            ++mime_lineNum;
            }*/
            DBG_(("db: COLON\n"));
            return COLON;
            }
        case ';':
            DBG_(("db: SEMICOLON\n"));
            return SEMICOLON;
        case '=':
            DBG_(("db: EQ\n"));
            return EQ;
        /* ignore whitespace in this mode */
        case '\t':
        case ' ': continue;
        case '\n': {
            ++mime_lineNum;
            continue;
            }
        case EOF: return 0;
            break;
        default: {
            lexPushLookaheadc(c);
            if (isalpha(c)) {
            char *t = lexGetWord();
            yylval.str = t;
            if (!stricmp(t, "begin")) {
                return match_begin_end_name(0);
                }
            else if (!stricmp(t,"end")) {
                return match_begin_end_name(1);
                }
                else {
                DBG_(("db: ID '%s'\n", t));
                return ID;
                }
            }
            else {
            /* unknow token */
            return 0;
            }
            break;
            }
        }
        }
    }
    return 0;
    }


/***************************************************************************/
/***                            Public Functions                        ****/
/***************************************************************************/

static VObject* Parse_MIMEHelper()
    {
    ObjStackTop = -1;
    mime_numErrors = 0;
    mime_lineNum = 1;
    vObjList = 0;
    curObj = 0;

    if (yyparse() != 0)
    return 0;

    finiLex();
    return vObjList;
    }

DLLEXPORT(VObject*) Parse_MIME(const char *input, unsigned long len)
    {
    initLex(input, len, 0);
    return Parse_MIMEHelper();
    }


#if INCLUDEMFC

DLLEXPORT(VObject*) Parse_MIME_FromFile(CFile *file)
    {
    unsigned long startPos;
    VObject *result;

    initLex(0,-1,file);
    startPos = file->GetPosition();
    if (!(result = Parse_MIMEHelper()))
    file->Seek(startPos, CFile::begin);
    return result;
    }

#else

VObject* Parse_MIME_FromFile(FILE *file)
    {
    VObject *result;
    long startPos;

    initLex(0,(unsigned long)-1,file);
    startPos = ftell(file);
    if (!(result = Parse_MIMEHelper())) {
    fseek(file,startPos,SEEK_SET);
    }
    return result;
    }

DLLEXPORT(VObject*) Parse_MIME_FromFileName(char *fname)
    {
    FILE *fp = fopen(fname,"r");
    if (fp) {
    VObject* o = Parse_MIME_FromFile(fp);
    fclose(fp);
    return o;
    }
    else {
    char msg[256];
    snprintf(msg, sizeof(msg), "can't open file '%s' for reading\n", fname);
    mime_error_(msg);
    return 0;
    }
    }

#endif


static MimeErrorHandler mimeErrorHandler;

DLLEXPORT(void) registerMimeErrorHandler(MimeErrorHandler me)
    {
    mimeErrorHandler = me;
    }

static void mime_error(char *s)
    {
    char msg[256];
    if (mimeErrorHandler) {
    sprintf(msg,"%s at line %d", s, mime_lineNum);
    mimeErrorHandler(msg);
    }
    }

static void mime_error_(char *s)
    {
    if (mimeErrorHandler) {
    mimeErrorHandler(s);
    }
    }