Основная задача синтаксического анализа - разбор структуры программы. Как правило, под структурой понимается дерево, соответствующее разбору в контекстно-свободной грамматике языка. В настоящее время чаще всего используется либо LL (1) - анализ (и его вариант - рекурсивный спуск), либо LR (1) - анализ и его варианты (LR (0), SLR (1), LALR (1) и др.). Рекурсивный спуск чаще используется при ручном программировании синтаксического анализатора, LR (1) - при использовании систем автоматизации построения синтаксических анализаторов. Результатом синтаксического анализа является синтаксическое дерево со ссылками на таблицу имен. В процессе синтаксического анализа также обнаруживаются ошибки, связанные со структурой программы.

Синтаксический анализатор, генерируемый программой Bison строится на основе LR (1) - грамматики

Алгоритм синтаксического анализа на основе LR (k) - грамматики относится к классу алгоритмов восходящего разбора.

Строкам управляющей таблицы М (LR-таблица разбора) ставятся в соответствие состояния, в которых может находиться анализатор, столбцам - элементы множества {VT$}. Каждая запись рабочего стека представляет собой пару: (символ, номер состояния).

Перед началом работы алгоритма в рабочий стек заносится пара (Л,1), где 1 - символ начального состояния анализатора. Возможные значения элементов таблицы и их интерпретация алгоритмом разбора приведены в таблице.

программирование строковый синтаксический анализ

Таблица возможных значений элементов управляющей таблицы

Для построения управляющей таблицы М может быть выполнена разметка порождающих правил грамматики номерами состояний анализатора. Номера состояний устанавливаются в правой части каждого правила: перед первым символом, между любыми двумя символами и после последнего символа. При этом номер состояния, непосредственно справа от которого находится нетерминал, следует распространять на позиции перед первыми символами всех правых частей правил для данного нетерминала (и т.д. рекурсивно). А если непосредственно слева от одного и того же символа в каких-либо правилах установлены одинаковые метки, то и непосредственно справа от этого символа в этих правилах следует поставить одну и ту же метку. Начальные позиции правых частей правил для аксиомы отмечаются номером начального состояния анализатора.

После разметки грамматики выполняется построение таблицы М по следующему алгоритму.

1. Если символ А в правой части правила имеет непосредственно слева от себя метку m, а непосредственно справа от себя - метку j, то M (m,A) = ("сдвиг",j).

2. Если метка j размещается за последним символом правой части правила номер n, то определяется множество Q символов, которые в какой-либо сентенциальной форме могут следовать за нетерминалом левой части правила номер n, и M (j,q) =n для всех q Q.

3. M (1,<S>) = "допуск", где 1 - символ начального состояния.

4. Оставшиеся незаполненными элементы таблицы M получают значение "ошибка".

5. Описание структуры системы программирования

1. Перед запуском исполняемого файла программы необходимо убедиться, что в папке с программой присутствует обрабатываемый файл. Обрабатываемый файл должен называться data. txt.

2. Для запуска программы запустите исполняемый файл KP. exe.

3. В случае, если обрабатываемый файл корректен, то после запуска программы на экране отобразиться таблица соответствия DN именам пользователей. См. Приложение 2.

4. Тестовые случаи, Тест 1.

Корректный обрабатываемый файл, должен быть выполнен по следующему примеру:

DN <DN_Number>

CPND

NAME <First_Name> <Last_Name>

XPLN 27

DISPLAY_FMT FIRST,LAST

VMB

VMB_COS 4

SECOND_DN

THIRD_DN

VMB_STATE CONFIGURED

TYPE SL1

TN 024 0 06 14 KEY 00 H MARP DES LAM 29 JUN 2000

(2008)

<DN_Number> - номер, который будет выбираться для соответствия с именем пользователя;

<First_Name> и <Last_Name> - Имя и Фамилия пользователя соответственно.

5. В случае, если обрабатываемый файл некорректен, программа выдаст сообщение об ошибке. См. Приложение 2. Тестовые случаи, Тест 2.

6. В случае, если обрабатываемый файл отсутствует в директории программы или неправильно поименован, в результате запуска программы отобразиться корректное сообщение об ошибке. См. Приложение 2. Тестовые случаи, Тест 3.

7. Заключение

/* A Bison parser, made by GNU Bison 2.1 */

/* Identify Bison output. */

#define YYBISON 1

/* Bison version. */

#define YYBISON_VERSION "2.1"

/* Skeleton name. */

#define YYSKELETON_NAME "yacc. c"

/* Pure parsers. */

#define YYPURE 0

/* Using locations. */

#define YYLSP_NEEDED 0

/* Tokens. */

#ifndef YYTOKENTYPE

# define YYTOKENTYPE

/* Put the tokens into the symbol table, so that GDB and other debuggers

know about them. */

