bison中的解析在第一行停止

我正在用类似python的语言创建bison语法，运行测试代码文件时得到的输出如下：

found identifier a at line 2
memory exhausted

Parsing completed successfully

我得到一些shift-reduce错误和reduce-reduce，但我可以正常创建我的.exe文件，如果我运行它，它会显示这一点

我已经试着把我大部分的班次减到零。但这真的是问题所在吗？因为我想它不会给我一个.exe

.l文件

%{
#include <stdio.h>
#include <stdlib.h>
#include "sym_tab.h"
#include "define.h"

FILE *new_file;
int stringtoint;
int current_indent = 0;
void count();
void comment();
int count_indent();

%}



L                  [A-Za-z]
D                  [0-9]
N                  [1-9]
C   "%"|"!"|"@"|"$"|"%"|"^"|"&"|"_"



identifier          {L}({L}|{D})*
dec_const           (-|\+)*(0|{N}{D}*)
blank               [ \v\f]+
invalid_identifier  {D}|{C}(({L}|{D})*|{L})
invalid_keyword     {C}({L}|{D})+
block_count                 ^[\t]+


%%

"while"           {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(WHILE); }

"for"           {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(FOR); }
"in range"            {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(IN_RANGE); }

"input"           {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(INPUT); }
"print"           {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(PRINT); }

"if"              {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(IF); }
"elif"            {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(ELIF); }
"else"            {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(ELSE); }

"and"             {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(AND); }
"not"             {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(NOT); }
"or"              {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(OR); }

"return"          {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(RETURN); }
"exit"            {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(EXIT); }

"def"             {char *yycopy=strdup(yytext); count(); printf("found keyword %s at line %d\n" ,yycopy, line);
                        addsym( yycopy, block_num ); return(DEF); }

L?\"(\\.|[^\\"])*\" {char *yycopy=strdup(yytext); count(); printf("found literal string %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(STRING_LITERAL); }


{dec_const}               {char *yycopy=strdup(yytext); count(); stringtoint=atoi(yycopy);if(stringtoint<(-32768)|| stringtoint>32767){
              printf("dec_const %d in line %d not an acceptable value\n",stringtoint,line);}else{
              printf("found dec_constant %s at line %d\n", yycopy,line);
              addsym( yycopy, block_num ); return(DEC_CONST);}}


{identifier}              {char *yycopy=strdup(yytext); count(); if(strlen(yycopy)>20){
               printf("identifier %s in line %d not valid(longer than 20 characters)\n",yycopy,line);}
               else{printf("found identifier %s at line %d\n", yycopy,line);
                           addsym( yycopy, block_num ); return(IDENTIFIER);}}


