Sharing memory among YACC, Lex, and C files

Posted by sczizzo on Stack Overflow See other posts from Stack Overflow or by sczizzo
Published on 2010-03-14T04:32:05Z Indexed on 2010/03/14 4:35 UTC
Read the original article Hit count: 484

Filed under:

yacc

|

bison

|

c

|

flex

|

lex

I have a YACC (Bison) grammar, a Lex (Flex) tokenizer, and a C program among which I need to share a struct (or really any variable). Currently, I declare the actual object in the grammar file and extern it wherever I need it (which is to say, my C source file), usually using a pointer to manipulate it. I have a shared header (and implementation) file between the C file and the grammar file with functions useful for manipulating my data structure. This works, but it feels a little uncomfortable. Is there a better way to share memory between the grammar and program?

© Stack Overflow or respective owner

Related posts about yacc

how to download lex and lex.yy.c and yacc in ubuntu9.10 ? how to download lex and lex.yy.c and yacc

as seen on Super User - Search for 'Super User'
how to download lex and lex.yy.c and yacc in ubuntu9.10 ? >>> More
Looking for a Java grammar in lex/yacc format

as seen on Stack Overflow - Search for 'Stack Overflow'
Does anyone know an online repository for lex/yacc format grammars? I'm looking for a Java grammar to make a quicky sourcecode converter. Thank you! >>> More
how to download lex and lex.yy.c and yacc in ubuntu9.10 ? how to download lex and lex.yy.c and yacc

as seen on Stack Overflow - Search for 'Stack Overflow'
how to download lex and lex.yy.c and yacc in ubuntu9.10 ? >>> More
Sharing memory among YACC, Lex, and C files

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a YACC (Bison) grammar, a Lex (Flex) tokenizer, and a C program among which I need to share a struct (or really any variable). Currently, I declare the actual object in the grammar file and extern it wherever I need it (which is to say, my C source file), usually using a pointer to manipulate… >>> More
Yacc and Lex inclusion confusion

as seen on Stack Overflow - Search for 'Stack Overflow'
I am wondering how to correctly compile a program with a Makefile that has calls to yyparse in it? This is what I do: I have a Makefile that compiles all my regular files and they have no connections to y.tab.c or lex.yy.c (Am I supposed to have them?) I do this on top of my code: #include "y… >>> More

Related posts about bison

ANTLR grammar from bison

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello, I'm trying to translate a grammar from bison to ANTLR. The grammar itself is pretty simple in bison but I cannot find a simple way for doing this. Grammar in bison: expr = expr or expr | expr and expr | (expr) Any hints/links/pointers are welcome. Thanks, Iulian >>> More
How do i implement If statement in Flex/bison

as seen on Stack Overflow - Search for 'Stack Overflow'
Hallo, I need help in flex/bison. Im a beginner in flex/bison, and i hav already looked out these programs and somethings i inderstood, but im learning. My problem is, i want to implement a If-statement via Flex/Bison and i dont know how to start how to do, someone any idea, im very thankful for all… >>> More
Filter y.output from bison or yacc?

as seen on Stack Overflow - Search for 'Stack Overflow'
I am using bison and its difficult to figure out the conflicts by looking at y.output. Is there a tool to make or filter y.output so its more useful? i would love to see the full path to the state with the conflict but anything helpful is what i would like. >>> More
rules precedence in bison

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi Here is the grammar rules: ProcessExpression : EventExpression "->" ProcessExpression | ProcessName ; Please can you tell me how can I tell to bison that the first rule has the highest precedence than the second one? I have tried: %nonassoc PROC %right "->" ProcessExpression… >>> More
how to instruct bison that I'm expecting TWO or more terminals

as seen on Stack Overflow - Search for 'Stack Overflow'
How can I define a rule in BISON that will state that I need two or more terminals. I use it like this and I get a shift/reduce conflict: word: LETTER | word LETTER; words: word word | words word; What's wrong here? And how to correct it? >>> More