enum yytokentype {

AP_DN_KW = 258,AP_NUMBER = 259,AP_CPND_KW = 260,AP_NAME_KW = 261,AP_XPLN_KW = 262,AP_DISPLAYFMT_KW = 263,AP_FIRSTLAST_KW = 264,AP_VMB_KW = 265,AP_VMBCOS_KW = 266,AP_SECONDDN_KW = 267,AP_THIRDDN_KW = 268,AP_VMBSTATE_KW = 269,AP_CONFIGURED_KW = 270,AP_TYPE_KW = 271,AP_SL = 272,AP_TN_KW = 273,AP_TN = 274,AP_KEY = 275,AP_KEY_KW = 276,AP_H_KW = 277,AP_MARP_KW = 278,AP_DES_KW = 279,AP_NAME = 280,AP_DATE = 281,AP_YEAR = 282

};

#endif

/* Tokens. */

#define AP_DN_KW 258

#define AP_NUMBER 259

#define AP_CPND_KW 260

#define AP_NAME_KW 261

#define AP_XPLN_KW 262

#define AP_DISPLAYFMT_KW 263

#define AP_FIRSTLAST_KW 264

#define AP_VMB_KW 265

#define AP_VMBCOS_KW 266

#define AP_SECONDDN_KW 267

#define AP_THIRDDN_KW 268

#define AP_VMBSTATE_KW 269

#define AP_CONFIGURED_KW 270

#define AP_TYPE_KW 271

#define AP_SL 272

#define AP_TN_KW 273

#define AP_TN 274

#define AP_KEY 275

#define AP_KEY_KW 276

#define AP_H_KW 277

#define AP_MARP_KW 278

#define AP_DES_KW 279

#define AP_NAME 280

#define AP_DATE 281

#define AP_YEAR 282

/* Copy the first part of user declarations. */

#line 1 "bison. txt"

#include <stdlib. h>

#include <stdio. h>

int yylex ();

void yyerror (char const *msg);

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

#if! defined (YYSTYPE) &&! defined (YYSTYPE_IS_DECLARED)

#line 9 "bison. txt"

typedef union YYSTYPE {

char* string;

} YYSTYPE;

/* Line 196 of yacc. c. */

#line 150 "bison. c"

# define yystype YYSTYPE /* obsolescent; will be withdrawn */

# define YYSTYPE_IS_DECLARED 1

# define YYSTYPE_IS_TRIVIAL 1

#endif

/* Copy the second part of user declarations. */

/* Line 219 of yacc. c. */

#line 162 "bison. c"

#if! defined (YYSIZE_T) && defined (__SIZE_TYPE__)

# define YYSIZE_T __SIZE_TYPE__

#endif

#if! defined (YYSIZE_T) && defined (size_t)

# define YYSIZE_T size_t

#endif

#if! defined (YYSIZE_T) && (defined (__STDC__) || defined (__cplusplus))

# include <stddef. h> /* INFRINGES ON USER NAME SPACE */

# define YYSIZE_T size_t

#endif

#if! defined (YYSIZE_T)

# define YYSIZE_T unsigned int

#endif

#ifndef YY_

# if YYENABLE_NLS

# if ENABLE_NLS

# include <libintl. h> /* INFRINGES ON USER NAME SPACE */

# define YY_ (msgid) dgettext ("bison-runtime", msgid)

# endif

# endif

# ifndef YY_

# define YY_ (msgid) msgid

# endif

#endif

#if! defined (yyoverflow) || YYERROR_VERBOSE

/* The parser invokes alloca or malloc; define the necessary symbols. */

# ifdef YYSTACK_USE_ALLOCA

# if YYSTACK_USE_ALLOCA

# ifdef __GNUC__

# define YYSTACK_ALLOC __builtin_alloca

# else

# define YYSTACK_ALLOC alloca

# if defined (__STDC__) || defined (__cplusplus)

# include <stdlib. h> /* INFRINGES ON USER NAME SPACE */

# define YYINCLUDED_STDLIB_H

# endif

# endif

# endif

# endif

# ifdef YYSTACK_ALLOC

/* Pacify GCC's `empty if-body' warning. */

# define YYSTACK_FREE (Ptr) do { /* empty */; } while (0)

# ifndef YYSTACK_ALLOC_MAXIMUM

/* The OS might guarantee only one guard page at the bottom of the stack,

and a page size can be as small as 4096 bytes. So we cannot safely

invoke alloca (N) if N exceeds 4096. Use a slightly smaller number

to allow for a few compiler-allocated temporary stack slots. */

# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2005 */

# endif

# else

# define YYSTACK_ALLOC YYMALLOC

# define YYSTACK_FREE YYFREE

# ifndef YYSTACK_ALLOC_MAXIMUM

# define YYSTACK_ALLOC_MAXIMUM ( (YYSIZE_T) - 1)

# endif

# ifdef __cplusplus