"+"                       {char *yycopy=strdup(yytext); count(); printf("found symbol %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(PLUS);}
"-"                       {char *yycopy=strdup(yytext); count(); printf("found symbol %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(MINUS);}
"*"                       {char *yycopy=strdup(yytext); count(); printf("found symbol %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(STAR);}
"/"                       {char *yycopy=strdup(yytext); count(); printf("found symbol %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(DIV);}
"<"                       {char *yycopy=strdup(yytext); count(); printf("found equation_symbol %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(L_THAN);}
">"                       {char *yycopy=strdup(yytext); count(); printf("found equation_symbol %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(G_THAN);}
"=="                      {char *yycopy=strdup(yytext); count(); printf("found equation_symbol %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(EQUAL);}
"<="                      {char *yycopy=strdup(yytext); count(); printf("found equation_symbol %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(L_EQ_THAN);}
">="                      {char *yycopy=strdup(yytext); count(); printf("found equation_symbol %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(G_EQ_THAN);}
"<>"                      {char *yycopy=strdup(yytext); count(); printf("found equation_symbol %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(NEQUAL);}
":="                        {char *yycopy=strdup(yytext); count(); printf("found asign_symbol %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(ASSIGN);}
"("                       {char *yycopy=strdup(yytext); count(); printf("found %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(LPAREN);}
")"                       {char *yycopy=strdup(yytext); count(); printf("found %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(RPAREN);}

"["                       {char *yycopy=strdup(yytext); count(); printf("found %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(LSQUARE_BRACK);}
"]"                       {char *yycopy=strdup(yytext); count(); printf("found %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(RSQUARE_BRACK);}

"\n"                        {char *yycopy=strdup(yytext); count(); printf("found new line at line %d\n" , line);
                           addsym( yycopy, block_num ); return(END_LINE);}
","                       {char *yycopy=strdup(yytext); count(); printf("found %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(COMMA);}
":"                                             {char *yycopy=strdup(yytext); count(); printf("found %s at line %d\n" ,yycopy, line);
                           addsym( yycopy, block_num ); return(COLON);}

"#"                      { comment();}

{blank}                   { count();}



{invalid_keyword}    {char *yycopy=strdup(yytext); count(); printf("invalid keyword %s at line %d\n", yycopy, line);
              addsym( yycopy, block_num );}

{invalid_identifier}   {char *yycopy=strdup(yytext); count(); printf("invalid identifier %s at line %d\n", yycopy, line);
              addsym( yycopy, block_num );}


.              {char *yycopy=strdup(yytext); count(); printf("unexpected character %s at line %d\n", yycopy, line);
              addsym( yycopy, block_num );}

%%

int yywrap()
{
  return 1;
}

// void main(int argc, char *argv[]){
//   int ret_val=1;
//
//   if (argc!=2) printf("\nUsage: lexyy <input file name> \n");
//   else
//     if ((new_file=fopen(argv[1],"r"))==NULL)
//       printf("\n<%s> not found.\n",argv[1]);
//     else{
//       yyrestart(new_file);
//       while(ret_val!=0){
//         ret_val=yylex();
//       }
//       fclose(new_file);
//     }
//}

void count()
{
        int i;
        for(i=0;yytext[i]!='\0';i++)
        if(yytext[i]=='\n')
        {
                line++;
        }
}

int count_indent()
{
  int i;
  int tab_num = 0;
  for(i=0;yytext[i]=='\t';i++)
  {
    tab_num++;
  }
  return tab_num;
}


void comment()
{
  int c;
  while(c=input()!='\n' && c!=EOF)
  {

  }
  line++;
}

%{
#包括
#包括
#包括“sym_tab.h”
#包括“define.h”
文件*新的_文件；
int stringtoint；
int current_indent=0；
无效计数（）；
无效注释（）；
int count_indent（）；
%}
L[A-Za-z]
D[0-9]
N[1-9]
C“%”|“！“|”@“|”$“|”%“|”^“|”和“|”|”
标识符{L}（{L}{D}）*
dec|const（-|\+）*（0{N}{D}*）
空白[\v\f]+
无效的_标识符{D}{C}（（{L}{D}）*{L}）
无效的_关键字{C}（{L}{D}）+
块计数^[\t]+
%%
而“{char*yycopy=strdup（yytext）；count（）；printf”（“在第%d\n行找到关键字%s”，yycopy，第行）；
addsym（yycopy，block_num）；返回（WHILE）；}
对于“{char*yycopy=strdup（yytext）；count（）；printf”（“在第%d\n行找到关键字%s”，yycopy，第行）；
addsym（yycopy，block_num）；return（FOR）；}
范围“{char*yycopy=strdup（yytext）；count（）；printf”（“在第%d行找到关键字%s\n”，yycopy，第行）；
addsym（yycopy，block_num）；返回（在_范围内）；}
输入“{char*yycopy=strdup（yytext）；count（）；printf”（“在第%d行找到关键字%s\n”，yycopy，第行）；
addsym（yycopy，block_num）；返回（输入）；}
“print”{char*yycopy=strdup（yytext）；count（）；printf（“在第%d行找到关键字%s\n”，yycopy，第行）；
addsym（yycopy，block_num）；return（PRINT）；}
如果“{char*yycopy=strdup（yytext）；count（）；printf”（“在第%d行找到关键字%s\n”，yycopy，第行）；
addsym（yycopy，block_num）；返回（IF）；}
“elif”{char*yycopy=strdup（yytext）；count（）；printf（“在第%d行找到关键字%s\n”，yycopy，第行）；
addsym（yycopy，block_num）；return（ELIF）；}
“else”{char*yycopy=strdup（yytext）；count（）；printf（“在第%d行找到关键字%s，\n”，yycopy，第行）；
addsym（yycopy，block_num）；return（ELSE）；}
和{char*yycopy=strdup（yytext）；count（）；printf（“在第%d行找到关键字%s”，yycopy，第行）；
addsym（yycopy，block_num）；return（AND）；}
“不是”{char*yycopy=strdup（yytext）；count（）；printf（“在第%d行找到关键字%s，\n”，yycopy，第行）；
addsym（yycopy，block_num）；return（NOT）；}
或“{char*yycopy=strdup（yytext）；count（）；printf”（“在第%d\n行找到关键字%s”，yycopy，第行）；
addsym（yycopy，block_num）；return（OR）；}
返回“{char*yycopy=strdup（yytext）；count（）；printf”（“在第%d行找到关键字%s\n”，yycopy，第行）；
addsym（yycopy，block_num）；return（return）；}
退出“{char*yycopy=strdup（yytext）；count（）；printf”（“在第%d行找到关键字%s\n”，yycopy，第行）；
addsym（yycopy，block_num）；return（EXIT）；}
“def”{char*yycopy=strdup（yytext）；count（）；printf（“在第%d行找到关键字%s\n”，yycopy，第行）；
addsym（yycopy，block_num）；return（DEF）；}
L？\“（\\.\\[^\\”]）*\“{char*yycopy=strdup（yytext）；count（）；printf（“在第%d\n行找到文字字符串%s”，yycopy，第行）；
addsym（yycopy，block_num）；返回（STRING_LITERAL）；}
{dec_const}{char*yycopy=strdup（yytext）；count（）；stringtoint=atoi（yycopy）；if（stringtoint32767）{
printf（“第%d行中的dec_const%d不是可接受的值，\n”，stringtoint，line）；}else{
printf（“在第%d行找到dec_常量%s”，yycopy，第行）；
addsym（yycopy，block_num）；return（DEC_CONST）；}
{identifier}{char*yycopy=strdup（yytext）；count（）；if（strlen（yycopy）>20）{
printf（“第%d行中的标识符%s无效（超过20个字符）\n”，yycopy，第行）；}
else{printf（“在第%d行找到标识符%s\n”，yycopy，第行）；
addsym（yycopy，block_num）；返回（标识符）；}
“+”{char*yycopy=strdup（yytext）；count（）；printf（“在第%d行找到符号%s，\n”，yycopy，第行）；
addsym（yycopy，block_num）；return（PLUS）；}
“-”{char*yycopy=strdup（yytext）；count（）；printf（“在第%d行找到符号%s，\n”，yycopy，第行）；
addsym（yycopy，block_num）；返回（减号）；}
“*”{char*yycopy=strdup（yytext）；count（）；printf（“在第%d行找到符号%s\n”，yycopy，第行）；
addsym（yycopy，block_num）；return（STAR）；}
“/”{char*yycopy=strdup（yytext）；count（）；printf（“在第%d行找到符号%s，\n”，yycopy，第行）；
addsym（yycopy，block_num）；return（DIV）；}
“{char*yycopy=strdup（yytext）；count（）；printf”（“在第%d行找到等式符号%s，\n”，yycopy，第行）；
addsym（yycopy，block_num）；返回（G_THAN）；}
“==”{char*yycopy=strdup（yytext）；count（）；printf（“在第%d行找到等式符号%s，\n”，yycopy，第行）；
addsym（yycopy，block_num）；return（EQUAL）；}
“=”{char*yycopy=strdup（yytext）；count（）；printf（“在第%d行找到等式符号%s，\n”，yycopy，第行）；
addsym（yycopy，block_num）；返回（G_EQ_THAN）；}
“{char*yycopy=strdup（yytext）；count（）；printf”（“在第%d行找到等式符号%s，\n”，yycopy，第行）；
addsym（yycopy，block_num）；return（NEQUAL）；}
":="                        {
%{
    #include<stdio.h>
    #include<stdlib.h>
    #include<string.h>
    #include <ctype.h>
    #include "y.tab.h"
    extern int yylex();
    extern FILE *yyin;
%}


%token L_THAN G_THAN EQUAL L_EQ_THAN G_EQ_THAN NEQUAL
%token ASSIGN
%token LPAREN RPAREN LSQUARE_BRACK RSQUARE_BRACK
%token END_LINE COMMA COLON
%token INDENT DEDENT


%start Program
%%

Program: Block Program
    | Empty
    ;

Empty: /* empty */
    ;

Block: Declarations
    | Subprograms
    | Sequence
    ;



%%
extern int column;

int main(int argc, char *argv[])
{
    yyin = fopen("test_code.sy", "r");
    if(yyparse()==1)
        printf("\nParsing failed\n\n");
       else
        printf("\nParsing completed successfully\n");
       fclose(yyin);
    return 0;
}

int yyerror(s)
char *s;
{
                printf("%s\n", s);
        fflush(stdout);
        return 1;
}


/*#include <iostream.h>*/
#include <stdio.h>
#include <malloc.h>
#include <string.h>

#define table_size          100

extern int line=1;
extern int end_file=1;
extern int block_num=0;
extern FILE *new_file; 

typedef struct hash_sym
    {
    struct hash_sym *prev, *next;
    char *nam;
    char *str_val;
    char *id_type;
    int  id_value;
    int  block_num;
} Hashing_table; 


Hashing_table *table[table_size];

int hash_funct( char str[], int hash_size);

addsym( sym, bloc_num )
register char sym[];
int bloc_num;

{   
    int hash_val = hash_funct( sym, table_size );
    register struct hash_sym *sym_sym = table[hash_val];
    register struct hash_sym *new_sym;
    register struct hash_sym *successor;

    while ( sym_sym!=0 )
    {

        if (  strcmp( sym, table[hash_val]->nam )==0 )
        {   

            printf("the entry %s at line %d already exists at symbol table\n", sym,line);   
            return -1;
        }   

        sym_sym = sym_sym->next;
    }


    new_sym = (struct hash_sym *)
    malloc( sizeof( struct hash_sym ) );


    if ( (successor = table[hash_val]) )
    { 

        new_sym->next = successor;
        successor->prev = new_sym;
    }
    else
        new_sym->next = NULL;

    new_sym->prev = NULL;
    new_sym->nam = sym;
    new_sym->block_num = bloc_num;

    table[hash_val] = new_sym;
    return 0;
}




int hash_funct( str, hash_size )
register char str[];
int hash_size;
{
    register int hashval;
    register int i;

    hashval = 0;
    i = 0;

    while ( str[i]!='\0' )
        {
        hashval = hashval +  str[i++]*(16+i);
        /*hashval %= hash_size;*/
        }
    return (hashval %= hash_size);

}



%%
list: %empty | unit list
unit: as | bs
as: %empty | as 'a'
bs: %empty | bs 'b'