Running Bison on this file:
%{
#include
int yylex();
void yyerror(const char*);
%}
%union
{
char name[100];
int val
As a further thought, if you want to be more explicit with your reductions (if you are doing AST annoation, this can be handy) then you can make your stack values pointers and then handle type values yourself. Much like scalar types with:
struct myScalar {
union {
int num;
char *id;
char *float_lexeme;
}payload;
enum {
TYPE_NUM,
TYPE_IDENTIFIER,
TYPE_FLOAT_CHAR
} type;
char *orig_lexeme;
};
And have a typedef and scalar_val *val
for the stack.
When you move onto more complex compiler front-ends, it can help to build your AST like this so that when you traverse the tree you have better meta-data and you can also augment the translation with translations for pre-semantic types. Then it boils down to your leaf productions such as ID to shuffle the lexeme into the right scalar payload.
Not a complete explanation, but you get the idea.
Hope this helps with your future Bison/Lex front-ends and ...
Good Luck