extern "C" {

# endif

# ifndef YYMALLOC

# define YYMALLOC malloc

# if (! defined (malloc) &&! defined (YYINCLUDED_STDLIB_H) \

&& (defined (__STDC__) || defined (__cplusplus)))

void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */

# endif

# endif

# ifndef YYFREE

# define YYFREE free

# if (! defined (free) &&! defined (YYINCLUDED_STDLIB_H) \

&& (defined (__STDC__) || defined (__cplusplus)))

void free (void *); /* INFRINGES ON USER NAME SPACE */

# endif

# endif

# ifdef __cplusplus

}

# endif

# endif

#endif /*! defined (yyoverflow) || YYERROR_VERBOSE */

#if (! defined (yyoverflow) \

&& (! defined (__cplusplus) \

|| (defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL)))

/* A type that is properly aligned for any stack member. */

union yyalloc

{

short int yyss;

YYSTYPE yyvs;

};

/* The size of the maximum gap between one aligned stack and the next. */

# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)

/* The size of an array large to enough to hold all stacks, each with

N elements. */

# define YYSTACK_BYTES (N) \

( (N) * (sizeof (short int) + sizeof (YYSTYPE)) \

+ YYSTACK_GAP_MAXIMUM)

/* Copy COUNT objects from FROM to TO. The source and destination do

not overlap. */

# ifndef YYCOPY

# if defined (__GNUC__) && 1 < __GNUC__

# define YYCOPY (To, From, Count) \

__builtin_memcpy (To, From, (Count) * sizeof (* (From)))

# else

# define YYCOPY (To, From, Count) \

do\

{\

YYSIZE_T yyi; \

for (yyi = 0; yyi < (Count); yyi++) \

(To) [yyi] = (From) [yyi]; \

}\

while (0)

# endif

# endif

/* Relocate STACK from its old location to the new one. The

local variables YYSIZE and YYSTACKSIZE give the old and new number of

elements in the stack, and YYPTR gives the new location of the

stack. Advance YYPTR to a properly aligned location for the next

stack. */

# define YYSTACK_RELOCATE (Stack) \

do\

{\

YYSIZE_T yynewbytes; \

YYCOPY (&yyptr->Stack, Stack, yysize); \

Stack = &yyptr->Stack; \

yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \

yyptr += yynewbytes / sizeof (*yyptr); \

}\

while (0)

#endif

#if defined (__STDC__) || defined (__cplusplus)

typedef signed char yysigned_char;

#else

typedef short int yysigned_char;

#endif

/* YYFINAL - State number of the termination state. */

#define YYFINAL 6

/* YYLAST - Last index in YYTABLE. */

#define YYLAST 41

/* YYNTOKENS - Number of terminals. */

#define YYNTOKENS 28

/* YYNNTS - Number of nonterminals. */

#define YYNNTS 7

/* YYNRULES - Number of rules. */

#define YYNRULES 8

/* YYNRULES - Number of states. */

#define YYNSTATES 36

/* YYTRANSLATE (YYLEX) - Bison symbol number corresponding to YYLEX. */

#define YYUNDEFTOK 2

#define YYMAXUTOK 282

#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

};

#if YYDEBUG

/* YYPRHS [YYN] - Index of the first RHS symbol of rule number YYN in

YYRHS. */

static const unsigned char yyprhs [] =

{

0, 0, 3, 5, 8, 13, 24, 32, 34

};

/* YYRHS - A `-1'-separated list of the rules' RHS. */

static const yysigned_char yyrhs [] =

{

29, 0, - 1, 30, - 1, 29, 30, - 1, 31, 32,33, 34, - 1, 3, 4, 5, 6, 25, 25, 7,4, 8, 9, - 1, 10, 11, 4, 12, 13, 14,15, - 1, 16, - 1, 18, 19, 21, 20, 22, 23,24, 26, 27, - 1

};

/* YYRLINE [YYN] - source line where rule number YYN was defined. */

static const unsigned char yyrline [] =

{

0, 18, 18, 18, 19, 20, 28, 30, 32

};

#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", "AP_DN_KW", "AP_NUMBER", "AP_CPND_KW",

"AP_NAME_KW", "AP_XPLN_KW", "AP_DISPLAYFMT_KW", "AP_FIRSTLAST_KW",

"AP_VMB_KW", "AP_VMBCOS_KW", "AP_SECONDDN_KW", "AP_THIRDDN_KW",

"AP_VMBSTATE_KW", "AP_CONFIGURED_KW", "AP_TYPE_KW", "AP_SL", "AP_TN_KW",

"AP_TN", "AP_KEY", "AP_KEY_KW", "AP_H_KW", "AP_MARP_KW", "AP_DES_KW",

"AP_NAME", "AP_DATE", "AP_YEAR", "$accept", "list", "record", "userinfo",

