tree is a list :P
* anyway, some changes here
-> a struct T consumes sizeof(struct T) of memory
-> actual wasn't really needed here. thrown away.
committer: Markus Bröker <mbroeker@largo.homelinux.org>
/**
* test/demos/parser/lexer.ll
* Copyright (C) 2008 Markus Broeker
*/
%{
#include <stdio.h>
#include "parser.h"
%}
%%
[0-9]+ { yylval = atoi(yytext); return DIGIT; }
[a-zA-Z] { yylval = yytext[0]; return LETTER; }
"+" { return PLUS; }
"-" { return MINUS; }
"*" { return MUL; }
"/" { return DIV; }
"("|")"|"=" { return yytext[0]; }
[ \t]+ {}
\n { return yytext[0]; }
. { printf("FEHLER: %s\n", yytext); }
%%