/* A Bison parser, made by GNU Bison 2.4.2. */
/* Skeleton implementation for Bison GLR parsers in C
Copyright (C) 2002-2006, 2009-2010 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 3 of the License, 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, see . */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* C GLR parser skeleton written by Paul Hilfinger. */
/* Identify Bison output. */
#define YYBISON 1
/* Bison version. */
#define YYBISON_VERSION "2.4.2"
/* Skeleton name. */
#define YYSKELETON_NAME "glr.c"
/* Pure parsers. */
#define YYPURE 0
/* Using locations. */
#define YYLSP_NEEDED 0
/* Copy the first part of user declarations. */
/* Line 171 of glr.c */
#line 12 "kroparser.y"
#include
#include
#include
#include
#define YYERROR_VERBOSE 1
#define DL_KOMUNIKATU 30
#define DL_METRUM 10
#define DL_NUTY 20
#define IL_NUT_W_TAKCIE 100
#define DL_NAZWY_PLIKU 30
typedef enum {
subkontra = 0,
kontra = 1,
wielka = 2,
mala = 3,
razkreslna = 4,
dwukreslna = 5,
trojkreslna = 6,
czterkreslna = 7,
pieckreslna = 8,
zadna = 9,
} Oktawa;
typedef enum {
ce = 0,
de = 1,
ee = 2,
ef = 3,
ge = 4,
aa = 5,
ha = 6,
pau = 7,
nic = 8
} Wysokosc_dzwieku;
typedef enum {
krotkie = 0, dlugie = 1
} Dlugosc_nut;
int yylex (void);
void wys_i_trwanie(char nuta[DL_NUTY], Wysokosc_dzwieku dz, int trwanie);
FILE* wej;
FILE* wyj;
char zn_chrom, zn_okt,
metrum[DL_METRUM],
nuta[DL_NUTY],
takt[DL_NUTY * IL_NUT_W_TAKCIE];
int nr_kropasa, il_krop, i;
Oktawa akt_oktawa;
Wysokosc_dzwieku akt_wys;
Dlugosc_nut dlugosci;
void yyerror (char *s) { // wywolywane przez yyparse w razie bledu
printf ("\n !!! kropas nr %i: %s\n\n", nr_kropasa, s);
exit(1);
}
/* Line 171 of glr.c */
#line 124 "kroparser.tab.c"
/* Tokens. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
/* Put the tokens into the symbol table, so that GDB and other debuggers
know about them. */
enum yytokentype {
p00 = 258,
p01 = 259,
p02 = 260,
p03 = 261,
p04 = 262,
p05 = 263,
p06 = 264,
p10 = 265,
p11 = 266,
p12 = 267,
p13 = 268,
p15 = 269,
p16 = 270,
p17 = 271,
p20 = 272,
p21 = 273,
p22 = 274,
p23 = 275,
p24 = 276,
p25 = 277,
p26 = 278,
p27 = 279,
p30 = 280,
p31 = 281,
p32 = 282,
p33 = 283,
p34 = 284,
p35 = 285,
p36 = 286,
p37 = 287,
p40 = 288,
p41 = 289,
p42 = 290,
p43 = 291,
p45 = 292,
p46 = 293,
p47 = 294,
p50 = 295,
p51 = 296,
p52 = 297,
p53 = 298,
p55 = 299,
p56 = 300,
p57 = 301,
p60 = 302,
p61 = 303,
p62 = 304,
p63 = 305,
p64 = 306,
p65 = 307,
p66 = 308,
p67 = 309,
p70 = 310,
p71 = 311,
p72 = 312,
p73 = 313,
p74 = 314,
p75 = 315,
p76 = 316,
p77 = 317
};
#endif
#ifndef YYSTYPE
typedef int YYSTYPE;
# define YYSTYPE_IS_TRIVIAL 1
#endif
#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
typedef struct YYLTYPE
{
char yydummy;
} YYLTYPE;
# define YYLTYPE_IS_DECLARED 1
# define YYLTYPE_IS_TRIVIAL 1
#endif
/* Enabling traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif
/* Enabling the token table. */
#ifndef YYTOKEN_TABLE
# define YYTOKEN_TABLE 0
#endif
/* Default (constant) value used for initialization for null
right-hand sides. Unlike the standard yacc.c template,
here we set the default value of $$ to a zeroed-out value.
Since the default value is undefined, this behavior is
technically correct. */
static YYSTYPE yyval_default;
/* Copy the second part of user declarations. */
/* Line 242 of glr.c */
#line 246 "kroparser.tab.c"
#include
#include
#include
#ifndef YY_
# if defined YYENABLE_NLS && YYENABLE_NLS
# if ENABLE_NLS
# include /* INFRINGES ON USER NAME SPACE */
# define YY_(msgid) dgettext ("bison-runtime", msgid)
# endif
# endif
# ifndef YY_
# define YY_(msgid) msgid
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YYUSE(e) ((void) (e))
#else
# define YYUSE(e) /* empty */
#endif
/* Identity function, used to suppress warnings about constant conditions. */
#ifndef lint
# define YYID(n) (n)
#else
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static int
YYID (int i)
#else
static int
YYID (i)
int i;
#endif
{
return i;
}
#endif
#ifndef YYFREE
# define YYFREE free
#endif
#ifndef YYMALLOC
# define YYMALLOC malloc
#endif
#ifndef YYREALLOC
# define YYREALLOC realloc
#endif
#define YYSIZEMAX ((size_t) -1)
#ifdef __cplusplus
typedef bool yybool;
#else
typedef unsigned char yybool;
#endif
#define yytrue 1
#define yyfalse 0
#ifndef YYSETJMP
# include
# define YYJMP_BUF jmp_buf
# define YYSETJMP(env) setjmp (env)
# define YYLONGJMP(env, val) longjmp (env, val)
#endif
/*-----------------.
| GCC extensions. |
`-----------------*/
#ifndef __attribute__
/* This feature is available in gcc versions 2.5 and later. */
# if (! defined __GNUC__ || __GNUC__ < 2 \
|| (__GNUC__ == 2 && __GNUC_MINOR__ < 5) \
|| (defined __STRICT_ANSI__ && __STRICT_ANSI__))
# define __attribute__(Spec) /* empty */
# endif
#endif
#ifdef __cplusplus
# define YYOPTIONAL_LOC(Name) /* empty */
#else
# define YYOPTIONAL_LOC(Name) Name __attribute__ ((__unused__))
#endif
#ifndef YYASSERT
# define YYASSERT(condition) ((void) ((condition) || (abort (), 0)))
#endif
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 4
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 471
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 63
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 19
/* YYNRULES -- Number of rules. */
#define YYNRULES 100
/* YYNRULES -- Number of states. */
#define YYNSTATES 129
/* YYMAXRHS -- Maximum number of symbols on right-hand side of rule. */
#define YYMAXRHS 5
/* YYMAXLEFT -- Maximum number of symbols to the left of a handle
accessed by $0, $-1, etc., in any rule. */
#define YYMAXLEFT 0
/* YYTRANSLATE(X) -- Bison symbol number corresponding to X. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 317
#define YYTRANSLATE(YYX) \
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
static const unsigned 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, 44,
45, 46, 47, 48, 49, 50, 51, 52, 53, 54,
55, 56, 57, 58, 59, 60, 61, 62
};
#if YYDEBUG
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
YYRHS. */
static const unsigned char yyprhs[] =
{
0, 0, 3, 7, 8, 10, 12, 15, 19, 24,
28, 31, 35, 40, 44, 47, 50, 52, 54, 56,
58, 60, 62, 64, 66, 68, 70, 73, 75, 77,
80, 82, 84, 86, 88, 90, 92, 94, 96, 98,
100, 104, 110, 112, 116, 118, 121, 124, 128, 132,
137, 139, 141, 143, 146, 148, 150, 152, 154, 156,
158, 160, 163, 165, 168, 171, 175, 179, 181, 183,
185, 187, 189, 191, 193, 195, 197, 199, 201, 203,
205, 207, 209, 211, 213, 215, 217, 219, 221, 223,
225, 227, 229, 231, 233, 235, 237, 239, 241, 243,
244
};
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
static const signed char yyrhs[] =
{
64, 0, -1, 65, 66, 72, -1, -1, 29, -1,
69, -1, 41, 69, -1, 41, 41, 69, -1, 41,
41, 41, 69, -1, 67, 41, 69, -1, 36, 69,
-1, 36, 36, 69, -1, 36, 36, 36, 69, -1,
67, 36, 69, -1, 59, 68, -1, 67, 68, -1,
27, -1, 4, -1, 6, -1, 11, -1, 26, -1,
18, -1, 13, -1, 28, -1, 20, -1, 12, -1,
67, 70, -1, 67, -1, 71, -1, 70, 71, -1,
51, -1, 5, -1, 9, -1, 19, -1, 49, -1,
35, -1, 23, -1, 53, -1, 38, -1, 21, -1,
73, 36, 8, -1, 73, 3, 74, 36, 8, -1,
74, -1, 73, 3, 74, -1, 75, -1, 74, 75,
-1, 78, 81, -1, 76, 78, 81, -1, 77, 78,
81, -1, 76, 77, 78, 81, -1, 41, -1, 36,
-1, 34, -1, 10, 10, -1, 10, -1, 25, -1,
55, -1, 17, -1, 40, -1, 47, -1, 33, -1,
33, 33, -1, 80, -1, 79, 80, -1, 36, 5,
-1, 25, 36, 5, -1, 10, 36, 5, -1, 60,
-1, 52, -1, 46, -1, 62, -1, 54, -1, 45,
-1, 61, -1, 14, -1, 30, -1, 22, -1, 16,
-1, 32, -1, 24, -1, 15, -1, 31, -1, 37,
-1, 56, -1, 48, -1, 43, -1, 58, -1, 50,
-1, 42, -1, 57, -1, 39, -1, 26, -1, 18,
-1, 13, -1, 28, -1, 20, -1, 12, -1, 27,
-1, 44, -1, -1, 81, 7, -1
};
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
static const unsigned short int yyrline[] =
{
0, 144, 144, 148, 149, 152, 153, 154, 155, 156,
157, 158, 159, 160, 163, 164, 167, 168, 169, 170,
171, 172, 173, 174, 175, 176, 179, 180, 183, 184,
187, 188, 189, 190, 191, 192, 193, 194, 195, 196,
199, 200, 203, 204, 207, 208, 211, 215, 224, 228,
240, 241, 242, 245, 246, 247, 248, 249, 250, 251,
252, 253, 256, 257, 260, 261, 262, 265, 266, 267,
268, 269, 270, 271, 272, 274, 275, 276, 277, 278,
279, 280, 281, 283, 284, 285, 286, 287, 288, 289,
290, 292, 293, 294, 295, 296, 297, 298, 299, 302,
303
};
#endif
#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"$end", "error", "$undefined", "p00", "p01", "p02", "p03", "p04", "p05",
"p06", "p10", "p11", "p12", "p13", "p15", "p16", "p17", "p20", "p21",
"p22", "p23", "p24", "p25", "p26", "p27", "p30", "p31", "p32", "p33",
"p34", "p35", "p36", "p37", "p40", "p41", "p42", "p43", "p45", "p46",
"p47", "p50", "p51", "p52", "p53", "p55", "p56", "p57", "p60", "p61",
"p62", "p63", "p64", "p65", "p66", "p67", "p70", "p71", "p72", "p73",
"p74", "p75", "p76", "p77", "$accept", "Muzyka", "Klucz",
"TonacjaMetrum", "Liczba", "Cyfra", "Metrum", "Liczba_obnizona",
"Cyfra_obnizona", "Takty", "Takty1", "Takt", "Nuta", "znak_chrom",
"znak_oktawy", "nutka", "zn_dlug", "nutka_wlasc", "Kropki", 0
};
#endif
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const unsigned char yyr1[] =
{
0, 63, 64, 65, 65, 66, 66, 66, 66, 66,
66, 66, 66, 66, 67, 67, 68, 68, 68, 68,
68, 68, 68, 68, 68, 68, 69, 69, 70, 70,
71, 71, 71, 71, 71, 71, 71, 71, 71, 71,
72, 72, 73, 73, 74, 74, 75, 75, 75, 75,
76, 76, 76, 77, 77, 77, 77, 77, 77, 77,
77, 77, 78, 78, 79, 79, 79, 80, 80, 80,
80, 80, 80, 80, 80, 80, 80, 80, 80, 80,
80, 80, 80, 80, 80, 80, 80, 80, 80, 80,
80, 80, 80, 80, 80, 80, 80, 80, 80, 81,
81
};
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
static const unsigned char yyr2[] =
{
0, 2, 3, 0, 1, 1, 2, 3, 4, 3,
2, 3, 4, 3, 2, 2, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 2, 1, 1, 2,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
3, 5, 1, 3, 1, 2, 2, 3, 3, 4,
1, 1, 1, 2, 1, 1, 1, 1, 1, 1,
1, 2, 1, 2, 2, 3, 3, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 0,
2
};
/* YYDPREC[RULE-NUM] -- Dynamic precedence of rule #RULE-NUM (0 if none). */
static const unsigned char yydprec[] =
{
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0
};
/* YYMERGER[RULE-NUM] -- Index of merging function for rule #RULE-NUM. */
static const unsigned char yymerger[] =
{
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0
};
/* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE
doesn't specify something else to do. Zero means the default is an
error. */
static const unsigned char yydefact[] =
{
3, 4, 0, 0, 1, 0, 0, 0, 0, 27,
5, 0, 27, 10, 0, 6, 17, 18, 19, 25,
22, 21, 24, 20, 16, 23, 14, 54, 96, 93,
74, 80, 77, 57, 92, 95, 76, 79, 55, 91,
97, 94, 75, 81, 78, 60, 52, 51, 82, 90,
58, 50, 88, 85, 98, 72, 69, 59, 84, 87,
68, 71, 56, 83, 89, 86, 67, 73, 70, 2,
0, 42, 44, 0, 0, 99, 0, 62, 31, 32,
33, 39, 36, 35, 0, 38, 0, 34, 30, 37,
15, 26, 28, 0, 11, 0, 7, 53, 0, 0,
61, 64, 0, 0, 45, 0, 0, 99, 0, 0,
99, 46, 63, 13, 9, 29, 12, 8, 66, 65,
43, 40, 99, 47, 48, 100, 51, 49, 41
};
/* YYPDEFGOTO[NTERM-NUM]. */
static const signed char yydefgoto[] =
{
-1, 2, 3, 8, 12, 90, 10, 91, 92, 69,
70, 71, 72, 73, 74, 75, 76, 77, 111
};
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
#define YYPACT_NINF -71
static const short int yypact[] =
{
-24, -71, 7, 21, -71, 13, 41, 57, -2, 348,
-71, 28, 398, -71, 73, -71, -71, -71, -71, -71,
-71, -71, -71, -71, -71, -71, -71, 11, -71, -71,
-71, -71, -71, -71, -71, -71, -71, -71, -19, -71,
-71, -71, -71, -71, -71, -14, -71, 22, -71, -71,
-71, -71, -71, -71, -71, -71, -71, -71, -71, -71,
-71, -71, -71, -71, -71, -71, -71, -71, -71, -71,
30, 79, -71, 185, 238, -71, 289, -71, -71, -71,
-71, -71, -71, -71, 6, -71, 6, -71, -71, -71,
-71, 418, -71, 6, -71, 6, -71, -71, 62, 93,
-71, -71, -2, 70, -71, 22, 238, -71, 66, 72,
-71, 110, -71, -71, -71, -71, -71, -71, -71, -71,
132, -71, -71, 110, 110, -71, 68, 110, -71
};
/* YYPGOTO[NTERM-NUM]. */
static const signed char yypgoto[] =
{
-71, -71, -71, -71, 125, 123, -5, -71, 47, -71,
-71, 49, -69, -71, 80, -70, -71, 67, -36
};
/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
positive, shift that token. If negative, reduce the rule which
number is the opposite. If zero, do what YYDEFACT says.
If YYTABLE_NINF, syntax error. */
#define YYTABLE_NINF -1
static const unsigned char yytable[] =
{
13, 15, 104, 107, 110, 1, 94, 4, 27, 96,
28, 29, 30, 31, 32, 33, 34, 99, 35, 100,
36, 97, 37, 38, 39, 40, 41, 101, 42, 43,
44, 45, 46, 102, 47, 48, 122, 49, 50, 51,
52, 53, 54, 55, 56, 57, 58, 98, 59, 11,
60, 104, 61, 62, 63, 64, 65, 5, 66, 67,
68, 16, 6, 17, 93, 7, 103, 118, 18, 19,
20, 123, 7, 101, 124, 21, 128, 22, 121, 113,
7, 114, 14, 23, 24, 25, 127, 7, 116, 27,
117, 28, 29, 30, 31, 32, 33, 34, 119, 35,
7, 36, 98, 37, 38, 39, 40, 41, 99, 42,
43, 44, 45, 46, 95, 47, 48, 125, 49, 50,
51, 52, 53, 54, 55, 56, 57, 58, 9, 59,
26, 60, 7, 61, 62, 63, 64, 65, 115, 66,
67, 68, 27, 112, 28, 29, 30, 31, 32, 33,
34, 120, 35, 106, 36, 0, 37, 38, 39, 40,
41, 0, 42, 43, 44, 45, 46, 0, 126, 48,
0, 49, 50, 51, 52, 53, 54, 55, 56, 57,
58, 0, 59, 0, 60, 0, 61, 62, 63, 64,
65, 0, 66, 67, 68, 27, 0, 28, 29, 30,
31, 32, 33, 34, 0, 35, 0, 36, 0, 37,
38, 39, 40, 41, 0, 42, 43, 44, 45, 0,
0, 105, 48, 0, 49, 50, 0, 52, 53, 54,
55, 56, 57, 58, 0, 59, 0, 60, 0, 61,
62, 63, 64, 65, 0, 66, 67, 68, 108, 0,
28, 29, 30, 31, 32, 0, 34, 0, 35, 0,
36, 0, 37, 109, 39, 40, 41, 0, 42, 43,
44, 0, 0, 0, 105, 48, 0, 49, 0, 0,
52, 53, 54, 55, 56, 0, 58, 0, 59, 0,
60, 0, 61, 0, 63, 64, 65, 0, 66, 67,
68, 28, 29, 30, 31, 32, 0, 34, 0, 35,
0, 36, 0, 37, 0, 39, 40, 41, 0, 42,
43, 44, 0, 0, 0, 0, 48, 0, 49, 0,
0, 52, 53, 54, 55, 56, 0, 58, 0, 59,
0, 60, 0, 61, 0, 63, 64, 65, 0, 66,
67, 68, 16, 78, 17, 0, 0, 79, 0, 18,
19, 20, 0, 0, 0, 0, 21, 80, 22, 81,
0, 82, 0, 0, 23, 24, 25, 0, 0, 0,
0, 0, 0, 83, 84, 0, 85, 0, 0, 86,
0, 0, 0, 0, 0, 0, 0, 87, 0, 88,
0, 89, 16, 78, 17, 0, 0, 79, 0, 18,
19, 20, 0, 0, 0, 0, 21, 80, 22, 81,
0, 82, 0, 78, 23, 24, 25, 79, 0, 0,
0, 0, 0, 83, 0, 0, 85, 80, 0, 81,
0, 82, 0, 0, 0, 0, 0, 87, 0, 88,
0, 89, 0, 83, 0, 0, 85, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 87, 0, 88,
0, 89
};
/* YYCONFLP[YYPACT[STATE-NUM]] -- Pointer into YYCONFL of start of
list of conflicting reductions corresponding to action entry for
state STATE-NUM in yytable. 0 means no conflicts. The list in
yyconfl is terminated by a rule number of 0. */
static const unsigned char yyconflp[] =
{
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 37, 0, 0,
0, 33, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 35, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 39, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
1, 3, 0, 0, 0, 0, 5, 0, 7, 0,
0, 0, 0, 0, 9, 11, 13, 0, 0, 0,
0, 0, 0, 0, 15, 0, 0, 0, 0, 17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
19, 21, 0, 0, 0, 0, 23, 0, 25, 0,
0, 0, 0, 0, 27, 29, 31, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0
};
/* YYCONFL[I] -- lists of conflicting rule numbers, each terminated by
0, pointed into by YYCONFLP. */
static const short int yyconfl[] =
{
0, 27, 0, 27, 0, 27, 0, 27, 0, 27,
0, 27, 0, 27, 0, 27, 0, 27, 0, 27,
0, 27, 0, 27, 0, 27, 0, 27, 0, 27,
0, 27, 0, 54, 0, 54, 0, 55, 0, 42,
0
};
static const signed char yycheck[] =
{
5, 6, 71, 73, 74, 29, 11, 0, 10, 14,
12, 13, 14, 15, 16, 17, 18, 36, 20, 33,
22, 10, 24, 25, 26, 27, 28, 5, 30, 31,
32, 33, 34, 3, 36, 37, 106, 39, 40, 41,
42, 43, 44, 45, 46, 47, 48, 36, 50, 36,
52, 120, 54, 55, 56, 57, 58, 36, 60, 61,
62, 4, 41, 6, 36, 59, 36, 5, 11, 12,
13, 107, 59, 5, 110, 18, 8, 20, 8, 84,
59, 86, 41, 26, 27, 28, 122, 59, 93, 10,
95, 12, 13, 14, 15, 16, 17, 18, 5, 20,
59, 22, 36, 24, 25, 26, 27, 28, 36, 30,
31, 32, 33, 34, 41, 36, 37, 7, 39, 40,
41, 42, 43, 44, 45, 46, 47, 48, 3, 50,
7, 52, 59, 54, 55, 56, 57, 58, 91, 60,
61, 62, 10, 76, 12, 13, 14, 15, 16, 17,
18, 102, 20, 73, 22, -1, 24, 25, 26, 27,
28, -1, 30, 31, 32, 33, 34, -1, 36, 37,
-1, 39, 40, 41, 42, 43, 44, 45, 46, 47,
48, -1, 50, -1, 52, -1, 54, 55, 56, 57,
58, -1, 60, 61, 62, 10, -1, 12, 13, 14,
15, 16, 17, 18, -1, 20, -1, 22, -1, 24,
25, 26, 27, 28, -1, 30, 31, 32, 33, -1,
-1, 36, 37, -1, 39, 40, -1, 42, 43, 44,
45, 46, 47, 48, -1, 50, -1, 52, -1, 54,
55, 56, 57, 58, -1, 60, 61, 62, 10, -1,
12, 13, 14, 15, 16, -1, 18, -1, 20, -1,
22, -1, 24, 25, 26, 27, 28, -1, 30, 31,
32, -1, -1, -1, 36, 37, -1, 39, -1, -1,
42, 43, 44, 45, 46, -1, 48, -1, 50, -1,
52, -1, 54, -1, 56, 57, 58, -1, 60, 61,
62, 12, 13, 14, 15, 16, -1, 18, -1, 20,
-1, 22, -1, 24, -1, 26, 27, 28, -1, 30,
31, 32, -1, -1, -1, -1, 37, -1, 39, -1,
-1, 42, 43, 44, 45, 46, -1, 48, -1, 50,
-1, 52, -1, 54, -1, 56, 57, 58, -1, 60,
61, 62, 4, 5, 6, -1, -1, 9, -1, 11,
12, 13, -1, -1, -1, -1, 18, 19, 20, 21,
-1, 23, -1, -1, 26, 27, 28, -1, -1, -1,
-1, -1, -1, 35, 36, -1, 38, -1, -1, 41,
-1, -1, -1, -1, -1, -1, -1, 49, -1, 51,
-1, 53, 4, 5, 6, -1, -1, 9, -1, 11,
12, 13, -1, -1, -1, -1, 18, 19, 20, 21,
-1, 23, -1, 5, 26, 27, 28, 9, -1, -1,
-1, -1, -1, 35, -1, -1, 38, 19, -1, 21,
-1, 23, -1, -1, -1, -1, -1, 49, -1, 51,
-1, 53, -1, 35, -1, -1, 38, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, 49, -1, 51,
-1, 53
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const unsigned char yystos[] =
{
0, 29, 64, 65, 0, 36, 41, 59, 66, 67,
69, 36, 67, 69, 41, 69, 4, 6, 11, 12,
13, 18, 20, 26, 27, 28, 68, 10, 12, 13,
14, 15, 16, 17, 18, 20, 22, 24, 25, 26,
27, 28, 30, 31, 32, 33, 34, 36, 37, 39,
40, 41, 42, 43, 44, 45, 46, 47, 48, 50,
52, 54, 55, 56, 57, 58, 60, 61, 62, 72,
73, 74, 75, 76, 77, 78, 79, 80, 5, 9,
19, 21, 23, 35, 36, 38, 41, 49, 51, 53,
68, 70, 71, 36, 69, 41, 69, 10, 36, 36,
33, 5, 3, 36, 75, 36, 77, 78, 10, 25,
78, 81, 80, 69, 69, 71, 69, 69, 5, 5,
74, 8, 78, 81, 81, 7, 36, 81, 8
};
/* Prevent warning if -Wmissing-prototypes. */
int yyparse (void);
/* Error token number */
#define YYTERROR 1
/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
If N is 0, then set CURRENT to the empty location which ends
the previous symbol: RHS[0] (always defined). */
#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N) ((void) 0)
#endif
#ifndef YY_LOCATION_PRINT
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
#endif
/* YYLEX -- calling `yylex' with the right arguments. */
#define YYLEX yylex ()
YYSTYPE yylval;
YYLTYPE yylloc;
int yynerrs;
int yychar;
static const int YYEOF = 0;
static const int YYEMPTY = -2;
typedef enum { yyok, yyaccept, yyabort, yyerr } YYRESULTTAG;
#define YYCHK(YYE) \
do { YYRESULTTAG yyflag = YYE; if (yyflag != yyok) return yyflag; } \
while (YYID (0))
#if YYDEBUG
# ifndef YYFPRINTF
# define YYFPRINTF fprintf
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (YYID (0))
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
/*ARGSUSED*/
static void
yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
{
if (!yyvaluep)
return;
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# else
YYUSE (yyoutput);
# endif
switch (yytype)
{
default:
break;
}
}
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
static void
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
{
if (yytype < YYNTOKENS)
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
else
YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
yy_symbol_value_print (yyoutput, yytype, yyvaluep);
YYFPRINTF (yyoutput, ")");
}
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, Type, \
Value); \
YYFPRINTF (stderr, "\n"); \
} \
} while (YYID (0))
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
#endif /* !YYDEBUG */
/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
if the built-in stack extension method is used).
Do not make this value too large; the results are undefined if
SIZE_MAX < YYMAXDEPTH * sizeof (GLRStackItem)
evaluated with infinite-precision integer arithmetic. */
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
/* Minimum number of free items on the stack allowed after an
allocation. This is to allow allocation and initialization
to be completed by functions that call yyexpandGLRStack before the
stack is expanded, thus insuring that all necessary pointers get
properly redirected to new data. */
#define YYHEADROOM 2
#ifndef YYSTACKEXPANDABLE
# if (! defined __cplusplus \
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))
# define YYSTACKEXPANDABLE 1
# else
# define YYSTACKEXPANDABLE 0
# endif
#endif
#if YYSTACKEXPANDABLE
# define YY_RESERVE_GLRSTACK(Yystack) \
do { \
if (Yystack->yyspaceLeft < YYHEADROOM) \
yyexpandGLRStack (Yystack); \
} while (YYID (0))
#else
# define YY_RESERVE_GLRSTACK(Yystack) \
do { \
if (Yystack->yyspaceLeft < YYHEADROOM) \
yyMemoryExhausted (Yystack); \
} while (YYID (0))
#endif
#if YYERROR_VERBOSE
# ifndef yystpcpy
# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
# define yystpcpy stpcpy
# else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
YYDEST. */
static char *
yystpcpy (char *yydest, const char *yysrc)
{
char *yyd = yydest;
const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
# ifndef yytnamerr
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
quotes and backslashes, so that it's suitable for yyerror. The
heuristic is that double-quoting is unnecessary unless the string
contains an apostrophe, a comma, or backslash (other than
backslash-backslash). YYSTR is taken from yytname. If YYRES is
null, do not copy; instead, return the length of what the result
would have been. */
static size_t
yytnamerr (char *yyres, const char *yystr)
{
if (*yystr == '"')
{
size_t yyn = 0;
char const *yyp = yystr;
for (;;)
switch (*++yyp)
{
case '\'':
case ',':
goto do_not_strip_quotes;
case '\\':
if (*++yyp != '\\')
goto do_not_strip_quotes;
/* Fall through. */
default:
if (yyres)
yyres[yyn] = *yyp;
yyn++;
break;
case '"':
if (yyres)
yyres[yyn] = '\0';
return yyn;
}
do_not_strip_quotes: ;
}
if (! yyres)
return strlen (yystr);
return yystpcpy (yyres, yystr) - yyres;
}
# endif
#endif /* !YYERROR_VERBOSE */
/** State numbers, as in LALR(1) machine */
typedef int yyStateNum;
/** Rule numbers, as in LALR(1) machine */
typedef int yyRuleNum;
/** Grammar symbol */
typedef short int yySymbol;
/** Item references, as in LALR(1) machine */
typedef short int yyItemNum;
typedef struct yyGLRState yyGLRState;
typedef struct yyGLRStateSet yyGLRStateSet;
typedef struct yySemanticOption yySemanticOption;
typedef union yyGLRStackItem yyGLRStackItem;
typedef struct yyGLRStack yyGLRStack;
struct yyGLRState {
/** Type tag: always true. */
yybool yyisState;
/** Type tag for yysemantics. If true, yysval applies, otherwise
* yyfirstVal applies. */
yybool yyresolved;
/** Number of corresponding LALR(1) machine state. */
yyStateNum yylrState;
/** Preceding state in this stack */
yyGLRState* yypred;
/** Source position of the first token produced by my symbol */
size_t yyposn;
union {
/** First in a chain of alternative reductions producing the
* non-terminal corresponding to this state, threaded through
* yynext. */
yySemanticOption* yyfirstVal;
/** Semantic value for this state. */
YYSTYPE yysval;
} yysemantics;
/** Source location for this state. */
YYLTYPE yyloc;
};
struct yyGLRStateSet {
yyGLRState** yystates;
/** During nondeterministic operation, yylookaheadNeeds tracks which
* stacks have actually needed the current lookahead. During deterministic
* operation, yylookaheadNeeds[0] is not maintained since it would merely
* duplicate yychar != YYEMPTY. */
yybool* yylookaheadNeeds;
size_t yysize, yycapacity;
};
struct yySemanticOption {
/** Type tag: always false. */
yybool yyisState;
/** Rule number for this reduction */
yyRuleNum yyrule;
/** The last RHS state in the list of states to be reduced. */
yyGLRState* yystate;
/** The lookahead for this reduction. */
int yyrawchar;
YYSTYPE yyval;
YYLTYPE yyloc;
/** Next sibling in chain of options. To facilitate merging,
* options are chained in decreasing order by address. */
yySemanticOption* yynext;
};
/** Type of the items in the GLR stack. The yyisState field
* indicates which item of the union is valid. */
union yyGLRStackItem {
yyGLRState yystate;
yySemanticOption yyoption;
};
struct yyGLRStack {
int yyerrState;
YYJMP_BUF yyexception_buffer;
yyGLRStackItem* yyitems;
yyGLRStackItem* yynextFree;
size_t yyspaceLeft;
yyGLRState* yysplitPoint;
yyGLRState* yylastDeleted;
yyGLRStateSet yytops;
};
#if YYSTACKEXPANDABLE
static void yyexpandGLRStack (yyGLRStack* yystackp);
#endif
static void yyFail (yyGLRStack* yystackp, const char* yymsg)
__attribute__ ((__noreturn__));
static void
yyFail (yyGLRStack* yystackp, const char* yymsg)
{
if (yymsg != NULL)
yyerror (yymsg);
YYLONGJMP (yystackp->yyexception_buffer, 1);
}
static void yyMemoryExhausted (yyGLRStack* yystackp)
__attribute__ ((__noreturn__));
static void
yyMemoryExhausted (yyGLRStack* yystackp)
{
YYLONGJMP (yystackp->yyexception_buffer, 2);
}
#if YYDEBUG || YYERROR_VERBOSE
/** A printable representation of TOKEN. */
static inline const char*
yytokenName (yySymbol yytoken)
{
if (yytoken == YYEMPTY)
return "";
return yytname[yytoken];
}
#endif
/** Fill in YYVSP[YYLOW1 .. YYLOW0-1] from the chain of states starting
* at YYVSP[YYLOW0].yystate.yypred. Leaves YYVSP[YYLOW1].yystate.yypred
* containing the pointer to the next state in the chain. */
static void yyfillin (yyGLRStackItem *, int, int) __attribute__ ((__unused__));
static void
yyfillin (yyGLRStackItem *yyvsp, int yylow0, int yylow1)
{
yyGLRState* s;
int i;
s = yyvsp[yylow0].yystate.yypred;
for (i = yylow0-1; i >= yylow1; i -= 1)
{
YYASSERT (s->yyresolved);
yyvsp[i].yystate.yyresolved = yytrue;
yyvsp[i].yystate.yysemantics.yysval = s->yysemantics.yysval;
yyvsp[i].yystate.yyloc = s->yyloc;
s = yyvsp[i].yystate.yypred = s->yypred;
}
}
/* Do nothing if YYNORMAL or if *YYLOW <= YYLOW1. Otherwise, fill in
* YYVSP[YYLOW1 .. *YYLOW-1] as in yyfillin and set *YYLOW = YYLOW1.
* For convenience, always return YYLOW1. */
static inline int yyfill (yyGLRStackItem *, int *, int, yybool)
__attribute__ ((__unused__));
static inline int
yyfill (yyGLRStackItem *yyvsp, int *yylow, int yylow1, yybool yynormal)
{
if (!yynormal && yylow1 < *yylow)
{
yyfillin (yyvsp, *yylow, yylow1);
*yylow = yylow1;
}
return yylow1;
}
/** Perform user action for rule number YYN, with RHS length YYRHSLEN,
* and top stack item YYVSP. YYLVALP points to place to put semantic
* value ($$), and yylocp points to place for location information
* (@$). Returns yyok for normal return, yyaccept for YYACCEPT,
* yyerr for YYERROR, yyabort for YYABORT. */
/*ARGSUSED*/ static YYRESULTTAG
yyuserAction (yyRuleNum yyn, int yyrhslen, yyGLRStackItem* yyvsp,
YYSTYPE* yyvalp,
YYLTYPE* YYOPTIONAL_LOC (yylocp),
yyGLRStack* yystackp
)
{
yybool yynormal __attribute__ ((__unused__)) =
(yystackp->yysplitPoint == NULL);
int yylow;
# undef yyerrok
# define yyerrok (yystackp->yyerrState = 0)
# undef YYACCEPT
# define YYACCEPT return yyaccept
# undef YYABORT
# define YYABORT return yyabort
# undef YYERROR
# define YYERROR return yyerrok, yyerr
# undef YYRECOVERING
# define YYRECOVERING() (yystackp->yyerrState != 0)
# undef yyclearin
# define yyclearin (yychar = YYEMPTY)
# undef YYFILL
# define YYFILL(N) yyfill (yyvsp, &yylow, N, yynormal)
# undef YYBACKUP
# define YYBACKUP(Token, Value) \
return yyerror (YY_("syntax error: cannot back up")), \
yyerrok, yyerr
yylow = 1;
if (yyrhslen == 0)
*yyvalp = yyval_default;
else
*yyvalp = yyvsp[YYFILL (1-yyrhslen)].yystate.yysemantics.yysval;
YYLLOC_DEFAULT ((*yylocp), (yyvsp - yyrhslen), yyrhslen);
switch (yyn)
{
case 2:
/* Line 936 of glr.c */
#line 145 "kroparser.y"
{ fprintf(wyj, " ||\n\n"); fclose(wej); fclose(wyj); ;}
break;
case 4:
/* Line 936 of glr.c */
#line 149 "kroparser.y"
{ fprintf(wyj, " klucz"); ;}
break;
case 5:
/* Line 936 of glr.c */
#line 152 "kroparser.y"
{ fprintf(wyj, " %s", metrum); ;}
break;
case 6:
/* Line 936 of glr.c */
#line 153 "kroparser.y"
{ fprintf(wyj, " tonacja:1# %s", metrum); ;}
break;
case 7:
/* Line 936 of glr.c */
#line 154 "kroparser.y"
{ fprintf(wyj, " tonacja:2# %s", metrum); ;}
break;
case 8:
/* Line 936 of glr.c */
#line 155 "kroparser.y"
{ fprintf(wyj, " tonacja:3# %s", metrum); ;}
break;
case 9:
/* Line 936 of glr.c */
#line 156 "kroparser.y"
{ fprintf(wyj, " tonacja:%i# %s", (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval), metrum); ;}
break;
case 10:
/* Line 936 of glr.c */
#line 157 "kroparser.y"
{ fprintf(wyj, " tonacja:1b %s", metrum); ;}
break;
case 11:
/* Line 936 of glr.c */
#line 158 "kroparser.y"
{ fprintf(wyj, " tonacja:2b %s", metrum); ;}
break;
case 12:
/* Line 936 of glr.c */
#line 159 "kroparser.y"
{ fprintf(wyj, " tonacja:3b %s", metrum); ;}
break;
case 13:
/* Line 936 of glr.c */
#line 160 "kroparser.y"
{ fprintf(wyj, " tonacja:%ib %s", (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval), metrum); ;}
break;
case 14:
/* Line 936 of glr.c */
#line 163 "kroparser.y"
{ ((*yyvalp)) = (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval); ;}
break;
case 15:
/* Line 936 of glr.c */
#line 164 "kroparser.y"
{ ((*yyvalp)) = (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval)*10 + (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval); ;}
break;
case 16:
/* Line 936 of glr.c */
#line 167 "kroparser.y"
{ ((*yyvalp)) = 0; ;}
break;
case 17:
/* Line 936 of glr.c */
#line 168 "kroparser.y"
{ ((*yyvalp)) = 1; ;}
break;
case 18:
/* Line 936 of glr.c */
#line 169 "kroparser.y"
{ ((*yyvalp)) = 2; ;}
break;
case 19:
/* Line 936 of glr.c */
#line 170 "kroparser.y"
{ ((*yyvalp)) = 3; ;}
break;
case 20:
/* Line 936 of glr.c */
#line 171 "kroparser.y"
{ ((*yyvalp)) = 4; ;}
break;
case 21:
/* Line 936 of glr.c */
#line 172 "kroparser.y"
{ ((*yyvalp)) = 5; ;}
break;
case 22:
/* Line 936 of glr.c */
#line 173 "kroparser.y"
{ ((*yyvalp)) = 6; ;}
break;
case 23:
/* Line 936 of glr.c */
#line 174 "kroparser.y"
{ ((*yyvalp)) = 7; ;}
break;
case 24:
/* Line 936 of glr.c */
#line 175 "kroparser.y"
{ ((*yyvalp)) = 8; ;}
break;
case 25:
/* Line 936 of glr.c */
#line 176 "kroparser.y"
{ ((*yyvalp)) = 9; ;}
break;
case 26:
/* Line 936 of glr.c */
#line 179 "kroparser.y"
{ sprintf(metrum, "metrum:%i/%i\n ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval)); ;}
break;
case 27:
/* Line 936 of glr.c */
#line 180 "kroparser.y"
{ sprintf(metrum, "metrum:%i\n ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval)); ;}
break;
case 29:
/* Line 936 of glr.c */
#line 184 "kroparser.y"
{ ((*yyvalp)) = (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval)*10 + (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval); ;}
break;
case 30:
/* Line 936 of glr.c */
#line 187 "kroparser.y"
{ ((*yyvalp)) = 0; ;}
break;
case 31:
/* Line 936 of glr.c */
#line 188 "kroparser.y"
{ ((*yyvalp)) = 1; ;}
break;
case 32:
/* Line 936 of glr.c */
#line 189 "kroparser.y"
{ ((*yyvalp)) = 2; ;}
break;
case 33:
/* Line 936 of glr.c */
#line 190 "kroparser.y"
{ ((*yyvalp)) = 3; ;}
break;
case 34:
/* Line 936 of glr.c */
#line 191 "kroparser.y"
{ ((*yyvalp)) = 4; ;}
break;
case 35:
/* Line 936 of glr.c */
#line 192 "kroparser.y"
{ ((*yyvalp)) = 5; ;}
break;
case 36:
/* Line 936 of glr.c */
#line 193 "kroparser.y"
{ ((*yyvalp)) = 6; ;}
break;
case 37:
/* Line 936 of glr.c */
#line 194 "kroparser.y"
{ ((*yyvalp)) = 7; ;}
break;
case 38:
/* Line 936 of glr.c */
#line 195 "kroparser.y"
{ ((*yyvalp)) = 8; ;}
break;
case 39:
/* Line 936 of glr.c */
#line 196 "kroparser.y"
{ ((*yyvalp)) = 9; ;}
break;
case 42:
/* Line 936 of glr.c */
#line 203 "kroparser.y"
{ fprintf(wyj, " |\n "); ;}
break;
case 43:
/* Line 936 of glr.c */
#line 204 "kroparser.y"
{ fprintf(wyj, " |\n "); ;}
break;
case 44:
/* Line 936 of glr.c */
#line 207 "kroparser.y"
{ fprintf(wyj, " %s", nuta); strcpy(nuta, ""); ;}
break;
case 45:
/* Line 936 of glr.c */
#line 208 "kroparser.y"
{ fprintf(wyj, " %s", nuta); strcpy(nuta, ""); ;}
break;
case 46:
/* Line 936 of glr.c */
#line 211 "kroparser.y"
{ while (il_krop > 0) {
il_krop--; strcat(nuta, ".");
}
;}
break;
case 47:
/* Line 936 of glr.c */
#line 215 "kroparser.y"
{ for (i=strlen(nuta); i>=0; i--)
nuta[i+3]=nuta[i];
nuta[0] = '(';
nuta[1] = zn_chrom;
nuta[2] = ')';
while (il_krop > 0) {
il_krop--; strcat(nuta, ".");
}
;}
break;
case 48:
/* Line 936 of glr.c */
#line 224 "kroparser.y"
{ while (il_krop > 0) {
il_krop--; strcat(nuta, ".");
}
;}
break;
case 49:
/* Line 936 of glr.c */
#line 229 "kroparser.y"
{ for (i=strlen(nuta); i>=0; i--)
nuta[i+3]=nuta[i];
nuta[0] = '(';
nuta[1] = zn_chrom;
nuta[2] = ')';
while (il_krop > 0) {
il_krop--; strcat(nuta, ".");
}
;}
break;
case 50:
/* Line 936 of glr.c */
#line 240 "kroparser.y"
{ zn_chrom = '#'; ;}
break;
case 51:
/* Line 936 of glr.c */
#line 241 "kroparser.y"
{ zn_chrom = 'b'; ;}
break;
case 52:
/* Line 936 of glr.c */
#line 242 "kroparser.y"
{ zn_chrom = '!'; ;}
break;
case 53:
/* Line 936 of glr.c */
#line 245 "kroparser.y"
{ akt_oktawa = subkontra; akt_wys = nic; ;}
break;
case 54:
/* Line 936 of glr.c */
#line 246 "kroparser.y"
{ akt_oktawa = kontra; akt_wys = nic; ;}
break;
case 55:
/* Line 936 of glr.c */
#line 247 "kroparser.y"
{ akt_oktawa = wielka; akt_wys = nic; ;}
break;
case 56:
/* Line 936 of glr.c */
#line 248 "kroparser.y"
{ akt_oktawa = mala; akt_wys = nic; ;}
break;
case 57:
/* Line 936 of glr.c */
#line 249 "kroparser.y"
{ akt_oktawa = razkreslna; akt_wys = nic; ;}
break;
case 58:
/* Line 936 of glr.c */
#line 250 "kroparser.y"
{ akt_oktawa = dwukreslna; akt_wys = nic; ;}
break;
case 59:
/* Line 936 of glr.c */
#line 251 "kroparser.y"
{ akt_oktawa = trojkreslna; akt_wys = nic; ;}
break;
case 60:
/* Line 936 of glr.c */
#line 252 "kroparser.y"
{ akt_oktawa = czterkreslna; akt_wys = nic; ;}
break;
case 61:
/* Line 936 of glr.c */
#line 253 "kroparser.y"
{ akt_oktawa = pieckreslna; akt_wys = nic; ;}
break;
case 64:
/* Line 936 of glr.c */
#line 260 "kroparser.y"
{ dlugosci = 1-dlugosci; ;}
break;
case 65:
/* Line 936 of glr.c */
#line 261 "kroparser.y"
{ dlugosci = dlugie; ;}
break;
case 66:
/* Line 936 of glr.c */
#line 262 "kroparser.y"
{ dlugosci = krotkie; ;}
break;
case 67:
/* Line 936 of glr.c */
#line 265 "kroparser.y"
{ wys_i_trwanie(nuta, ce, 1); ;}
break;
case 68:
/* Line 936 of glr.c */
#line 266 "kroparser.y"
{ wys_i_trwanie(nuta, de, 1); ;}
break;
case 69:
/* Line 936 of glr.c */
#line 267 "kroparser.y"
{ wys_i_trwanie(nuta, ee, 1); ;}
break;
case 70:
/* Line 936 of glr.c */
#line 268 "kroparser.y"
{ wys_i_trwanie(nuta, ef, 1); ;}
break;
case 71:
/* Line 936 of glr.c */
#line 269 "kroparser.y"
{ wys_i_trwanie(nuta, ge, 1); ;}
break;
case 72:
/* Line 936 of glr.c */
#line 270 "kroparser.y"
{ wys_i_trwanie(nuta, aa, 1); ;}
break;
case 73:
/* Line 936 of glr.c */
#line 271 "kroparser.y"
{ wys_i_trwanie(nuta, ha, 1); ;}
break;
case 74:
/* Line 936 of glr.c */
#line 272 "kroparser.y"
{ wys_i_trwanie(nuta, pau, 1); ;}
break;
case 75:
/* Line 936 of glr.c */
#line 274 "kroparser.y"
{ wys_i_trwanie(nuta, ce, 2); ;}
break;
case 76:
/* Line 936 of glr.c */
#line 275 "kroparser.y"
{ wys_i_trwanie(nuta, de, 2); ;}
break;
case 77:
/* Line 936 of glr.c */
#line 276 "kroparser.y"
{ wys_i_trwanie(nuta, ee, 2); ;}
break;
case 78:
/* Line 936 of glr.c */
#line 277 "kroparser.y"
{ wys_i_trwanie(nuta, ef, 2); ;}
break;
case 79:
/* Line 936 of glr.c */
#line 278 "kroparser.y"
{ wys_i_trwanie(nuta, ge, 2); ;}
break;
case 80:
/* Line 936 of glr.c */
#line 279 "kroparser.y"
{ wys_i_trwanie(nuta, aa, 2); ;}
break;
case 81:
/* Line 936 of glr.c */
#line 280 "kroparser.y"
{ wys_i_trwanie(nuta, ha, 2); ;}
break;
case 82:
/* Line 936 of glr.c */
#line 281 "kroparser.y"
{ wys_i_trwanie(nuta, pau, 2); ;}
break;
case 83:
/* Line 936 of glr.c */
#line 283 "kroparser.y"
{ wys_i_trwanie(nuta, ce, 4); ;}
break;
case 84:
/* Line 936 of glr.c */
#line 284 "kroparser.y"
{ wys_i_trwanie(nuta, de, 4); ;}
break;
case 85:
/* Line 936 of glr.c */
#line 285 "kroparser.y"
{ wys_i_trwanie(nuta, ee, 4); ;}
break;
case 86:
/* Line 936 of glr.c */
#line 286 "kroparser.y"
{ wys_i_trwanie(nuta, ef, 4); ;}
break;
case 87:
/* Line 936 of glr.c */
#line 287 "kroparser.y"
{ wys_i_trwanie(nuta, ge, 4); ;}
break;
case 88:
/* Line 936 of glr.c */
#line 288 "kroparser.y"
{ wys_i_trwanie(nuta, aa, 4); ;}
break;
case 89:
/* Line 936 of glr.c */
#line 289 "kroparser.y"
{ wys_i_trwanie(nuta, ha, 4); ;}
break;
case 90:
/* Line 936 of glr.c */
#line 290 "kroparser.y"
{ wys_i_trwanie(nuta, pau, 4); ;}
break;
case 91:
/* Line 936 of glr.c */
#line 292 "kroparser.y"
{ wys_i_trwanie(nuta, ce, 8); ;}
break;
case 92:
/* Line 936 of glr.c */
#line 293 "kroparser.y"
{ wys_i_trwanie(nuta, de, 8); ;}
break;
case 93:
/* Line 936 of glr.c */
#line 294 "kroparser.y"
{ wys_i_trwanie(nuta, ee, 8); ;}
break;
case 94:
/* Line 936 of glr.c */
#line 295 "kroparser.y"
{ wys_i_trwanie(nuta, ef, 8); ;}
break;
case 95:
/* Line 936 of glr.c */
#line 296 "kroparser.y"
{ wys_i_trwanie(nuta, ge, 8); ;}
break;
case 96:
/* Line 936 of glr.c */
#line 297 "kroparser.y"
{ wys_i_trwanie(nuta, aa, 8); ;}
break;
case 97:
/* Line 936 of glr.c */
#line 298 "kroparser.y"
{ wys_i_trwanie(nuta, ha, 8); ;}
break;
case 98:
/* Line 936 of glr.c */
#line 299 "kroparser.y"
{ wys_i_trwanie(nuta, pau, 8); ;}
break;
case 99:
/* Line 936 of glr.c */
#line 302 "kroparser.y"
{ il_krop=0; ;}
break;
case 100:
/* Line 936 of glr.c */
#line 303 "kroparser.y"
{ il_krop++; ;}
break;
/* Line 936 of glr.c */
#line 1911 "kroparser.tab.c"
default: break;
}
return yyok;
# undef yyerrok
# undef YYABORT
# undef YYACCEPT
# undef YYERROR
# undef YYBACKUP
# undef yyclearin
# undef YYRECOVERING
}
/*ARGSUSED*/ static void
yyuserMerge (int yyn, YYSTYPE* yy0, YYSTYPE* yy1)
{
YYUSE (yy0);
YYUSE (yy1);
switch (yyn)
{
default: break;
}
}
/* Bison grammar-table manipulation. */
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
/*ARGSUSED*/
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
{
YYUSE (yyvaluep);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
switch (yytype)
{
default:
break;
}
}
/** Number of symbols composing the right hand side of rule #RULE. */
static inline int
yyrhsLength (yyRuleNum yyrule)
{
return yyr2[yyrule];
}
static void
yydestroyGLRState (char const *yymsg, yyGLRState *yys)
{
if (yys->yyresolved)
yydestruct (yymsg, yystos[yys->yylrState],
&yys->yysemantics.yysval);
else
{
#if YYDEBUG
if (yydebug)
{
if (yys->yysemantics.yyfirstVal)
YYFPRINTF (stderr, "%s unresolved ", yymsg);
else
YYFPRINTF (stderr, "%s incomplete ", yymsg);
yy_symbol_print (stderr, yystos[yys->yylrState],
NULL);
YYFPRINTF (stderr, "\n");
}
#endif
if (yys->yysemantics.yyfirstVal)
{
yySemanticOption *yyoption = yys->yysemantics.yyfirstVal;
yyGLRState *yyrh;
int yyn;
for (yyrh = yyoption->yystate, yyn = yyrhsLength (yyoption->yyrule);
yyn > 0;
yyrh = yyrh->yypred, yyn -= 1)
yydestroyGLRState (yymsg, yyrh);
}
}
}
/** Left-hand-side symbol for rule #RULE. */
static inline yySymbol
yylhsNonterm (yyRuleNum yyrule)
{
return yyr1[yyrule];
}
#define yyis_pact_ninf(yystate) \
((yystate) == YYPACT_NINF)
/** True iff LR state STATE has only a default reduction (regardless
* of token). */
static inline yybool
yyisDefaultedState (yyStateNum yystate)
{
return yyis_pact_ninf (yypact[yystate]);
}
/** The default reduction for STATE, assuming it has one. */
static inline yyRuleNum
yydefaultAction (yyStateNum yystate)
{
return yydefact[yystate];
}
#define yyis_table_ninf(yytable_value) \
YYID (0)
/** Set *YYACTION to the action to take in YYSTATE on seeing YYTOKEN.
* Result R means
* R < 0: Reduce on rule -R.
* R = 0: Error.
* R > 0: Shift to state R.
* Set *CONFLICTS to a pointer into yyconfl to 0-terminated list of
* conflicting reductions.
*/
static inline void
yygetLRActions (yyStateNum yystate, int yytoken,
int* yyaction, const short int** yyconflicts)
{
int yyindex = yypact[yystate] + yytoken;
if (yyindex < 0 || YYLAST < yyindex || yycheck[yyindex] != yytoken)
{
*yyaction = -yydefact[yystate];
*yyconflicts = yyconfl;
}
else if (! yyis_table_ninf (yytable[yyindex]))
{
*yyaction = yytable[yyindex];
*yyconflicts = yyconfl + yyconflp[yyindex];
}
else
{
*yyaction = 0;
*yyconflicts = yyconfl + yyconflp[yyindex];
}
}
static inline yyStateNum
yyLRgotoState (yyStateNum yystate, yySymbol yylhs)
{
int yyr;
yyr = yypgoto[yylhs - YYNTOKENS] + yystate;
if (0 <= yyr && yyr <= YYLAST && yycheck[yyr] == yystate)
return yytable[yyr];
else
return yydefgoto[yylhs - YYNTOKENS];
}
static inline yybool
yyisShiftAction (int yyaction)
{
return 0 < yyaction;
}
static inline yybool
yyisErrorAction (int yyaction)
{
return yyaction == 0;
}
/* GLRStates */
/** Return a fresh GLRStackItem. Callers should call
* YY_RESERVE_GLRSTACK afterwards to make sure there is sufficient
* headroom. */
static inline yyGLRStackItem*
yynewGLRStackItem (yyGLRStack* yystackp, yybool yyisState)
{
yyGLRStackItem* yynewItem = yystackp->yynextFree;
yystackp->yyspaceLeft -= 1;
yystackp->yynextFree += 1;
yynewItem->yystate.yyisState = yyisState;
return yynewItem;
}
/** Add a new semantic action that will execute the action for rule
* RULENUM on the semantic values in RHS to the list of
* alternative actions for STATE. Assumes that RHS comes from
* stack #K of *STACKP. */
static void
yyaddDeferredAction (yyGLRStack* yystackp, size_t yyk, yyGLRState* yystate,
yyGLRState* rhs, yyRuleNum yyrule)
{
yySemanticOption* yynewOption =
&yynewGLRStackItem (yystackp, yyfalse)->yyoption;
yynewOption->yystate = rhs;
yynewOption->yyrule = yyrule;
if (yystackp->yytops.yylookaheadNeeds[yyk])
{
yynewOption->yyrawchar = yychar;
yynewOption->yyval = yylval;
yynewOption->yyloc = yylloc;
}
else
yynewOption->yyrawchar = YYEMPTY;
yynewOption->yynext = yystate->yysemantics.yyfirstVal;
yystate->yysemantics.yyfirstVal = yynewOption;
YY_RESERVE_GLRSTACK (yystackp);
}
/* GLRStacks */
/** Initialize SET to a singleton set containing an empty stack. */
static yybool
yyinitStateSet (yyGLRStateSet* yyset)
{
yyset->yysize = 1;
yyset->yycapacity = 16;
yyset->yystates = (yyGLRState**) YYMALLOC (16 * sizeof yyset->yystates[0]);
if (! yyset->yystates)
return yyfalse;
yyset->yystates[0] = NULL;
yyset->yylookaheadNeeds =
(yybool*) YYMALLOC (16 * sizeof yyset->yylookaheadNeeds[0]);
if (! yyset->yylookaheadNeeds)
{
YYFREE (yyset->yystates);
return yyfalse;
}
return yytrue;
}
static void yyfreeStateSet (yyGLRStateSet* yyset)
{
YYFREE (yyset->yystates);
YYFREE (yyset->yylookaheadNeeds);
}
/** Initialize STACK to a single empty stack, with total maximum
* capacity for all stacks of SIZE. */
static yybool
yyinitGLRStack (yyGLRStack* yystackp, size_t yysize)
{
yystackp->yyerrState = 0;
yynerrs = 0;
yystackp->yyspaceLeft = yysize;
yystackp->yyitems =
(yyGLRStackItem*) YYMALLOC (yysize * sizeof yystackp->yynextFree[0]);
if (!yystackp->yyitems)
return yyfalse;
yystackp->yynextFree = yystackp->yyitems;
yystackp->yysplitPoint = NULL;
yystackp->yylastDeleted = NULL;
return yyinitStateSet (&yystackp->yytops);
}
#if YYSTACKEXPANDABLE
# define YYRELOC(YYFROMITEMS,YYTOITEMS,YYX,YYTYPE) \
&((YYTOITEMS) - ((YYFROMITEMS) - (yyGLRStackItem*) (YYX)))->YYTYPE
/** If STACK is expandable, extend it. WARNING: Pointers into the
stack from outside should be considered invalid after this call.
We always expand when there are 1 or fewer items left AFTER an
allocation, so that we can avoid having external pointers exist
across an allocation. */
static void
yyexpandGLRStack (yyGLRStack* yystackp)
{
yyGLRStackItem* yynewItems;
yyGLRStackItem* yyp0, *yyp1;
size_t yysize, yynewSize;
size_t yyn;
yysize = yystackp->yynextFree - yystackp->yyitems;
if (YYMAXDEPTH - YYHEADROOM < yysize)
yyMemoryExhausted (yystackp);
yynewSize = 2*yysize;
if (YYMAXDEPTH < yynewSize)
yynewSize = YYMAXDEPTH;
yynewItems = (yyGLRStackItem*) YYMALLOC (yynewSize * sizeof yynewItems[0]);
if (! yynewItems)
yyMemoryExhausted (yystackp);
for (yyp0 = yystackp->yyitems, yyp1 = yynewItems, yyn = yysize;
0 < yyn;
yyn -= 1, yyp0 += 1, yyp1 += 1)
{
*yyp1 = *yyp0;
if (*(yybool *) yyp0)
{
yyGLRState* yys0 = &yyp0->yystate;
yyGLRState* yys1 = &yyp1->yystate;
if (yys0->yypred != NULL)
yys1->yypred =
YYRELOC (yyp0, yyp1, yys0->yypred, yystate);
if (! yys0->yyresolved && yys0->yysemantics.yyfirstVal != NULL)
yys1->yysemantics.yyfirstVal =
YYRELOC(yyp0, yyp1, yys0->yysemantics.yyfirstVal, yyoption);
}
else
{
yySemanticOption* yyv0 = &yyp0->yyoption;
yySemanticOption* yyv1 = &yyp1->yyoption;
if (yyv0->yystate != NULL)
yyv1->yystate = YYRELOC (yyp0, yyp1, yyv0->yystate, yystate);
if (yyv0->yynext != NULL)
yyv1->yynext = YYRELOC (yyp0, yyp1, yyv0->yynext, yyoption);
}
}
if (yystackp->yysplitPoint != NULL)
yystackp->yysplitPoint = YYRELOC (yystackp->yyitems, yynewItems,
yystackp->yysplitPoint, yystate);
for (yyn = 0; yyn < yystackp->yytops.yysize; yyn += 1)
if (yystackp->yytops.yystates[yyn] != NULL)
yystackp->yytops.yystates[yyn] =
YYRELOC (yystackp->yyitems, yynewItems,
yystackp->yytops.yystates[yyn], yystate);
YYFREE (yystackp->yyitems);
yystackp->yyitems = yynewItems;
yystackp->yynextFree = yynewItems + yysize;
yystackp->yyspaceLeft = yynewSize - yysize;
}
#endif
static void
yyfreeGLRStack (yyGLRStack* yystackp)
{
YYFREE (yystackp->yyitems);
yyfreeStateSet (&yystackp->yytops);
}
/** Assuming that S is a GLRState somewhere on STACK, update the
* splitpoint of STACK, if needed, so that it is at least as deep as
* S. */
static inline void
yyupdateSplit (yyGLRStack* yystackp, yyGLRState* yys)
{
if (yystackp->yysplitPoint != NULL && yystackp->yysplitPoint > yys)
yystackp->yysplitPoint = yys;
}
/** Invalidate stack #K in STACK. */
static inline void
yymarkStackDeleted (yyGLRStack* yystackp, size_t yyk)
{
if (yystackp->yytops.yystates[yyk] != NULL)
yystackp->yylastDeleted = yystackp->yytops.yystates[yyk];
yystackp->yytops.yystates[yyk] = NULL;
}
/** Undelete the last stack that was marked as deleted. Can only be
done once after a deletion, and only when all other stacks have
been deleted. */
static void
yyundeleteLastStack (yyGLRStack* yystackp)
{
if (yystackp->yylastDeleted == NULL || yystackp->yytops.yysize != 0)
return;
yystackp->yytops.yystates[0] = yystackp->yylastDeleted;
yystackp->yytops.yysize = 1;
YYDPRINTF ((stderr, "Restoring last deleted stack as stack #0.\n"));
yystackp->yylastDeleted = NULL;
}
static inline void
yyremoveDeletes (yyGLRStack* yystackp)
{
size_t yyi, yyj;
yyi = yyj = 0;
while (yyj < yystackp->yytops.yysize)
{
if (yystackp->yytops.yystates[yyi] == NULL)
{
if (yyi == yyj)
{
YYDPRINTF ((stderr, "Removing dead stacks.\n"));
}
yystackp->yytops.yysize -= 1;
}
else
{
yystackp->yytops.yystates[yyj] = yystackp->yytops.yystates[yyi];
/* In the current implementation, it's unnecessary to copy
yystackp->yytops.yylookaheadNeeds[yyi] since, after
yyremoveDeletes returns, the parser immediately either enters
deterministic operation or shifts a token. However, it doesn't
hurt, and the code might evolve to need it. */
yystackp->yytops.yylookaheadNeeds[yyj] =
yystackp->yytops.yylookaheadNeeds[yyi];
if (yyj != yyi)
{
YYDPRINTF ((stderr, "Rename stack %lu -> %lu.\n",
(unsigned long int) yyi, (unsigned long int) yyj));
}
yyj += 1;
}
yyi += 1;
}
}
/** Shift to a new state on stack #K of STACK, corresponding to LR state
* LRSTATE, at input position POSN, with (resolved) semantic value SVAL. */
static inline void
yyglrShift (yyGLRStack* yystackp, size_t yyk, yyStateNum yylrState,
size_t yyposn,
YYSTYPE* yyvalp, YYLTYPE* yylocp)
{
yyGLRState* yynewState = &yynewGLRStackItem (yystackp, yytrue)->yystate;
yynewState->yylrState = yylrState;
yynewState->yyposn = yyposn;
yynewState->yyresolved = yytrue;
yynewState->yypred = yystackp->yytops.yystates[yyk];
yynewState->yysemantics.yysval = *yyvalp;
yynewState->yyloc = *yylocp;
yystackp->yytops.yystates[yyk] = yynewState;
YY_RESERVE_GLRSTACK (yystackp);
}
/** Shift stack #K of YYSTACK, to a new state corresponding to LR
* state YYLRSTATE, at input position YYPOSN, with the (unresolved)
* semantic value of YYRHS under the action for YYRULE. */
static inline void
yyglrShiftDefer (yyGLRStack* yystackp, size_t yyk, yyStateNum yylrState,
size_t yyposn, yyGLRState* rhs, yyRuleNum yyrule)
{
yyGLRState* yynewState = &yynewGLRStackItem (yystackp, yytrue)->yystate;
yynewState->yylrState = yylrState;
yynewState->yyposn = yyposn;
yynewState->yyresolved = yyfalse;
yynewState->yypred = yystackp->yytops.yystates[yyk];
yynewState->yysemantics.yyfirstVal = NULL;
yystackp->yytops.yystates[yyk] = yynewState;
/* Invokes YY_RESERVE_GLRSTACK. */
yyaddDeferredAction (yystackp, yyk, yynewState, rhs, yyrule);
}
/** Pop the symbols consumed by reduction #RULE from the top of stack
* #K of STACK, and perform the appropriate semantic action on their
* semantic values. Assumes that all ambiguities in semantic values
* have been previously resolved. Set *VALP to the resulting value,
* and *LOCP to the computed location (if any). Return value is as
* for userAction. */
static inline YYRESULTTAG
yydoAction (yyGLRStack* yystackp, size_t yyk, yyRuleNum yyrule,
YYSTYPE* yyvalp, YYLTYPE* yylocp)
{
int yynrhs = yyrhsLength (yyrule);
if (yystackp->yysplitPoint == NULL)
{
/* Standard special case: single stack. */
yyGLRStackItem* rhs = (yyGLRStackItem*) yystackp->yytops.yystates[yyk];
YYASSERT (yyk == 0);
yystackp->yynextFree -= yynrhs;
yystackp->yyspaceLeft += yynrhs;
yystackp->yytops.yystates[0] = & yystackp->yynextFree[-1].yystate;
return yyuserAction (yyrule, yynrhs, rhs,
yyvalp, yylocp, yystackp);
}
else
{
/* At present, doAction is never called in nondeterministic
* mode, so this branch is never taken. It is here in
* anticipation of a future feature that will allow immediate
* evaluation of selected actions in nondeterministic mode. */
int yyi;
yyGLRState* yys;
yyGLRStackItem yyrhsVals[YYMAXRHS + YYMAXLEFT + 1];
yys = yyrhsVals[YYMAXRHS + YYMAXLEFT].yystate.yypred
= yystackp->yytops.yystates[yyk];
for (yyi = 0; yyi < yynrhs; yyi += 1)
{
yys = yys->yypred;
YYASSERT (yys);
}
yyupdateSplit (yystackp, yys);
yystackp->yytops.yystates[yyk] = yys;
return yyuserAction (yyrule, yynrhs, yyrhsVals + YYMAXRHS + YYMAXLEFT - 1,
yyvalp, yylocp, yystackp);
}
}
#if !YYDEBUG
# define YY_REDUCE_PRINT(Args)
#else
# define YY_REDUCE_PRINT(Args) \
do { \
if (yydebug) \
yy_reduce_print Args; \
} while (YYID (0))
/*----------------------------------------------------------.
| Report that the RULE is going to be reduced on stack #K. |
`----------------------------------------------------------*/
/*ARGSUSED*/ static inline void
yy_reduce_print (yyGLRStack* yystackp, size_t yyk, yyRuleNum yyrule,
YYSTYPE* yyvalp, YYLTYPE* yylocp)
{
int yynrhs = yyrhsLength (yyrule);
yybool yynormal __attribute__ ((__unused__)) =
(yystackp->yysplitPoint == NULL);
yyGLRStackItem* yyvsp = (yyGLRStackItem*) yystackp->yytops.yystates[yyk];
int yylow = 1;
int yyi;
YYUSE (yyvalp);
YYUSE (yylocp);
YYFPRINTF (stderr, "Reducing stack %lu by rule %d (line %lu):\n",
(unsigned long int) yyk, yyrule - 1,
(unsigned long int) yyrline[yyrule]);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
YYFPRINTF (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
&(((yyGLRStackItem const *)yyvsp)[YYFILL ((yyi + 1) - (yynrhs))].yystate.yysemantics.yysval)
);
YYFPRINTF (stderr, "\n");
}
}
#endif
/** Pop items off stack #K of STACK according to grammar rule RULE,
* and push back on the resulting nonterminal symbol. Perform the
* semantic action associated with RULE and store its value with the
* newly pushed state, if FORCEEVAL or if STACK is currently
* unambiguous. Otherwise, store the deferred semantic action with
* the new state. If the new state would have an identical input
* position, LR state, and predecessor to an existing state on the stack,
* it is identified with that existing state, eliminating stack #K from
* the STACK. In this case, the (necessarily deferred) semantic value is
* added to the options for the existing state's semantic value.
*/
static inline YYRESULTTAG
yyglrReduce (yyGLRStack* yystackp, size_t yyk, yyRuleNum yyrule,
yybool yyforceEval)
{
size_t yyposn = yystackp->yytops.yystates[yyk]->yyposn;
if (yyforceEval || yystackp->yysplitPoint == NULL)
{
YYSTYPE yysval;
YYLTYPE yyloc;
YY_REDUCE_PRINT ((yystackp, yyk, yyrule, &yysval, &yyloc));
YYCHK (yydoAction (yystackp, yyk, yyrule, &yysval,
&yyloc));
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyrule], &yysval, &yyloc);
yyglrShift (yystackp, yyk,
yyLRgotoState (yystackp->yytops.yystates[yyk]->yylrState,
yylhsNonterm (yyrule)),
yyposn, &yysval, &yyloc);
}
else
{
size_t yyi;
int yyn;
yyGLRState* yys, *yys0 = yystackp->yytops.yystates[yyk];
yyStateNum yynewLRState;
for (yys = yystackp->yytops.yystates[yyk], yyn = yyrhsLength (yyrule);
0 < yyn; yyn -= 1)
{
yys = yys->yypred;
YYASSERT (yys);
}
yyupdateSplit (yystackp, yys);
yynewLRState = yyLRgotoState (yys->yylrState, yylhsNonterm (yyrule));
YYDPRINTF ((stderr,
"Reduced stack %lu by rule #%d; action deferred. Now in state %d.\n",
(unsigned long int) yyk, yyrule - 1, yynewLRState));
for (yyi = 0; yyi < yystackp->yytops.yysize; yyi += 1)
if (yyi != yyk && yystackp->yytops.yystates[yyi] != NULL)
{
yyGLRState* yyp, *yysplit = yystackp->yysplitPoint;
yyp = yystackp->yytops.yystates[yyi];
while (yyp != yys && yyp != yysplit && yyp->yyposn >= yyposn)
{
if (yyp->yylrState == yynewLRState && yyp->yypred == yys)
{
yyaddDeferredAction (yystackp, yyk, yyp, yys0, yyrule);
yymarkStackDeleted (yystackp, yyk);
YYDPRINTF ((stderr, "Merging stack %lu into stack %lu.\n",
(unsigned long int) yyk,
(unsigned long int) yyi));
return yyok;
}
yyp = yyp->yypred;
}
}
yystackp->yytops.yystates[yyk] = yys;
yyglrShiftDefer (yystackp, yyk, yynewLRState, yyposn, yys0, yyrule);
}
return yyok;
}
static size_t
yysplitStack (yyGLRStack* yystackp, size_t yyk)
{
if (yystackp->yysplitPoint == NULL)
{
YYASSERT (yyk == 0);
yystackp->yysplitPoint = yystackp->yytops.yystates[yyk];
}
if (yystackp->yytops.yysize >= yystackp->yytops.yycapacity)
{
yyGLRState** yynewStates;
yybool* yynewLookaheadNeeds;
yynewStates = NULL;
if (yystackp->yytops.yycapacity
> (YYSIZEMAX / (2 * sizeof yynewStates[0])))
yyMemoryExhausted (yystackp);
yystackp->yytops.yycapacity *= 2;
yynewStates =
(yyGLRState**) YYREALLOC (yystackp->yytops.yystates,
(yystackp->yytops.yycapacity
* sizeof yynewStates[0]));
if (yynewStates == NULL)
yyMemoryExhausted (yystackp);
yystackp->yytops.yystates = yynewStates;
yynewLookaheadNeeds =
(yybool*) YYREALLOC (yystackp->yytops.yylookaheadNeeds,
(yystackp->yytops.yycapacity
* sizeof yynewLookaheadNeeds[0]));
if (yynewLookaheadNeeds == NULL)
yyMemoryExhausted (yystackp);
yystackp->yytops.yylookaheadNeeds = yynewLookaheadNeeds;
}
yystackp->yytops.yystates[yystackp->yytops.yysize]
= yystackp->yytops.yystates[yyk];
yystackp->yytops.yylookaheadNeeds[yystackp->yytops.yysize]
= yystackp->yytops.yylookaheadNeeds[yyk];
yystackp->yytops.yysize += 1;
return yystackp->yytops.yysize-1;
}
/** True iff Y0 and Y1 represent identical options at the top level.
* That is, they represent the same rule applied to RHS symbols
* that produce the same terminal symbols. */
static yybool
yyidenticalOptions (yySemanticOption* yyy0, yySemanticOption* yyy1)
{
if (yyy0->yyrule == yyy1->yyrule)
{
yyGLRState *yys0, *yys1;
int yyn;
for (yys0 = yyy0->yystate, yys1 = yyy1->yystate,
yyn = yyrhsLength (yyy0->yyrule);
yyn > 0;
yys0 = yys0->yypred, yys1 = yys1->yypred, yyn -= 1)
if (yys0->yyposn != yys1->yyposn)
return yyfalse;
return yytrue;
}
else
return yyfalse;
}
/** Assuming identicalOptions (Y0,Y1), destructively merge the
* alternative semantic values for the RHS-symbols of Y1 and Y0. */
static void
yymergeOptionSets (yySemanticOption* yyy0, yySemanticOption* yyy1)
{
yyGLRState *yys0, *yys1;
int yyn;
for (yys0 = yyy0->yystate, yys1 = yyy1->yystate,
yyn = yyrhsLength (yyy0->yyrule);
yyn > 0;
yys0 = yys0->yypred, yys1 = yys1->yypred, yyn -= 1)
{
if (yys0 == yys1)
break;
else if (yys0->yyresolved)
{
yys1->yyresolved = yytrue;
yys1->yysemantics.yysval = yys0->yysemantics.yysval;
}
else if (yys1->yyresolved)
{
yys0->yyresolved = yytrue;
yys0->yysemantics.yysval = yys1->yysemantics.yysval;
}
else
{
yySemanticOption** yyz0p;
yySemanticOption* yyz1;
yyz0p = &yys0->yysemantics.yyfirstVal;
yyz1 = yys1->yysemantics.yyfirstVal;
while (YYID (yytrue))
{
if (yyz1 == *yyz0p || yyz1 == NULL)
break;
else if (*yyz0p == NULL)
{
*yyz0p = yyz1;
break;
}
else if (*yyz0p < yyz1)
{
yySemanticOption* yyz = *yyz0p;
*yyz0p = yyz1;
yyz1 = yyz1->yynext;
(*yyz0p)->yynext = yyz;
}
yyz0p = &(*yyz0p)->yynext;
}
yys1->yysemantics.yyfirstVal = yys0->yysemantics.yyfirstVal;
}
}
}
/** Y0 and Y1 represent two possible actions to take in a given
* parsing state; return 0 if no combination is possible,
* 1 if user-mergeable, 2 if Y0 is preferred, 3 if Y1 is preferred. */
static int
yypreference (yySemanticOption* y0, yySemanticOption* y1)
{
yyRuleNum r0 = y0->yyrule, r1 = y1->yyrule;
int p0 = yydprec[r0], p1 = yydprec[r1];
if (p0 == p1)
{
if (yymerger[r0] == 0 || yymerger[r0] != yymerger[r1])
return 0;
else
return 1;
}
if (p0 == 0 || p1 == 0)
return 0;
if (p0 < p1)
return 3;
if (p1 < p0)
return 2;
return 0;
}
static YYRESULTTAG yyresolveValue (yyGLRState* yys,
yyGLRStack* yystackp);
/** Resolve the previous N states starting at and including state S. If result
* != yyok, some states may have been left unresolved possibly with empty
* semantic option chains. Regardless of whether result = yyok, each state
* has been left with consistent data so that yydestroyGLRState can be invoked
* if necessary. */
static YYRESULTTAG
yyresolveStates (yyGLRState* yys, int yyn,
yyGLRStack* yystackp)
{
if (0 < yyn)
{
YYASSERT (yys->yypred);
YYCHK (yyresolveStates (yys->yypred, yyn-1, yystackp));
if (! yys->yyresolved)
YYCHK (yyresolveValue (yys, yystackp));
}
return yyok;
}
/** Resolve the states for the RHS of OPT, perform its user action, and return
* the semantic value and location. Regardless of whether result = yyok, all
* RHS states have been destroyed (assuming the user action destroys all RHS
* semantic values if invoked). */
static YYRESULTTAG
yyresolveAction (yySemanticOption* yyopt, yyGLRStack* yystackp,
YYSTYPE* yyvalp, YYLTYPE* yylocp)
{
yyGLRStackItem yyrhsVals[YYMAXRHS + YYMAXLEFT + 1];
int yynrhs;
int yychar_current;
YYSTYPE yylval_current;
YYLTYPE yylloc_current;
YYRESULTTAG yyflag;
yynrhs = yyrhsLength (yyopt->yyrule);
yyflag = yyresolveStates (yyopt->yystate, yynrhs, yystackp);
if (yyflag != yyok)
{
yyGLRState *yys;
for (yys = yyopt->yystate; yynrhs > 0; yys = yys->yypred, yynrhs -= 1)
yydestroyGLRState ("Cleanup: popping", yys);
return yyflag;
}
yyrhsVals[YYMAXRHS + YYMAXLEFT].yystate.yypred = yyopt->yystate;
yychar_current = yychar;
yylval_current = yylval;
yylloc_current = yylloc;
yychar = yyopt->yyrawchar;
yylval = yyopt->yyval;
yylloc = yyopt->yyloc;
yyflag = yyuserAction (yyopt->yyrule, yynrhs,
yyrhsVals + YYMAXRHS + YYMAXLEFT - 1,
yyvalp, yylocp, yystackp);
yychar = yychar_current;
yylval = yylval_current;
yylloc = yylloc_current;
return yyflag;
}
#if YYDEBUG
static void
yyreportTree (yySemanticOption* yyx, int yyindent)
{
int yynrhs = yyrhsLength (yyx->yyrule);
int yyi;
yyGLRState* yys;
yyGLRState* yystates[1 + YYMAXRHS];
yyGLRState yyleftmost_state;
for (yyi = yynrhs, yys = yyx->yystate; 0 < yyi; yyi -= 1, yys = yys->yypred)
yystates[yyi] = yys;
if (yys == NULL)
{
yyleftmost_state.yyposn = 0;
yystates[0] = &yyleftmost_state;
}
else
yystates[0] = yys;
if (yyx->yystate->yyposn < yys->yyposn + 1)
YYFPRINTF (stderr, "%*s%s -> \n",
yyindent, "", yytokenName (yylhsNonterm (yyx->yyrule)),
yyx->yyrule - 1);
else
YYFPRINTF (stderr, "%*s%s -> \n",
yyindent, "", yytokenName (yylhsNonterm (yyx->yyrule)),
yyx->yyrule - 1, (unsigned long int) (yys->yyposn + 1),
(unsigned long int) yyx->yystate->yyposn);
for (yyi = 1; yyi <= yynrhs; yyi += 1)
{
if (yystates[yyi]->yyresolved)
{
if (yystates[yyi-1]->yyposn+1 > yystates[yyi]->yyposn)
YYFPRINTF (stderr, "%*s%s \n", yyindent+2, "",
yytokenName (yyrhs[yyprhs[yyx->yyrule]+yyi-1]));
else
YYFPRINTF (stderr, "%*s%s \n", yyindent+2, "",
yytokenName (yyrhs[yyprhs[yyx->yyrule]+yyi-1]),
(unsigned long int) (yystates[yyi - 1]->yyposn + 1),
(unsigned long int) yystates[yyi]->yyposn);
}
else
yyreportTree (yystates[yyi]->yysemantics.yyfirstVal, yyindent+2);
}
}
#endif
/*ARGSUSED*/ static YYRESULTTAG
yyreportAmbiguity (yySemanticOption* yyx0,
yySemanticOption* yyx1)
{
YYUSE (yyx0);
YYUSE (yyx1);
#if YYDEBUG
YYFPRINTF (stderr, "Ambiguity detected.\n");
YYFPRINTF (stderr, "Option 1,\n");
yyreportTree (yyx0, 2);
YYFPRINTF (stderr, "\nOption 2,\n");
yyreportTree (yyx1, 2);
YYFPRINTF (stderr, "\n");
#endif
yyerror (YY_("syntax is ambiguous"));
return yyabort;
}
/** Starting at and including state S1, resolve the location for each of the
* previous N1 states that is unresolved. The first semantic option of a state
* is always chosen. */
static void
yyresolveLocations (yyGLRState* yys1, int yyn1,
yyGLRStack *yystackp)
{
if (0 < yyn1)
{
yyresolveLocations (yys1->yypred, yyn1 - 1, yystackp);
if (!yys1->yyresolved)
{
yySemanticOption *yyoption;
yyGLRStackItem yyrhsloc[1 + YYMAXRHS];
int yynrhs;
int yychar_current;
YYSTYPE yylval_current;
YYLTYPE yylloc_current;
yyoption = yys1->yysemantics.yyfirstVal;
YYASSERT (yyoption != NULL);
yynrhs = yyrhsLength (yyoption->yyrule);
if (yynrhs > 0)
{
yyGLRState *yys;
int yyn;
yyresolveLocations (yyoption->yystate, yynrhs,
yystackp);
for (yys = yyoption->yystate, yyn = yynrhs;
yyn > 0;
yys = yys->yypred, yyn -= 1)
yyrhsloc[yyn].yystate.yyloc = yys->yyloc;
}
else
{
/* Both yyresolveAction and yyresolveLocations traverse the GSS
in reverse rightmost order. It is only necessary to invoke
yyresolveLocations on a subforest for which yyresolveAction
would have been invoked next had an ambiguity not been
detected. Thus the location of the previous state (but not
necessarily the previous state itself) is guaranteed to be
resolved already. */
yyGLRState *yyprevious = yyoption->yystate;
yyrhsloc[0].yystate.yyloc = yyprevious->yyloc;
}
yychar_current = yychar;
yylval_current = yylval;
yylloc_current = yylloc;
yychar = yyoption->yyrawchar;
yylval = yyoption->yyval;
yylloc = yyoption->yyloc;
YYLLOC_DEFAULT ((yys1->yyloc), yyrhsloc, yynrhs);
yychar = yychar_current;
yylval = yylval_current;
yylloc = yylloc_current;
}
}
}
/** Resolve the ambiguity represented in state S, perform the indicated
* actions, and set the semantic value of S. If result != yyok, the chain of
* semantic options in S has been cleared instead or it has been left
* unmodified except that redundant options may have been removed. Regardless
* of whether result = yyok, S has been left with consistent data so that
* yydestroyGLRState can be invoked if necessary. */
static YYRESULTTAG
yyresolveValue (yyGLRState* yys, yyGLRStack* yystackp)
{
yySemanticOption* yyoptionList = yys->yysemantics.yyfirstVal;
yySemanticOption* yybest;
yySemanticOption** yypp;
yybool yymerge;
YYSTYPE yysval;
YYRESULTTAG yyflag;
YYLTYPE *yylocp = &yys->yyloc;
yybest = yyoptionList;
yymerge = yyfalse;
for (yypp = &yyoptionList->yynext; *yypp != NULL; )
{
yySemanticOption* yyp = *yypp;
if (yyidenticalOptions (yybest, yyp))
{
yymergeOptionSets (yybest, yyp);
*yypp = yyp->yynext;
}
else
{
switch (yypreference (yybest, yyp))
{
case 0:
yyresolveLocations (yys, 1, yystackp);
return yyreportAmbiguity (yybest, yyp);
break;
case 1:
yymerge = yytrue;
break;
case 2:
break;
case 3:
yybest = yyp;
yymerge = yyfalse;
break;
default:
/* This cannot happen so it is not worth a YYASSERT (yyfalse),
but some compilers complain if the default case is
omitted. */
break;
}
yypp = &yyp->yynext;
}
}
if (yymerge)
{
yySemanticOption* yyp;
int yyprec = yydprec[yybest->yyrule];
yyflag = yyresolveAction (yybest, yystackp, &yysval,
yylocp);
if (yyflag == yyok)
for (yyp = yybest->yynext; yyp != NULL; yyp = yyp->yynext)
{
if (yyprec == yydprec[yyp->yyrule])
{
YYSTYPE yysval_other;
YYLTYPE yydummy;
yyflag = yyresolveAction (yyp, yystackp, &yysval_other,
&yydummy);
if (yyflag != yyok)
{
yydestruct ("Cleanup: discarding incompletely merged value for",
yystos[yys->yylrState],
&yysval);
break;
}
yyuserMerge (yymerger[yyp->yyrule], &yysval, &yysval_other);
}
}
}
else
yyflag = yyresolveAction (yybest, yystackp, &yysval, yylocp);
if (yyflag == yyok)
{
yys->yyresolved = yytrue;
yys->yysemantics.yysval = yysval;
}
else
yys->yysemantics.yyfirstVal = NULL;
return yyflag;
}
static YYRESULTTAG
yyresolveStack (yyGLRStack* yystackp)
{
if (yystackp->yysplitPoint != NULL)
{
yyGLRState* yys;
int yyn;
for (yyn = 0, yys = yystackp->yytops.yystates[0];
yys != yystackp->yysplitPoint;
yys = yys->yypred, yyn += 1)
continue;
YYCHK (yyresolveStates (yystackp->yytops.yystates[0], yyn, yystackp
));
}
return yyok;
}
static void
yycompressStack (yyGLRStack* yystackp)
{
yyGLRState* yyp, *yyq, *yyr;
if (yystackp->yytops.yysize != 1 || yystackp->yysplitPoint == NULL)
return;
for (yyp = yystackp->yytops.yystates[0], yyq = yyp->yypred, yyr = NULL;
yyp != yystackp->yysplitPoint;
yyr = yyp, yyp = yyq, yyq = yyp->yypred)
yyp->yypred = yyr;
yystackp->yyspaceLeft += yystackp->yynextFree - yystackp->yyitems;
yystackp->yynextFree = ((yyGLRStackItem*) yystackp->yysplitPoint) + 1;
yystackp->yyspaceLeft -= yystackp->yynextFree - yystackp->yyitems;
yystackp->yysplitPoint = NULL;
yystackp->yylastDeleted = NULL;
while (yyr != NULL)
{
yystackp->yynextFree->yystate = *yyr;
yyr = yyr->yypred;
yystackp->yynextFree->yystate.yypred = &yystackp->yynextFree[-1].yystate;
yystackp->yytops.yystates[0] = &yystackp->yynextFree->yystate;
yystackp->yynextFree += 1;
yystackp->yyspaceLeft -= 1;
}
}
static YYRESULTTAG
yyprocessOneStack (yyGLRStack* yystackp, size_t yyk,
size_t yyposn)
{
int yyaction;
const short int* yyconflicts;
yyRuleNum yyrule;
while (yystackp->yytops.yystates[yyk] != NULL)
{
yyStateNum yystate = yystackp->yytops.yystates[yyk]->yylrState;
YYDPRINTF ((stderr, "Stack %lu Entering state %d\n",
(unsigned long int) yyk, yystate));
YYASSERT (yystate != YYFINAL);
if (yyisDefaultedState (yystate))
{
yyrule = yydefaultAction (yystate);
if (yyrule == 0)
{
YYDPRINTF ((stderr, "Stack %lu dies.\n",
(unsigned long int) yyk));
yymarkStackDeleted (yystackp, yyk);
return yyok;
}
YYCHK (yyglrReduce (yystackp, yyk, yyrule, yyfalse));
}
else
{
yySymbol yytoken;
yystackp->yytops.yylookaheadNeeds[yyk] = yytrue;
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = YYLEX;
}
if (yychar <= YYEOF)
{
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
yygetLRActions (yystate, yytoken, &yyaction, &yyconflicts);
while (*yyconflicts != 0)
{
size_t yynewStack = yysplitStack (yystackp, yyk);
YYDPRINTF ((stderr, "Splitting off stack %lu from %lu.\n",
(unsigned long int) yynewStack,
(unsigned long int) yyk));
YYCHK (yyglrReduce (yystackp, yynewStack,
*yyconflicts, yyfalse));
YYCHK (yyprocessOneStack (yystackp, yynewStack,
yyposn));
yyconflicts += 1;
}
if (yyisShiftAction (yyaction))
break;
else if (yyisErrorAction (yyaction))
{
YYDPRINTF ((stderr, "Stack %lu dies.\n",
(unsigned long int) yyk));
yymarkStackDeleted (yystackp, yyk);
break;
}
else
YYCHK (yyglrReduce (yystackp, yyk, -yyaction,
yyfalse));
}
}
return yyok;
}
/*ARGSUSED*/ static void
yyreportSyntaxError (yyGLRStack* yystackp)
{
if (yystackp->yyerrState == 0)
{
#if YYERROR_VERBOSE
int yyn;
yyn = yypact[yystackp->yytops.yystates[0]->yylrState];
if (YYPACT_NINF < yyn && yyn <= YYLAST)
{
yySymbol yytoken = YYTRANSLATE (yychar);
size_t yysize0 = yytnamerr (NULL, yytokenName (yytoken));
size_t yysize = yysize0;
size_t yysize1;
yybool yysize_overflow = yyfalse;
char* yymsg = NULL;
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
int yyx;
char *yyfmt;
char const *yyf;
static char const yyunexpected[] = "syntax error, unexpected %s";
static char const yyexpecting[] = ", expecting %s";
static char const yyor[] = " or %s";
char yyformat[sizeof yyunexpected
+ sizeof yyexpecting - 1
+ ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2)
* (sizeof yyor - 1))];
char const *yyprefix = yyexpecting;
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. */
int yyxbegin = yyn < 0 ? -yyn : 0;
/* Stay within bounds of both yycheck and yytname. */
int yychecklim = YYLAST - yyn + 1;
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
int yycount = 1;
yyarg[0] = yytokenName (yytoken);
yyfmt = yystpcpy (yyformat, yyunexpected);
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
{
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
{
yycount = 1;
yysize = yysize0;
yyformat[sizeof yyunexpected - 1] = '\0';
break;
}
yyarg[yycount++] = yytokenName (yyx);
yysize1 = yysize + yytnamerr (NULL, yytokenName (yyx));
yysize_overflow |= yysize1 < yysize;
yysize = yysize1;
yyfmt = yystpcpy (yyfmt, yyprefix);
yyprefix = yyor;
}
yyf = YY_(yyformat);
yysize1 = yysize + strlen (yyf);
yysize_overflow |= yysize1 < yysize;
yysize = yysize1;
if (!yysize_overflow)
yymsg = (char *) YYMALLOC (yysize);
if (yymsg)
{
char *yyp = yymsg;
int yyi = 0;
while ((*yyp = *yyf))
{
if (*yyp == '%' && yyf[1] == 's' && yyi < yycount)
{
yyp += yytnamerr (yyp, yyarg[yyi++]);
yyf += 2;
}
else
{
yyp++;
yyf++;
}
}
yyerror (yymsg);
YYFREE (yymsg);
}
else
{
yyerror (YY_("syntax error"));
yyMemoryExhausted (yystackp);
}
}
else
#endif /* YYERROR_VERBOSE */
yyerror (YY_("syntax error"));
yynerrs += 1;
}
}
/* Recover from a syntax error on *YYSTACKP, assuming that *YYSTACKP->YYTOKENP,
yylval, and yylloc are the syntactic category, semantic value, and location
of the lookahead. */
/*ARGSUSED*/ static void
yyrecoverSyntaxError (yyGLRStack* yystackp)
{
size_t yyk;
int yyj;
if (yystackp->yyerrState == 3)
/* We just shifted the error token and (perhaps) took some
reductions. Skip tokens until we can proceed. */
while (YYID (yytrue))
{
yySymbol yytoken;
if (yychar == YYEOF)
yyFail (yystackp, NULL);
if (yychar != YYEMPTY)
{
yytoken = YYTRANSLATE (yychar);
yydestruct ("Error: discarding",
yytoken, &yylval);
}
YYDPRINTF ((stderr, "Reading a token: "));
yychar = YYLEX;
if (yychar <= YYEOF)
{
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
yyj = yypact[yystackp->yytops.yystates[0]->yylrState];
if (yyis_pact_ninf (yyj))
return;
yyj += yytoken;
if (yyj < 0 || YYLAST < yyj || yycheck[yyj] != yytoken)
{
if (yydefact[yystackp->yytops.yystates[0]->yylrState] != 0)
return;
}
else if (yytable[yyj] != 0 && ! yyis_table_ninf (yytable[yyj]))
return;
}
/* Reduce to one stack. */
for (yyk = 0; yyk < yystackp->yytops.yysize; yyk += 1)
if (yystackp->yytops.yystates[yyk] != NULL)
break;
if (yyk >= yystackp->yytops.yysize)
yyFail (yystackp, NULL);
for (yyk += 1; yyk < yystackp->yytops.yysize; yyk += 1)
yymarkStackDeleted (yystackp, yyk);
yyremoveDeletes (yystackp);
yycompressStack (yystackp);
/* Now pop stack until we find a state that shifts the error token. */
yystackp->yyerrState = 3;
while (yystackp->yytops.yystates[0] != NULL)
{
yyGLRState *yys = yystackp->yytops.yystates[0];
yyj = yypact[yys->yylrState];
if (! yyis_pact_ninf (yyj))
{
yyj += YYTERROR;
if (0 <= yyj && yyj <= YYLAST && yycheck[yyj] == YYTERROR
&& yyisShiftAction (yytable[yyj]))
{
/* Shift the error token having adjusted its location. */
YYLTYPE yyerrloc;
YY_SYMBOL_PRINT ("Shifting", yystos[yytable[yyj]],
&yylval, &yyerrloc);
yyglrShift (yystackp, 0, yytable[yyj],
yys->yyposn, &yylval, &yyerrloc);
yys = yystackp->yytops.yystates[0];
break;
}
}
if (yys->yypred != NULL)
yydestroyGLRState ("Error: popping", yys);
yystackp->yytops.yystates[0] = yys->yypred;
yystackp->yynextFree -= 1;
yystackp->yyspaceLeft += 1;
}
if (yystackp->yytops.yystates[0] == NULL)
yyFail (yystackp, NULL);
}
#define YYCHK1(YYE) \
do { \
switch (YYE) { \
case yyok: \
break; \
case yyabort: \
goto yyabortlab; \
case yyaccept: \
goto yyacceptlab; \
case yyerr: \
goto yyuser_error; \
default: \
goto yybuglab; \
} \
} while (YYID (0))
/*----------.
| yyparse. |
`----------*/
int
yyparse (void)
{
int yyresult;
yyGLRStack yystack;
yyGLRStack* const yystackp = &yystack;
size_t yyposn;
YYDPRINTF ((stderr, "Starting parse\n"));
yychar = YYEMPTY;
yylval = yyval_default;
if (! yyinitGLRStack (yystackp, YYINITDEPTH))
goto yyexhaustedlab;
switch (YYSETJMP (yystack.yyexception_buffer))
{
case 0: break;
case 1: goto yyabortlab;
case 2: goto yyexhaustedlab;
default: goto yybuglab;
}
yyglrShift (&yystack, 0, 0, 0, &yylval, &yylloc);
yyposn = 0;
while (YYID (yytrue))
{
/* For efficiency, we have two loops, the first of which is
specialized to deterministic operation (single stack, no
potential ambiguity). */
/* Standard mode */
while (YYID (yytrue))
{
yyRuleNum yyrule;
int yyaction;
const short int* yyconflicts;
yyStateNum yystate = yystack.yytops.yystates[0]->yylrState;
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
if (yystate == YYFINAL)
goto yyacceptlab;
if (yyisDefaultedState (yystate))
{
yyrule = yydefaultAction (yystate);
if (yyrule == 0)
{
yyreportSyntaxError (&yystack);
goto yyuser_error;
}
YYCHK1 (yyglrReduce (&yystack, 0, yyrule, yytrue));
}
else
{
yySymbol yytoken;
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = YYLEX;
}
if (yychar <= YYEOF)
{
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
yygetLRActions (yystate, yytoken, &yyaction, &yyconflicts);
if (*yyconflicts != 0)
break;
if (yyisShiftAction (yyaction))
{
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
yychar = YYEMPTY;
yyposn += 1;
yyglrShift (&yystack, 0, yyaction, yyposn, &yylval, &yylloc);
if (0 < yystack.yyerrState)
yystack.yyerrState -= 1;
}
else if (yyisErrorAction (yyaction))
{
yyreportSyntaxError (&yystack);
goto yyuser_error;
}
else
YYCHK1 (yyglrReduce (&yystack, 0, -yyaction, yytrue));
}
}
while (YYID (yytrue))
{
yySymbol yytoken_to_shift;
size_t yys;
for (yys = 0; yys < yystack.yytops.yysize; yys += 1)
yystackp->yytops.yylookaheadNeeds[yys] = yychar != YYEMPTY;
/* yyprocessOneStack returns one of three things:
- An error flag. If the caller is yyprocessOneStack, it
immediately returns as well. When the caller is finally
yyparse, it jumps to an error label via YYCHK1.
- yyok, but yyprocessOneStack has invoked yymarkStackDeleted
(&yystack, yys), which sets the top state of yys to NULL. Thus,
yyparse's following invocation of yyremoveDeletes will remove
the stack.
- yyok, when ready to shift a token.
Except in the first case, yyparse will invoke yyremoveDeletes and
then shift the next token onto all remaining stacks. This
synchronization of the shift (that is, after all preceding
reductions on all stacks) helps prevent double destructor calls
on yylval in the event of memory exhaustion. */
for (yys = 0; yys < yystack.yytops.yysize; yys += 1)
YYCHK1 (yyprocessOneStack (&yystack, yys, yyposn));
yyremoveDeletes (&yystack);
if (yystack.yytops.yysize == 0)
{
yyundeleteLastStack (&yystack);
if (yystack.yytops.yysize == 0)
yyFail (&yystack, YY_("syntax error"));
YYCHK1 (yyresolveStack (&yystack));
YYDPRINTF ((stderr, "Returning to deterministic operation.\n"));
yyreportSyntaxError (&yystack);
goto yyuser_error;
}
/* If any yyglrShift call fails, it will fail after shifting. Thus,
a copy of yylval will already be on stack 0 in the event of a
failure in the following loop. Thus, yychar is set to YYEMPTY
before the loop to make sure the user destructor for yylval isn't
called twice. */
yytoken_to_shift = YYTRANSLATE (yychar);
yychar = YYEMPTY;
yyposn += 1;
for (yys = 0; yys < yystack.yytops.yysize; yys += 1)
{
int yyaction;
const short int* yyconflicts;
yyStateNum yystate = yystack.yytops.yystates[yys]->yylrState;
yygetLRActions (yystate, yytoken_to_shift, &yyaction,
&yyconflicts);
/* Note that yyconflicts were handled by yyprocessOneStack. */
YYDPRINTF ((stderr, "On stack %lu, ", (unsigned long int) yys));
YY_SYMBOL_PRINT ("shifting", yytoken_to_shift, &yylval, &yylloc);
yyglrShift (&yystack, yys, yyaction, yyposn,
&yylval, &yylloc);
YYDPRINTF ((stderr, "Stack %lu now in state #%d\n",
(unsigned long int) yys,
yystack.yytops.yystates[yys]->yylrState));
}
if (yystack.yytops.yysize == 1)
{
YYCHK1 (yyresolveStack (&yystack));
YYDPRINTF ((stderr, "Returning to deterministic operation.\n"));
yycompressStack (&yystack);
break;
}
}
continue;
yyuser_error:
yyrecoverSyntaxError (&yystack);
yyposn = yystack.yytops.yystates[0]->yyposn;
}
yyacceptlab:
yyresult = 0;
goto yyreturn;
yybuglab:
YYASSERT (yyfalse);
goto yyabortlab;
yyabortlab:
yyresult = 1;
goto yyreturn;
yyexhaustedlab:
yyerror (YY_("memory exhausted"));
yyresult = 2;
goto yyreturn;
yyreturn:
if (yychar != YYEMPTY)
yydestruct ("Cleanup: discarding lookahead",
YYTRANSLATE (yychar),
&yylval);
/* If the stack is well-formed, pop the stack until it is empty,
destroying its entries as we go. But free the stack regardless
of whether it is well-formed. */
if (yystack.yyitems)
{
yyGLRState** yystates = yystack.yytops.yystates;
if (yystates)
{
size_t yysize = yystack.yytops.yysize;
size_t yyk;
for (yyk = 0; yyk < yysize; yyk += 1)
if (yystates[yyk])
{
while (yystates[yyk])
{
yyGLRState *yys = yystates[yyk];
if (yys->yypred != NULL)
yydestroyGLRState ("Cleanup: popping", yys);
yystates[yyk] = yys->yypred;
yystack.yynextFree -= 1;
yystack.yyspaceLeft += 1;
}
break;
}
}
yyfreeGLRStack (&yystack);
}
/* Make sure YYID is used. */
return YYID (yyresult);
}
/* DEBUGGING ONLY */
#if YYDEBUG
static void yypstack (yyGLRStack* yystackp, size_t yyk)
__attribute__ ((__unused__));
static void yypdumpstack (yyGLRStack* yystackp) __attribute__ ((__unused__));
static void
yy_yypstack (yyGLRState* yys)
{
if (yys->yypred)
{
yy_yypstack (yys->yypred);
YYFPRINTF (stderr, " -> ");
}
YYFPRINTF (stderr, "%d@%lu", yys->yylrState,
(unsigned long int) yys->yyposn);
}
static void
yypstates (yyGLRState* yyst)
{
if (yyst == NULL)
YYFPRINTF (stderr, "");
else
yy_yypstack (yyst);
YYFPRINTF (stderr, "\n");
}
static void
yypstack (yyGLRStack* yystackp, size_t yyk)
{
yypstates (yystackp->yytops.yystates[yyk]);
}
#define YYINDEX(YYX) \
((YYX) == NULL ? -1 : (yyGLRStackItem*) (YYX) - yystackp->yyitems)
static void
yypdumpstack (yyGLRStack* yystackp)
{
yyGLRStackItem* yyp;
size_t yyi;
for (yyp = yystackp->yyitems; yyp < yystackp->yynextFree; yyp += 1)
{
YYFPRINTF (stderr, "%3lu. ",
(unsigned long int) (yyp - yystackp->yyitems));
if (*(yybool *) yyp)
{
YYFPRINTF (stderr, "Res: %d, LR State: %d, posn: %lu, pred: %ld",
yyp->yystate.yyresolved, yyp->yystate.yylrState,
(unsigned long int) yyp->yystate.yyposn,
(long int) YYINDEX (yyp->yystate.yypred));
if (! yyp->yystate.yyresolved)
YYFPRINTF (stderr, ", firstVal: %ld",
(long int) YYINDEX (yyp->yystate
.yysemantics.yyfirstVal));
}
else
{
YYFPRINTF (stderr, "Option. rule: %d, state: %ld, next: %ld",
yyp->yyoption.yyrule - 1,
(long int) YYINDEX (yyp->yyoption.yystate),
(long int) YYINDEX (yyp->yyoption.yynext));
}
YYFPRINTF (stderr, "\n");
}
YYFPRINTF (stderr, "Tops:");
for (yyi = 0; yyi < yystackp->yytops.yysize; yyi += 1)
YYFPRINTF (stderr, "%lu: %ld; ", (unsigned long int) yyi,
(long int) YYINDEX (yystackp->yytops.yystates[yyi]));
YYFPRINTF (stderr, "\n");
}
#endif
/* Line 2634 of glr.c */
#line 306 "kroparser.y"
/****************************************************/
char getch () {
char z = getc(wej);
if (z == EOF) printf("\n");
else printf("%c", z);
return z;
}
int yylex (void) {
char c1, c2; char komunikat[DL_KOMUNIKATU];
c2 = ' ';
do {
c1 = c2; c2 = getch();
if (c1 == '/' && c2 == '/') {
do {
c1 = getch();
} while (c1 != '\n');
c1 = ' '; c2 = ' ';
}
} while (isspace(c1));
nr_kropasa++;
if (c2 == EOF) return -1;
switch (c1) {
case '0':
switch (c2) {
case '0': return p00;
case '1': return p01;
case '2': return p02;
case '3': return p03;
case '4': return p04;
case '5': return p05;
case '6': return p06;
default:
sprintf(komunikat, "nieznany kropas %c%c", c1, c2);
yyerror(komunikat); return 1;
}
case '1':
switch (c2) {
case '0': return p10;
case '1': return p11;
case '2': return p12;
case '3': return p13;
case '5': return p15;
case '6': return p16;
case '7': return p17;
default:
sprintf(komunikat, "nieznany kropas %c%c", c1, c2);
yyerror(komunikat); return 1;
}
case '2':
switch (c2) {
case '0': return p20;
case '1': return p21;
case '2': return p22;
case '3': return p23;
case '4': return p24;
case '5': return p25;
case '6': return p26;
case '7': return p27;
default:
sprintf(komunikat, "nieznany kropas %c%c", c1, c2);
yyerror(komunikat); return 1;
}
case '3':
switch (c2) {
case '0': return p30;
case '1': return p31;
case '2': return p32;
case '3': return p33;
case '4': return p34;
case '5': return p35;
case '6': return p36;
case '7': return p37;
default:
sprintf(komunikat, "nieznany kropas %c%c", c1, c2);
yyerror(komunikat); return 1;
}
case '4':
switch (c2) {
case '0': return p40;
case '1': return p41;
case '2': return p42;
case '3': return p43;
case '5': return p45;
case '6': return p46;
case '7': return p47;
default:
sprintf(komunikat, "nieznany kropas %c%c", c1, c2);
yyerror(komunikat); return 1;
}
case '5':
switch (c2) {
case '0': return p50;
case '1': return p51;
case '2': return p52;
case '3': return p53;
case '5': return p55;
case '6': return p56;
case '7': return p57;
default:
sprintf(komunikat, "nieznany kropas %c%c", c1, c2);
yyerror(komunikat); return 1;
}
case '6':
switch (c2) {
case '0': return p60;
case '1': return p61;
case '2': return p62;
case '3': return p63;
case '4': return p64;
case '5': return p65;
case '6': return p66;
case '7': return p67;
default:
sprintf(komunikat, "nieznany kropas %c%c", c1, c2);
yyerror(komunikat); return 1;
}
case '7':
switch (c2) {
case '0': return p70;
case '1': return p71;
case '2': return p72;
case '3': return p73;
case '4': return p74;
case '5': return p75;
case '6': return p76;
case '7': return p77;
default:
sprintf(komunikat, "nieznany kropas %c%c", c1, c2);
yyerror(komunikat); return 1;
}
default:
sprintf(komunikat, "nieznany kropas %c%c", c1, c2);
yyerror(komunikat); return 1;
}
}
/****************************************************/
void wys_i_trwanie(char nuta[DL_NUTY], Wysokosc_dzwieku dz, int trwanie) {
if (akt_oktawa == zadna) yyerror("nieustalona oktawa");
else {
char trw_napis[DL_NUTY];
if (akt_wys != nic) { // nie ma znaku oktawy
if ((akt_wys == aa && dz == ce) ||
(akt_wys == ha && (dz == ce || dz == de))
)
akt_oktawa++;
if ((akt_wys == de && dz == ha) ||
(akt_wys == ce && (dz == aa || dz == ha))
)
akt_oktawa--;
if (akt_oktawa < subkontra) yyerror("za niska oktawa");
if (akt_oktawa > pieckreslna) yyerror("za wysoka oktawa");
}
switch (dz) {
case ce: strcat(nuta, "C"); break;
case de: strcat(nuta, "D"); break;
case ee: strcat(nuta, "E"); break;
case ef: strcat(nuta, "F"); break;
case ge: strcat(nuta, "G"); break;
case aa: strcat(nuta, "A"); break;
case ha: strcat(nuta, "H"); break;
case pau: strcat(nuta, "-"); break;
default: yyerror("co to za nuta?");
}
if (dz != pau) {
akt_wys = dz;
strcat(nuta, "{");
switch (akt_oktawa) {
case subkontra: strcat(nuta, "-3"); break;
case kontra: strcat(nuta, "-2"); break;
case wielka: strcat(nuta, "-1"); break;
case mala: strcat(nuta, "0"); break;
case razkreslna: strcat(nuta, "+1"); break;
case dwukreslna: strcat(nuta, "+2"); break;
case trojkreslna: strcat(nuta, "+3"); break;
case czterkreslna: strcat(nuta, "+4"); break;
case pieckreslna: strcat(nuta, "+5"); break;
default: yyerror("co to za oktawa?");
}
strcat(nuta, "}");
}
if (dlugosci == dlugie)
sprintf(trw_napis, "%i", trwanie);
else
sprintf(trw_napis, "%i", 16*trwanie);
strcat(nuta, "[1/"); strcat(nuta, trw_napis); strcat(nuta, "]");
}
}
/****************************************************/
int main (int argn, char* arg[]) {
char plik_wej[DL_NAZWY_PLIKU], plik_wyj[DL_NAZWY_PLIKU];
if (argn == 3) {
strcpy(plik_wej, arg[1]); strcpy(plik_wyj, arg[2]);
}
else yyerror("WYWOLANIE: kroparser plik_wej plik_wyj");
wej = fopen(plik_wej, "r");
wyj = fopen(plik_wyj, "w");
akt_oktawa = zadna; akt_wys = nic;
strcpy(metrum, ""); strcpy(nuta, "");
nr_kropasa = 0; il_krop = 0; dlugosci = dlugie;
printf("\n"); fprintf(wyj, "\n");
return yyparse();
}