"dopinfo", "type", "summary", 0

};

#endif

# ifdef YYPRINT

/* YYTOKNUM [YYLEX-NUM] - Internal token number corresponding to

token YYLEX-NUM. */

static const unsigned short int yytoknum [] =

{

0, 256, 257, 258, 259, 260, 261, 262, 263, 264,265, 266, 267, 268, 269, 270, 271, 272, 273, 274,275, 276, 277, 278, 279, 280, 281, 282

};

# endif

/* YYR1 [YYN] - Symbol number of symbol that rule YYN derives. */

static const unsigned char yyr1 [] =

{

0, 28, 29, 29, 30, 31, 32, 33, 34

};

/* YYR2 [YYN] - Number of symbols composing right hand side of rule YYN. */

static const unsigned char yyr2 [] =

{

0, 2, 1, 2, 4, 10, 7, 1, 9

};

/* YYDEFACT [STATE-NAME] - Default rule to reduce with in state

STATE-NUM when YYTABLE doesn't specify something else to do. Zero

means the default is an error. */

static const unsigned char yydefact [] =

{

0, 0, 0, 2, 0, 0, 1, 3, 0, 0,0, 0, 7, 0, 0, 0, 0, 4, 0, 0,0, 0, 0, 0, 0, 0, 0, 0, 6, 0,0, 0, 5, 0, 0, 8

};

/* YYDEFGOTO [NTERM-NUM]. */

static const yysigned_char yydefgoto [] =

{

1, 2, 3, 4, 9, 13, 17

};

/* YYPACT [STATE-NUM] - Index in YYTABLE of the portion describing

STATE-NUM. */

#define YYPACT_NINF - 16

static const yysigned_char yypact [] =

{

2, 1, 0, - 16, - 8, - 1, - 16, - 16, - 5, - 9,2, 5, - 16, - 7, - 15, 3, - 6, - 16, - 13, 4,3, 7, 6, - 4, 15, 8, 9, 13, - 16, 10,16, 11, - 16, 12, 14, - 16

};

/* YYPGOTO [NTERM-NUM]. */

static const yysigned_char yypgoto [] =

{

16, - 16, 20, - 16, - 16, - 16, - 16

};

/* 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 [] =

{

6, 1, 8, 1, 10, 5, 11, 12, 14, 15,18, 16, 21, 20, 24, 19, 26, 22, 23, 27,25, 30, 7, 28, 0, 32, 0, 0, 0, 0,0, 29, 0, 31, 0, 33, 0, 0, 34, 0,0, 35

};

static const yysigned_char yycheck [] =

{

0, 3, 10, 3, 5, 4, 11, 16, 6, 4,25, 18, 25, 19, 7, 12, 20, 13, 21, 4,14, 8, 2, 15, - 1, 9, - 1, - 1, - 1, - 1,1, 22, - 1, 23, - 1, 24, - 1, - 1, 26, - 1,1, 27

};

/* YYSTOS [STATE-NUM] - The (internal number of the) accessing

symbol of state STATE-NUM. */

static const unsigned char yystos [] =

{

0, 3, 29, 30, 31, 4, 0, 30, 10, 32,5, 11, 16, 33, 6, 4, 18, 34, 25, 12,19, 25, 13, 21, 7, 14, 20, 4, 15, 22,8, 23, 9, 24, 26, 27

};

#define yyerrok (yyerrstatus = 0)

#define yyclearin (yychar = YYEMPTY)

#define YYEMPTY (-2)

#define YYEOF0

#define YYACCEPTgoto yyacceptlab

#define YYABORTgoto yyabortlab

#define YYERRORgoto yyerrorlab

/* 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 YYFAILgoto yyerrlab

#define YYRECOVERING () (!! yyerrstatus)

#define YYBACKUP (Token, Value) \

do\

if (yychar == YYEMPTY && yylen == 1) \

{\

yychar = (Token); \

yylval = (Value); \

yytoken = YYTRANSLATE (yychar); \

YYPOPSTACK; \

goto yybackup; \

}\

else\

{\

yyerror (YY_ ("syntax error: cannot back up")); \

YYERROR; \

}\

while (0)

#define YYTERROR1

#define YYERRCODE256

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

#define YYRHSLOC (Rhs, K) ( (Rhs) [K])

#ifndef YYLLOC_DEFAULT

# define YYLLOC_DEFAULT (Current, Rhs, N) \

do\

if (N) \

{\

(Current). first_line = YYRHSLOC (Rhs, 1). first_line; \

(Current). first_column = YYRHSLOC (Rhs, 1). first_column; \

(Current). last_line = YYRHSLOC (Rhs, N). last_line; \

(Current). last_column = YYRHSLOC (Rhs, N). last_column; \

}\

else\

{\

(Current). first_line = (Current). last_line =\

YYRHSLOC (Rhs, 0). last_line; \

(Current). first_column = (Current). last_column =\

YYRHSLOC (Rhs, 0). last_column; \

}\

while (0)

#endif

/* YY_LOCATION_PRINT - Print the location on the stream.

This macro was not mandated originally: define only if we know

we won't break user code: when these are the locations we know. */

#ifndef YY_LOCATION_PRINT

# if YYLTYPE_IS_TRIVIAL

# define YY_LOCATION_PRINT (File, Loc) \

fprintf (File, "%d. %d-%d. %d",\

(Loc). first_line, (Loc). first_column,\

(Loc). last_line, (Loc). last_column)

# else

# define YY_LOCATION_PRINT (File, Loc) ( (void) 0)

# endif

#endif

/* YYLEX - calling `yylex' with the right arguments. */

#ifdef YYLEX_PARAM

# define YYLEX yylex (YYLEX_PARAM)

#else

# define YYLEX yylex ()

#endif

/* Enable debugging if requested. */

#if YYDEBUG

# ifndef YYFPRINTF

# include <stdio. h> /* INFRINGES ON USER NAME SPACE */

# define YYFPRINTF fprintf

# endif

# define YYDPRINTF (Args) \

do {\

if (yydebug) \

YYFPRINTF Args; \

} while (0)

# define YY_SYMBOL_PRINT (Title, Type, Value, Location) \

do {\

if (yydebug) \

{\

YYFPRINTF (stderr, "%s", Title); \

yysymprint (stderr,\

Type, Value); \

YYFPRINTF (stderr, "\n"); \

}\

} while (0)

/*------------------------------------------------------------------.

| yy_stack_print - Print the state stack from its BOTTOM up to its |

| TOP (included). |

`------------------------------------------------------------------*/

#if defined (__STDC__) || defined (__cplusplus)

static void

yy_stack_print (short int *bottom, short int *top)

#else

static void

yy_stack_print (bottom, top)

short int *bottom;

short int *top;

#endif

{

YYFPRINTF (stderr, "Stack now");

for (/* Nothing. */; bottom <= top; ++bottom)

YYFPRINTF (stderr, " %d", *bottom);

YYFPRINTF (stderr, "\n");

}

# define YY_STACK_PRINT (Bottom, Top) \

do {\

if (yydebug) \

yy_stack_print ( (Bottom), (Top)); \

} while (0)

/*------------------------------------------------.

| Report that the YYRULE is going to be reduced. |

`------------------------------------------------*/

#if defined (__STDC__) || defined (__cplusplus)

static void

yy_reduce_print (int yyrule)

#else

static void

yy_reduce_print (yyrule)

int yyrule;

#endif

{

int yyi;

unsigned long int yylno = yyrline [yyrule];

YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu), ",

yyrule - 1, yylno);

/* Print the symbols being reduced, and their result. */

for (yyi = yyprhs [yyrule]; 0 <= yyrhs [yyi]; yyi++)

YYFPRINTF (stderr, "%s", yytname [yyrhs [yyi]]);

YYFPRINTF (stderr, "-> %s\n", yytname [yyr1 [yyrule]]);

}

# define YY_REDUCE_PRINT (Rule) \

do {\

if (yydebug) \

yy_reduce_print (Rule); \

} while (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)

# define YY_STACK_PRINT (Bottom, Top)

# define YY_REDUCE_PRINT (Rule)

#endif /*! YYDEBUG */

/* YYINITDEPTH - initial size of the parser's stacks. */

#ifndefYYINITDEPTH

# 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

YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)

evaluated with infinite-precision integer arithmetic. */

#ifndef YYMAXDEPTH

# define YYMAXDEPTH 10000

#endif

#if YYERROR_VERBOSE

# ifndef yystrlen

# if defined (__GLIBC__) && defined (_STRING_H)

# define yystrlen strlen

# else

/* Return the length of YYSTR. */

static YYSIZE_T

# if defined (__STDC__) || defined (__cplusplus)

yystrlen (const char *yystr)

# else

yystrlen (yystr)

const char *yystr;

# endif

{

const char *yys = yystr;

while (*yys++! = '\0')

continue;

return yys - yystr - 1;

}

# endif

# endif

# 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 *

# if defined (__STDC__) || defined (__cplusplus)

yystpcpy (char *yydest, const char *yysrc)

# else

yystpcpy (yydest, yysrc)

char *yydest;

const char *yysrc;

# endif

{

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 YYSIZE_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 yystrlen (yystr);

return yystpcpy (yyres, yystr) - yyres;

}

# endif

#endif /* YYERROR_VERBOSE */

#if YYDEBUG

/*--------------------------------.

| Print this symbol on YYOUTPUT. |

`--------------------------------*/

#if defined (__STDC__) || defined (__cplusplus)

static void

yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep)

#else

static void

yysymprint (yyoutput, yytype, yyvaluep)

FILE *yyoutput;

int yytype;

YYSTYPE *yyvaluep;

#endif

{

/* Pacify ``unused variable'' warnings. */

(void) yyvaluep;

if (yytype < YYNTOKENS)

YYFPRINTF (yyoutput, "token %s (", yytname [yytype]);

else

YYFPRINTF (yyoutput, "nterm %s (", yytname [yytype]);

# ifdef YYPRINT

if (yytype < YYNTOKENS)

YYPRINT (yyoutput, yytoknum [yytype], *yyvaluep);

# endif

switch (yytype)

{

default:

break;

}

YYFPRINTF (yyoutput, ")");

}

#endif /*! YYDEBUG */

/*-----------------------------------------------.

| Release the memory associated to this symbol. |

`-----------------------------------------------*/

#if defined (__STDC__) || defined (__cplusplus)

static void

yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)

#else

static void

yydestruct (yymsg, yytype, yyvaluep)

const char *yymsg;

int yytype;

YYSTYPE *yyvaluep;

#endif

{

/* Pacify ``unused variable'' warnings. */

(void) yyvaluep;

if (! yymsg)

yymsg = "Deleting";

YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);

switch (yytype)

{

default:

break;

}

}

/* Prevent warnings from - Wmissing-prototypes. */

#ifdef YYPARSE_PARAM

# if defined (__STDC__) || defined (__cplusplus)

int yyparse (void *YYPARSE_PARAM);

# else

int yyparse ();

# endif

#else /*! YYPARSE_PARAM */

#if defined (__STDC__) || defined (__cplusplus)

int yyparse (void);

#else

int yyparse ();

#endif

#endif /*! YYPARSE_PARAM */

/* The look-ahead symbol. */

int yychar;

/* The semantic value of the look-ahead symbol. */

YYSTYPE yylval;

/* Number of syntax errors so far. */

int yynerrs;

/*----------.

| yyparse. |

`----------*/

#ifdef YYPARSE_PARAM

# if defined (__STDC__) || defined (__cplusplus)

int yyparse (void *YYPARSE_PARAM)

# else

int yyparse (YYPARSE_PARAM)

void *YYPARSE_PARAM;

# endif

#else /*! YYPARSE_PARAM */

#if defined (__STDC__) || defined (__cplusplus)

int

yyparse (void)

#else

int

yyparse ()

;

#endif

#endif

{

int yystate;

int yyn;

int yyresult;

/* Number of tokens to shift before error messages enabled. */

int yyerrstatus;

/* Look-ahead token as an internal (translated) token number. */

int yytoken = 0;

/* Three stacks and their tools:

`yyss': related to states,

`yyvs': related to semantic values,

`yyls': related to locations.

Refer to the stacks thru separate pointers, to allow yyoverflow

to reallocate them elsewhere. */

/* The state stack. */

short int yyssa [YYINITDEPTH];

short int *yyss = yyssa;

short int *yyssp;

/* The semantic value stack. */

YYSTYPE yyvsa [YYINITDEPTH];

YYSTYPE *yyvs = yyvsa;

YYSTYPE *yyvsp;

#define YYPOPSTACK (yyvsp--, yyssp--)

YYSIZE_T yystacksize = YYINITDEPTH;

/* The variables used to return semantic value and location from the

action routines. */

YYSTYPE yyval;

/* When reducing, the number of symbols on the RHS of the reduced

rule. */

int yylen;

YYDPRINTF ( (stderr, "Starting parse\n"));

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;

yyvsp = yyvs;

goto yysetstate;

/*------------------------------------------------------------.

| yynewstate - Push a new state, which is found in yystate. |

`------------------------------------------------------------*/

yynewstate:

/* In all cases, when you get here, the value and location stacks

have just been pushed. so pushing a state here evens the stacks.

*/

yyssp++;

yysetstate:

*yyssp = yystate;

if (yyss + yystacksize - 1 <= yyssp)

{

/* Get the current used size of the three stacks, in elements. */

YYSIZE_T yysize = yyssp - yyss + 1;

#ifdef yyoverflow

{

/* 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 int *yyss1 = yyss;

/* Each stack pointer address is followed by the size of the

data in use in that stack, in bytes. This used to be a

conditional around just the two extra args, but that might

be undefined if yyoverflow is a macro. */

yyoverflow (YY_ ("memory exhausted"),

&yyss1, yysize * sizeof (*yyssp),

&yyvs1, yysize * sizeof (*yyvsp),

&yystacksize);

yyss = yyss1;

yyvs = yyvs1;

}

#else /* no yyoverflow */

# ifndef YYSTACK_RELOCATE

goto yyexhaustedlab;

# else

/* Extend the stack our own way. */

if (YYMAXDEPTH <= yystacksize)

goto yyexhaustedlab;

yystacksize *= 2;

if (YYMAXDEPTH < yystacksize)

yystacksize = YYMAXDEPTH;

{

short int *yyss1 = yyss;

union yyalloc *yyptr =

(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));

if (! yyptr)

goto yyexhaustedlab;

YYSTACK_RELOCATE (yyss);

YYSTACK_RELOCATE (yyvs);

# undef YYSTACK_RELOCATE

if (yyss1! = yyssa)

YYSTACK_FREE (yyss1);

}

# endif

#endif /* no yyoverflow */

yyssp = yyss + yysize - 1;

yyvsp = yyvs + yysize - 1;

YYDPRINTF ( (stderr, "Stack size increased to %lu\n",

(unsigned long int) yystacksize));

if (yyss + yystacksize - 1 <= yyssp)

YYABORT;

}

YYDPRINTF ( (stderr, "Entering state %d\n", yystate));

goto yybackup;

/*-----------.

| yybackup. |

`-----------*/

yybackup:

/* Do appropriate processing given the current state. */

/* Read a look-ahead token if we need one and don't already have one. */

/* yyresume: */

/* First try to decide what to do without reference to look-ahead token. */

yyn = yypact [yystate];

if (yyn == YYPACT_NINF)

goto yydefault;

/* Not known => get a look-ahead token if don't already have one. */

/* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol. */

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);

}

/* If the proper action on seeing token YYTOKEN is to reduce or to

detect an error, take that action. */

yyn += yytoken;

if (yyn < 0 || YYLAST < yyn || yycheck [yyn]! = yytoken)

goto yydefault;

yyn = yytable [yyn];

if (yyn <= 0)

{

if (yyn == 0 || yyn == YYTABLE_NINF)

goto yyerrlab;

yyn = - yyn;

goto yyreduce;

}

if (yyn == YYFINAL)

YYACCEPT;

/* Shift the look-ahead token. */

YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);

/* Discard the token being shifted unless it is eof. */

if (yychar! = YYEOF)

yychar = YYEMPTY;

*++yyvsp = yylval;

/* Count tokens shifted since error; after three, turn off error

status. */

if (yyerrstatus)

yyerrstatus--;

yystate = yyn;

goto yynewstate;

/*-----------------------------------------------------------.

| yydefault - do the default action for the current state. |

`-----------------------------------------------------------*/

yydefault:

yyn = yydefact [yystate];

if (yyn == 0)

goto yyerrlab;

goto yyreduce;

/*-----------------------------.

| yyreduce - Do a reduction. |

`-----------------------------*/

yyreduce:

/* yyn is the number of a rule to reduce with. */

yylen = yyr2 [yyn];

/* If YYLEN is nonzero, implement the default value of the action:

`$$ = $1'.

Otherwise, the following line sets YYVAL to garbage.

This behavior is undocumented and Bison

users should not rely upon it. Assigning to YYVAL

unconditionally makes the parser a bit smaller, and it avoids a

GCC warning that YYVAL may be used uninitialized. */

yyval = yyvsp [1-yylen];

YY_REDUCE_PRINT (yyn);

switch (yyn)

{

case 5:

#line 21 "bison. txt"

{

printf ("%s\t", (yyvsp [-8]. string));

printf ("%s\t", (yyvsp [-5]. string));

printf ("\t%s", (yyvsp [-4]. string));

printf ("\n---------------------------------");

printf ("\n");

; }

break;

case 6:

#line 29 "bison. txt"

{; }

break;

case 7:

#line 31 "bison. txt"

{; }

break;

case 8:

#line 33 "bison. txt"

{; }

break;

default: break;

}

/* Line 1126 of yacc. c. */

#line 1192 "bison. c"

yyvsp - = yylen;

yyssp - = yylen;

YY_STACK_PRINT (yyss, yyssp);

*++yyvsp = yyval;

/* 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 - YYNTOKENS] + *yyssp;

if (0 <= yystate && yystate <= YYLAST && yycheck [yystate] == *yyssp)

yystate = yytable [yystate];

else

yystate = yydefgoto [yyn - YYNTOKENS];

goto yynewstate;

/*------------------------------------.

| yyerrlab - here on detecting error |

`------------------------------------*/

yyerrlab:

/* If not already recovering from an error, report this error. */

if (! yyerrstatus)

{

++yynerrs;

#if YYERROR_VERBOSE

yyn = yypact [yystate];

if (YYPACT_NINF < yyn && yyn < YYLAST)

{

int yytype = YYTRANSLATE (yychar);

YYSIZE_T yysize0 = yytnamerr (0, yytname [yytype]);

YYSIZE_T yysize = yysize0;

YYSIZE_T yysize1;

int yysize_overflow = 0;

char *yymsg = 0;

# define YYERROR_VERBOSE_ARGS_MAXIMUM 5

char const *yyarg [YYERROR_VERBOSE_ARGS_MAXIMUM];

int yyx;

#if 0

/* This is so xgettext sees the translatable formats that are

constructed on the fly. */

YY_ ("syntax error, unexpected %s");

YY_ ("syntax error, unexpected %s, expecting %s");

YY_ ("syntax error, unexpected %s, expecting %s or %s");

YY_ ("syntax error, unexpected %s, expecting %s or %s or %s");

YY_ ("syntax error, unexpected %s, expecting %s or %s or %s or %s");

#endif

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;

int yyxend = yychecklim < YYNTOKENS? yychecklim: YYNTOKENS;

int yycount = 1;

yyarg [0] = yytname [yytype];

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++] = yytname [yyx];

yysize1 = yysize + yytnamerr (0, yytname [yyx]);

yysize_overflow |= yysize1 < yysize;

yysize = yysize1;

yyfmt = yystpcpy (yyfmt, yyprefix);

yyprefix = yyor;

}

yyf = YY_ (yyformat);

yysize1 = yysize + yystrlen (yyf);

yysize_overflow |= yysize1 < yysize;

yysize = yysize1;

if (! yysize_overflow && yysize <= YYSTACK_ALLOC_MAXIMUM)

yymsg = (char *) YYSTACK_ALLOC (yysize);

if (yymsg)

{

/* Avoid sprintf, as that infringes on the user's name space.

Don't have undefined behavior even if the translation

produced a string with the wrong number of "%s"s. */

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);

YYSTACK_FREE (yymsg);

}

else

{

yyerror (YY_ ("syntax error"));

goto yyexhaustedlab;

}

}

else

#endif /* YYERROR_VERBOSE */

yyerror (YY_ ("syntax error"));

}

if (yyerrstatus == 3)

{

/* If just tried and failed to reuse look-ahead token after an

error, discard it. */

if (yychar <= YYEOF)

{

/* Return failure if at end of input. */

if (yychar == YYEOF)

YYABORT;

}

else

{

yydestruct ("Error: discarding", yytoken, &yylval);

yychar = YYEMPTY;

}

}

/* Else will try to reuse look-ahead token after shifting the error

token. */

goto yyerrlab1;

/*---------------------------------------------------.

| yyerrorlab - error raised explicitly by YYERROR. |

`---------------------------------------------------*/

yyerrorlab:

/* Pacify compilers like GCC when the user code never invokes

YYERROR and the label yyerrorlab therefore never appears in user

code. */

if (0)

goto yyerrorlab;

yyvsp - = yylen;

yyssp - = yylen;

yystate = *yyssp;

goto yyerrlab1;

/*-------------------------------------------------------------.

| yyerrlab1 - common code for both syntax error and YYERROR. |

`-------------------------------------------------------------*/

yyerrlab1:

yyerrstatus = 3; /* Each real token shifted decrements this. */

for (;;)

{

yyn = yypact [yystate];

if (yyn! = YYPACT_NINF)

{

yyn += YYTERROR;

if (0 <= yyn && yyn <= YYLAST && yycheck [yyn] == YYTERROR)

{

yyn = yytable [yyn];

if (0 < yyn)

break;

}

}

/* Pop the current state because it cannot handle the error token. */

if (yyssp == yyss)

YYABORT;

yydestruct ("Error: popping", yystos [yystate], yyvsp);

YYPOPSTACK;

yystate = *yyssp;

YY_STACK_PRINT (yyss, yyssp);

}

if (yyn == YYFINAL)

YYACCEPT;

*++yyvsp = yylval;

/* Shift the error token. */

YY_SYMBOL_PRINT ("Shifting", yystos [yyn], yyvsp, yylsp);

yystate = yyn;

goto yynewstate;

/*-------------------------------------.

| yyacceptlab - YYACCEPT comes here. |

`-------------------------------------*/

yyacceptlab:

yyresult = 0;

goto yyreturn;

/*-----------------------------------.

| yyabortlab - YYABORT comes here. |

`-----------------------------------*/

yyabortlab:

yyresult = 1;

goto yyreturn;

#ifndef yyoverflow

/*-------------------------------------------------.

| yyexhaustedlab - memory exhaustion comes here. |

`-------------------------------------------------*/

yyexhaustedlab:

yyerror (YY_ ("memory exhausted"));

yyresult = 2;

/* Fall through. */

#endif

yyreturn:

if (yychar! = YYEOF && yychar! = YYEMPTY)

yydestruct ("Cleanup: discarding lookahead",

yytoken, &yylval);

while (yyssp! = yyss)

{

yydestruct ("Cleanup: popping",

yystos [*yyssp], yyvsp);

YYPOPSTACK;

}

#ifndef yyoverflow

if (yyss! = yyssa)

YYSTACK_FREE (yyss);

#endif

return yyresult;

}

#line 34 "bison. txt"

Приложение 2. Тестовые случаи